Practical adaptive routing schemes considering load balancing in WDM networks

  • Authors:
  • Younghwan Yoo;Sanghyun Ahn;Chong Sang Kim

  • Affiliations:
  • School of Computer Sci. & Eng., Seoul National University, Seoul, Korea;School of Computer Science, University of Seoul, Seoul, Korea;School of Computer Sci. & Eng., Seoul National University, Seoul, Korea

  • Venue:
  • HSI'03 Proceedings of the 2nd international conference on Human.society@internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.