A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources. In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate. To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users' utility functions to increase users' benefit and network revenue. Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm. We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.

[1]  James Aweya,et al.  A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks , 2001, Int. J. Commun. Syst..

[2]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[3]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[4]  Douglas S. Reeves,et al.  Bandwidth provisioning and pricing for networks with multiple classes of service , 2004, Comput. Networks.

[5]  Andrew T. Campbell,et al.  Dynamic core provisioning for quantitative differentiated services , 2004, IEEE/ACM Transactions on Networking.

[6]  Guy Pujolle,et al.  Dynamic Resource Allocation in Communication Networks , 2006, Networking.

[7]  Ronaldo M. Salles,et al.  Fair and efficient dynamic bandwidth allocation for multi-application networks , 2005, Comput. Networks.

[8]  Henning Schulzrinne,et al.  RNAP: A Resource Negotiation and Pricing Protocol , 1999 .

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

[10]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[11]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[12]  M. Chial,et al.  in simple , 2003 .

[13]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 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).

[14]  M. Allalouf,et al.  Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

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

[16]  Krzysztof Pawlikowski,et al.  On credibility of simulation studies of telecommunication networks , 2002, IEEE Commun. Mag..

[17]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description , 2003, RFC.

[18]  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.

[19]  Raouf Boutaba,et al.  A measurement-based approach for dynamic QoS adaptation in DiffServ networks , 2005, Comput. Commun..

[20]  Andrew T. Campbell,et al.  Dynamic edge provisioning for core IP networks , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[21]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[22]  Shengyu Zhang,et al.  Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[23]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[24]  Eitan Altman,et al.  Generalized Nash Bargaining Solution for bandwidth allocation , 2006, Comput. Networks.

[25]  Hung Tuan Tran,et al.  Adaptive bandwidth provisioning with explicit respect to QoS requirements , 2003, Comput. Commun..

[26]  Manish Parashar,et al.  Active resource management for the differentiated services environment , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[27]  Henning Schulzrinne,et al.  Incentive-compatible adaptation of Internet real-time multimedia , 2005, IEEE Journal on Selected Areas in Communications.

[28]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[29]  Richard J. La,et al.  Utility-based rate control in the Internet for elastic traffic , 2002, TNET.

[30]  Raj Jain,et al.  Source behavior for ATM ABR traffic management: an explanation , 1996, IEEE Commun. Mag..

[31]  Guy Pujolle,et al.  Dynamic Resource Allocation in Quality of Service Networks , 2005, EuroNGI Workshop.

[32]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques , 2001, IEEE Commun. Mag..

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

[34]  James Aweya,et al.  Design and stability analysis of a rate control algorithm using the Routh-Hurwitz stability criterion , 2004, IEEE/ACM Transactions on Networking.