Analysis on Extended Ant Routing Algorithms for Network Routing and Management

  • Authors:

  • John Sum;Hong Shen;G. Young;Jie Wu;Chi-Sing Leung

  • Affiliations:

  • Department of Computing, Hong Kong Polytechnic University, Hung Hom, KLN, Hong Kong cspfsum@comp.polyu.edu.hk;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa 923-1292, Japan shen@jaist.ac.jp;Computer Science Department, Cal Poly Pomona, Pomona, CA 91768, USA;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, Florida, 334332, USA jie@cse.fau.edu;Department of Electronic Engineering, City University of Hong Kong, Kowloon Tong, KLN, Hong Kong eeleungc@cityu.edu.hk

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.