Dynamic wavelength allocation in all-optical ring networks

We focus on wavelength allocation schemes for all-optical WDM ring networks. For an N node network we characterize the traffic by its load L/sub max/ (the maximum number of lightpaths that share a link) and do not assume knowledge of the arrival/departure processes. We prove that shortest path routing produces a routing which has at most twice the load of the optimal solution. We show that at least 0.5 L/sub max/ log/sub 2/N+L/sub max/ wavelengths are required by any algorithm in the worst case, and develop an algorithm which requires up to 3 L/sub max/ log/sub 2/N wavelengths. For the case when the load is high and blocking is necessary we present an improved algorithm.

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

[2]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

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

[4]  Nobuji Saito,et al.  Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..

[5]  I. Chlamtac,et al.  Lightnets: Topologies for High-speed Optical Networks , 1993 .

[6]  Kazuhiro Oda,et al.  100 channel optical FDM technology and its applications to optical FDM channel-based networks , 1993 .

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

[8]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

[9]  N. Raghavan.  Eecient Routing in All-optical Networks , 1994 .

[10]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area optical network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[12]  Computing Approximate Blocking Probabilities for a Class of All-Optical Networks , 1996, IEEE J. Sel. Areas Commun..

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

[14]  L. Wuttisittikulkij,et al.  Multiwavelength self-healing ring transparent networks , 1995, Proceedings of GLOBECOM '95.

[15]  Milena Mihail,et al.  Hierarchical design of WDM optical networks for ATM transport , 1995, Proceedings of GLOBECOM '95.

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

[17]  Piet Demeester,et al.  Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks , 1996, IEEE J. Sel. Areas Commun..

[18]  Galen H. Sasaki,et al.  Dynamic Channel Assignment For WDM Optical Networks With Little Or No Wavelength Conversion , 1996 .

[19]  Anthony AcamporaAbstract.  On the Beneets of Wavelength Translation in All-optical Clear-channel Networks , 1996 .

[20]  Rene L. Cruz,et al.  Special issue on optical networks , 1996 .

[21]  Ori Gerstel,et al.  Benefits of limited wavelength conversion in WDM ring networks , 1997, Proceedings of Optical Fiber Communication Conference (.

[22]  Gee-Kung Chang,et al.  Scalability of a novel wavelength assignment algorithm for WDM shared protection rings , 1998 .

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

[24]  A. Bonato,et al.  Graphs and Hypergraphs , 2021, Clustering.