Issue No. 03 - March (2002 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.993210
<p>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 <it>Elastic Round Robin (ERR)</it>, 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.</p>
fair queuing, Deficit Round Robin, Surplus Round Robin, relative fairness bound, quality of service, wormhole networks
H. Sethu, S. Kanhere and A. Parekh, "Fair and Efficient Packet Scheduling Using Elastic Round Robin," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 324-336, 2002.