Analysis on extended ant routing algorithms for network routing and management
Date
2003
Authors
Sum, J.
Shen, H.
Young, G.
Wu, J.
Leung, C.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Journal of Supercomputing, 2003; 24(3):327-340
Statement of Responsibility
John Sum, Hong Shen, G. Young, Jie Wu and Chi-Sing Leung
Conference Name
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2003 Kluwer Academic Publishers