๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heavy Traffic Asymptotics for a Gated, Infinite-Server Queue with Uniform Service Times

โœ Scribed by Tan, Xiaoming; Knessl, Charles

Book ID
118195153
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
926 KB
Volume
54
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Gated Infinite-Server Queue: Uniform
The Gated Infinite-Server Queue: Uniform Service Times
โœ Browne, Sid; Coffman, Jr., E. G.; Gilbert, E. N.; Wright, Paul E. ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 990 KB
Heavy-traffic asymptotics for the single
Heavy-traffic asymptotics for the single-server queue with random order of service
โœ Bert Zwart ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

We consider the GI/GI/1 queue with customers served in random order, and derive the heavy-traffic limit of the waitingtime distribution. Our proof is probabilistic, requires no finite-variance assumptions, and makes the intuition provided by Kingman (Math. Oper. Res. 7 (1982) 262) rigorous.