Wavelength assignment in all-optical star-ring

This paper studies wavelength assignments in a class of all-optical networks without wavelength converters topologized as star-ring: some sub-rings connected by a backbone ring. In the static model, we give an upper bound 5L/2 and a lower bound 9L/4 of the necessary wavelengths to accommodate any requests with load L. These become (3L/2)/spl lceil/log/sub 2/ (N+(/spl Sigma//sub i=1//sup n/)m/sub i/)/spl rceil/+max/sub 1/spl les/i/spl les/n/ (L/spl lceil/log/sub 2/ m/sub i//spl rceil/)+2L and 0.5L(/spl lceil/log/sub 2/ (N+max/sub 1/spl les/i/spl les/n/ (m/sub i/))/spl rceil/+1) respectively in the dynamic model, where N is the number of nodes in the backbone ring and m/sub i/ is the number of nodes in the ith sub-ring (1/spl les/i/spl les/n).

[1]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

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

[3]  John M. Senior,et al.  Developments in wavelength division multiple access networking , 1998 .

[4]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[5]  Rahul Simha,et al.  On the wavelength assignment problem in multifiber WDM star and ring networks , 2001, TNET.

[6]  Alexander Birman,et al.  Routing and wavelength assignment methods in single-hop all-optical networks with blocking , 1995, Proceedings of INFOCOM'95.

[7]  Luisa Gargano,et al.  Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems , 2000 .

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

[9]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[10]  Rahul Simha,et al.  On bounds for the wavelength assignment problem on optical ring networks , 1999, J. High Speed Networks.

[11]  Stefano Leonardi,et al.  On-Line Routing in All-Optical Networks , 1997, ICALP.

[13]  Rahul Simha,et al.  On the wavelength assignment problem in multifiber WDM star and ring networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Klaus Jansen Approximation Results for Wavelength Routing in Directed Trees , 2000 .

[15]  Maciej Slusarek Optimal On-Line Coloring of Circular Arc Graphs , 1995, RAIRO Theor. Informatics Appl..