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.
Swipe to navigate through the chapters of this book
- Practical Adaptive Routing Schemes Considering Load Balancing in WDM Networks
Chong Sang Kim
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA