An optimal moving policy for a mobile agent in distributed networks

Authors:
Atsushi Inoie;Michihiro Ishizaka
Affiliations:
Kanagawa Institute of Technology, Kanagawa, Japan;Kanagawa Institute of Technology, Kanagawa, Japan
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 7
Cited 0

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Understanding Code Mobility

IEEE Transactions on Software Engineering
Seven good reasons for mobile agents

Communications of the ACM
Programming and Deploying Java Mobile Agents Aglets

Programming and Deploying Java Mobile Agents Aglets
Performance Evaluation of Mobile Agents for E-commerce Applications

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Exploiting Code Mobility in Decentralized and Flexible Network Management

MA '97 Proceedings of the First International Workshop on Mobile Agents
Mobile agents in distributed network management

Communications of the ACM - A game experience in every application

Quantified Score

Hi-index	0.00

Visualization

Abstract

An optimal mobile agent moving policy for a mobile agent network where a single mobile agent moves and collects management information, is studied. The network has one management station that maintains many network elements each of which generates the management information (e.g., the updated state of the element). We formulate this network model as a semi-Markov decision process (SMDP) and compute an optimal policy with a policy iteration algorithm. It is shown that an optimal mobile agent moving policy achieved by the policy iteration algorithm has a cost reduction effect for the network in comparison to a heuristic policy.