Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Analysis on extended ant routing algorithms for network routing and management|
|Citation:||Journal of Supercomputing, 2003; 24(3):327-340|
|Publisher:||Kluwer Academic Publ|
|John Sum, Hong Shen, G. Young, Jie Wu and Chi-Sing Leung|
|Abstract:||Advances in mobile agent research have brought in a new method for network routing, ant routing. Recently, we have derived some preliminary results regarding the agent population growth property and the jumping behavior for an ant routing algorithm. The focus was on the expected number of agents in a node. In practice, the number of agents propagating on each network channel is also critical as the network channel bandwidth is limited. In this paper, we first propose two extended ant routing algorithms, and then provide an in-depth analysis on the population growth behavior of the propagating agents for these algorithms, both at nodes (hosts) and on edges (channels) of the network.|
|Keywords:||Internet; mobile agents; routing algorithms|
|Rights:||© 2003 Kluwer Academic Publishers|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.