A scheduling algorithm using Compensating Round Robin in packet-swtiching broadband networks
Papers
- 23 Downloads
Abstract
A new approximation of fair queuing called Compensating Round Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O(1) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending sources.
Key words
Broadband networks Round robin Scheduling Bandwidth allocation QueuingPreview
Unable to display preview. Download preview PDF.
References
- [1]A. Demers, S. Keshav, S. Shenker, Analysis and simulation of a fair queuing algorithm, In Proc. ACM SIGCOMM’89, Austin, TX, USA, September 1989, 1–12.Google Scholar
- [2]Ellen L. Hahne, Round-robin scheduling for Max-Min fairness in data networks, IEEE J. on Selected Area in Communications, 9(1991)7, 1024–1039.CrossRefGoogle Scholar
- [3]Ion Stoica, Scott Shenker, Hui Zhang, Core-stateless fair queuing: Achieving approximately fair bandwidth allocation in high speed networks, Computer Communication Review, 28(1998)4, 118–131.CrossRefGoogle Scholar
- [4]Farooq M, Anjum, Leandros Tassiulas, Fair bandwidth sharing among adaptive and non-adaptive flows in the internet, In Proc. IEEE Infocomm’99, New York City, New York, 1999, 1412–1420.Google Scholar
- [5]L. Massoulie, J. Roberts, Bandwidth sharing: Objectives and algorithms, In Proc. IEEE Infocomm’99, New York City, New York, 1999, 1395–1403.Google Scholar
- [6]John Nagle, On packet switches with infinite storage, IEEE Trans. on Comm., COM-35(1987)4, 435–439.CrossRefGoogle Scholar
- [7]P. McKenney, Stochastic fairness queueing, Internetworking: Research and Experience, 2(1991)1, 113–131.Google Scholar
- [8]S. Golestani, A self clocked fair queueing scheme for broadband applications, In Proc. IEEE Infocomm’94, Toronto, Canada, 1994, 636–646.Google Scholar
Copyright information
© Science Press 2002