Sojourn time asymptotics in the M/G/1 processor sharing queue

Sojourn time asymptotics in the M/G/1 processor sharing queue

0.00 Avg rating0 Votes
Article ID: iaor20013069
Country: Netherlands
Volume: 35
Issue: 1/4
Start Page Number: 141
End Page Number: 166
Publication Date: Jan 2000
Journal: Queueing Systems
Authors: ,
Keywords: M/G/1 queues
Abstract:

We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index, if the sojourn time distribution is regularly varying of that index. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We show how the moments of the sojourn time can be calculated recursively and prove that the kth moment of the sojourn time is finite iff the kth moment of the service time is finite. In addition, we give a short proof of a heavy traffic theorem for the sojourn time distribution, prove a heavy traffic theorem for the moments of the sojourn time, and study the properties of the heavy traffic limiting sojourn time distribution when the service time distribution is regularly varying. Explicit formulas and multiterm expansions are provided for the case that the service time has a Pareto distribution.

Reviews

Required fields are marked *. Your email address will not be published.