Mathematics – Probability
Scientific paper
2011-04-16
Mathematics
Probability
Scientific paper
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 $\rho$ which is the ratio of mean service and mean interarrival times. For service times with regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a `principle of $s-k$ big jumps' in this case (here $k$ is the integer part of $\rho$). As another corollary of the bounds obtained, we provide a new proof of necessity and sufficiency of conditions for existence of moments of the stationary waiting time.
Foss Sergey
Korshunov Dmitry
No associations
LandOfFree
How big queues occur in multi-server system with heavy tails does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How big queues occur in multi-server system with heavy tails, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How big queues occur in multi-server system with heavy tails will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-346620