Architecture for dynamic and fair distribution of bandwidth

The problem of fair distribution of available bandwidth among traffic flows or aggregates remains an essential issue in computer networks. This paper introduces a novel approach, called the Exact Bandwidth Distribution Scheme (X-BDS), for dynamic and fair distribution of available bandwidth among individual flows. In this approach, the edge routers keep per-flow information, while the core routers maintain the aggregate flow requirements.The X-BDS approach employs a distributed message exchange protocol for providing network feedback and for distributing aggregate flow requirements among the nodes in the network. Based on the obtained feedback, the edge routers employ the X-BDS resource management unit to dynamically distribute available bandwidth among individual flows. The X-BDS admission control and resource management units are responsible for fair resource allocation that supports minimum bandwidth guarantees of individual flows. This paper evaluates the Bandwidth Distribution Scheme through simulation and shows that the X-BDS is capable of supporting per-flow bandwidth guarantees in a dynamically changing network environment.

[1]  R. J. Gibbensa,et al.  Measurement-based connection admission control , 2007 .

[2]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[3]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[4]  Edwin K. P. Chong,et al.  A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[5]  Albert Banchs,et al.  User fair queuing: fair allocation of bandwidth for users , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Adarshpal S. Sethi,et al.  Dynamic bandwidth distribution techniques for scalable per-flow qos , 2003 .

[7]  Adarshpal S. Sethi,et al.  Estimating aggregate resource reservation for dynamic, scalable, and fair distribution of bandwidth , 2005, Comput. Networks.

[8]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[9]  Adarshpal S. Sethi,et al.  Reducing load distribution overhead with message aggregation , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[10]  Adarshpal S. Sethi,et al.  Avoiding congestion through dynamic load control , 2001, SPIE ITCom.

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

[12]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

[13]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[14]  Raj Jain,et al.  The ERICA switch algorithm for ABR traffic management in ATM networks , 1998, TNET.

[15]  R. Gibbens.  Measurement-based connection admission control , 1997 .

[16]  Jean-Yves Le Boudec,et al.  A Unified Framework for Max-Min and Min-Max Fairness With Applications , 2007, IEEE/ACM Transactions on Networking.

[17]  Kai-Yeung Siu,et al.  On Max-Min Fair Congestion Control for Multicast ABR Service in ATM , 1997, IEEE J. Sel. Areas Commun..

[18]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[19]  Scott Shenker,et al.  Comments on the performance of measurement-based admission control algorithms , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  Raj Jain,et al.  General weighted fairness and its support in explicit rate switch algorithms , 2000, Comput. Commun..

[21]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.

[22]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[23]  Adarshpal S. Sethi,et al.  Fair and Scalable Load Distribution in the Internet , 2002, International Conference on Internet Computing.

[24]  Ion Stoica,et al.  Stateless Core: A Scalable Approach for Quality of Service in the Internet , 2004, Lecture Notes in Computer Science.

[25]  Kang G. Shin,et al.  Understanding and improving TCP performance over networks with minimum rate guarantees , 1999, TNET.

[26]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[27]  Leandros Tassiulas,et al.  A Simple Rate Control Algorithm for Maximizing Total User Utility. , 2001, INFOCOM 2001.

[28]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[29]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.