On large delays in multi-server queues with heavy tails

From MaRDI portal
Publication:2884313

DOI10.1287/MOOR.1120.0539zbMATH Open1242.90062arXiv1104.3192OpenAlexW1993992052MaRDI QIDQ2884313FDOQ2884313


Authors: Sergey Foss, Dmitry Korshunov Edit this on Wikidata


Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Abstract: We present upper and lower bounds for the tail distribution of the stationary waiting time D in the stable GI/GI/s FCFS queue. These bounds depend on the value of the traffic load ho which is the ratio of mean service and mean interarrival times. For service times with intermediate regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a `principle of sk big jumps' in this case (here k is the integer part of ho), which gives the most probable way for the stationary waiting time to be large. Another corollary of the bounds obtained is to provide a new proof of necessity and sufficiency of conditions for the existence of moments of the stationary waiting time.


Full work available at URL: https://arxiv.org/abs/1104.3192




Recommendations





Cited In (29)





This page was built for publication: On large delays in multi-server queues with heavy tails

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884313)