Survivable routing of logical topologies in WDM networks

Network restoration is often done at the electronic layer by rerouting traffic along a redundant path. With wavelength division multiplexing (WDM) as the underlying physical layer, it is possible that both the primary and backup paths traverse the same physical links and would fail simultaneously in the event of a link failure. It is therefore critical that lightpaths are routed in such a way that a single link failure would not disconnect the network. We call such a routing survivable and develop algorithms for survivable routing of a logical topology. We prove necessary and sufficient conditions for a routing to be survivable and use this condition to formulate the problem as an integer linear program. We use our new formulation to route various logical topologies over a number of different physical topologies and show that this new approach offers a much greater degree of protection than alternative routing schemes such as shortest path routing and a greedy routing algorithm.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Andrea Fumagalli,et al.  Survivable networks based on optimal routing and WDM self-healing rings , 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).

[3]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

[4]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

[5]  Muriel Médard,et al.  WDM loop-back recovery in mesh networks , 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).

[6]  Eytan Modiano,et al.  Dynamic load balancing in WDM packet networks with and without wavelength constraints , 2000, IEEE Journal on Selected Areas in Communications.

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

[8]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[9]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[11]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[12]  Jean-Yves Le Boudec,et al.  Design protection for WDM optical networks , 1998, IEEE J. Sel. Areas Commun..

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

[14]  Ori Gerstel,et al.  Fault tolerant multiwavelength optical rings with limited wavelength conversion , 1998, IEEE J. Sel. Areas Commun..