This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eligibility-Based Round Robin for Fair and Efficient Packet Scheduling in Wormhole Switching Networks
March 2004 (vol. 15 no. 3)
pp. 244-256

Abstract—Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple users contend for channel bandwidth, fairness in bandwidth sharing becomes a key requirement. In fact, enforcing a fair sharing of channel bandwidth improves flow isolation, thus preventing misbehaving flows from affecting the performance of other flows. This paper presents a novel packet scheduling algorithm, called Eligibility-Based Round Robin (EBRR), devised to provide fair queueing in interconnection networks. In fact, EBRR meets the constraints imposed by wormhole switching, which is the most popular switching technique in interconnection networks of parallel systems. It can also be applied to packet switching Wide Area Networks (WANs), such as IP and ATM. We show that EBRR has O(1) complexity and better delay and fairness properties than existing algorithms of comparable complexity. In this paper, we also investigate the means for assessing the fairness of a scheduler: We show that using the Relative Fairness Bound as a fairness measure may lead to erroneous results. We then propose an alternative measure, called the Generalized Relative Fairness Bound, that allows fairness to be assessed more precisely.

[1] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,” Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
[2] D. Stiliadis and A. Varma, Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms IEEE/ACM Trans. Networking, vol. 6, pp. 675-689, Oct. 1998.
[3] D. Stiliadis and A. Varma, Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms Technical Report CRL-95-38, Univ. of California at Santa Cruz, July 1995.
[4] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[5] S.J. Golestani, A Self-Clocked Fair Queueing Scheme for Broadband Applications Proc. IEEE INFOCOM, pp. 636-646, June 1994.
[6] 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.
[7] J. Bennett and H. Zhang, Hierarchical Packet Fair Queueing Algorithms IEEE/ACM Trans. Networking, vol. 5, no. 5, pp. 675-689, Oct. 1997.
[8] 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.
[9] G. Parulkar, H. Adiseshu, and G. Varghese, A Reliable and Scalable Striping Protocol Proc. ACM SIGCOMM, pp. 131-141, Aug. 1996.
[10] L. Lenzini, E. Mingozzi, and G. Stea, Aliquem: A Novel DRR Implementation to Achieve Better Latency and Fairness atO(1) Complexity Proc. IEEE 10th Int'l Workshop Quality of Service, pp. 77-86, May 2002.
[11] L. Lenzini, E. Mingozzi, and G. Stea, A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queueing Services Based on the Timed Token Protocol IEEE Trans. Computers, vol. 51, no. 9, Sept. 2002.
[12] L. Lenzini, E. Mingozzi, and G. Stea, Packet Timed Token Service Discipline: A Scheduling Algorithm Based on the Dual-Class Paradigm for Providing QoS in Integrated Services Networks Computer Networks, vol. 39, no. 4, pp. 363-384, July 2002.
[13] S.S. Kanhere, A.B. Parekh, and H. Sethu, Fair and Efficient Packet Scheduling in Wormhole Networks Proc. Int'l Parallel and Distributed Processing Symp., May 2000.
[14] S.S. Kanhere, H. Sethu, and A.B. Parekh, Fair and Efficient Packet Scheduling Using Elastic Round-Robin IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, Mar. 2002.
[15] The Network Simulator ns-2,http://www.isi.edu/nsnamns/, 2003.
[16] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. IEEE Computer Soc. Press, 1997.
[17] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[18] J. Rexford and K.G. Shin, Support for Multiple Classes of Traffic in Multicomputer Routers Proc. Workshop Parallel Computer Routing and Comm., pp. 116-130, May 1994.
[19] 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.
[20] S. Senapathi, D.K. Panda, D. Stredney, and H.-W. Shen, A QoS Framework for Clusters to Support Applications with Resource Adaptivity and Predictable Performance Proc. IEEE 10th Int'l Workshop Quality of Service, pp. 180-190, May 2002.
[21] S.-C. Tsao and Y.-D. Lin, Pre-Order Deficit Round Robin: A New Scheduling Algorithm for Packet Switched Networks Computer Networks, vol. 35, pp. 287-305, Feb. 2001.

Index Terms:
Packet scheduling, fairness, wormhole switching networks, quality of service.
Citation:
Luciano Lenzini, Enzo Mingozzi, Giovanni Stea, "Eligibility-Based Round Robin for Fair and Efficient Packet Scheduling in Wormhole Switching Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 3, pp. 244-256, March 2004, doi:10.1109/TPDS.2004.1264809
Usage of this product signifies your acceptance of the Terms of Use.