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.

中文翻译：

---

聚合计算中分布式信息传播的稳定性和弹性

通过设备网络传播信息是大多数分布式系统的核心活动。这样，实现信息传播的自稳定算法是使聚合计算能够在开放的复杂分布式系统中提供弹性协调的关键构建块之一。本文通过使集合计算文献对网络扰动具有弹性，改进了集合计算文献中的一般扩散块，建立了它的全局一致渐近稳定性，并证明了它最终受到持续扰动的限制。最终界限仅取决于最大扰动的大小和网络直径，并且三个设计参数需要权衡性能的竞争方面。例如，在许多动力系统中