International Journal of Computer Applications
In current WDM networks, it is possible to support hundreds of WDM channels on a single fiber. Therefore, the cost of the transmitters and the receivers, and hence the number of light paths, is becoming the main factor in determining the cost of a WDM network. Researchers tried to keep the number of light paths required to implement a topology as low as possible. This paper presents a restorable routing algorithm that reduces blocking probability and suggested a mathematical model and compares the proposed paper with the conventional algorithms such as first fit and best fit routing algorithm.