Multi‐agent system for knowledge‐based event recognition and composition

This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored.     

Distributing RePast agent‐based simulations with HLA

Large, experimental multi‐agent system (MAS) simulations are highly demanding tasks, both computationally and developmentally. Agent toolkits provide reliable templates for the design of even the largest MAS simulations, without offering a solution to computational limitations. Conversely, distributed simulation architectures offer performance benefits, but the introduction of parallel logic can complicate the design process significantly. The motivations of distribution are not limited to this question of processing power. True interoperation of sequential agent‐simulation platforms would allow agents designed using different toolkits to transparently interact in common abstract domains. This paper discusses the design and implementation of a system capable of harnessing the computational power of a distributed simulation infrastructure with the design efficiency of an agent toolkit. The system permits integration, through a higher‐level architecture (HLA) federation, of multiple instances of the Java‐based lightweight agent‐simulation toolkit RePast. This paper defines abstractly the engineering process necessary in creating such middleware, and reports on the experience in the specific case of the RePast toolkit. The paper also presents performance results that illustrate that significant speedup can be achieved through the integration of RePast with HLA. Copyright © 2008 John Wiley & Sons, Ltd.     

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.     

Event‐triggered distributed constrained consensus

We consider a distributed consensus problem for continuous‐time multi‐agent systems with set constraints on the final states. To save communication costs, an event‐triggered communication‐based protocol is proposed. By comparing its own instantaneous state with the one previously broadcasted to neighbours, each agent determines the next communication time. Based on this event‐triggered communication, each agent is not required to continuously monitor its neighbours' state and the communication only happens at discrete time instants. We show that, under some mild conditions, the constrained consensus of the multi‐agent system with the proposed protocol can be achieved with an exponential convergence rate. A lower bound of the transmission time intervals is provided that can be adjusted by choosing different values of parameters. Numerical examples illustrate the results. Copyright © 2016 John Wiley & Sons, Ltd.     

Scalable model‐based configuration management of security services in complex enterprise networks

Security administrators face the challenge of designing, deploying and maintaining a variety of configuration files related to security systems, especially in large‐scale networks. These files have heterogeneous syntaxes and follow differing semantic concepts. Nevertheless, they are interdependent due to security services having to cooperate and their configuration to be consistent with each other, so that global security policies are completely and correctly enforced. To tackle this problem, our approach supports a comfortable definition of an abstract high‐level security policy and provides an automated derivation of the desired configuration files. It is an extension of policy‐based management and policy hierarchies, combining model‐based management (MBM) with system modularization. MBM employs an object‐oriented model of the managed system to obtain the details needed for automated policy refinement. The modularization into abstract subsystems (ASs) segment the system—and the model—into units which more closely encapsulate related system components and provide focused abstract views. As a result, scalability is achieved and even comprehensive IT systems can be modelled in a unified manner. The associated tool MoBaSeC (Model‐Based‐Service‐Configuration) supports interactive graphical modelling, automated model analysis and policy refinement with the derivation of configuration files. We describe the MBM and AS approaches, outline the tool functions and exemplify their applications and results obtained. Copyright © 2010 John Wiley & Sons, Ltd.     

Leader–follower flocking based on distributed event‐triggered hybrid control

In this paper, we proposed a new hybrid control algorithm to achieve leader–follower flocking in multi‐agent systems. In the algorithm, the position is transmitted continuously, whereas the velocity is utilized discretely, which is governed by a distributed event‐triggered mechanism, and the neighbors' velocity is not required to detect the event‐triggered condition for each agent. It is shown that stable flocking is achieved asymptotically while the connectivity of networks is preserved. A numerical example is provided to illustrate the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

分布式移动代理系统的异步死锁检测

移动代理技术在为分布式应用提供全新的网络计算方式的同时也产生了传统分布式计算领域所没有的新的交互模式和执行模式。传统分布式计算的处理方法如并发控制和死锁检测方法不再适用于客户和服务提供者都可在网络中随处移动的移动代理系统。通过移动代理来建模长寿事务,并根据移动代理的特点提出了一种异步分布式死锁检测和解除算法。它将事务代理的执行与死锁检测机制分离,用专门的代理负责死锁检测的初始化、检测和消除等工作。死锁的检测通过创建若干检测代理,使其在各个站点间移动来收集资源请求和分配信息,并据此构造全局等待图;通过分析和探测全局等待图中是否存在圈来完成。算法具有独立于网络的拓扑结构,死锁的检测和事务代理的执行异步操作,不对代理的移动性施加任何限制等特点。     

基于MAS智能分布实时监测系统任务协调与调度

在现代分布实时监测系统工作环境下,要清晰地表示分布的任务结构和任务之间的交互关系是非常困难的。为了解决这个问题,给出了一种Agent体系结构,它通过一般部分全局计划方法表示Agent任务结构,实现具有一定适应能力的协调机制,获得Agent本地调度方案。     

Distributed adaptive integral‐type event‐triggered cooperative output regulation of switched multiagent systems by agent‐dependent switching with dwell time

This article presents a distributed adaptive integral‐type event‐triggered scheme (ETS) and an agent‐dependent switching strategy with dwell time to solve the cooperative output regulation problem for switched multiagent systems. First, by constructing an adaptive law to dynamically update the time‐varying coupling weights for all the communication links, a fully distributed ETS is designed, where only the local information of the topology is adopted. Based on the integral‐type triggering condition, the interevent interval is substantially enlarged and Zeno behavior is explicitly ruled out. Second, each agent permits all the subsystems to be unstabilizable. The switching signal for each agent is different, and any adjacent switches of each agent satisfy the preset dwell time. Under the designed switching strategy, the solvability of the regulation problem is guaranteed. Finally, the effectiveness of the designed ETS and switching strategy is substantiated by an example.     

Satisfying quality requirements in the design of a partition‐based,distributed stock trading system

Although quality requirements (QRs) have become a major drive in today's software development, there have been very few real‐world examples in the literature that demonstrate how to meet these requirements. This paper presents such an example. Specifically, the paper describes the design of a partition‐based distributed stock trading service system that satisfies a set of QRs related to resource utilization, performance, scalability and availability. The paper evaluates this design through detailed experiments and discusses some design alternatives and the lessons learned. Central to this design are a static load distribution strategy and a dynamic load balancing strategy. The first strategy is to achieve an initial balanced workload on the system's server cluster during the system initialization time, whereas the second strategy is to maintain this balanced workload throughout the system execution time. Together, these two strategies work in unison to ensure that the server resources are efficiently utilized; the user requests are processed with the required speed; the application is partitioned with sufficient room to scale; and the system is highly available. Copyright © 2011 John Wiley & Sons, Ltd.     

基于移动Agent的分布式数据库的协同安全模型

随着各种分布式计算的广泛应用,移动Agent技术引起了人们越来越多的关注.在移动Agent的应用环境中,数据传输、服务器资源.移动Agent运行环境和移动Agent自身安全等方面的安全性问题日益突出.同时移动Agent应用系统中各个数据处理Agent之间的自主进行协商和协调也是一个有待解决的问题.针对这些问题,提出了一种基于移动Agent的分布式数据库的协同安全模型,来初步解决移动Agent的分布式数据库安全性和Agent之间协调工作的问题.     

Improving scalability of event‐driven distributed objects architectures

The goal of this paper is to present practical techniques for improving the scalability of a distributed objects architecture built around an event‐driven paradigm and the evaluation of their effectiveness in the case of location systems. As a case study, the ABng location system constructed using a publisher/subscriber pattern over a CORBA compliant middleware is presented. The main contribution of this paper is the elaboration and evaluation of three main concepts that play a crucial role in improving the scalability of event‐driven architectures: events dissemination quality of service, notification tree based events‐routing, and transparent multicast event‐channel notification service. The applicability and efficiency of these techniques have been verified in practice by the ABng system implementation and performance testing. Copyright © 2000 John Wiley & Sons, Ltd.     

Fault‐driven stress testing of distributed real‐time software based on UML models

In a previous article, a stress testing methodology was reported to detect network traffic‐related Real‐Time (RT) faults in distributed RT systems based on the design UML model of a System Under Test (SUT). The stress methodology, referred to as Test LOcation‐driven Stress Testing (TLOST), aimed at increasing the chances of RT failures (violations in RT constraints) associated with a given stress test location (an network or a node under test). As demonstrated and experimented in this article, although TLOST is useful in stress testing different test locations (nodes and network, it does not guarantee to target (test) all RT constraints in an SUT. This is because the durations of message sequences bounded by some RT constraints might never be exercised (covered) by TLOST. A complementary stress test methodology is proposed in this article, which guarantees to target (cover) all RT constraints in an SUT and detect their potential RT faults (if any). Using a case study, this article shows that the new complementary methodology is capable of targeting the RT faults not detected by the previous test methodology. Copyright © 2009 John Wiley & Sons, Ltd.     

A distributed and multi‐tiered software architecture for assessing e‐Commerce recommendations

Recently, an ever increasing number of e‐Commerce tools has been made available that are able to help customers by generating purposed recommendations. Many of them are centralized so that they have to face problems related to efficiency and scalability. A few of them are distributed, but in this case, the complexity of the e‐Commerce process implies computation overhead on the client side, which is often unsuitable if mobile devices are used by customers. In this paper, we study how the software distribution in recommender systems affects their performances, depending on the characteristics of the e‐Commerce population. To this end, we present a distributed testbed architecture for e‐Commerce recommender systems using a multi‐tiered agent‐based approach to generate effective recommendations without requiring such an onerous amount of computation per single client. We use such a testbed to study the main advantages and limitations associated with the problem of distributing the computation of recommendations. Copyright © 2016 John Wiley & Sons, Ltd.     

Event‐based distributed robust synchronization control for multiple Euler‐Lagrange systems without relative velocity measurements

This paper focuses on the event‐based distributed robust leaderless synchronization control for multiple Euler‐Lagrange systems with directed communication topology that contains a directed spanning tree. Update frequency of the system is reduced by taking advantages of the event‐triggered approach, which can help extend the service life of the controller. Robust control theory is employed to guarantee the synchronization stability of the networked Euler‐Lagrange systems when unmodeled dynamics occur. The cost on the distributed synchronization protocol design can be saved due to the relaxation of the requirement on relative velocity measurements. Furthermore, our results are more practical because unknown disturbance is taken into consideration. In addition, it can be rigorously analyzed that each agent can exclude the undesired Zeno behavior. Some simulation examples are provided in the end to demonstrate the effectiveness of the proposed event‐based distributed robust control algorithm.     

Improving the scalability of the CORBA event service with a multi‐agent load balancing algorithm

The event service of the Common Object Request Broker Architecture (CORBA) is useful in supporting decoupled and asynchronous communication between distributed object components. However, the specification of the event service standard does not require implementation to provide facilities to guarantee efficient event/data delivery. Consequently, applications in which a large number of objects need to communicate via an event service channel may suffer from poor performance. In this paper, a generic CORBA‐based framework is proposed to tackle this scalability problem. Two techniques are applied; namely, event channel federation and load balancing. The solution is transparent in the sense that it exports the same IDL interface as the original event service. We explore three critical dimensions underlying the design of the load‐balancing algorithm and conduct experiments to evaluate their impact on the overall performance of the framework. The results provide some useful insights into the improvement of the scalability of the event service. Copyright © 2002 John Wiley & Sons, Ltd.     

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

During the last decade, the number of distributed application domains with temporal requirements has significantly augmented, arising the necessity of exploring new concepts and paradigms that allow, on the one hand, the development of dynamic and flexible distributed applications and, on the other hand, the reusability of code. Service‐oriented paradigms have been successfully applied to distributed environments, increasing their flexibility and allowing the reusability of their components. Besides, distributed real‐time Java technologies have shown to be a good candidate to deploy real‐time distributed applications. This paper presents a model for service‐oriented applications on a time‐triggered distributed real‐time Java environment, focusing on the definition of the temporal model of an application and its schedulability, applying and evaluating this model in real‐time service‐oriented composition algorithms. Copyright © 2012 John Wiley & Sons, Ltd.     

Towards pattern‐based architectures for event processing systems

Recently, event processing (EP) has gained considerable attention as an individual discipline in computer science. From a software engineering perspective, EP systems still lack the maturity of well‐established software architectures. For the development of industrial EP systems, generally accepted software architectures based on proven design patterns and principles are still missing. In this article, we introduce a catalog of design patterns that supports the development of event‐driven architectures (EDAs) and complex EP systems. The design principles originate from experiences reported in publications as well as from our own experiences in building EP systems with industrial and academic partners. We present several patterns on different layers of abstractions that define the overall structure as well as the building blocks for EP systems. Architectural patterns that determine the top‐level structure of an EDA can be distinguished from design patterns that specify the basic mechanisms of EP. The practical application of the catalog of patterns is described by the pattern‐based design of a sample EDA for a sensor‐based energy control system. Finally, we propose a coherent and general reference architecture for EP derived from the proposed patterns.Copyright © 2013 John Wiley & Sons, Ltd.     

Decentralized summation‐based triggering mechanism for Lipschitz nonlinear systems

In this paper, a decentralized event‐based triggering mechanism for a class of nonlinear control systems is studied. It is assumed that the measurement sensors are geographically distributed and so local event generator modules are employed. Then, a novel periodic triggering condition is proposed for each module, which can potentially reduce the information exchange between subsystems compared with traditional control approaches, while maintaining closed‐loop asymptotic stability. The triggering condition parameters are designed through a convex optimization problem with LMI constraints. Finally, simulations are carried out to illustrate the performance of the introduced scheme. Copyright © 2017 John Wiley & Sons, Ltd.     

Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms

This paper studies the problem of minimizing the sum of convex functions that all share a common global variable, each function is known by one specific agent in the network. The underlying network topology is modeled as a time‐varying sequence of directed graphs, each of which is endowed with a non‐doubly stochastic matrix. We present a distributed method that employs gradient‐free oracles and push‐sum algorithms for solving this optimization problem. We establish the convergence by showing that the method converges to an approximate solution at the expected rate of , where T is the iteration counter. A numerical example is also given to illustrate the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.