On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing
Probability
2010-03-16 v1 Classical Analysis and ODEs
Abstract
We consider a processor shared queue that can accommodate at most a finite number of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit , by locating the dominant singularity of the Laplace transform.
Keywords
Cite
@article{arxiv.0907.2908,
title = {On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing},
author = {Qiang Zhen and Charles Knessl},
journal= {arXiv preprint arXiv:0907.2908},
year = {2010}
}
Comments
10 pages