Abstract

Optical wavelength converters are expensive, and their technology is still evolving. Deploying full conversion capability in all nodes of a large optical network would be prohibitively costly. We present a new algorithm for the sparse placement of full wavelength converters based on the concept of a k-minimum dominating set (k-MDS) of graphs. The k-MDS algorithm is used to select the best set of nodes that will be equipped with full-conversion capability. To allow placement of full wavelength conversion at any arbitrary number of nodes, we introduce a HYBRID algorithm and compare its performance with the simulation-based k-BLK approach. We also extend the k-MDS algorithm to the case of limited conversion capability by using a scalable and cost-effective node-sharing switch design. Compared with full search algorithms previously proposed in the literature our algorithm has better blocking performance, has better time complexity, and avoids the local minimum problem. The performance benefit of our algorithms is demonstrated by simulation.

© 2003 Optical Society of America

New strategy for optimizing wavelength converter placement

Y. C. Foo, S. F. Chien, Andy L. Y. Low, C. F. Teo, and Youngseok Lee
Opt. Express 13(2) 545-551 (2005)

Optical Amplifiers Placement in WDM Mesh Networks for Optical Multicasting Service Support

Ashraf M. Hamad and Ahmed E. Kamal
J. Opt. Commun. Netw. 1(1) 85-102 (2009)

Minimizing Blocking Probability for the Multicast Routing and Wavelength Assignment Problem in WDM Networks: Exact Solutions and Heuristic Algorithms

Dinh Danh Le, Fen Zhou, and Miklós Molnár
J. Opt. Commun. Netw. 7(1) 36-48 (2015)

Algorithms for the design of WDM translucent optical networks

Yabin Ye, Teck Yoong Chai, Tee Hiang Cheng, and Chao Lu
Opt. Express 11(22) 2917-2926 (2003)

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca
J. Opt. Commun. Netw. 2(6) 305-318 (2010)