This Article 
 Bibliographic References 
 Add to: 
Fair and Efficient Packet Scheduling Using Elastic Round Robin
March 2002 (vol. 13 no. 3)
pp. 324-336

Parallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in the allocation of bandwidth available on a link among traffic flows of different users that share the link. Strict fairness in traffic scheduling can improve the isolation between users, offer a more predictable performance and improve performance by eliminating some bottlenecks. This paper presents a simple, fair, efficient, and easily implementable scheduling discipline, called Elastic Round Robin (ERR), designed to satisfy the unique needs of wormhole switching, which is popular in interconnection networks of parallel systems. In spite of the constraints of wormhole switching imposed on the design, ERR is also suitable for use in Internet routers and has better fairness and performance characteristics than previously known scheduling algorithms of comparable efficiency, including Deficit Round Robin and Surplus Round Robin. In this paper, we prove that ERR is efficient, with a per-packet work complexity of O(1). We analytically derive the relative fairness bound of ERR, a popular metric used to measure fairness. We also derive the bound on the start-up latency experienced by a new flow that arrives at an ERR scheduler. Finally, this paper presents simulation results comparing the fairness and performance characteristics of ERR with other scheduling disciplines of comparable efficiency.

[1] H. Sethu, C.B. Stunkel, and R.F. Stucke, IBM RS/6000 SP Large System Interconnection Network Topologies Proc. Int'l Conf. Parallel Processing, Aug. 1998.
[2] J. Nagle, “On Packet Switches with Infinite Storage,” IEEE Trans. Comm., vol. 35, no. 4, Apr. 1987.
[3] W.J. Dally and C.L. Seitz, “The Torus Routing Chip,” J. Distributed Computing, vol. 1, no. 3, pp. 187-196, Oct. 1986.
[4] C. Stunkel, D. Shea, B. Abali, M. Atkins, C. Bender, D. Grice, P. Hochshild, D. Joseph, B. Nathanson, R. Swetz, R. Stucke, M. Tsao, and P. Varker, “The SP2 High-Performance Switch,” IBM Systems J., vol. 34, no. 2,pp. 185–204, 1995.
[5] J. Beecroft, M. Homewood, and M. McLaren, “Meiko CS-2 Interconnect Elan-Elite Design,” Parallel Computing, vol. 20, no. 10-11, pp. 1627-1638, Nov. 1994.
[6] Intel Corporation, Paragon XP/S Product Overview. 1991.
[7] Cray Research, Inc., Cray T3D System Architecture. 1993.
[8] ANSI, Inc., High-Performance Parallel Interface-6400 Mb/s Physical Layer (HIPPI-6400-PH). June 1999.
[9] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[10] Y. Tamir and G.L. Frazier, "Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches," IEEE Trans. Computers, vol. 41, no. 6, pp. 725-737, June 1992.
[11] J. Ding and L.N. Bhuyan, “Evaluation of Multi-Queue Buffered Multistage Interconnection Networks under Uniform and Non-Uniform Traffic Patterns,” Int'l J. Systems Science, vol. 28, no. 11, 1997.
[12] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[13] H. Sethu, H. Shi, S.S. Kanhere, and A.B. Parekh, “A Round-Robin Scheduling Strategy for Reduced Delays in Wormhole Switches with Virtual Lanes,” Proc. Int'l Conf. Comm. in Computing, June 2000.
[14] A. Demers, S. Keshav, and S. Shenkar, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. SIGCOMM, pp. 1-12, 1989.
[15] S. Keshav, “On the Efficient Implementation of Fair Queuing,” J. Internetworking Research and Experience, vol. 2, no. 3, pp. 3-26, Sept. 1990.
[16] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control—The Single Node Case,” Proc. IEEE INFOCOM, pp. 915-924, May 1992.
[17] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[18] S. Floyd and V. Jacobson, “Link-Sharing and Resource Management Models for Packet Networks,” IEEE Trans. Networking, vol. 3, no. 4, pp. 365-386, Aug. 1995.
[19] S. Floyd, “Notes on Class-Based-Queueing and Guaranteed Service,” Unpublished Notes:, July 1995.
[20] G. Parulkar, H. Adiseshu, and G. Varghese, “A Reliable and Scalable Striping Protocol,” Proc. ACM SIGCOMM, pp. 131-141, Aug. 1996.
[21] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[22] A. Johnson and K. Mackenzie,"Pattern Matching in Reconfigurable Logic for Packet Classification," Proc. Int'l Conf. Compilers, Architectures and Synthesis for Embedded Systems (CASES 01), ACM Press, 2001, pp. 126-130.
[23] P. Goyal, H.M. Vin, and H. Cheng, Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 690-704, Oct. 1997.
[24] S. Keshav, An Engineering Approach to Computer Networks. Reading, Mass.: Addison-Wesley, 1997.
[25] J.A. Cobb, M.G. Gouda, and A. El-Nahas, “Time-Shift Scheduling-Fair Scheduling of Flows in High-Speed Networks,” IEEE Trans. Networking, vol. 6, no. 3, pp. 274-285, June 1998.
[26] D. Stiliadis and A. Varma, Efficient Fair Queueing Algorithms for Packet-Switched Networks IEEE/ACM Trans. Networking, vol. 6, no. 2, 1998.
[27] K. Thompson, G.J. Miller, and R. Wilder, “Wide-Area Internet Traffic Patterns and Characteristics,” IEEE Network, vol. 11, no. 6, pp. 10-23, Nov./Dec. 1997.
[28] L. Kleinrock, Queuing Systems, Volume 2: Computer Applications. New York: Wiley Interscience, 1975.

Index Terms:
fair queuing, Deficit Round Robin, Surplus Round Robin, relative fairness bound, quality of service, wormhole networks
S.S. Kanhere, H. Sethu, A.B. Parekh, "Fair and Efficient Packet Scheduling Using Elastic Round Robin," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 324-336, March 2002, doi:10.1109/71.993210
Usage of this product signifies your acceptance of the Terms of Use.