Fault-tolerant Mobile Agent Research Articles

RETRACTED ARTICLE: A study on supervised machine learning algorithm to improvise intrusion detection systems for mobile ad hoc networks

The security inside the network correspondence is a noteworthy concern. Being the way that information is considered as the profitable asset of an association, giving security against the intruders is exceptionally fundamental. Intrusion Detection Systems tries to recognize security assaults of intruders by researching a few information records saw in forms on the network. In this paper, Intrusion Detection Classification of attacks is done by NNIDS, TSVID and DF-IDS. The proposed algorithms are trained and tested using KDD Cup 1999 dataset . This paper has presented a novel method for an adaptive fault tolerant mobile agent based intrusion detection system. At first the classification of attacks is done by TSVID Classification algorithm. The TSVID makes use of RBF kernel and iterative learning mechanism. Next the classification is done by using NNIDS that makes use of neural network based approach. Advantages of NNIDS method is that it can successfully handle both qualitative, quantitative data, and it handles multiple criteria and easier to understand. Then, finally, the classification is done by using iterative learning mechanism and DF-IDS gives successful results of classification. The performances of the proposed algorithm are evaluated using the classification metrics such as detection rate and accuracy. Comparison graphs of attack detection rate and false-alarm rate reveals that the obtained results of anticipated methods achieve greater detection rate and less computational time for the classification of attacks and protocols. The proposed study is a classification based approach for combining several networks in intrusion detection systems. In evaluation of this model, it has been demonstrated that there is a significant improvement in real time performance without sacrificing efficiency.

Reliable mobile agents with transactional behaviour

The mobile agent systems are well suited for certain types of real world applications such as e-commerce and distributed transactions. However, this technology is not being used by many applications. This is due to the lack of infrastructures and methodologies that address fault tolerance and transactions. The basic requirements for fault-tolerant transactional mobile agent are: 1) non-blocking (i.e., a single failure does not prevent progress of the mobile agent execution); 2) exactly-once (i.e., multiple executions of the agent are prevented); 3) the execution atomicity (i.e., all tasks are committed or none at all). In this paper, we propose a mechanism for providing fault-tolerance capability based on the mobile agent replication and the backward process. The failure detection is not perfect. The replication may result in multiple executions of the agent. So, we defined a technique that detects multiple executions and allows only one agent to go on while the others are stopped. To ensure the execution atomicity of the distributed transaction we used a commit at destination approach.

Evaluation and Checkpointing of Fault Tolerant Mobile Agents Execution in Distributed Systems

The reliable execution of a mobile agent is a very important design issue to build a mobile agent system and many fault-tolerant schemes have been proposed. Hence, in this paper, we present evaluation of the performance of the fault-tolerant schemes for the mobile agent environment. Our evaluation focuses on the checkpointing schemes and deals with the cooperating agents. We derive the FANTOMAS (Fault-Tolerant approach for Mobile Agents) design which offers a user transparent fault tolerance that can be activated on request, according to the needs of the task. A theoretical analysis examines the advantages and drawbacks of Fault-Tolerant approach for Mobile Agents . The use of mobile agent, however, is critical and requires reliability in regard to mobile agent failures that may lead to bad response time and hence the availability of the system may lost. In this study, a fault tolerance technology is proposed in order that the system autonomously detects and recovers the fault of the mobile agent due to a failure in a transmission link. Also discuss how transactional agent with types of commitment constraints can commit. Furthermore this paper proposes a solution for effective agent deployment using dynamic agent domains.

A Fault Tolerant Mobile Agent Information Retrieval System

Problem statement: Most of the information retrieval systems used only client-server architectures. The client-server model though powerful, had some limitations. In mobile computing environment which has both wired network and wireless networks with limited communication capabilities, the performance of the system was very low. Approach: Mobile agents are considered a suitable technology to develop applications such as information retrieval system for mobile computing environment. Mobile agents are autonomous and dynamic entities that can migrate between various nodes in the network. They offer many advantages over traditional design methodologies like: reduction in network load, overcoming network latency and disconnected operations. Since the mobile agents do not need continuous communication with the mobile host, they are not affected by the sudden disconnection of wireless network and the situation of turning mobile host off for power saving. In order to get the complete benefit of mobile agent system, the system must be fault tolerant. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the agent. Results: Our system in mobile computing environment ensured that the agent arrived at its destination with result and performance of the system improved by the way of reduction in the response time. And also, the system allowed sending more requests by the way of creating many mobile agents without affecting the performance. Conclusion: Our research compared the performance of client-server architecture and fault tolerant mobile agent information retrieval system and proved that our system solved the limitations faced by the client server architecture. The system can also be extended to adhoc networks.

Evaluation of Fault Tolerant Mobile Agents in Distributed Systems

The reliable execution of a mobile agent is a very important design issue to build a mobile agent system and many fault-tolerant schemes have been proposed. Hence, in this article, we present an evaluation of the per­formance of the fault-tolerant schemes for the mobile agent environment. Our evaluation focuses on the checkpointing schemes and deals with the cooperating agents. We derive the Fault-Tolerant approach for Mobile Agents (FANTOMAS) design which offers a user transparent fault tol­erance that can be activated on request, according to the needs of the task. We also discuss how a transactional agent with different types of commitment constraints can commit. Furthermore, this article proposes a solution for effective agent deployment using dynamic agent domains.

Efficient algorithms for fault tolerant mobile agent execution

Redundancy is necessary for fault tolerance, but the overhead introduced by redundancy may degrade system' performance. In this paper, we propose efficient replication-based algorithms for fault-tolerant mobile agent execution, which enable parallel processing in the agent execution to reduce the overhead caused by redundancy. We also investigate failure detection mechanisms and identify the problems of the heartbeat style failure detection approach and modify it for use in our proposed algorithms. Performance evaluation has been performed to compare the proposed algorithms with the existing algorithm. Both analytic and simulation results show that our new algorithms can significantly improve the system performance.

GCS-MA: A group communication system for mobile agents

Reliable messaging is a key component necessary for mobile agent systems. Current researches focus on reliable one-to-one message delivery to mobile agents. But how to implement a group communication system for mobile agents remains an open issue, which is a powerful block that facilitates the development of fault-tolerant mobile agent systems. In this paper, we propose a group communication system for mobile agents (GCS-MA), which includes totally ordered multicast and membership management functions. We divide a group of mobile agents into several agent clusters, and each agent cluster consists of all mobile agents residing in the same sub-network and is managed by a special module, named coordinator. Then, all coordinators form a ring-based overlay for interchanging messages between clusters. We present a token-based algorithm, an intra-cluster messaging algorithm and an inter-cluster migration algorithm to achieve atomicity and total ordering properties of multicast messages, by building a membership protocol on top of the clustering and failure detection mechanisms. Performance issues of the proposed system have been analysed through simulations. We also describe the application of the proposed system in the context of the service cooperation middleware (SCM) project.

Modeling Fault Tolerant and Secure Mobile Agent Execution in Distributed Systems

The reliable execution of mobile agents is a very important design issue in building mobile agent systems and many fault-tolerant schemes have been proposed so far. Security is a major problem of mobile agent systems, especially when monetary transactions are concerned. Security for the partners involved is handled by encryption methods based on a public key authentication mechanism and by secret key encryption of the communication. To achieve fault tolerance for the agent system, especially for the agent transfer to a new host, we use distributed transaction processing. We propose a fault-tolerant approach for mobile agents design which offers a user transparent fault tolerance that can be activated on request, according to the needs of the task. We also discuss how transactional agents with different types of commitment constraints can commit transactions. Furthermore, we present a solution for effective agent deployment using dynamic agent domains

Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view

Over the past years, mobile agent technology has attracted considerable attention, and a significant body of literature has been published. To further develop mobile agent technology, reliability mechanisms such as fault tolerance and transaction support are required. This article aims at structuring the field of fault-tolerant and transactional mobile agent execution and thus at guiding the reader to understand the basic strengths and weaknesses of existing approaches. It starts with a discussion on providing fault tolerance in a system in which processes simply fail. For this purpose, we first identify two basic requirements for fault-tolerant mobile agent execution: (1) non-blocking (i.e., a single failure does not prevent progress of the mobile agent execution) and (2) exactly-once (i.e., multiple executions of the agent are prevented). This leads us to introduce the notion of a <i>local transaction</i> as the basic building block for fault-tolerant mobile agent execution and to classify existing approaches according to when and by whom the local transactions are committed. In a second part, we show that transactional mobile agent execution additionally ensures execution atomicity and present a survey of existing approaches. In the last part of the survey, we extend the notion of fault tolerance to arbitrary Byzantine failures and security-related issues of the mobile agent execution.

인터넷 응용을 위한 고장 감내 이동 에이전트 프레임워크와 레플리케이션 연구

본 논문에서는 인터넷 환경에서 분산 이동 에이전트의 신뢰성에 관련된 이슈를 논한다. 인터넷 응용을 위해 이동 에이전트들에 고장-감내하도록 만든 구조 프레임워크를 제안한다. 에이전트 데이터를 복제하는 레플리케이션 기법은 인터넷을 통한 분산 시스템에서 고장 감내를 획득하기 위해 매우 중요하다. 본 연구의 초점은 제안된 고장-감내 이동 에이전트 프레임워크에 대한 레플리케이션 컴포넌트 부분이다. 레플리케이션 차수, 능동형과 수동형 레플리케이션 전략, 레플리케이션 규모에 따른 효과에 대해 시뮬레이션 연구를 통해 얻은 성능 분석 결과를 설명한다. This paper addresses the issue involved in dependability of distributed mobile agents in the Internet environment. We propose an architectural framework for the Internet applications making mobile agents into fault-tolerant. The replication of agents and data is of great importance to achieve fault tolerance in distributed systems over the Internet. This research focuses on the replication component for the proposed fault-tolerant mobile agent framework. We present and analyze the performance results obtained when doing simulation study on the effects of the degree of replication, the active and passive replication strategies, and the replication scale.

Fault-tolerant mobile agent execution

Mobile agents have attracted considerable interest in recent years. In the context of mobile agents, fault tolerance is crucial to enable the integration of mobile agent technology into today's business applications. This article identifies two important properties for fault-tolerant mobile agent execution: nonblocking and exactly-once. Nonblocking ensures that the agent execution can proceed despite a single failure of the agent or the machine, for instance. Replication is the generally adopted mechanism to prevent blocking, but may lead to multiple executions of the agent (i.e., a violation of the exactly-once property), which is undesirable with operations that have side effects. Hence, we propose that fault-tolerant mobile agent execution be modeled as a sequence of agreement problems. Our approach is nonblocking and ensures exactly-once execution. FATOMAS, our prototype fault-tolerant mobile agent system, implements our approach. Its performance evaluation illustrates the overhead of the replication mechanisms.