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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
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.
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.
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.
L. Massoulie, J. Roberts, Bandwidth sharing: Objectives and algorithms, In Proc. IEEE Infocomm’99, New York City, New York, 1999, 1395–1403.
John Nagle, On packet switches with infinite storage, IEEE Trans. on Comm., COM-35(1987)4, 435–439.
P. McKenney, Stochastic fairness queueing, Internetworking: Research and Experience, 2(1991)1, 113–131.
S. Golestani, A self clocked fair queueing scheme for broadband applications, In Proc. IEEE Infocomm’94, Toronto, Canada, 1994, 636–646.
Author information
Authors and Affiliations
About this article
Cite this article
Lan, J., Wang, B., Li, O. et al. A scheduling algorithm using Compensating Round Robin in packet-swtiching broadband networks. J. of Electron.(China) 19, 139–145 (2002). https://doi.org/10.1007/s11767-002-0025-z
Issue Date:
DOI: https://doi.org/10.1007/s11767-002-0025-z