Stability and Resilience of Distributed Information Spreading in Aggregate Computing

  title={Stability and Resilience of Distributed Information Spreading in Aggregate Computing},
  author={Yuanqiu Mo and Soura Dasgupta and Jacob Beal},
Spreading information through a network of devices is a core activity for most distributed systems. As such, selfstabilizing algorithms implementing information spreading are one of the key building blocks enabling aggregate computing to provide resilient coordination in open complex distributed systems. This paper improves a general spreading block in the aggregate computing literature by making it resilient to network perturbations, establishes its global uniform asymptotic stability and… 

Figures from this paper


Robust Stability of Spreading Blocks in Aggregate Computing
An extremely general information spreading algorithm of which ABF is a special case is analyzed, providing a proof of global uniform asymptotic stability, upper bound on the time to converge, and ultimate bounds on state error in face of persistent perturbations.
Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm
This work proves the adaptive Bellman-Ford algorithm to be GUAS, bounding the time to converge, and shows via simulations that it withstands persistent bounded perturbations in the graph edge lengths.
Consensus and Cooperation in Networked Multi-Agent Systems
This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in
Toward Predicting Distributed Systems Dynamics
A commonly used distributed distance estimation algorithm is analyzed from a stability theory perspective, identifying key properties of monotonicity and dynamical behavior envelope that allow standard stability theory analysis to be applied to predict the behavior of the algorithm in response to persistent perturbation.
Engineering Resilient Collective Adaptive Systems by Self-Stabilisation
Overall, the methodology sheds light on how to identify core building blocks of collective behaviour and how to select implementations that improve system performance while leaving overall system function and resiliency properties unchanged.
Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds
A Lyapunov function is formulated to analyze the Adaptive Bellman-Ford distance estimation algorithm and used to prove global uniform asymptotic stability, a property which the classical Bellman–Ford algorithm lacks.
A Calculus of Self-stabilising Computational Fields
This paper presents a tiny, expressive, and type-sound calculus of computational fields, enjoying self-stabilisation, i.e., the ability of computational Fields to react to changes in the environment finding a new stable state in finite time.
A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford algorithm
  • S. Dasgupta, J. Beal
  • Mathematics
    2016 IEEE 55th Conference on Decision and Control (CDC)
  • 2016
This analysis proves global uniform asymptotic stability of such algorithms, a property which the classical Bellman-Ford algorithm lacks, thus demonstrating a measure of robustness to structural perturbations, empirically observed by us in a previous work.
Efficient Engineering of Complex Self-Organising Systems by Self-Stabilising Fields
This work identifies the largest known sub-language of self-stabilising programs, guaranteed to eventually attain correct behaviour despite any perturbation in state or topology, and facilitates construction and simulation of example applications for evacuation alerts and for live estimation of crowd feedback at mass events.
Building Blocks for Aggregate Programming of Self-Organising Applications
  • J. Beal, Mirko Viroli
  • Computer Science
    2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops
  • 2014
This work aims to raise the abstraction level for system construction by identifying a collection of general and reusable "building block" algorithms, ensuring that any system constructed from them is guaranteed to rapidly converge to a correct behaviour.