Heavy traffic limit theorems for a sequence of shortest queueing systems
From MaRDI portal
Publication:1908677
DOI10.1007/BF01158582zbMath0841.60074OpenAlexW2056925735MaRDI QIDQ1908677
Rongxin Wang, Guang-Hui Hsu, Han-Qin Zhang
Publication date: 5 March 1996
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158582
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Functional limit theorems; invariance principles (60F17)
Related Items
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems, Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics, Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
Cites Work
- Unnamed Item
- Unnamed Item
- Transient behavior of regulated Brownian motion, I: Starting at the origin
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
- A Basic Dynamic Routing Problem and Diffusion
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Multiple channel queues in heavy traffic. I