Theoretical analysis on a traffic-based routing algorithm of mobile agents
Files
(Published version)
Date
2005
Authors
Qu, W.
Shen, H.
Jin, Y.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IEEE/WIC/ACM International Conference on Intelligent Agent Technology : proceedings : Compiègne University of Technology, France, September 19-22, 2005 / [edited by Andrzej Skowron ... et al.] ; sponsorsed by IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), pp. 520-526
Statement of Responsibility
Wenyu Qu, Hong Shen, Yingwei Jin
Conference Name
IEEE/WIC/ACM International Conference on Intelligent Agent Technology (2005 : Compiègne, France)
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.
School/Discipline
Dissertation Note
Provenance
Description
© 2005 IEEE.