Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks

Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day multilayer networks. Multiple link failure models, in the form of Shared Risk Link Groups (SRLG’s), Shared Risk Node Groups (SRNG’s), and more generally shared risk resource groups (SRRG), are becoming critical in survivable optical network design. We develop techniques for the minimum color path problem to tolerate multiple failures arising from a shared resource group failure. We also study the minimum color st-cut problem that we prove NP-complete and hard to approximate. We also provide ecient MILP formulation and heuristic algorithms for it.

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

[2]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

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

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

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Arun K. Somani,et al.  Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks , 2004, First International Conference on Broadband Networks.

[7]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[8]  Charles Kalmanek,et al.  Fiber span failure protection in mesh optical networks , 2001, OptiComm: Optical Networking and Communications Conference.

[9]  Ori Gerstel,et al.  Opportunities for optical protection and restoration , 1998 .

[10]  Ori Gerstel,et al.  Optical layer survivability-an implementation perspective , 2000, IEEE Journal on Selected Areas in Communications.

[11]  Jason P. Jue,et al.  Minimum-color path problems for reliability in mesh networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Romeo Rizzi.  NOTE – On Minimizing Symmetric Set Functions , 2000, Comb..

[13]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

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

[15]  A. Greenberg,et al.  Auto-discovery of shared risk link groups , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[16]  Dimitri Papadimitriou,et al.  Inference of Shared Risk Link Groups , 2001 .

[17]  Jason P. Jue,et al.  Dynamic lightpath protection in WDM mesh networks under risk-disjoint constraint , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[18]  Robert D. Carr,et al.  On the red-blue set cover problem , 2000, SODA '00.