Decentralised autonomic computing: Analysing self-organising emergent behaviour using advanced numerical methods

When designing decentralised autonomic computing sys-tems, a fundamental engineering issue is to assess system-wide behaviour. Such decentralised systems are charac-terised by the lack of global control, typically consist of autonomous cooperating entities, and often rely on self-organised emergent behaviour to achieve the requirements. A well-founded and practically feasible approach to study overall system behaviour is a prerequisite for suc-cessful deployment. On one hand, formal proofs of cor-rect behaviour and even predictions of the exact system-wide behaviour are practically infeasible due to the com-plex, dynamic, and often non-deterministic nature of self-organising emergent systems. On the other hand, simple simulations give no convincing arguments for guarantee-ing system-wide properties. We describe an alternative ap-proach that allows to analyse and assess trends in system-wide behaviour, based on so-called “equation-free ” macro-scopic analysis. This technique yields more reliable results about the system-wide behaviour, compared to mere obser-vation of simulation results, at an affordable computational cost. Numerical algorithms act at the system-wide level and steer the simulations. This allows to limit the amount of simulations considerably. We illustrate the approach by studying a particular system-wide property of a decentralised control system for Automated Guided Vehicles and we outline a road map to-wards a general methodology for studying decentralised autonomic computing systems. 1