On sojourn times in the M/M/1-PS model, conditioned on the number of other users

From MaRDI portal
Publication:3558499

zbMATH Open1197.60088arXiv0902.1200MaRDI QIDQ3558499FDOQ3558499


Authors: Qiang Zhen, Charles Knessl Edit this on Wikidata


Publication date: 5 May 2010

Abstract: We consider the M/M/1-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn time distribution, using a discrete Green's function. This is shown to be equivalent to some classic results of Pollaczeck and Vaulot from 1946. Then various asymptotic limits are studied, including large time and/or large number of customers present, and heavy traffic, where the arrival rate is only slightly less than the service rate.


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




Recommendations




Cited In (7)





This page was built for publication: On sojourn times in the \(M/M/1\)-PS model, conditioned on the number of other users

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