A trusted computing approach to building trusted connect between entities in mobile agents environment

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.

Detecting and resolving deadlocks in mobile agent systems

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 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.

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.

Mobile agent systems have unique properties and characteristics and represent a new application development paradigm. Existing solutions to distributed computing problems, such as deadlock avoidance algorithms, are not suited to environments where both clients and servers move freely through the network. This paper describes a distributed deadlock solution for use in mobile agent systems. The properties of this solution are locality of reference, topology independence, fault tolerance, asynchronous operation and freedom of movement. The presented technique, called the shadow agent solution proposes dedicated agents for deadlock initiation, detection and resolution. These agents are fully adapted to the properties of a mobile agent environment.

Although the mobile agent paradigm provides great potential advantages ever traditional approaches in distributed computing applications, there are still several issues to be addressed before the technology can be widely accepted. The performance of the communication protocol is one of the critical issues in mobile agent systems. A practical communication protocol for mobile agents must satisfy three basic requirements: location transparency, reliability and efficiency. Although many communication protocols have been proposed for mobile agent systems and most of them are location transparent, these protocols usually compromise some aspects of reliability and efficiency. In this research we develop a communication scheme for efficient location tracking of agents and reliable message delivery in mobile agent systems by using a proxy-based scheme. The location update and message delivery protocols are developed and shown to be reliable even when agents migrate during message delivery. A simulation model is developed to estimate the performance relative to a (nonproxy-based) home-server protocol. Sensitivity analysis is used to reveal the important circumstances (domain/agent dimensions and exogenous demand/movement characteristics) for efficient communication performance.

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.

Mobile agents' paradigm is increasingly being used on the global Internet, distributed systems and ambient intelligence environment. Indeed, they can provide many advantages to the development of dynamic applications. More recently, mobile agent paradigm is of the best prevalent alternatives bringing most of suitable characteristics of pervasive environments, where people are surrounded by intelligent interfaces merged in daily life objects. Yet, the success of dynamic environment based mobile agents and multi agent systems will depend on how secure it can be made. Certainly, their use poses many security threats, because they are exposed to different malicious hosts' and nodes attacks. The aim of this paper is to propose CAPMA, Clone agent to protect mobile agents. The approach is based on adaptability concept and a clone agent, which is a prototype of the mobile agent with no critical code and sensitive data. The idea minimizes damages on the mobile agent.

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.

A mobile agent system is regarded as an attractive technology when developing distributed applications. However, mobility makes it more difficult to trace agents. It is also more complex for agents to communicate with each other in a reliable manner. Therefore, a reliable communication protocol is necessary to control and monitor mobile agents and deliver messages between them. In this paper, a new reliable communication protocol (RCP) is proposed for a multiregion mobile agent computing environment. RCP is implemented on the ODDUGI mobile agent system. Analysis and evaluation show that RCP fulfills the following design goals: reliability, asynchrony, timeliness, location dependency, scalability, and communication cost.

Mobile agent systems provide new perspectives for distributed e-commerce applications. These applications may present specific restrictions, making mobile agent systems a feasible solution. Even so, mobile agents present some security related problems. An important one is resource access control. The ability for mobile agents to provide a simple, scalable, flexible, and secure access control system is a key point for the widespread adoption of mobile agents. In this paper we propose a mechanism to safely assign roles to mobile agents and an access control method based on Role-based Access Control (RBAC). The access control method provides a simple, lightweight and distributed model for mobile agent applications. It is proposed as an extension of the MARISM-A (An Architecture for Mobile Agents with Recursive Itineraries and Secure Migration) project, a secure mobile agent platform.

Aiming at the security and trust management of mobile agent system in cloud computing environment, based on the simple public key infrastructure (SPKI) trust mechanism, a mobile agent system objective trust peer management model (MAOTM) is proposed to solve the problem of identity authentication, operation authorization and access control in the mobile agent system; On this basis, the Human Trust Mechanism (HTM) is used to study the subjective trust formation, trust propagation and trust evolution law, and the subjective trust dynamic management algorithm (MASTM) is proposed. Based on the interaction experience between the mobile agent and the execution host and the third-party recommendation information to collect the basic trust data, the public trust host selection algorithm is given. The isolated malicious host algorithm and the integrated trust degree calculation algorithm realize the function of selecting the trusted cluster and isolating the malicious host, so as to enhance the security interaction between the mobile agent and the host. The simulations of the proposed algorithms are verified and proved to be feasible and effective.

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.

Mobile agents programming paradigm is an emerging approach for distributed computing, extremely suitable for mobile systems because of its adaptability to exploit the available resources. Optimization of mobile agents applications and system configuration are relevant above all when we deal handheld devices with limited capabilities. Classical approaches are hard to apply because new kinds of interaction facilities provided by agent platforms, such as cloning and migration, represent an additional software layer that affects the system performances. In this context identification and estimation of performance indexes are necessary to evaluate and foresee system dependability. In fact performance evaluation is exploited to address different issues according to which, different measurements are required. In practice, there is a need for tools and techniques for evaluation of the performances of the adopted mobile agent platforms. Related work proposes a set of performance indexes, slightly different one from the other; and measured using different approaches. We present here a framework that aims at supporting the development of ad-hoc solutions based on measurement agents. Framework architecture, prototype implementation and case studies and preliminary performance figures are presented in the following.