| Article ID: | iaor2006388 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 5 |
| Start Page Number: | 519 |
| End Page Number: | 524 |
| Publication Date: | Sep 2005 |
| Journal: | Operations Research Letters |
| Authors: | Aalto Samuli, Ayesta Urtzi, Nyberg-Oksanen Eeva |
| Keywords: | networks: scheduling |
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.