Maximum Network Flow Aware Multi-lightpath Survivable Routing in WDM Networks

In this paper, a survivable routing and wavelength assignment strategy using flow network concepts of network graph theory has been proposed. The proposed approach determines a route and the wavelength simultaneously for incoming lighpath connection traffics. Generally, all algorithms of routing and wavelength assignment problem solve the route selection and channel assignments problem separately. In the proposed approach, flow network represents the wavelength resources in such a way to solve the survivable routing and wavelength assignment problem for WDM networks efficiently. This strategy provides all the possible wavelength continuous flow paths to maximize the lightpaths between pair of source and destination node of the requests. It chooses a suitable lightpath from the available multiple link-disjoint lighpaths to transmit the data for an improved network performance. Simulation results taken over different network topologies confirm that the maximum network flow-based lightpath routing for survivable network has significant improvement of call acceptance ratio when compared against the conventional fixed alternate routing, shortest path and K-shortest path routing approach.