Mini round robin: an enhanced frame-based scheduling algorithm for multimedia networks

TitleMini round robin: an enhanced frame-based scheduling algorithm for multimedia networks
Publication TypeConference Paper
Year of Publication2005
AuthorsAl-Khasib, T., H. Alnuweiri, H. Fattah, and V. C. M. Leung
Conference NameCommunications, 2005. ICC 2005. 2005 IEEE International Conference on
Pagination363 - 368 Vol. 1
Date Publishedmay.
Keywordsdata communication, delays, frame-based scheduling, high-priority flows, Internet, low-rate flows, mini round robin, multimedia communication, multimedia communications, packet data networks, packet schedulers, packet switching, QoS model, quality of service, queueing theory, scheduling, start-up latency bound, telecommunication traffic, voice-over-IP

The broad spread of packet data networks and the emergence of applications in multimedia communications, has 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) that is primarily designed 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.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia