Abstract
Ant colony optimization (Aco) has been proposed as a promising tool for adaptive routing in telecommunications networks. The algorithm is applied here to a simulation of a satellite telecommunications network with 72Leo nodes and 121 earth stations. Three variants ofAco are tested in order to assess the relative importance of the different components of the algorithm. The bestAco variant consistently gives performance superior to that obtained with a standard link state algorithm (Spf), under a variety of traffic conditions, and at negligible cost in terms of routing bandwidth.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
