A Novel Adaptive Routing Algorithm Based on the Load Balancing Strategy under Dynamic Traffic in WDM Networks

摘要

In order to reducing the blocking probability, many routing and wavelength assignment algorithms are introduced to this problem. It is crucial for the optical networks to utilize the network resources properly. In this paper, a novel adaptive algorithm is presented for routing in WDM networks. The objective of the algorithm is not only considering the distance vector as the routing cost, but also adopting the load balancing strategy. The simulations for the NSFNET show that the blocking probability and the degree of load balance are both improved with our algorithm compared with some formers.