Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Communications of the ACM
Seven good reasons for mobile agents
Communications of the ACM
Agent factory: generative migration of mobile agents in heterogeneous environments
Proceedings of the 2002 ACM symposium on Applied computing
An optimal location update and searching algorithm for tracking mobile agent
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Programming and Deploying Java Mobile Agents Aglets
Programming and Deploying Java Mobile Agents Aglets
Analysis on Extended Ant Routing Algorithms for Network Routing and Management
The Journal of Supercomputing
IEEE Internet Computing
ACM Transactions on Internet Technology (TOIT)
A Comparative Evaluation of Mobile Agent Performance for Network Management
ECBS '02 Proceedings of the 9th IEEE International Conference on Engineering of Computer-Based Systems
Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management
IEEE Transactions on Parallel and Distributed Systems
Dispatching Multiple Mobile Agents in Parallel for Visiting E-Shops
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
A novel fault-tolerant execution model by using of mobile agents
Journal of Network and Computer Applications
New analysis on mobile agents based network routing
Applied Soft Computing
Distribution of mobile agents in vulnerable networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
The probability of success of mobile agents when routing in faulty networks
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Statistical behaviors of mobile agents in network routing
The Journal of Supercomputing
Hi-index | 0.00 |
In this paper, we consider the problem of mobile agent based network routing. We analyze the probability of success (the probability that an agent can find the destination) and the population growth of mobile agents under an ant-routing algorithm. First, We give an estimation on the probability of success, P(d), than an agent can find the destination in d jumps as P(d) ≤ /1n(1-/1n)d (σ1-1/σ1)d-1, n is the number of nodes in the network, and σ1, σn, are the largest and smallest degrees of nodes in the network respectively. The probability of success that k agents can find the destination in d jumps is estimated as P*(d) ≤ 1 - (n-1/n+σ1-1)k, where k is the number of agents generated per request. Second, the distribution of mobile agents in the network is analyzed, p→(t) = (I + A + ... + At-1)km e→ when 0 d and p→ = (I + A + .... + Ad-1)kme→ when t d, where A is a matrix derived from the connectivity matrix. We further estimate that the number of agents running in the network is less than n2 σ1 km/n+σ1-1, and the populaUon of mobile agents running in each host, pj(t), satisfies: km + (1 -ξd-1)[1 - 1/n(1-ξ)](Dj - 1)km ≤ pj(t) ≤ km + (1 - ζd-1)[1 - 1/n(1-ζ)](Dj - 1)km, where ξ = ||A||1 = max1≤j≤n||aj||1, ζ = min1≤j≤n ||aj||1, aj is the jth column of matrix A, and Dj is the degree of the jth host.