Abstract
Fairness, latency and computational complexity are three important factors in evaluating the performance of a scheduling algorithm. Fairness must be satisfied so that service can be distributed according to the reserved rate. Only when latency is irrelevant to the number of connections, is it possible to minimize the end-to-end delay through controlling the reserved rate. Among existing scheduling algorithms, Round Robin is the least complex. However, conventional Round Robin is unable to ensure fairness, and the improved round robin algorithms like Deficit Round Robin, Weighted Round Robin and Virtual Round Robin are unable to ensure that their latencies are irrelevant to the number of connections although they guarantee fairness. Potential Round Robin developed for analysis of fairness and latency reduction is thus proposed. It is based on the introduction of a new concept, Round Potential Function. The function splits service time into a number of service round periods to guarantee fairness regardless of the serving process used in the period. In the analysis of latency, service round periods are re-split into multiple scanning cycles for further service distribution with approximate sorting between scanning cycles. As a result, latency is no longer relevant to the number of connections while the low complexity of round robin is kept.
Similar content being viewed by others
References
Panwar S, Towsley D, Wolf J. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of services.Journal of ACM, 1988, 35(4): 832–844.
Liebeherr J, Wrege D E, Ferrari D. Exact admission control in networks with bounded delay service.IEEE/ACM Transactions on Networking, December, 1996, 4(6): 885–901.
Zhang Lixia. Virtual clock: A new traffic control algorithm for packet switching networks. InProceedings of ACM SIGCOMM’90, August, 1990, pp.19–29.
Goyal P, Vin H M, Cheng H. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. InProceedings of ACM SIGCOMM’96, August, 1996, pp.157–168. Another version is published inIEEE/ACM Transactions on Networking, October, 1997, 5(5): 690–704.
Golestani S J. A Self-clocked fair queuing scheme for broadband application. InProceedings of IEEE INFOCOM’94, April, 1994, pp.636–646.
Stiliadis D, Varma A. Latency rate servers: A general model for analysis of traffic scheduling algorithms.IEEE/ACM Transactions on Networking, October, 1998, 6(5): 611–624.
Zhang H, Ferrari D. Rate-controlled service disciplines.Journal of High Speed Networks, 1994, 3 (4): 389–412.
Georgiadis L, Guerin R, Peris V, Sivarajan H N. Efficient network QoS provisioning based on per node traffic shaping.IEEE/ACM Transactions on Networking, August, 1996, 4(4): 482–501.
Shreedhar M, Varghese G. Efficient fair queuing using deficit round robin. InProceedings of ACM SIGCOMM’95, 1995, pp.231–242. Also published inIEEE Transactions on Networking, June, 1996, 4(3): 375–385.
Katvenis M, Sidiropoulos S, Courcoubetis C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip.IEEE Journal on Selected Areas in Communications, 1991, 9: 1265–1279.
Haldar S, Subramanian D K. Fairness in processor scheduling in time sharing systems. InProceedings of the 13th ACM Symposium on Operating System Principles, October, 1991, pp.4–18.
Stiliadis D, Varma A. Efficient fair queuing algorithms for packet-switched networks.IEEE/ACM Transactions on Networking, April, 1998, 6(2): 175–185.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Defense Pre-Research Project (No.15.8.4), and the National ‘863’ High-Tech Programme of China (No.863-317-01-10-99).
WANG Youcheng was born in 1970. He received the B.E. and M.E. degrees in computer science from the Huazhong University of Science and Technology (HUST), respectively in 1991 and 1997. He is currently a Ph.D. candidate in computer science at HUST. His research interests are multimedia and Quality-of-Service network.
YU Shengsheng was born in 1944. He received the B.E. degree in electric engineering from the Huazhong University of Science and Technology (HUST) in 1966. He is a member of IEEE and a member of China Computer Federation. His research interests are computer architecture and multimedia networking.
ZHA Hui was born in 1975. He received the B.E. degree in applied electronic technique from the Huazhong University of Science and Technology (HUST) in 1996, and the M.E. degree in computer science from HUST in 1999. He is currently a Ph.D. candidate in computer science at HUST. His current research interests are wireless/Internet multimedia and Quality-of-Service network.
ZHOU Jingli was born in 1948. She received the B.E. degree in automatic control engineering from the Huazhong University of Science and Technology (HUST) in 1969. She is a member of IEEE and a member of China Computer Federation. Her research interests are multimedia communication and application, and network switching and management.
Rights and permissions
About this article
Cite this article
Wang, Y., Yu, S., Zha, H. et al. Approximate sorting of packet-scheduling in high-speed networks. J. Comput. Sci. & Technol. 16, 315–328 (2001). https://doi.org/10.1007/BF02948980
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948980