Dynamic routing for shared path protection in multidomain optical mesh networks

The routing problem for shared path protection in multidomain optical mesh networks is more difficult than that in single-domain mesh networks due to the lack of complete and global knowledge of the network topology and bandwidth allocation. To overcome this difficulty, we propose an aggregated network modeling by underestimation with a two-step routing strategy. In the first step, a rough routing solution is sketched in a virtual network that is the topology aggregation of the multidomain network. A complete routing is then determined by solving routing problems within the original single-domain networks. The first step can be solved by either using an exact mathematical program or a heuristic, whereas the second step is always solved by heuristics. Computational results show the relevance of the aggregated network modeling. They also prove the scalability of the proposed routing for multidomain networks and its efficiency in comparison with the optimal solution obtained by use of the complete information scenario. In addition, we believe that short working paths lead to a higher possibility of sharing backup resources between backup paths. Our mathematical program model minimizes the total requested resources and at the same time provides a short working path, resulting in a further overall saving of resources.

[1]  Jim Boyle,et al.  Requirements for Inter-Area MPLS Traffic Engineering , 2005, RFC.

[2]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[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]  Fang Hao,et al.  On scalable QoS routing: performance evaluation of topology aggregation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

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

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

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

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

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

[11]  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).

[12]  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).

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

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

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

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