稳定单向网络中的最大独立集是困难的
Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
摘要:
分布式算法是自稳定的,如果在故障和攻击击中系统并将其置于任意全局状态之后,系统在有限时间内从这种灾难性情况中恢复而无需外部干预。本文考虑在任意形状的均匀单向网络中构造自稳定的\emph{maximal independent set}的问题。在消极的一面,我们提出的证据表明,在均匀的网络,\emph{deterministic}自我稳定的这个问题是\emph{impossible}。此外,无论是对于协议的确定性变体还是对于协议的概率性变体,都不可能保证\emph{silence}属性(\emph{i.e.}在每次执行中的某个点具有固定的通信)。在积极的一面,我们提出了一个确定性协议的网络与任意单向网络的唯一标识符,表现出多项式空间和时间复杂度在异步调度。我们补充研究的概率协议的统一情况下:第一个概率协议需要无限的内存,但处理异步调度,而第二个概率协议具有多项式空间复杂度,但只能处理同步调度。两个概率解都具有期望的多项式时间复杂度。
英文摘要:
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this paper, we consider the problem of constructing self-stabilizingly a \emph{maximal independent set} in uniform unidirectional networks of arbitrary shape. On the negative side, we present evidence that in uniform networks, \emph{deterministic} self-stabilization of this problem is \emph{impossible}. Also, the \emph{silence} property (\emph{i.e.} having communication fixed from some point in every execution) is impossible to guarantee, either for deterministic or for probabilistic variants of protocols. On the positive side, we present a deterministic protocol for networks with arbitrary unidirectional networks with unique identifiers that exhibits polynomial space and time complexity in asynchronous scheduling. We complement the study with probabilistic protocols for the uniform case: the first probabilistic protocol requires infinite memory but copes with asynchronous scheduling, while the second probabilistic protocol has polynomial space complexity but can only handle synchronous scheduling. Both probabilistic solutions have expected polynomial time complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。