Fair queuing for aggregated multiple links

Provisioning of a shared server with guarantees is an important scheduling task that has led to significant work in a number of areas including link scheduling. Fair Queuing algorithms provide a method for proportionally sharing a single server among competing flows, however, they do not address the problem of sharing multiple servers. Multiserver systems arise in a number of applications including link aggregation, multiprocessors and multi-path storage I/O. In this paper we introduce a new service discipline for multi-server systems that provides guarantees for competing flows. We prove that this new service discipline is a close approximation of the idealized Generalized Processor Sharing (GPS) discipline. We calculate its maximum packet delay and service discrepancy with respect to GPS. We also discuss its relevance to several applications, in particular, Ethernet link aggregation.

[1]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[2]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[3]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[4]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[5]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Ieee Standards Board.  Fiber optic active and passive star-based segments, type 10BASE-F (section 15-18) : IEEE standards for local and metropolitan area networks : supplement to carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications , 1993 .

[7]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[8]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[10]  George Varghese,et al.  A reliable and scalable striping protocol , 1996, SIGCOMM 1996.

[11]  Prashant J. Shenoy,et al.  Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors , 2000, OSDI.

[12]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.