Adaptive bandwidth allocation: impact of routing and load balancing on tunnel capacity requirements

In this paper, we consider adaptive bandwidth allocation (ABA) for capacity tunnels as an effective means for multi-hour network design. Traffic engineering (TE) tunnels established in a network from border-to-border (b2b) can be used not only for route pinning between ingress/egress node pairs but also for efficient implementation of resilient network admission control. If static bandwidth allocation (SBA) based on peak-rate traffic assumptions is used to dimension the b2b tunnels, fluctuations of the network traffic can lead to under- or overprovisioning of network capacity in the tunnels. If ABA is used instead, the tunnel sizes are dynamically adapted to current traffic conditions. The efficient use of network capacity assigned to TE tunnels strongly depends on the structure of these tunnels. The contribution of this paper is an assessment of the bandwidth savings that are achievable with ABA in comparison to SBA for various tunnel structures with different path layouts and load balancing strategies. Our results show that the capacity savings due to ABA depend on the routing and load balancing schemes provisioned in the network and that these savings may be increased by appropriately chosen tunnel implementations

[1]  J. W. Roberts.  Traffic theory and the Internet , 2001 .

[2]  Hung Tuan Tran,et al.  On the adaptive bandwidth provisioning schemes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[4]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  S. O. Larsson.  Comparisons of different approaches for capacity management in ATM networks , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[6]  Michael Menth,et al.  Self-Protecting Multipaths - A Simple and Resource-Effcient Protection Switching Mechanism for MPLS Networks , 2004, NETWORKING.

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

[8]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[9]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[10]  Aurel A. Lazar,et al.  Virtual path control for ATM networks with call level quality of service guarantees , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Michael Menth,et al.  Efficient admission control and routing for resilient communication networks , 2004 .

[12]  Michael Menth,et al.  Adaptive Bandwidth Allocation: Impact of Traffic Demand Models for Wide Area Networks , 2005 .

[13]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[14]  Michael Menth,et al.  Adaptive Bandwidth Allocation: Concepts and Efficiency for Admission-Controlled Capacity Tunnels , 2005 .

[15]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[16]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[17]  Jorma Virtamo,et al.  Broadband Network Traffic , 1996, Lecture Notes in Computer Science.

[18]  Dániel Orincsay,et al.  Multi-hour Design of Dynamically Reconfigurable MPLS Networks , 2004, NETWORKING.

[19]  M. Menth,et al.  Capacity assignment for NAC budgets in resilient networks , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[20]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[21]  Sujata Banerjee,et al.  A survey of adaptive bandwidth control algorithms , 2003, IEEE Communications Surveys & Tutorials.

[22]  Ugo Mocci,et al.  Broadband Network Teletraffic: Final Report of Action COST 242 , 1996 .

[23]  Joachim Charzinski,et al.  Towards carrier-grade next generation networks , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[24]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[25]  Thomas Bauschert,et al.  Optimale Dimensionierung von ATM-Weitverkehrsnetzen mit mehrstufiger Durchschaltung , 1997 .

[26]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[27]  S. Schnitter,et al.  Traffic matrices for MPLS networks with LDP traffic statistics , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[28]  S. Pink,et al.  Performance of QoS agents for provisioning network resources , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[29]  A. Arvidsson,et al.  Real time management of virtual paths , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[30]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[31]  Jens B. Schmitt,et al.  Multi-Period Resource Allocation at System Edges , 2002 .