An Optimal Moving Policy for a Mobile Agent in Distributed Networks

A. Inoie and M. Ishizaka (Japan)


Mobile agent, semi-Markov decision process, simple net work management protocol, and simulation.


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 net work model as a semi-Markov decision process (SMDP) and compute an optimal policy with a policy iteration al gorithm. 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 heuris tic policy.

Important Links:

Go Back