Decentralised Fully Probabilistic Design for Stochastic Networks with Multiplicative Noise

In this paper, we present an innovative decentralised control framework, designed to address stochastic dynamic complex systems that are influenced by multiple multiplicative noise factors. Our advanced approach builds upon the foundation of conventional Decentralised Fully Probabilistic Design (DFPD) by refining the Riccati equation to accommodate multiple noise sources effectively. By embracing the inherent stochastic nature of complex systems, our methodology fully characterises their dynamic behaviours using probabilistic state–space models, delivering a comprehensive representation of subsystem components. Importantly, the DFPD approach also incorporates system and input constraints by characterising their corresponding ideal distributions, ensuring optimal functionality and performance while adhering to permissible boundaries. To further enhance system performance, we introduce a probabilistic message passing architecture that enables seamless communication between neighbouring subsystems and promotes harmonised decision-making among local nodes. To demonstrate the efficacy of our proposed framework, we employ a three-inverted pendulum system as a numerical example and compare its performance to that of the conventional DFPD. Through this comparison, we showcase the advantages of our novel decentralised control approach in handling complex systems with multiple noise factors

Self-organising agent communities for autonomic resource management

The autonomic computing paradigm addresses the operational challenges presented by increasingly complex software systems by proposing that they be composed of many autonomous components, each responsible for the run-time reconfiguration of its own dedicated hardware and software components. Consequently, regulation of the whole software system becomes an emergent property of local adaptation and learning carried out by these autonomous system elements. Designing appropriate local adaptation policies for the components of such systems remains a major challenge. This is particularly true where the system’s scale and dynamism compromise the efficiency of a central executive and/or prevent components from pooling information to achieve a shared, accurate evidence base for their negotiations and decisions.In this paper, we investigate how a self-regulatory system response may arise spontaneously from local interactions between autonomic system elements tasked with adaptively consuming/providing computational resources or services when the demand for such resources is continually changing. We demonstrate that system performance is not maximised when all system components are able to freely share information with one another. Rather, maximum efficiency is achieved when individual components have only limited knowledge of their peers. Under these conditions, the system self-organises into appropriate community structures. By maintaining information flow at the level of communities, the system is able to remain stable enough to efficiently satisfy service demand in resource-limited environments, and thus minimise any unnecessary reconfiguration whilst remaining sufficiently adaptive to be able to reconfigure when service demand changes

Distribution pattern-driven development of service architectures

Distributed systems are being constructed by composing a number of discrete components. This practice is particularly prevalent within the Web service domain in the form of service process orchestration and choreography. Often, enterprise systems are built from many existing discrete applications such as legacy applications exposed using Web service interfaces. There are a number of architectural configurations or distribution patterns, which express how a composed system is to be deployed in a distributed environment. However, the amount of code required to realise these distribution patterns is considerable. In this paper, we propose a distribution pattern-driven approach to service composition and architecting. We develop, based on a catalog of patterns, a UML-compliant framework, which takes existing Web service interfaces as its input and generates executable Web service compositions based on a distribution pattern chosen by the software architect