Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

In this paper we propose an algorithm for estimating the reliability of mobile agent systems, based on the conditions of the underlying computer network. We use the concept of restricted random walks in graph theory for generating a random static route strategy for mobile agents. The complexity of the mobile agent networks makes it hard to obtain the reliability of the system theoretically; instead we estimate it using the Monte Carlo approach. We assume that the system consists of a number of independent agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithm.

REFERENCES

• 1: Jin-Wook Baek , Jae-Heung Yeo , Heon-Young Yeom, Agent Chaining: An Approach to Dynamic Mobile Agent Planning, Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02), p.579, July 02-05, 2002
• 2: Chung-Chi Hsieh , Yi-Che Hsieh, Reliability and cost optimization in distributed computing systems, Computers and Operations Research, v.30 n.8, p.1103-1119, July 2003 [doi>10.1016/S0305-0548(02)00058-8]
• 3: Amy L. Murphy , Gian Pietro Picco, Reliable Communication for Highly Mobile Agents, Autonomous Agents and Multi-Agent Systems, v.5 n.1, p.81-100, March 2002 [doi>10.1023/A:1013449017690]
• 4: Katsuhiro Moizumi , George Cybenko, Mobile agent planning problems, 1999
• 5: Martin L. Shooman, Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design, John Wiley & Sons, Inc., New York, NY, 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS

Keywords:
mobile agents, monte carlo, reliability