Lightpaths routing for single link failure survivability in IP-over-WDM networks

High speed all optical network is a viable option to satisfy the exponential growth of internet usage in the recent years. Optical networks offer very high bit rates and, by employing technologies like internet protocol over wavelength division multiplexing (IP-over-WDM), these high bit rates can be effectively utilized. However, failure of a network component, carrying such high speed data traffic can result in enormous loss of data in a few seconds and persistence of a failure can severely degrade the performance of the entire network. Designing IP-over-WDM networks, which can withstand failures, has been subject of considerable interest in the research community recently. Most of the research is focused on the failure of optical links in the network. This paper addresses the problem of designing IP-over-WDM networks that do not suffer service degradation in case of a single link failure. The paper proposes an approach based on the framework provided by a re- cent paper by M. Kurant and P. Thiran. The proposed approach can be used to design large survivable IP-over-WDM networks.

[1]  Torsten Tholey,et al.  Solving the 2-Disjoint Paths Problem in Nearly Linear Time , 2004, Theory of Computing Systems.

[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]  M. N. S. Swamy,et al.  Graphs: Theory and Algorithms: Thulasiraman/Graphs , 1992 .

[4]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[5]  Patrick Thiran,et al.  Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction , 2007, IEEE Journal on Selected Areas in Communications.

[6]  Christian Blum,et al.  Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem , 2004, EvoWorkshops.

[7]  Ori Gerstel,et al.  Protection interoperability for WDM optical networks , 2000, TNET.

[8]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[9]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[10]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[11]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[12]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[13]  Guoliang Xue,et al.  OPN07-3: Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation , 2006, IEEE Globecom 2006.

[14]  Luca Valcarenghi,et al.  IP restoration vs. WDM protection: is there an optimal choice? , 2000, IEEE Netw..

[15]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[16]  Patrick Thiran,et al.  On survivable routing of mesh topologies in IP-over-WDM networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  M. N. Shanmukha Swamy,et al.  Graphs: Theory and Algorithms , 1992 .

[18]  Biswanath Mukherjee,et al.  Fault management in IP-over-WDM networks: WDM protection versus IP restoration , 2002, IEEE J. Sel. Areas Commun..