一个移动Agent算法性能评价的仿真环境

移动Agent是一种新的分布计算技术，自90年代被提出以来受到广泛关注。研究人员提出了很多基于移动Agent的算法，以解决传统分布式计算问题和移动计算中的问题。然而由于移动Agent所具有的反应性、自治性、可移动性等的特性使得对移动Agent的算法的性能评价成为一个相当复杂的问题。本文使用直接执行仿真(Direct Execution Simulation)的方法建立了一个移动Agent系统的仿真环境MADESE，通过执行移动Agent代码来获取其基本数据，并通过仿真计算出移动Agent算法在各种环境中的性能。文章讨论了MADESE的事件和同步机制以及其系统环境的设计结构，并介绍了其实现原型。     

Performance analysis of a mobile agent prototype system based on VIRGO P2P protocols

The mobile agent technique has been broadly used in next generation distributed systems. The system performance measurement and simulation are required before the system can be deployed on a large scale. In this paper, we address performance analysis on a finite state mobile agent prototype on the basis of Virtual Hierarchical Tree Grid Organizations (VIRGO). The finite states refer to the migration, execution, and searching of the mobile agent. We introduce a novel evaluation model for the finite state mobile agent. The experimental results based on this evaluation model show that the finite mobile agents can perform well under multiple agent conditions and are superior to the traditional client/server approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Dynamic partner identification in mobile agent-based distributed job workflow execution

This paper is concerned with the design, implementation, and evaluation of algorithms for communication partner identification in mobile agent-based distributed job workflow execution. We first describe a framework for distributed job workflow execution over the Grid: the Mobile Code Collaboration Framework (MCCF). Based on the study of agent communications during a job workflow execution on MCCF, we identify the unnecessary agent communications that degrade the system performance. Then, we design a novel subjob grouping algorithm for preprocessing the job workflow's static specification in MCCF. The obtained information is used in both static and dynamic algorithms to identify partners for agent communication. The mobile agent dynamic location and communication based on this approach is expected to reduce the agent communication overhead by removing unnecessary communication partners during the dynamic job workflow execution. The proof of the dynamic algorithm's correctness and effectiveness are elaborated. Finally, the algorithms are evaluated through a comparison study using simulated job workflows executed on a prototype implementation of the MCCF on a LAN environment and an emulated WAN setup. The results show the scalability and efficiency of the algorithms as well as the advantages of the dynamic algorithm over the static one.     

一个通用移动agent仿真平台的设计与实现*

对移动agent在广域网中的运行情况进行仿真从而评价其算法的性能是优化移动agent应用设计的关键问题之一。在前期工作基础上,采用直接执行仿真方法,设计并实现的通用移动agent仿真平台SimulAglets。实验结果表明,该平台可对复杂的移动agent算法进行有效的模拟,仿真结果与理论建模和专用仿真程序得到的结果完全相符。     

Mobile agent‐based computational steering for distributed applications

The mobile agent‐based computational steering (MACS) for distributed applications is presented in this article. In the MACS, a mobile agent platform, Mobile‐C, is embedded in a program through the Mobile‐C library to support C/C++ mobile agent code. Runtime replaceable algorithms of a program are represented as agent services in C/C++ source code and can be replaced with new ones through mobile agents. In the MACS, a mobile agent created and deployed by a user from the steering host migrates to computing hosts successively to replace algorithms of running programs that constitute a distributed application without the need of stopping the execution and recompiling the programs. The methodology of dynamic algorithm alteration in the MACS is described in detail with an example of matrix operation. The Mobile‐C library enables the integration of Mobile‐C into any C/C++ programs to carry out computational steering through mobile agents. The source code level execution of mobile agent code facilitates handling issues such as portability and secure execution of mobile agent code. In the MACS, the network load between the steering and computing hosts can be reduced, and the successive operations of a mobile agent on multiple computing hosts are not affected whether the steering host stays online or not. The employment of the middle‐level language C/C++ enables the MACS to accommodate the diversity of scientific and engineering fields to allow for runtime interaction and steering of distributed applications to match the dynamic requirements imposed by the user or the execution environment. An experiment is used to validate the feasibility of the MACS in real‐world mobile robot applications. The experiment replaces a mobile robot's behavioral algorithm with a mobile agent at runtime. Copyright © 2009 John Wiley & Sons, Ltd.     

Detecting and resolving deadlocks in mobile agent systems

Mobile agents environment is a new application paradigm with unique features such as mobility and autonomy. Traditional deadlock detection algorithms in distributed computing systems do not work well in mobile agent systems due to the unique feature property of the mobile agent. Existing deadlock detection and resolution algorithms in mobile agent systems have limitations such as performance inefficiency and duplicate detection/resolution when multiple mobile agents simultaneously detect/resolve the same deadlock. To address these problems, we propose an improved deadlock detection and resolution algorithm that adopts priority-based technique and lazy reaction strategy. The priority-based technique aims to ensure that there is only one instance of deadlock detection and resolution, and it also helps reduce mobile agent movement and data traffic together with the lazy reaction strategy. The liveness and safety properties of the proposed algorithm are proved in this paper. Theoretical analysis and experimental results show that the proposed algorithm provides better performance in terms of agent movement, data traffic, and execution time.     

具有迁移能力的基于Agent分布仿真中的通信系统

对基于Agent系统的分布仿真是仿真领域的重要研究和应用方向，而分布仿真中的通信系统是其中的基础部分．提出并实现了一种支持基于Agent系统分布仿真的通信系统．该系统除了提供基本的仿真通信支持外，还能够有效地支持仿真中Agent的迁移，具有对应用系统透明、通信效率高等优点．首先给出了通信系统的结构及其基本思想，对局部服务Agent和通信过程进行了详细的描述；从应用系统级和分布仿真级两个层次，给出了结构化的通信协议；在此基础之上，给出了完整的Agent迁移支持方案，包括迁移过程、迁移过程中的消息处理和迁移后的通信；最后对通信系统的性能进行了测试．     

Distributed computing paradigms for collaborative signal and information processing in sensor networks

In this paper, we report the development of an energy-efficient, high-performance distributed computing paradigm to carry out Collaborative Signal and Information Processing (CSIP) in sensor networks using mobile agents. In this paradigm, the processing code is moved to the sensor nodes through mobile agents, in contrast to the client/server-based computing, where local data are transferred to a processing center. Although the client/server paradigm has been widely used in distributed computing, the many advantages of the mobile agent paradigm make it more suitable for sensor networks. The paper first presents simulation models for both the client/server paradigm and the mobile agent paradigm. We use the execution time, energy and energy*delay as metrics to measure the performance. Several experiments are designed to show the effect of different parameters on the performance of the paradigms. Experimental results show that the mobile agent paradigm performs much better when the number of nodes is large while the client/server paradigm is advantageous when the number of nodes is small. Based on this observation, we then propose a cluster-based hybrid computing paradigm to combine the advantages of these two paradigms. There are two schemes in this paradigm and simulation results show that there is always one scheme which performs better than either the client/server or the mobile agent paradigms. Thus, the cluster-based hybrid computing provides an energy-efficient and high-performance solution to CSIP.     

网格环境中基于移动Agent的工作流架构研究

传统的工作流架构有很多弱点,比如架构严重降低了系统性能,在动态环境中缺少灵活性。本文提出了一个集成了WebServices,网格,工作流和移动代理技术的分布式工作流架构。在这个架构中,我们可以通过移动代理间的通讯来达到工作流之间协同工作,而且这个架构增强了工作流的灵活性和可靠性。最后,以这个新的模型为基础实现了一个具体的工作流工作站。     

Mobile agent-enabled framework for structuring and building distributed systems on the internet

Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of proc- essing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel ap- proach to detecting deadlocks in distributed system by using mobile agents, which dem- onstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD (Mobile Agent Enabled Deadlock Detection) scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detec- tion strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.     

Execution coordination in mobile agent-based distributed job workflow execution

Mobile agent-based distributed job workflow execution requires the use of execution coordination techniques to ensure that an agent executing a subjob can locate its predecessors’ execution results. This paper describes the classification, implementation, and evaluation of execution coordination techniques in the mobile agent-based distributed job workflow execution system. First, a classification of the existing execution coordination techniques is developed for mobile agent systems. Second, to put the discussion into perspective, our framework for mobile agent-based distributed job workflow execution over the Grid (that is, MCCF: Mobile Code Collaboration Framework) is described. How the existing coordination techniques can be applied in the MCCF is also discussed. Finally, a performance study has been conducted to evaluate three coordination techniques using real and simulated job workflows. The results are presented and discussed in the paper.     

J-SEAL2—A Secure High-Performance Mobile Agent System

Even though the advantages of mobile agents for distributed electronic commerce applications have been highlighted in numerous research works, mobile agent applications are not in widespread use today. For the success of mobile agent applications, secure, portable, and efficient execution platforms for mobile agents are crucial. However, popular mobile agent systems do not meet the high security requirements of electronic commerce applications, are not portable, or cause high overhead. Currently, the majority of mobile agent platforms is based on Java. These systems simply rely on the security model of Java, although it is not suited to protect agents and service components from each other.In contrast, J-SEAL2 is a mobile agent system designed to meet the high security, portability, and performance requirements of large-scale electronic commerce applications. J-SEAL2 extends the Java environment with a model of strong protection domains. The core of the system is a micro-kernel fulfilling the same functions as a traditional operating system kernel: protection, communication, domain termination, and resource control. For portability reasons, J-SEAL2 is implemented in pure Java. This paper focuses on the design of the new communication model in J-SEAL2, which allows convenient, efficient, and mediated communication in a hierarchy of strong protection domains.     

A bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling

This paper presents a bio-inspired mobile agent-based integrated system for flexible autonomic job shop scheduling. The system matches the autonomic system architecture, inspired by the autonomic nervous system and proposed by the IBM, and has the IBM-defined fundamental self-managing properties, so that it can manage itself with little human intervention. The system conforms to the IEEE FIPA (Foundation for Intelligent Physical Agents) standard. Therefore, the interoperability between agents of the system and agents from many active heterogeneous FIPA compliant agent platforms can be ensured. The system supports the execution of C/C++ mobile agent codes. Thus, it is applicable to a variety of applications, especially for distributed mechatronic and embedded systems. In addition, since the system is composed of agents, including stationary and mobile agents, the system has a high scalability and flexibility to integrate and adopt various scheduling models and algorithms for different scheduling requirements. An overall architecture of the system and critical implementation details about the agency and agents in the system are presented in this article. An energy saving job shop scheduling example is used to validate one autonomic property of the system.     

一种基于移动Agent技术的分布式死锁检测算法

死锁的处理长期以来一直是分布式系统的研究重点,已有许多成熟算法.随着网络技术的发展,越来越多的客户和资源可在网络中自由移动,这种可移动性使得传统算法面临了新的挑战.在这种新的应用背景下,本文结合移动Agent技术,提出了一种分布式系统死锁检测和解除算法：Agent Guard.该算法使用一个移动Agent,使其遵循一定的路线算法在各个站点间移动来收集资源请求和分配信息并进行分析,从而发现并解除死锁.模拟实验证明,A-gent Guard算法能取得较短的死锁持续时间,较小的伪死锁率,且网络的通信复杂度也有降低.     

Mobile Agent Connection Establishment and Management (CEMA)—Message Exchange for Pervasive Computing Environments

Pervasive computing is an emerging technology that offers new possibilities to distributed computing and computer networking; it employs a wide variety of smart, ubiquitous devices throughout an individual's working and living environment. Mobile agents are software entities that can migrate between servers (mobile agent environments) of the network accomplishing various tasks on the behalf of their owners. The objective of this paper is to describe a test and prototyping environment for experimenting with mobile agents in pervasive environments. A prototype environment for a novel, proactive infrastructure is described for mobile agent assisted pervasive computing. In addition, a new message passing algorithm is provided for mobile agent connection establishment and management (CEMA). Simulation results show the performance of the proposed approach.     

A novel fault-tolerant execution model by using of mobile agents

The exponential expansion of the Internet and the widespread popularity of the World Wide Web give a challenge to experts on reliable and secure system design, e.g., e-economy applications. New paradigms are on demand and mobile agent technology is one of the features. In this paper, we propose a fault-tolerance execution model by using of mobile agents, for the purpose of consistent and correct performance with a required function under stated conditions for a specified period of time. Failures are classified into two classes based on their intrinsic different effects on mobile agents. For each kind of failure, a specified handling method is adopted. The introduction of exceptional handling method allows performance improvements during mobile agents’ execution. The behaviors of mobile agents are statistically analyzed through several key parameters, including the migration time from node to node, the life expectancy of mobile agents, and the population distribution of mobile agents, to evaluate the performance of our model. The analytical results give new theoretical insights to the fault-tolerant execution of mobile agents and show that our model outperforms the existing fault-tolerant models. Our model provides an effective way to improve the reliability of computer systems.     

Pewss: A platform of extensible workflow simulation service for workflow scheduling research

This paper presents a Platform of Extensible Workflow Simulation Service (Pewss), which we have developed to provide a cloud service for aiding research work in workflow scheduling. The simulation has been a major tool for performance evaluation and comparison in workflow scheduling research. However, researchers usually have to develop their own simulation programs with limited functionality, simply outputting summarized performance results. Pewss has been developed for easing and improving current practices in conducting performance simulations during studying of existing workflow scheduling algorithms or designing of new scheduling algorithms. Pewss has been designed based on the Software as a Service (SaaS) model, adopting a multiuser Web‐based client/server architecture. Conducting simulation experiments on Pewss, researchers simply have to implement the scheduling algorithm under study instead of a whole simulation environment, allowing them to focus on their research work without spending unnecessary efforts on the simulation implementation details. Pewss provides the visualization of a workflow execution schedule based on simulation results, offering a convenient way for researchers to gain an insight into the effectiveness, characteristics, and performance bottleneck of scheduling algorithms. As a multiuser environment, Pewss also provides functionality for researchers to facilitate comparative performance analysis and collaborative research works effectively. Pewss has been used in our research work on task‐parallel workflow scheduling and has been planned to be extended to support other types of workflow scheduling research problems, eg, mixed‐parallel workflows.     

Agent scheduling model for adaptive dynamic load balancing in agent-based distributed simulations

Agent-based distributed simulations are confronted with load imbalance problem, which significantly affects simulation performance. Dynamic load balancing can be effective in decreasing simulation execution time and improving simulation performance. The characteristics of multi-agent systems and time synchronization mechanisms make the traditional dynamic load balancing approaches not suitable for dynamic load balancing in agent-based distributed simulations. In this paper, an adaptive dynamic load balancing model in agent-based distributed simulations is proposed. Due to the complexity and huge time consuming for solving the model, a distributed approximate optimized scheduling algorithm with partial information (DAOSAPI) is proposed. It integrates the distributed mode, approximate optimization and agent set scheduling approach. Finally, experiments are conducted to verify the efficiency of the proposed algorithm and the simulation performance under dynamic agent scheduling. The experiments indicate that DAOSPI has the advantage of short execution time in large-scale agent scheduling, and the distributed simulation performance under this dynamic agent scheduling outperforms that under static random agent distribution.     

Applications of mobile agents and ambassadors in distributed simulation

This paper describes part of a project to investigate various uses of mobile agents within distributed simulations. A number of generic roles for these agents are suggested. The design of a monitoring facility for remote models is covered in detail. This has been constructed as an example of an “Ambassador system”, having a convenient sub-set of the facilities of a fully autonomous mobile agent system. The prototype of this system uses Java applets to provide model-specific controls and displays through a standard Internet browser interface.