Related papers: Validity of heavy traffic steady-state approximati…
In the seminal paper of Gamarnik and Zeevi (2006), 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…
We establish uniform moment bounds for steady-state queue lengths of generalized Jackson networks (GJNs) in multi-scale heavy traffic as recently proposed by Dai et al. [2023]. Uniform moment bounds lay the foundation for further analysis…
We are interested to prove that the stationary distribution of a multiclass queueing network converges to the stationary distribution of a semimartingale reflecting Brownian motion (SRBM) in heavy traffic. A key condition for this…
We prove that under a multi-scale heavy traffic condition, the stationary distribution of the scaled queue length vector process in any generalized Jackson network has a product-form limit. Each component in the product form follows an…
We consider a Jackson network with regenerative input flows in which every server is subject to a random environment influence generating breakdowns and repairs. They occur in accordance with two independent sequences of i.i.d. random…
We investigate the functional limits of generalized Jackson networks in a multi-scale heavy traffic regime where stations approach full utilization at distinct, separated rates. Our main result shows that the appropriately scaled queue…
Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…
We give uniform proofs of tightness and exponential tightness of the sequences of stationary queue lengths in generalised Jackson networks in a number of setups which concern large, normal and moderate deviations.
We study the tail asymptotic of the stationary joint queue length distribution for a generalized Jackson network (GJN for short), assuming its stability. For the two station case, this problem has been recently solved in the logarithmic…
For a class of large closed Jackson networks submitted to capacity constraints, asymptotic independence of the nodes in normal traffic phase is proved at stationarity under mild assumptions, using a Local Limit Theorem. The limiting…
Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove,…
In this work, we study the stationary distribution of the scaled queue length vector process in multiclass queueing networks operating under static buffer priority service policies. We establish that when subjected to a multi-scale heavy…
Probabilistic graphical models provide a powerful tool to describe complex statistical structure, with many real-world applications in science and engineering from controlling robotic arms to understanding neuronal computations. A major…
This paper studies the heavy-traffic joint distribution of queue lengths in two stochastic processing networks (SPN), viz., an input-queued switch operating under the MaxWeight scheduling policy and a two-server parallel server system…
We analyze the convergence to equilibrium of one-dimensional reflected Brownian motion (RBM) and compute a number of related initial transient formulae. These formulae are of interest as approximations to the initial transient for queueing…
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…
This paper proves a large deviation principle (LDP) for the stationary distribution of queue lengths in a subcritical generalised Jackson network assuming a Cramer condition on the interarrival and service times. The deviation function is…
We study a single-server Markovian queueing model with $N$ customer classes in which priority is given to the shortest queue. Under a critical load condition, we establish the diffusion limit of the workload and queue length processes in…
This article presents a review of some old and new results on the long time behavior of reflected diffusions. First, we present a summary of prior results on construction, ergodicity and geometric ergodicity of reflected diffusions in the…
In this paper we study the stationary workload distribution of a fluid tandem queue in heavy traffic. We consider different types of L\'evy input, covering compound Poisson, $\alpha$-stable L\'evy motion (with $1<\alpha<2$), and Brownian…