2003 | OriginalPaper | Chapter
Practical Adaptive Routing Schemes Considering Load Balancing in WDM Networks
Authors : Younghwan Yoo, Sanghyun Ahn, Chong Sang Kim
Published in: Web and Communication Technologies and Internet-Related Social Issues — HSI 2003
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The three adaptive algorithms proposed in this paper address the routing and the wavelength assignment problems at once. They search for a route with the near-maximum number of available wavelengths between two nodes, resulting in the improvement of load balancing. Simulation results show that our algorithms improve blocking probability by up to 50%, compared to the least-loaded and the k-fixed routing algorithms. In addition, the path length of our algorithms is almost equal to that of the others according to the simulation and analysis.