On Large Delays in Multi-Server Queues with Heavy Tails

preprint2012arXivOpen access

Abstract

We present upper and lower bounds for the tail distribution of the stationary waiting time DD in the stable GI/GI/sGI/GI/s FCFS queue. These bounds depend on the value of the traffic load ρρ 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 s−ks-k big jumps' in this case (here kk is the integer part of ρρ), 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.