Theoretical Analysis on A Traffic-Based Routing Algorithm of Mobile Agents

Authors:
Wenyu Qu;Hong Shen;Yingwei Jin
Affiliations:
Graduate School of Information Science Japan Advanced Institute of Science and Technology;Graduate School of Information Science Japan Advanced Institute of Science and Technology;Dalian University of Technology, No 2, Linggong Road, Ganjinzi District, Dalian, 116024, China
Venue:
IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Year:
2005

Citing 0
Cited 3

Itinerary determination of imprecise mobile agents with firm deadline

Web Intelligence and Agent Systems
A mobile agent-based statistic execution model for grid computing

GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
A mobile agent-based routing model for grid computing

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a mobile agent-based routing algorithm in which the traffic cost is considered. We define a traffic cost function for each link based on known traffic information and find the probability distribution that mobile agents may select a neighboring node and move to. We theoretically analyze the probability distribution and provide the optimal probability distribution that makes inference on the known traffic information and approximates to a unbiased distribution.