Fair adaptive bandwidth allocation: a rate control based active queue management discipline

Active queue management disciplines such as RED and its extensions have been widely studied as mechanisms for providing congestion avoidance, differentiated services and fairness between different traffic classes. With the emergence of new applications with diverse Quality-of-Service requirements over the Internet, the need for mechanisms that provide differentiated services has become increasingly important. We propose fair adaptive bandwidth allocation (FABA), a buffer management discipline that ensures a fair bandwidth allocation amongst competing flows even in the presence of non-adaptive traffic. FABA is a rate control based AQM discipline that provides explicit fairness and can be used to partition bandwidth in proportion to pre-assigned weights. FABA is well-suited for allocation of bandwidth to aggregate flows as required in the differentiated services framework. Since FABA can be extended to scenarios such as aggregate, hierarchical and weighted flows, it can serve as a useful method for enforcing service level agreements at the edge of the network. We study and compare FABA with other well known queue management disciplines and show that FABA ensures fair allocation of bandwidth across a much wider range of buffer sizes at a bottleneck router. Further, FABA is shown to give high values of fairness coefficient for diverse applications such as FTP, Telnet and HTTP. FABA uses randomization and has an O(1) average time complexity, and, is therefore scalable. The space complexity of the proposed algorithm is O(B) where B is the buffer size at the bottleneck router. We argue that though FABA maintains per active-flow state, through O(1) computation, reasonably scalable implementations can be deployed which is sufficient for network edges.

[1]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[2]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[3]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[4]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[5]  Dinesh C. Verma,et al.  Policy-Based Networking: Architecture and Algorithms , 2000 .

[6]  Bruce S. Davie,et al.  Computer Networks: A System Approach , 1998, IEEE Communications Magazine.

[7]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[8]  Brian E. Carpenter,et al.  Definition of Differentiated Services Per Domain Behaviors and Rules for their Specification , 2001, RFC.

[9]  Brian E. Carpenter,et al.  Definition of Differentiated Services Behavior Aggregates and Rules for their Specification , 2000 .

[10]  Armand M. Makowski,et al.  Limit behavior of ECN/RED gateways under a large number of TCP flows , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Roch Guérin,et al.  Scalable QoS provision through buffer management , 1998, SIGCOMM '98.

[12]  Roch Guérin,et al.  The cost of QoS support in edge devices an experimental study , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[14]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[15]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[16]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[18]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[19]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.