Related papers: Functional Limits of Generalized Jackson Networks …

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 establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state…

We consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one non-negative entry. The root node is fed by a Gaussian process with stationary increments. Our aim is to characterize the…

A univariate Hawkes process is a simple point process that is self-exciting and has clustering effect. The intensity of this point process is given by the sum of a baseline intensity and another term that depends on the entire past history…

We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a…

This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime$\unicode{x2014}$where the number of jobs and single-server service rates…

The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…

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 consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…

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…

In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…

We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the CRP condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of…

We address the problem of giving robust performance bounds based on the study of the asymptotic behavior of the insensitive load balancing schemes when the number of servers and the load scales jointly. These schemes have the desirable…

We consider a GI/H/n queueing system. In this system, there are multiple servers in the queue. The inter-arrival time is general and independent, and the service time follows hyper-exponential distribution. Instead of stochastic…

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 examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be highly…

We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…

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…