Abstract
In this paper, an adaptive routing and wavelength assignment algorithm based on cost updating (CU-RWA) has been proposed to optimize route selection in optical networks. The classical shortest path algorithms, such as the Dijkstra algorithm, always cause high blocking probability and unbalanced load when making a routing decision. Consequently, the algorithm which is able to train the network and constantly update the link cost depending on the load status of link is designed to solve the problem in this paper. Simulation results obtained indicate that the proposed algorithm outperforms Dijkstra algorithm in load balancing and blocking probability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
