A Delay-Constrained Shared Mesh Restoration Scheme

We present a multi-constrained routing algorithm, called delay-constrained pool sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link- disjoint primary and backup paths between a given source and destination nodes, which guarantees full recovery from any single link failure in the network. Our objective is to minimize the resources (such as backup bandwidth) used in the network as well as the total end-to-end delay time along the primary and backup paths. Our approach improves the end-to-end delay performance of the simple pool sharing (SPS) algorithm introduced in the literature, and proposes an integrated approach for quality of service (QoS) and resiliency. Using simulation, we studied the DPS algorithm on the existing North-American transport networks, and showed its improvements compared to the SPS scheme. We also introduce a hybrid algorithm which relaxes the delay constraint on the backup path in favor of maximizing the reusability (sharing) of the backup bandwidth.

[1]  Byrav Ramamurthy,et al.  On computing disjoint paths with dependent cost structure in optical networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[2]  H. T. Mouftah,et al.  Availability analysis and simulation of mesh restoration networks , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[3]  Ramesh Bhandari.  Survivable Networks: Algorithms for Diverse Routing , 1998 .

[4]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[5]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[6]  Sudipta Sengupta,et al.  Efficient channel reservation for backup paths in optical mesh networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[7]  H. T. Mouftah,et al.  Linear formulation for path shared protection , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

[9]  ChenShigang,et al.  An overview of quality of service routing for next-generation high-speed networks , 1998 .

[10]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[11]  Biswanath Mukherjee,et al.  Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks , 2004, Photonic Network Communications.

[12]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[13]  Jason P. Jue,et al.  Heuristic routing algorithm for shared protection in connection-oriented networks , 2001, OptiComm: Optical Networking and Communications Conference.

[14]  Hussein T. Mouftah,et al.  Enhanced pool sharing: a constraint-based routing algorithm for shared mesh restoration networks [Invited] , 2004 .