Deploying Distributed State Information in Mobile Agent Systems

The flexibility offered by mobile agents is quite noticeable in distributed computing environments. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at an additional threats since agent systems are prone to failures originating from bad communication, security attacks, agent server crashes, system resources unavailability, network congestion, or even deadlock situations. In such events, mobile agents either get lost or damaged (partially or totally) during execution. In this paper, we propose parallel checkpointing approach based on the use of antecedence graphs for providing fault tolerance in mobile agent systems. During normal computation message transmission, the dependency information among mobile agents is recorded in the form of antecedence graphs by participating mobile agents of mobile agent group. When a checkpointing procedure begins, the initiator concurrently informs relevant mobile agents, which minimizes the identifying time. The proposed scheme utilizes the checkpointed information for fault tolerance which is stored in form of antecedence graphs. In case of failures, using checkpointed information, the antecedence graphs and message logs are regenerated for recovery and then normal operation continued. Moreover, compared with the existing schemes, our algorithm involves the minimum number of mobile agents during the identifying and checkpoiting procedure, which leads to the improvement of the system performance. In addition, the proposed algorithm is a domino-free checkpointing algorithm, which is especially desirable for mobile agent systems. Quantitative analysis and experimental simulation show that our algorithm outperforms other coordinated checkpointing schemes in terms of the identifying time and the number of blocked mobile agents and then can provide a better system performance. The main contribution of the proposed checkpointing scheme is the enhancement of graph-based approach in terms of considerable improvement by reducing message overhead, execution, and recovery times.

The system of mobile agents described here is like a beehive: agents (like bees) swarm off to do their duties, wandering to different places, and finally returning to their origin. The main insight of this work is how to specifically separate the different functionalities in such a system of mobile agents, and in particular a description of the cooperative processes is given. In fact, modeling the cooperation of agents is at the heart of this proposal. This paper proposes the specification of a mobile system in an object oriented specification language, thus permitting to model a system without binding it to a particular language, an implementation platform or a programming model. The specification is an architectural description of the system, focusing on its components, their functionalities and connectors. It helps making assumptions and hence properties of the system explicit, it will be used as a blueprint for the implementation of a framework which supports mobile agents.

Over the last couple of years we have been working on the development of mobile agents systems and their application to the areas of telecommunications and network management. This work has produced positive results: a competitive mobile agent platform was built, the run-time benefits of mobile agents were proved, and our industrial partners have developed practical applications that are being integrated into commercial products. However, despite the positive results, we feel that mobile agent technology is still not ready to enter the path of mainstream software development. In our perspective, one of the main reasons for this situation arises from the traditional approach to mobile agent technology. This approach, based on the familiar concept of the mobile-agent distributed platform as an extension of the operating system, focuses too much on the mobile agents and associated issues (mobility, agent lifecycle, security, coordination, etc.) and provides poor support for the development of applications where mobile agents are just one of several available technologies. Learning from past experience, we are now working on a new approach where the focus is brought back to the applications and mobile agents become just one the tools available to develop distributed systems. This provides a much lighter framework for application-based mobile agent systems. This paper presents the lessons learned from our previous project and discusses the new concept we are developing: application-centric mobile agent systems.

The security problem of mobile agent is important for applications using mobile agent technology. In this paper, we analyzed the security problems of mobile agent system exposed in opening environment and proposed a method to improve the authentication and credentials management in mobile agent environment. In our design, the trusted computing platform is used as the basic platform to running mobile agent systems, and the trusted platform module will used to help the authentication and credentials management. We also gave a model system for building trusted mobile agent system. In this system, the security of mobile agent is improved by using trusted computing platform which is linked with upper layer applications through the trusted software stack. Then, trusted services for mobile agent, including authentication, credential management and key storage, are supported.

Mobile agents are a new paradigm for distributed computing that is especially well suited for mobile computing over global wireless networks. This paper describes the approach taken in the ACTS On TheMove project to integrate a mobile agent system into the Mobile Application Support Environment (MASE), a middleware for mobile computing. In this project, an existing mobile agent system was adapted for the requirements of mobile computing. We present the changes that had to be made to the agent system to adapt it to the wireless communication. We also present some of the application areas where a mobile agent system is suitable for mobile communication. We describe an agent based pre-fetcher application where an agent operaes disconnected from the user on the fixed network and prepares web pages for the anticipated next connection of the user using the Quality-of-Service trading functions available in MASE.

Mobile agent-based computing is an attractive model for distributed computation environment. A mobile agent has the unique ability to transfer from one host to another in the network. In multi-hop mobile agent system, the agent brings the produced offer from various remote hosts to its owner only after completing the visit to many remote hosts. Carrying the offer gathered from the preceding hosts to the succeeding hosts requires much security mechanisms to protect the offer from the malicious hosts, and also the owner has to wait for the arrival of offer until the mobile agent finishes its travel. To overcome this, an alternative model has been developed called matrix hop mobile agent (MHMA) system in which the mobile agent sends the offer collected from the host to the owner before it migrates to the next host. This research work proposes a new fault tolerant mechanism for MHMA to identify the malicious host and to protect the agent from various attacks, including colluded attack. In this proposed model, the owner calculates the expected waiting time for the arrival of offer from each remote host, using the transmission cost. If the offer does not reach the owner within the waiting time, the owner identifies the agent’s failure and retransmits the agent directly to the remote host. The implementation of this model enhances the performance of the MMHA in all kinds of e-service applications.

Mobile agents are no longer a theoretical issue since different architectures for their realization have been proposed. With the increasing market of electronic commerce it becomes an interesting aspect to use autonomous mobile agents for electronic business transactions. Being involved in money transactions, supplementary security features for mobile agent systems have to be ensured. In this paper we present an architecture for a mobile agent system which guarantees security for the host as well as security for the agent. This architecture additionally offers fault tolerance for the whole agent system at a high level. To handle these issues for mobile agents we use various encryption mechanisms and we apply a novel method for mobile agent systems by using distributed transactions processing based on the OMG Object Transaction Service in our architecture. With this security architecture an agent will be enabled to do money transactions.

A mobile agent is a software program which migrates from a site to another site to perform tasks assigned by a user. For the mobile agent system to support agents in various application areas, the issues regarding reliable agent execution, as well as compatibility between two different agent systems or secure agent migration, have been considered. Some of the proposed schemes are either replicating the agents (Hamidi & Mohammadi, 2005) or check-pointing the agents (Park, Byun, Kim, & Yeom, 2002; Pleisch & Schiper, 2001;) For a single agent environment without considering inter-agent communication, the performance of the replication scheme and the check-pointing scheme is compared in Park et al. (2002) and Silva, Batista, and Silva (2000). In the area of mobile agents, only few works can be found relating to fault tolerance. Most of them refer to special agent systems or cover only some special aspects relating to mobile agents, such as the communication subsystem. Nevertheless, most people working with mobile agents consider fault tolerance to be an important issue (Izatt, Chan, & Brecht, 1999; Shiraishi, Enokido, & Takzawa, 2003). Mobile agents are becoming a major trend for designing distributed systems and applications in the last few years and foreseeable future. It can bring benefits such as reduced network load and overcoming of network latency (Chan, Won, & Lyu, 1993). Nevertheless, security is one of the limiting factors of the development of these systems. The main unsolved security problem lies in the possible existence of malicious hosts that can manipulate the execution and data of agents (Defago, Schiper, & Sergent, 1998). Most distributed applications we see today are deploying the client/server paradigm. There are certain problems with the client/server paradigm, such as the requirement of a high network bandwidth, and continuous user-computer interactivity. In view of the deficiencies of the client/server paradigm, the mobile code paradigm has been developed as an alternative approach for distributed application design. In the client/server paradigm, programs cannot move across different machines and must run on the machines they reside on. The mobile code paradigm, on the other hand, allows programs to be transferred among and executed on different computers. By allowing code to move between hosts, programs can interact on the same computer instead of over the network. Therefore, communication cost can be reduced. Besides, mobile agent (Fischer, Lynch, & Paterson, 1983) programs can be designed to work on behalf of users autonomously. This autonomy allows users to delegate their tasks to the mobile agents, and not to stay continuously in front of the computer terminal. The promises of the mobile code paradigm bring about active research in its realization. Most researchers, however, agree that security concerns are a hurdle (Greenberg, Byington, & Harper, 1998). In this article, we investigate these concerns. First, we review some of the foundation materials of the mobile code paradigm. We elaborate Ghezzi and Vigna’s classification of mobile code paradigms (Ghezzi & Vigna, 1997), which is a collection of the remote evaluation, code on demand, and mobile agent approaches. In the next section, we address the current status of mobile code security. The following section presents the model for fault-tolerant mobile agent. In the next section, security issues of the mobile agent are discussed, and we discuss security modeling and evaluation for the mobile agent in the section after. In the following section, simulation results and influence of the size of agent are discussed. We then conclude the article.

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.

Mobile agents can provide many benefits to the development of distributed applications. But the mobile agent system will face some security threat since it will run in an opening network environment. In this paper, we analyzed the security threats in mobile agent system and provided a method to build the trusted connect between entities in mobile agent environment. This method uses the trusted platform module in trusted computing platform as the trusted base. When a mobile agent wants to migrate to another platform, it should use a trusted connect between the source host and the goal host. The agent and agent platform can trust with each other. This method will be helpful to build a trusted computing environment for the mobile agent system.

Detecting and resolving deadlocks in mobile agent systems

Mobile agents are autonomous objects that can migrate from node to node of a computer network. Mobile agent technology has been proposed for various application areas, including electronic commerce, systems management and active messaging. Many of these applications - especially those for electronic commerce - require agents to be performed 'exactly once', independent of communication and node failures. In other words, once a mobile agent has been launched, it must never be lost before its execution is finished. Moreover, each 'portion' of the agent performed at the visited nodes is performed exactly once. Due to the autonomy of mobile agents, there is no 'natural' instance that monitors the progress of an agent's execution. As a result of that agents may be blocked due to node crashes or network partitioning even if there are other nodes available that could continue processing. In this paper, we will describe a protocol that ensures the exactly once property of agents and additionally reduces the blocking probability of agents by introducing so-called observer nodes for monitoring the progress of agents. This protocol is based on conventional transactional technology, such as defined by X/Open DTP or CORBA OTS. It is implemented in the Mole, a mobile agent system developed at Stuttgart University.

So far, agent research can be broadly categorized into two areas: intelligent agents and mobile agents. Intelligent agent research has grown from a background of AI, humancomputer interaction, and autonomous systems, while mobile agents research stems from the areas of distributed computing and networked systems. Intelligent agents research addresses intelligent control, planning, domain modeling, user modeling, perception, interagent cooperation, and adaptivity. Intelligent agents can take on many different roles, ranging from representing a human user’s interests to actively collaborating with users and each other. Intelligent agents are being designed to tackle nearly every tedious, non-creative activity that people perform (e.g., Web searches), as well as many more abstract functions (e.g., entertainment). Major issues in intelligent agents research include knowledge representation and communication, architectures for intelligent autonomy, mixed-initiative behavior, collaboration techniques, and learning. Mobile agents address physical communication, agent mobility, tracking and locating mobile agents, security and reliability of agents, etc. Mobile agents are suited for optimizing communication ‐ moving the action towards the source of data ‐ and thereby avoiding the need for huge data transfers. This is beneficial in data-intensive applications such as data mining. Mobility can also improve reliability in certain cases. In the field of electronic commerce, mobile agents naturally reflect the characteristics of buyer and the seller, effectively playing the roles of traveling salesman or broker. They can also be applied for easier software customization, software distribution, and to represent disconnected users. The main issues are in security, providing the infrastructure on the Web (naming, locating, controlling, and messaging) and improving survivability. The biggest challenge for all new agent technology is developing successful applications. For this minitrack, we selected two characteristics of agents that can span the diverging areas of intelligent and mobile agents: mobility and communication. The accepted papers reflect the research issues described in this summary. The minitrack is organized in three sessions. The first session explores the coordination of multiple intelligent agents using dramatically different communication schemes. Andersson and Ygge present an efficient market-based approach to managing very large scale groups of agents engaged in coordination via producer/ consumer transactions. Their CoTree algorithm allows largescale markets to operate efficiently with sparse communication, rapid updates as agent preferences change, and minimal data caching requirements on massively distributed systems. In contrast, Nelson, Penner, and Soken discuss the Interaction Society model of coordination, in which relatively small-scale groups of knowledge-intensive agents collaborate using complex communication about discrete tasking and information requirements. Their model for inter-agent communication and interactions with human users is being applied to build a multi-agent advising system for coordinating military Search and Rescue operations. Finally, Barbuceanu discusses the role of obligations and interdictions in the context of coarse-grain agent interactions. By explicitly capturing social obligations and the costs associated with violating those constraints, he shows how rational agents can achieve coordinated behavior without necessarily sharing goals. The second session addresses Java-based mobile agent systems. The paper by Covaci, Busse and Zhang, describes how a mobile agent system can be used for network management. Their framework is based on existing solutions such as TMN, and can be extended to SNMP.

Despite the fact that the origin of software agent systems has been rooted in autonomous artificial intelligence and cognitive psychology, their implementations are still based on conventional imperative computing techniques rather than autonomous computational intelligence. This paper presents a cognitive informatics perspective on autonomous agent systems (AAS’s). A hierarchical reference model of AAS’s is developed, which reveals that an autonomous agent possesses intelligent behaviors at three layers known as those of imperative, autonomic, and autonomous from the bottom up. The theoretical framework of AAS’s is described from the facets of cognitive informatics, computational intelligence, and denotational mathematics. According to Wang’s abstract intelligence theory, an autonomous software agent is supposed to be called as an intelligent-ware, shortly, an intelware, parallel to hardware and software in computing, information science, and artificial intelligence.

Mobile agents are autonomous and dynamic entities that can migrate among various nodes in the network. Java`s Jini framework facilitates mobile agent system development, providing hey features for distributed network programming. However, due to the security weakness, Jinil.0 service has a fundamental limitation on developing mobile agent systems which support secure remote communications. In this paper, we describe a Jini2.0-based secure mobile agent system named SecureJMoblet. On the top of Jini2.0, the system provides basic functionalities of a mobile agent system such as creation, transfer and control. In addition, with the SeureJS developed for secure JavaSpace service, SecureJMoblet supports a secure object repository and a reliable communication among mobile agents.