Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

This study investigates the problem of fault management in a wavelength-division multiplexing (WDM)-based optical mesh network in which failures occur due to fiber cuts. In reality, bundles of fibers often get cut at the same time due to construction or destructive natural events, such as earthquakes. Fibers laid down in the same duct have a significant probability to fail at the same time. When path protection is employed, we require the primary path and the backup path to be duct-disjoint, so that the network is survivable under single-duct failures. Moreover, if two primary paths go through any common duct, their backup paths cannot share wavelengths on common links. This study addresses the routing and wavelength-assignment problem in a network with path protection under duct-layer constraints. Off-line algorithms for static traffic is developed to combat single-duct failures. The objective is to minimize total number of wavelengths used on all the links in the network. Both integer linear programs and a heuristic algorithm are presented and their performance is compared through numerical examples.

[1]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

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

[3]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. II. Restoration , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[4]  Jennifer Yates,et al.  Effectiveness of shared risk link group auto-discovery in optical networks , 2002, Optical Fiber Communication Conference and Exhibit.

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

[6]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[7]  Sudipta Sengupta,et al.  Efficient channel reservation for backup paths in optical mesh networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[8]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

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

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

[11]  Murti V. Salapaka,et al.  Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.

[12]  Biswanath Mukherjee,et al.  Connection management for survivable wavelength-routed wdm mesh networks , 2001 .

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

[14]  S. Sengupta,et al.  From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: an architectural and algorithmic overview , 2001, IEEE Netw..

[15]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

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

[17]  Murat Azizoglu,et al.  Optical layer survivability: single service-class case , 2000, Other Conferences.

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

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

[20]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

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

[22]  Pin-Han Ho,et al.  Novel routing protocol for WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

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

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

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