arXiv · 0907.2910
Asymptotic Expansions for the Conditional Sojourn Time Distribution in the $M/M/1$-PS Queue
Abstract
We consider the $M/M/1$ queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. The asymptotic formulas relate to, and extend, some results of Morrison \cite{MO} and Flatto \cite{FL}.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Qiang Zhen, Charles Knessl. 2009-07-16. Asymptotic Expansions for the Conditional Sojourn Time Distribution in the $M/M/1$-PS Queue. https://doi.org/10.1007/s11134-007-9054-5
Cite the original work for its findings. Save a collection to share your selection of sources.