Fair and efficient frame-based scheduling algorithm for multimedia networks

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.

[1]  Salil S. Kanhere,et al.  Prioritized Elastic Round Robin: An Efficient and Low-Latency Packet Scheduler with Improved Fairness , 2003 .

[2]  Harish Sethu,et al.  An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[3]  Ying-Dar Lin,et al.  Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks , 2001, Comput. Networks.

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[5]  Salil S. Kanhere,et al.  Low-latency guaranteed-rate scheduling using Elastic Round Robin , 2002, Comput. Commun..

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[7]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[8]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[9]  Salil S. Kanhere,et al.  Fair, efficient and low-latency packet scheduling using nested deficit round robin , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[10]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[11]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[12]  Salil S. Kanhere,et al.  Fair and Efficient Packet Scheduling Using Elastic Round Robin , 2002, IEEE Trans. Parallel Distributed Syst..