| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524014 | Operations Research Letters | 2005 | 6 Pages |
Abstract
Multilevel processor sharing scheduling disciplines have recently been resurrected in papers that focus on the differentiation between short and long TCP flows in the Internet. We prove that, for M/G/1 queues, such disciplines are better than the processor sharing discipline with respect to the mean delay whenever the hazard rate of the service time distribution is decreasing.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Samuli Aalto, Urtzi Ayesta, Eeva Nyberg-Oksanen,
