4 research outputs found
On Sojourn Times in the Finite Capacity Queue with Processor Sharing
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.Comment: 10 page