Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks

We consider the routing and wavelength assignment (RWA) in survivable WDM network. A path protection scheme assumed and two different wavelength assignment methods for protection paths are considered. Integer programming formulations of RWA under two wavelength assignment methods are proposed and we devised algorithms to solve them. Test results show that the difference of wavelength requirements between two wavelength assignment methods is 5–30–

[1]  Rajiv Ramaswami,et al.  Optical layer survivability: a services perspective , 2000, IEEE Commun. Mag..

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

[3]  Gurusamy Mohan,et al.  Lightpath restoration in WDM optical networks , 2000, IEEE Netw..

[4]  N. Nagatsu,et al.  Optical Path Cross-Connect System Scale Evaluation Using Path Accommodation Design for Restricted Wavelength Multiplexing , 1996, IEEE J. Sel. Areas Commun..

[5]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

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

[7]  Sungsoo Park,et al.  Routing and wavelength assignment in WDM all-optical networks , 2000 .

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

[9]  BarnhartCynthia,et al.  Branch-And-Price , 1998 .

[10]  Kyungsik Lee,et al.  Optimal routing and wavelength assignment in WDM ring networks , 2000, IEEE Journal on Selected Areas in Communications.

[11]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[12]  P. A. Bonenfant.  Optical layer survivability: a comprehensive approach , 1998 .

[13]  C. Siva Ram Murthy,et al.  Reconfiguration based failure restoration in wavelength-routed WDM networks , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[14]  Eytan Modiano,et al.  Efficient routing and wavelength assignment for reconfigurable WDM networks , 2002, IEEE J. Sel. Areas Commun..

[15]  Eytan Modiano,et al.  Survivable routing of logical topologies in WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Hiroyuki Saito,et al.  Optimal design and evaluation of survivable WDM transport networks , 1998, IEEE J. Sel. Areas Commun..

[17]  P. Sreenivasa Kumar,et al.  Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms , 2002, Comput. Commun..

[18]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[19]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..