Shared Path Protection for Bandwidth Guaranteed Connections in Multi-Domain Networks

Abstract Shared path protection routing for bandwidth guaranteed connections in multi-domain networks is difficult due to the lack of complete and global knowledge on the network topology and bandwidth allocation. To overcome this difficulty, we propose an aggregated network modelling by overestimation and a two-step routing strategy. In the first step, a rough routing solution is sketched in a compact network which is the topology aggregation of the multi-domain network. A complete routing is then determined by solving routing problems within the original single-domain networks. Each routing step can be solved by either using an exact mathematical or a heuristic method. Computational results show the relevance of the aggregate network modelling and the scalability as well as the efficiency of the proposed routing for multi-domain networks.

[1]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[2]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Chunming Qiao,et al.  An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[4]  John A. Copeland,et al.  Multi-domain mesh optical network protection using Hamiltonian cycles , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[5]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[6]  Dimitra Simeonidou,et al.  The design of a European optical network , 1995 .

[7]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[9]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[10]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[11]  Biswanath Mukherjee,et al.  Sub-path protection for scalability and fast recovery in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

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

[13]  Vishal Sharma,et al.  Interdomain optical routing , 2002 .

[14]  Sudipta Sengupta,et al.  RELIABILITY IN SINGLE DOMAIN VS. MULTI DOMAIN OPTICAL MESH NETWORKS , 2002 .

[15]  Eric Bouillet,et al.  Distributed computation of shared backup path in mesh optical networks using probabilistic methods , 2004, IEEE/ACM Transactions on Networking.