loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
T. Al-Khasib, University of British Columbia
H. Alnuweiri, University of British Columbia
H. Fattah, University of British Columbia
V. C. M. Leung, University of British Columbia
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today?s Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.
Citation:
T. Al-Khasib, H. Alnuweiri, H. Fattah, V. C. M. Leung, "Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks," iscc, pp.597-603, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.