GSP, the Generalised Shared Protection

There are different shared protection strategies including shared link, segment, and end-to-end path protection. Here we propose a generic optimization framework, referred to as GSP, the Generalised Shared Protection, that yields a shared protection that uses resources optimally along with the primary path for any single demand. The optimization is based on ILP formulation. The optimization implicitly decides whether link, segment or end-to-end path protection is the best solution for a certain demand under given traffic and network conditions. We prove analytically that GSP cannot be outperformed by any of the classical shared protection methods. By intensive simulations we compare the performance of 5 shared protection methods to GSP in case of dynamic traffic. We show that SPP (Shared Path Protection) nearly always provides the same result as GSP, however, GSP is more resilient against double link failures. Furthermore, we show that GSP is as resilient to double link failures as SLP (Shared Link Protection) while it requires significantly less resources and has, therefore, significantly lower cost.

[1]  Brigitte Jaumard,et al.  Design of survivable WDM networks using pre-configured protection structures with unrestricted shapes , 2010, Photonic Network Communications.

[2]  Pin-Han Ho.  State-of-the-art progress in developing survivable routing schemes in mesh WDM networks , 2004, IEEE Communications Surveys & Tutorials.

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

[4]  Pin-Han Ho,et al.  ILP formulations for p-cycle design without candidate cycle enumeration , 2010, TNET.

[5]  Piotr Cholda,et al.  Network Recovery, Protection and Restoration of Optical, SONET-SDH, IP, and MPLS [Book Review] , 2005, IEEE Communications Magazine.

[6]  P. Castoldi,et al.  Single-layer versus multilayer preplanned lightpath restoration , 2005, Journal of Lightwave Technology.

[7]  Tibor Cinkler,et al.  A meta-heuristic approach for non-bifurcated dedicated protection in WDM optical networks , 2011, 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN).

[8]  Hans-Werner Braun,et al.  The National Science Foundation Network , 1992 .

[9]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[10]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[11]  Tibor Cinkler,et al.  A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time , 2008, IEEE Transactions on Reliability.

[12]  Tibor Cinkler,et al.  Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels , 2004, IEEE/ACM Transactions on Networking.

[13]  Jacek Rak.  κ-Penalty: a novel approach to find κ-Disjoint paths with differentiated path costs , 2010, IEEE Communications Letters.

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

[15]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

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

[18]  Tibor Cinkler,et al.  Fairness in Capacitated Networks: A Polyhedral Approach , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[19]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .