Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

This paper focuses on the problem of dynamic survivable routing for segment shared protection (SSP) in mesh communication networks provisioning bandwidth guaranteed tunnels. With SSP, a connection is settled by concatenating a series of protection domains, each of which contains a working and protection segment pair behaving as a self-healing unit for performing local restoration whenever the working segment is subject to any unexpected interruption. We first discuss the advantages of using SSP-the ability to shorten the restoration time as well as achieve a higher throughput by saving spare capacity required for 100% restorability; then the survivable routing problem is formulated into an Integer Linear Programming (ILP), where the switching/merging node pair of each protection domain along with the corresponding least-cost working and protection segment pair can be jointly determined for a dynamically arrived connection request. A novel approach of arc-reversal transformation is devised to deal with the situation that the working segments of two neighbor protection domains may overlap with each other by more than a single node. Due to a very high computation complexity induced in solving the ILP, a novel heuristic algorithm is proposed, named Cascaded Diverse Routing (CDR), to allocate protection domains for a connection request by performing diverse routing across a set of predefined candidate switching/merging node pairs. Experiments are conducted on five two-connected network topologies to verify the ILP and the CDR algorithm. We first determine the best diameter of protection domains for the CDR scheme in each network topology. Using the results of best diameters, CDR is compared with two reported schemes, namely PROMISE and OPDA. We demonstrate in the simulation results that the path-shared protection schemes are outperformed by the SSP schemes in terms of blocking probability under all possible arrangements in the experiment and that CDR yields better performance than PROMISE and OPDA due to the extra efforts in manipulating the location of working segments at the expense of longer computation time.

[1]  Chunming Qiao,et al.  Protection with Multi-Segments ( PROMISE ) in Networks with Shared Risk Link Groups ( SRLG ) ∗ , 2002 .

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

[3]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[4]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..

[6]  Chunming Qiao,et al.  Achieving fast and bandwidth-efficient shared-path protection , 2003 .

[7]  S. Chaudhuri,et al.  Comparison of centralized and distributed provisioning of lightpaths in optical networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

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

[9]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[10]  Robert D. Doverspike,et al.  Efficient distributed restoration path selection for shared mesh restoration , 2003, TNET.

[11]  H. T. Mouftah,et al.  Shared protection in mesh WDM networks , 2004, IEEE Communications Magazine.

[12]  Eric Bouillet,et al.  Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Ariel Orda,et al.  Algorithms for computing QoS paths with restoration , 2005, IEEE/ACM Transactions on Networking.

[14]  Katherine Guo,et al.  Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks , 2022 .

[15]  H. T. Mouftah,et al.  Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[16]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

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

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

[20]  C. Siva Ram Murthy,et al.  Dynamic Establishment of Segmented Protection Paths in Single and Multi-Fiber WDM Mesh Networks , 2005, Photonic Network Communications.

[21]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  H. T. Mouftah,et al.  On achieving optimal survivable routing for shared protection in survivable next-generation Internet , 2004, IEEE Transactions on Reliability.