Distributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing (2006)
| Venue: | in in Proceedings of ICAI 2006, Las Vegas |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Mcbride06distributedbiobjective,
author = {Benjamin Mcbride},
title = {Distributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing},
booktitle = {in in Proceedings of ICAI 2006, Las Vegas},
year = {2006}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract — In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. The proposed ant colony algorithm was applied to a randomly generated 100-node network with an average node degree of 10.2. The results show that the algorithm quickly converges to the shortest path between nodes while converging on a low cost overlay routing network topology, despite changing traffic demands. I.
