On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing

Details On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing

2009-07-16

arxiv.org/abs/0907.2908v1

Oper. Res. Lett. 37 (2009) 447-450

Mathematics

Probability

10 pages

Scientific paper

10.1016/j.orl.2009.09.007

We consider a processor shared $M/M/1$ queue that can accommodate at most a
finite number $K$ 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 $K\to\infty$, by
locating the dominant singularity of the Laplace transform.

Affiliated with

Also associated with

No associations

Rating

On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Sojourn Times in the Finite Capacity $M/M/1$ Queue with Processor Sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622690