Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks

In end-to-end connections it is sometimes not possible to find a totally disjoint path pair. In this context it may be reasonable to accept a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single fault protection that can be ensured. A Shared Risk Link Group (SRLG) is a group of links which have a common risk of failure (which may result from the sharing of common resources at a lower layer). The concept of SRLG allows an upper layer to be capable of implementing diverse routing, taking into account the existence of common risks of failure. Two heuristics for solving the min-sum maximally node and SRLG-disjoint path pair, formulated as a multi-objective optimization problem, are presented. The relative performance of the heuristics is evaluated using three different networks. The envisaged application scenario of these path calculation algorithms is Generalized Multiprotocol Label Switching (GMPLS) networks.

[1]  Chunming Qiao,et al.  Novel algorithms for shared segment protection , 2003, IEEE J. Sel. Areas Commun..

[2]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

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

[4]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[5]  Lei Guo,et al.  Partial SRLG-disjoint shared path protection with differentiated reliability in survivable WDM network , 2007 .

[6]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[7]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[8]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[9]  Byrav Ramamurthy,et al.  On provisioning diverse circuits in heterogeneous multi-layer optical networks , 2013, Comput. Commun..

[10]  Teresa Gomes,et al.  Obtaining a SRLG-disjoint path pair of min-sum cost , 2010, International Congress on Ultra Modern Telecommunications and Control Systems.

[11]  Yi Zhu,et al.  SRLG-aware topology aggregation for survivable multi-domain optical networks , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[12]  Byrav Ramamurthy,et al.  SRLG-diverse routing of multiple circuits in a heterogeneous optical transport network , 2011, 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN).

[13]  Luying Zhou,et al.  Shared partial path protection in WDM networks with shared risk link groups , 2008, Photonic Network Communications.

[14]  Hassan Naser,et al.  Class of service with Partial Protection in multilayered networks with SRLG constraints , 2010, The IEEE symposium on Computers and Communications.

[15]  Sheng Wang,et al.  Planning Traffic-Oblivious Survivable WDM Networks Using Differentiated Reliable Partial SRLG-Disjoint Protection , 2010, 2010 Symposium on Photonics and Optoelectronics.

[16]  Jin Cao,et al.  Differentiated Reliable Partial SRLG-disjoint Shared Path Protection in Survivable WDM Network , 2006, 2006 International Conference on Communications, Circuits and Systems.

[17]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[18]  Jin Cao,et al.  A new shared-risk link groups (SRLG)-disjoint path provisioning with shared protection in WDM optical networks , 2007, J. Netw. Comput. Appl..

[19]  Teresa Gomes,et al.  An heuristic for maximally SRLG-disjoint path pairs calculation , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[20]  Mohammad Javad Rostami,et al.  MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization , 2012, J. Netw. Comput. Appl..

[21]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[22]  Zafar Ali,et al.  RSVP-TE Extensions for Collecting SRLG Information , 2014 .

[23]  Eiji Oki,et al.  A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.

[24]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[25]  Teresa Gomes,et al.  Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost , 2011, Telecommunication Systems.

[26]  C. Chellamuthu,et al.  A Cost Effective Approach for WDM Network Protection under Critical Duct Constraints , 2012 .

[27]  Wang Yan,et al.  New SRLG-diverse path selection algorithm in survivable GMPLS networks , 2009 .

[28]  Byrav Ramamurthy,et al.  Shared risk link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks , 2005, IEEE/ACM Transactions on Networking.

[29]  Lei Guo,et al.  A Novel Survivable Routing Algorithm With Partial Shared-Risk Link Groups (SRLG)-Disjoint Protection Based on Differentiated Reliability Constraints in WDM Optical Mesh Networks , 2007, Journal of Lightwave Technology.