Spreading information through a network of devices is a core activity for most distributed systems. As such, self-stabilizing 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 proves that it is ultimately bounded under persistent disturbances. The ultimate bounds depend only on the magnitude of the largest perturbation and the network diameter, and three design parameters trade off competing aspects of performance. For example, as in many dynamical systems, values leading to greater resilience to network perturbations slow convergence and vice versa.

翻译：通过设备网络传播信息是大多数分布式系统的核心活动。因此,实施信息传播的自我稳定算法是使综合计算能够在开放的复杂分布式系统中提供弹性协调的关键构件之一。本文改进了综合计算文献中一个总的扩展块,使其适应网络扰动,建立了其全球统一的无药可救稳定性,并证明它最终被长期动乱所束缚。最终界限仅取决于最大扰动的程度和网络直径,以及三个设计参数可以相互交换性能的竞争性方面。例如,在许多动态系统中,价值导致对网络扰动缓慢趋同和反之更强的抗力。