On sojourn times in the finite capacity queue with processor sharing |
| |
| Authors: | Qiang Zhen Charles Knessl |
| |
| Affiliation: | aDepartment of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 S Morgan St(M/C 249), Chicago, IL 60607, USA |
| |
| Abstract: | 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 this finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K→∞. |
| |
| Keywords: | Finite capacity Processor sharing Sojourn time Tail behavior |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
