Reliability Analysis Of Cooperating And Communicating Distributed Mobile Agents

Recently the concepts and technologies associated with Intelligent Agents have become popular and issues such as reliable analysis and design methodologies are increasingly evolved. Distributed Agents have received more attention, as they are used in accessing Distributed recourses in a network. In order to access the recourses efficiently a reliable Distributed Communication Network (DCN) is required. This paper aims at analyzing the reliability of DCN, which is formulated using Distributed Agents. Agents are autonomous entities and are called software robots and their interactions are cooperative. The Reliability of the DCN is a factor that may depend on the performance, availability, and strategy of Distributed Agent based system and it provides a failure free environment for communication. In this paper a Distributed Agent system is defined, which consists of multiple Agents, each of which accomplishes an independent task by taking a random walk, process the information at the chosen node and returns the result to the requestor. The Distributed Agents act as tokens, which travels over the network from node to node. It is necessary for the Agent to complete its walk successfully by a specified deadline t. The Agent needs a connected route during the period t to maintain mobility. This defines the concept of Distributed Agent tour or walk, which is used to estimate the Reliability of the Distributed Agents. Hence, the problem is reduced to the problem of successful completion of Agent's tour, based on the status of Distributed Communication Network. With such system, robustness of DCN is asserted & hence the increase in reliability.