Sojourn time tails in the M/D/1 processor sharing queue

R.R. Egorova, B. Zwart, O.J. Boxma

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

19 Citaten (Scopus)
2 Downloads (Pure)

Samenvatting

We consider the sojourn time V in the M/D/1 processor sharing (PS) queue and show that P(V > x) is of the form Ce-[gamma]x as x becomes large. The proof involves a geometric random sum representation of V and a connection with Yule processes, which also enables us to simplify Ott's [21] derivation of the Laplace transform of V. Numerical experiments show that the approximation P(V > x) [approximate] Ce-[gamma]x is excellent even for moderate values of x.
Originele taal-2Engels
Pagina's (van-tot)429-446
TijdschriftProbability in the Engineering and Informational Sciences
Volume20
Nummer van het tijdschrift3
DOI's
StatusGepubliceerd - 2006

Vingerafdruk

Duik in de onderzoeksthema's van 'Sojourn time tails in the M/D/1 processor sharing queue'. Samen vormen ze een unieke vingerafdruk.

Citeer dit