自稳定静默协议的通信效率
Communication Efficiency in Self-stabilizing Silent Protocols
摘要：
自稳定是为分布式系统和网络提供前向恢复能力的一般范例。直观地说，如果一个协议能够在没有外部干预的情况下从任何灾难性的瞬时故障中恢复，那么它就是自稳定的。在本文中，我们的重点是降低自稳定协议\emph{below}的通信复杂性，需要永远检查每个邻居。更详细地说，该文件的贡献有三个方面：（i）我们为自稳定协议的通信效率提供了新的复杂性度量，特别是在稳定阶段或没有故障时。（ii）在负面方面，我们证明了对于非平凡问题，如着色，最大匹配和最大独立集，是不可能得到（确定性或概率性）自稳定的解决方案，其中每个参与者与少于每个邻居在稳定阶段进行通信，以及（iii）在积极的一面，我们提出了着色，最大匹配，以及最大独立集，使得一部分参与者在稳定阶段中与恰好一个邻居通信。
英文摘要：
Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic transient failure. In this paper, our focus is to lower the communication complexity of self-stabilizing protocols \emph{below} the need of checking every neighbor forever. In more details, the contribution of the paper is threefold: (i) We provide new complexity measures for communication efficiency of self-stabilizing protocols, especially in the stabilized phase or when there are no faults, (ii) On the negative side, we show that for non-trivial problems such as coloring, maximal matching, and maximal independent set, it is impossible to get (deterministic or probabilistic) self-stabilizing solutions where every participant communicates with less than every neighbor in the stabilized phase, and (iii) On the positive side, we present protocols for coloring, maximal matching, and maximal independent set such that a fraction of the participants communicates with exactly one neighbor in the stabilized phase.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
