Abstract
With the emerging of many new kinds of network services, it is critical for the network to give service differentiation and QoS guarantee. One of the most important components in existing QoS frameworks is packet scheduler. A good scheduler should provide QoS guarantee and, at the same time, show low complexity. However, existing algorithms often fail to provide the two features at the same time. This paper proposes an improved DRR-like packet scheduling algorithm based on even service sequence, which combining advantages of DRR and WF2Q. Our simulation experiments show that this algorithm can provide good fairness, low scheduling delay and low complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)
Bennet, J., Zhang, H.: WF2Q: worst case fair weighted fair queuing. In: Proceedings of INFOCOM 1996 (1996)
Yuan, X., Duan, Z.: FRR: a Proportional and Worst-Case Fair Round Robin Scheduler. In: IEEE INFOCOM (2005)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach for flow control – the single node case. In: Proceedings of INFOCOM 1992, vol. 2, pp. 915–924 (May 1992)
Ramabhadran, S., Pasquale, J.: Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay. In: ACM SIGCOMM 2003, pp. 239–249 (2003)
Cheung, S., Pencea, C.: BSFQ: Bin Sort Fair Queuing. In: IEEE INFOCOM 2002 (2002)
Demers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queuing Algorithm. In: ACM SIGCOMM 1989 (1989)
The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns
Guo, C.: SRR, an O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks. In: ACM SIGCOMM 2001 (2001)
Lenzini, L., Mingozzi, E., Stea, G.: Aliquem: a Novel DRR Implementation to Achieve Better Latency and Fairness at O(1) Complexity. In: IWQoS 2002 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, F., Yan, S., Zhou, X., Wang, Y. (2005). An Improved DRR Packet Scheduling Algorithm Based on Even Service Sequence. In: Yang, L.T., Zhou, X., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds) Embedded Software and Systems. ICESS 2005. Lecture Notes in Computer Science, vol 3820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599555_59
Download citation
DOI: https://doi.org/10.1007/11599555_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30881-2
Online ISBN: 978-3-540-32297-9
eBook Packages: Computer ScienceComputer Science (R0)