On disjoint path pairs with wavelength continuity constraint in WDM networks

In a WDM optical network, each fiber link can carry a certain set of wavelengths /spl Lambda/= {/spl lambda//sub 1/,/spl lambda//sub 2/,...,/spl lambda//sub W/}. One scheme for tolerating a single link failure (or node failure) in the network is the path protection scheme, which establishes an active path and a link-disjoint (or node-disjoint) backup path, so that in the event of a link failure (node failure) on the active path, data can be quickly re-routed through the backup path. We consider a dynamic scenario, where requests to establish active-backup paths between a specified source-destination node pair arrive sequentially. If a link-disjoint (node-disjoint) active-backup path pair is found at the time of the request, the paths are established; otherwise, the request is blocked. In this scenario, at the time a request arrives, not every fiber link will have all W wavelengths available for new call establishment, as some of the wavelengths may already have been allocated to earlier requests and communication through these paths may still be in progress. We assume that the network nodes do not have any wavelength converters. This paper studies the existence of a pair of link-disjoint (node-disjoint) active-backup paths satisfying the wavelength continuity constraint between a specified source-destination node pair. First we prove that both the link-disjoint and node-disjoint versions of the problem are NP-complete. Then we focus on the link-disjoint version and present an approximation algorithm and an exact algorithm for the problem. Finally, through our experimental evaluations, we demonstrate that our approximation algorithm produces near-optimal solutions in almost all of the instances of the problem in a fraction of the time required by the exact algorithm.

[1]  L. H.,et al.  Communication Networks , 1936, Nature.

[2]  Yu Liu,et al.  Successive survivable routing for node failures , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[4]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

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

[6]  Arunabha Sen,et al.  Survivability of lightwave networks - path lengths in WDM protection scheme , 2001, J. High Speed Networks.

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

[8]  Chunming Qiao,et al.  Static versus dynamic establishment of protection paths in WDM networks , 2001, J. High Speed Networks.

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

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

[11]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[12]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

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

[14]  Chunming Qiao,et al.  Dynamic establishment of protection paths in WDM networks. Part I , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[15]  Li Chen,et al.  Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[16]  Rami G. Melhem,et al.  Low-cost, delay-bounded point-to-multipoint communication to support multicasting over WDM networks , 2002, Comput. Networks.

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

[18]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[19]  Arunita Jaekel,et al.  Fault-tolerant routing scheme for all-optical networks , 1998, Other Conferences.

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

[21]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

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

[23]  Nasir Ghani,et al.  On IP-over-WDM integration , 2000, IEEE Commun. Mag..

[24]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[25]  K. Lee,et al.  A wavelength rerouting algorithm in wide-area all-optical networks , 1996 .

[26]  Deying Li,et al.  Converter Placement Supporting Broadcast in WDM Optical Networks , 2001, IEEE Trans. Computers.

[27]  Nasir Ghani,et al.  Channel provisioning for higher-layer protocols in WDM networks , 1999, Optics East.

[28]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[29]  Muriel Médard,et al.  A novel approach to automatic protection switching using trees , 1997, Proceedings of ICC'97 - International Conference on Communications.

[30]  Niki Pissinou,et al.  On optical communications networks and wideband network architecture , 2000, Comput. Commun..

[31]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[32]  Eytan Modiano,et al.  Partial path protection for WDM networks: end-to-end recovery using local failure information , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[33]  Muriel Médard,et al.  Generalized loop-back recovery in optical mesh networks , 2002, TNET.

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

[35]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..

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

[37]  Admela Jukan.  QoS-based Wavelength Routing in Multi-Service WDM Networks , 2001, Progress in Communication Networks.