Reliability analysis of mobile agent-based systems

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.