Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information

This paper presents new algorithms for dynamic routing of restorable bandwidth-guaranteed paths. We assume that connection requests one-by-one and have to be routed with no a priori knowledge of future arrivals. In order to guarantee restorability, in addition to determining an active path to route each request, an alternate link (node) disjoint backup (restoration) path has to be determined for the request at the time of connection initiation. This joint on-line routing problem is becoming particularly important in optical networks and in multiprotocol label switching (MPLS)-based networks due to the trend in backbone networks toward dynamic provisioning of bandwidth-guaranteed or wavelength paths. A straightforward solution for the restoration problem is to find two disjoint paths. However, this results in excessive resource usage. Given a restoration objective, such as protection against single-link failures, backup path bandwidth usage can be reduced by judicious sharing of backup paths amongst certain active paths while still maintaining restorability. The best sharing performance is achieved if the routing of every path in progress in the network is known to the routing algorithm at the time of a new path setup. We give an integer programming formulation for this problem which is new. Complete path routing knowledge is a reasonable assumption for a centralized routing algorithm. However, it is not often desirable, particularly when distributed routing is preferred. We show that an aggregate information scenario which uses only aggregated and not per-path information provides sufficient information for a suitably developed algorithm to be able to perform almost as well as the complete information scenario. Disseminating this aggregate information is feasible using proposed traffic engineering extensions to routing protocols. We formulate the dynamic restorable bandwidth routing problem in this aggregate information scenario and develop efficient routing algorithms. We show that the performance of our aggregate information-based algorithm is close to the complete information bound.

[1]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

[2]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 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).

[3]  Bruce W. Suter,et al.  COPS Extension for Intra-Domain Traffic Engineering , 1999 .

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

[5]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[6]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[7]  W. D. Grover,et al.  The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .

[8]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

[9]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[10]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[11]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. II. Restoration , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[12]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[13]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

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

[15]  Liang T. Wu,et al.  Using distributed topology update and preplanned configurations to achieve trunk network survivability , 1991 .

[16]  D. Awduche,et al.  Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects , 2001, IEEE Commun. Mag..

[17]  Chung-Lun Li,et al.  Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[18]  George Swallow,et al.  A framework for multiprotocol label switching , 1999 .

[19]  M. Medard,et al.  Capacity versus robustness: a tradeoff for link restoration in mesh networks , 2000, Journal of Lightwave Technology.

[20]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[21]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[22]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.