Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches

With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are a common approach for switches and routers to support QoS. All fair scheduling algorithms are running based on a bandwidth allocation scheme. The scheme should be feasible in order to be applied in practice, and should be efficient to fully utilize available bandwidth and allocate bandwidth in a fair manner. However, since a single input port or output port of a switch has only the bandwidth information of its local flows (i.e., the flows traversing itself), it is difficult to obtain a globally feasible and efficient bandwidth allocation scheme. In this paper, we show how to fairly allocate bandwidth in packet switches based on the max-min fairness principle. We first formulate the problem, and give the definitions of feasibility and max-min fairness for bandwidth allocation in packet switches. As the first step to solve the problem, we consider the simpler unicast scenarios, and present the max-min fair bandwidth allocation algorithm for unicast traffic. We then extend the analysis to the more general multicast scenarios, and present the max-min fair bandwidth allocation algorithm for multicast traffic. We prove that both algorithms achieve max-min fairness, and analyze their complexity. The proposed algorithms are universally applicable to any type of switches and scheduling algorithms.

[1]  Jun Xu,et al.  On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms , 2005, TNET.

[2]  Stephan Olariu,et al.  A Fair Resource Allocation Protocol for Multimedia Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[3]  Harish Sethu,et al.  On achieving fairness in the joint allocation of processing and bandwidth resources , 2003, IWQoS'03.

[4]  Anujan Varma,et al.  Providing bandwidth guarantees in an input-buffered crossbar switch , 1995, Proceedings of INFOCOM'95.

[5]  Harish Sethu,et al.  Max-Min Fairness in Input-Queued Switches , 2005 .

[6]  San-Qi Li,et al.  Performance of a nonblocking space-division packet switch with correlated input traffic , 1992, IEEE Trans. Commun..

[7]  Deng Pan,et al.  Credit based fair scheduling for packet switched networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

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

[10]  Robert B. Magill,et al.  Output-queued switch emulation by fabrics with limited memory , 2003, IEEE J. Sel. Areas Commun..

[11]  Richard J. Lipton,et al.  On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms , 2002, IEEE/ACM Transactions on Networking.

[12]  Laxmi N. Bhuyan,et al.  Fair Scheduling for Input Buffered Switches , 2001, Proceedings, International Parallel and Distributed Processing Symposium (IPDPS).

[13]  Harish Sethu,et al.  On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms , 2005, IEEE/ACM Transactions on Networking.

[14]  Nick McKeown,et al.  Practical algorithms for performance guarantees in buffered crossbars , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[16]  Deng Pan,et al.  FIFO based multicast scheduling algorithm for VOQ packet switches , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[17]  Yiwei Thomas Hou,et al.  A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[18]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..

[19]  Jonathan Turner,et al.  Strong Performance Guarantees for Asynchronous Crossbar Schedulers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[20]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[21]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[22]  Harish Sethu,et al.  Max-Min Fair Scheduling in Input-Queued Switches , 2008, IEEE Transactions on Parallel and Distributed Systems.

[23]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[24]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[25]  Xiao Zhang,et al.  Deficit round-robin scheduling for input-queued switches , 2003, IEEE J. Sel. Areas Commun..

[26]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

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

[29]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[30]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[31]  Christopher Metz.  IP Routers: New Tool for Gigabit Networking , 1998, IEEE Internet Comput..

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