Fair and efficient frame-based scheduling algorithm for multimedia networks

TitleFair and efficient 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 NameComputers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on
Pagination597 - 603
Date Publishedjun.
Keywordsframe-based scheduling algorithm, Internet, mini round robin, multimedia communication, multimedia communications, multimedia networks, packet data networks, packet schedulers, QoS, quality of service, scheduling, voice-over-IP
Abstract

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.

URLhttp://dx.doi.org/10.1109/ISCC.2005.69
DOI10.1109/ISCC.2005.69

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
Email:

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