Title :
Competitive performance analysis of two evolutionary algorithms for routing optimization in graded network
Author :
Sooda, K. ; Gopalakrishnan Nair, T.R.
Author_Institution :
Dept. of CSE, Nitte Meenakshi Inst. of Technol., Bangalore, India
Abstract :
In this paper we compare the two intelligent route generation system and its performance capability in graded networks using Artificial Bee Colony (ABC) algorithm and Genetic Algorithm (GA). Both ABC and GA have found its importance in optimization technique for determining optimal path while routing operations in the network. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the links and determines better quality paths over GA. Here the nodes participating in the routing are evaluated for their QoS metric. The nodes which satisfy the minimum threshold value of the metric are chosen and enabled to participate in routing. A quadrant is synthesized on the source as the centre and depending on which quadrant the destination node belongs to, a search for optimal path is performed. The simulation results show that ABC speeds up local minimum search convergence by around 60% as compared to GA with respect to traffic intensity, and opens the possibility for cognitive routing in future intelligent networks.
Keywords :
genetic algorithms; search problems; telecommunication network routing; ABC algorithm; GA; QoS metric; artificial bee colony algorithm; cognitive routing; destination node; evolutionary algorithms; genetic algorithm; graded network; intelligent networks; intelligent route generation system; local minimum search convergence; optimization technique; routing optimization; Availability; Bandwidth; Delays; Genetic algorithms; Mathematical model; Optimization; Routing; ABC; Agent; Evolutionary Algorithm; GA; Graded Network; Optimal path;
Conference_Titel :
Advance Computing Conference (IACC), 2013 IEEE 3rd International
Conference_Location :
Ghaziabad
Print_ISBN :
978-1-4673-4527-9
DOI :
10.1109/IAdCC.2013.6514306