Abstract
Abstract
We study the occurrence of large queue lengths in the GI / GI / d queue with heavy-tailed Weibull-type service times. Our analysis hinges on a recently developed sample path large-deviations principle for Lévy processes and random walks, following a continuous mapping approach. Also, we identify and solve a key variational problem which provides physical insight into the way a large queue length occurs. In contrast to the regularly varying case, we observe several subtle features such as a non-trivial trade-off between the number of big jobs and their sizes and a surprising asymmetric structure in asymptotic job sizes leading to congestion.
Funder
Eindhoven University of Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference20 articles.
1. Pollaczek, Félix: Théorie analytique des problèmes stochastiques relatifs à un groupe de lignes téléphoniques avec dispositif d’attente (1961)
2. Kiefer, J., Wolfowitz, J.: On the theory of queues with many servers. Trans. Am. Math. Soc. 78, 1–18 (1955)
3. Iglehart, D.L., Whitt, W.: Multiple channel queues in heavy traffic. I. Adv. Appl. Probab. 2, 150–177 (1970)
4. Pang, G., Talreja, R., Whitt, W.: Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surv. 4, 193–267 (2007)
5. Sadowsky, J.S.: The probability of large queue lengths and waiting times in a heterogeneous multiserver queue. II. Positive recurrence and logarithmic limits. Adv. Appl. Probab. 27(2), 567–583 (1995)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献