Efficient routing and wavelength assignment for reconfigurable WDM networks with wavelength converters

We consider the problem of wavelength assignment in a reconfigurable bidirectional ring network with wavelength converters. We show that for N-node P-port bidirectional rings, a minimum number of /spl lceil/PN/4/spl rceil/ wavelengths are required to support all possible virtual topologies in a rearrangeably nonblocking fashion, and provide an algorithm that meets this bound for connected topologies using no more than /spl lceil/PN/2/spl rceil/ wavelength converters. This improves over the tight lower bound of /spl lfloor/PN/3/spl rfloor/ wavelengths required for such rings given in A. Narula-Tam et al. (2002)] if no wavelength conversion is available. We also provide another algorithm that uses more wavelengths yet requires significantly fewer converters. Both algorithms are then extended to the case of unconnected topologies using at most one additional wavelength. Finally, we develop a method that allows the wavelength converters to be arbitrarily located at any node in the ring. This gives significant flexibility in the design of the networks. For example, all /spl lceil/PN/2/spl rceil/ converters can be collocated at a single hub node, or distributed evenly among the N nodes with /spl lceil/P/2 /spl rceil/ converters at each node.

[1]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[2]  Ling Li,et al.  Dynamic wavelength routing using congestion and neighborhood information , 1999, TNET.

[3]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1997, Proceedings of INFOCOM '97.

[4]  Kumar N. Sivarajan,et al.  Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers , 2001, TNET.

[5]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

[6]  Ling Li,et al.  A new analytical model for multifiber WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Shay Kutten,et al.  Worst-case analysis of dynamic wavelength allocation in optical networks , 1999, TNET.

[8]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[9]  Sridhar Ramesh,et al.  Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls , 2002, IEEE J. Sel. Areas Commun..

[10]  George N. Rouskas,et al.  A path decomposition approach for computing blocking probabilities in wavelength-routing networks , 2000, TNET.

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

[12]  Anthony S. Acampora,et al.  Benefits of Wavelength Translation in All-Optical Clear-Channel Networks , 1996, IEEE J. Sel. Areas Commun..

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

[14]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

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

[16]  P. Humblet,et al.  Models of blocking probability in all-optical networks with and without wavelength changers , 1995, Proceedings of INFOCOM'95.

[17]  Eytan Modiano,et al.  An On-Line Routing and Wavelength Assignment Algorithm for Dynamic Traffic in a WDM Bidirectional Ring , 2002, JCIS.