78 hasil
Menampilkan 1–20 · 2,75 detik · RSS
Stochastic Systems
Scopus
ISSN 1946-5238 · Institute for Operations Research and the Management Sciences · 78 artikel di indeks
-
Artikel Jurnal Teks lengkap
Dynamic Matching for Real-Time Ride Sharing
In a ride-sharing system, arriving customers must be matched with available drivers. These decisions affect the overall number of customers matched, because they impact whether future available drivers will be close to the locations of arriving customers. A common policy used in practice is the…
-
Artikel Jurnal
Waves in a spatial queue
Envisaging a physical queue of humans, we model a long queue by a continuous-space model in which, when a customer moves forward, they stop a random distance behind the previous customer, but do not move at all if their distance behind the previous customer is below a threshold. The latter…
-
Artikel Jurnal
Asymptotic expansion of stationary distribution for reflected Brownian motion in the quarter plane via analytic approach
Brownian motion in R2+ with covariance matrix Σ and drift μ in the interior and reflection matrix R from the axes is considered. The asymptotic expansion of the stationary distribution density along all paths in R2+ is found and its main term is identified depending on parameters (Σ,μ,R). For this…
-
Artikel Jurnal
Heavy traffic approximation for the stationary distribution of a generalized Jackson network: The BAR approach
In the seminal paper of Gamarnik and Zeevi [17], the authors justify the steady-state diffusion approximation of a generalized Jackson network (GJN) in heavy traffic. Their approach involves the so-called limit interchange argument, which has since become a popular tool employed by many others who…
-
Artikel Jurnal
Heavy-traffic limit for the initial content process
To understand the performance of a queueing system, it can be useful to focus on the evolution of the content that is initially in service at some time. That necessarily will be the case in service systems that provide service during normal working hours each day, with the system shutting down at…
-
Artikel Jurnal
Scaling limits for infinite-server systems in a random environment
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate Λ from a given distribution every Δ time units, yielding an i.i.d. sequence of arrival rates Λ1,Λ2,…. Applying…
-
Artikel Jurnal
Stein's method for steady-state diffusion approximations: An introduction through the Erlang-A and Erlang-C models
This paper provides an introduction to the Stein method framework in the context of steady-state diffusion approximations. The framework consists of three components: the Poisson equation and gradient bounds, generator coupling, and moment bounds. Working in the setting of the Erlang-A and Erlang-C…
-
Artikel Jurnal
Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian Control Problem
We consider a dynamic scheduling problem for parallel server systems. J. M. Harrison has proposed a scheme for using diffusion control problems to approximately solve such control problems for heavily loaded systems. This approach has been very successfully used in the special case when the…
-
Artikel Jurnal
Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
We study a fork-join network with a single class of jobs, which are forked into a fixed number of parallel tasks upon arrival to be processed at the corresponding multi-server stations. After service completion, each task will join a buffer associated with the service station waiting for…
-
Artikel Jurnal
Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy
In this paper, we develop a new approach to studying the asymptotic behavior of fluid model solutions for critically loaded processor sharing queues. For this, we introduce a notion of relative entropy associated with measure-valued fluid model solutions. In contrast to the approach used in [12]…
-
Artikel Jurnal
Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay
We consider the problem of assignning jobs to servers in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪N) different types according to their processing capacities or speeds. Jobs of random sizes arrive at the system according to a Poisson process…
-
Artikel Jurnal
Convergence properties of weighted particle islands with application to the double bootstrap algorithm
Particle island models [31] provide a means of parallelization of sequential Monte Carlo methods, and in this paper we present novel convergence results for algorithms of this sort. In particular we establish a central limit theorem—as the number of islands and the common size of the islands tend…
-
Artikel Jurnal
Construction of asymptotically optimal control for crisscross network from a free boundary problem
An asymptotic framework for optimal control of multiclass stochastic processing networks, using formal diffusion approximations under suitable temporal and spatial scaling, by Brownian control problems (BCP) and their equivalent workload formulations (EWF), has been developed by Harrison (1988)…
-
Artikel Jurnal
Clearing analysis on phases: Exact limiting probabilities for skip-free, unidirectional, quasi-birth-death processes
A variety of problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes with transitions that are skip-free in level, in that one can…
-
Artikel Jurnal
Chattering and congestion collapse in an overload switching control
Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimensional subset of its full state space. In a fluid limit, a control producing asymptotic SSC corresponds to an ideal…
-
Artikel Jurnal
On queue-size scaling for input-queued switches
We study the optimal scaling of the expected total queue size in an n×n input-queued switch, as a function of the number of ports n and the load factor ρ, which has been conjectured to be Θ(n/(1−ρ)) (cf. [15]). In a recent work [16], the validity of this conjecture has been established for the…
-
Artikel Jurnal
Heavy traffic queue length behavior in a switch under the MaxWeight algorithm
We consider a switch operating under the MaxWeight scheduling algorithm, under any traffic pattern such that all the ports are loaded. This system is interesting to study since the queue lengths exhibit a multi-dimensional state-space collapse in the heavy-traffic regime. We use a Lyapunov-type…
-
Artikel Jurnal
Mean square convergence rates for maximum quasi-likelihood estimator
In this note we study the behavior of maximum quasilikelihood estimators (MQLEs) for a class of statistical models, in which only knowledge about the first two moments of the response variable is assumed. This class includes, but is not restricted to, generalized linear models with general link…
-
Artikel Jurnal
Resource sharing networks: Overview and an open problem
This paper provides an overview of the resource sharing networks introduced by Massoulié and Roberts [20] to model the dynamic behavior of Internet flows. Striving to separate the model class from the applications that motivated its development, we assume no prior knowledge of communication…
-
Artikel Jurnal
Solving the drift control problem
We model the problem of managing capacity in a build-to-order environment as a Brownian drift control problem. We formulate a structured linear program that models a practical discretization of the problem and exploit a strong relationship between relative value functions and dual solutions to…