An application of two different algorithms on the same network
2006 International Symposium on Communications and Information Technologies, ISCIT, Bangkok, Tayland, 18 - 20 Ekim 2006, ss.1162-1166, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/iscit.2006.339963
- Basıldığı Şehir: Bangkok
- Basıldığı Ülke: Tayland
- Sayfa Sayıları: ss.1162-1166
- Anahtar Kelimeler: Ant colony system, Computer networks, Self cloning ant, Shortest path
- Maltepe Üniversitesi Adresli: Evet
Özet
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. © 2006 IEEE.