Skip to main content
Article thumbnail
Location of Repository


By Samuli Aalto A, Urtzi Ayesta B and Eeva Nyberg-oksanen A


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. © 2004 Elsevier B.V. All rights reserved. Keywords: Scheduling; Multilevel processor sharing; Mean delay; Unfinished truncated work; M/G/

Year: 2004
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.