COMPARISON OF DIJKSTRA ALGORITHM WITH ANT COLONY OPTIMIZATION ALGORITHM USING RANDOM TOPOLOGY IN ALL-OPTICAL NETWORK USING RWA

Abstract

All-optical networks are gaining higher and higher importance in the transmission of multimedia data. Routing and wavelength assignment is the critical issue that arises in optical networks across big infrastructures in corporate software industry. The randomness of data signals using optical networks can address specific issues to wit, blocking probability, one among the QoS parameters (which is to be reduced). Optimization techniques can be invariably applied in this scenario wherein Ant Colony Optimization (ACO) is one such method that proved very effective in solving the blocking probability issue. Routing and wavelength assignment (RWA) provides an important solution in optical networks. In this paper a comparison has been done between the results of ACO and traditional Dijkstra algorithm, in which ACO algorithm shows better performance in terms of blocking probability. Simulation results show that ACO algorithm has very low blocking probability compared with the traditional Dijkstra algorithm when the traffic load is small.