Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-19T06:47:30.228Z Has data issue: false hasContentIssue false

Sojourn time distribution in some processor-shared queues

Published online by Cambridge University Press:  26 September 2008

Xiaoming Tan
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago (M/C 249), PO Box 4348, Chicago, IL 60680, USA
Charles Knessl
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago (M/C 249), PO Box 4348, Chicago, IL 60680, USA

Abstract

We develop a technique for obtaining asymptotic properties of the sojourn time distribution in processor-sharing queues. We treat the standard M/M/1-PS queue and its finite capacity version, the M/M/1/K-PS queue. Using perturbation methods, we construct asymptotic expansions for the distribution of a tagged customer's sojourn time, conditioned on that customer's total required service. The asymptotic limit assumes that (i) the traffic intensity is close to one for the infinite capacity model, and (ii) that the system's capacity is large for the finite capacity queue.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable