Title :
An Application of Two Different Algorithms on the Same Network
Author :
Erdogan, Senol Zafer ; Esin, E.M.
Author_Institution :
Fac. of Eng., Maltepe Univ., Istanbul
fDate :
Oct. 18 2006-Sept. 20 2006
Abstract :
In this study, Dijkstra algorithm and self cloning ant colony approach are explained. Dijkstra is a well known algorithm to find the shortest path. Self cloning ant colony approach is a new method to find the optimal path between the pair of the nodes in an unknown net topology. Both methods are applied on the same network and the results and differences are shown
Keywords :
telecommunication network topology; Dijkstra algorithm; net topology; self cloning ant colony approach; Cloning; Computer networks; Costs; Delay; Electronic mail; H infinity control; Intelligent agent; Routing protocols; Telecommunication network topology; Telecommunication traffic; Ant Colony System; Computer Networks; Self Cloning Ant; Shortest Path;
Conference_Titel :
Communications and Information Technologies, 2006. ISCIT '06. International Symposium on
Conference_Location :
Bangkok
Print_ISBN :
0-7803-9741-X
Electronic_ISBN :
0-7803-9741-X
DOI :
10.1109/ISCIT.2006.339963
