arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.10779cs.DC
收藏

抽象MAC层的力量:一个容错视角

The Power of Abstract MAC Layer: A Fault-tolerance Perspective

Qinzi Zhang, Lewis Tseng

AI总结:

本文研究单跳异步网络中抽象MAC层模型的容错能力,提出无等待原子寄存器实现并证明k-集合共识不可能,同时设计四种常数存储复杂度的匿名共识算法,其中一种以O(n log n)期望广播终止。

摘要:

本文研究了单跳异步网络中“抽象MAC层”模型的能力。该模型捕捉了现代无线MAC协议的原始属性。在此模型中,Newport [PODC '14] 证明了当节点可能崩溃时,实现确定性共识是不可能的。随后,Newport和Robinson [DISC '18] 提出了随机化共识算法,在n个节点的系统中以O(n^3 log n)次期望广播终止。我们不知道此模型中其他容错分布式任务的结果。\n我们首先研究抽象MAC层的可计算性方面。我们提出了一种实现原子寄存器的无等待算法。此外,我们证明,在一般情况下,k-集合共识是不可能的。其次,我们旨在最小化存储复杂度。现有算法需要Ω(n log n)位。我们提出了四种无等待共识算法,仅需要常数存储复杂度。(两种近似共识和两种随机化二元共识算法。)其中一种随机化算法以O(n log n)次期望广播终止。我们所有的共识算法都是匿名的,意味着在算法层面,节点不需要具有唯一标识符。

英文摘要:

This paper studies the power of the "abstract MAC layer" model in a single-hop asynchronous network. The model captures primitive properties of modern wireless MAC protocols. In this model, Newport [PODC '14] proves that it is impossible to achieve deterministic consensus when nodes may crash. Subsequently, Newport and Robinson [DISC '18] present randomized consensus algorithms that terminate with O(n3 log n) expected broadcasts in a system of n nodes. We are not aware of any results on other fault-tolerant distributed tasks in this model. We first study the computability aspect of the abstract MAC layer. We present a wait-free algorithm that implements an atomic register. Furthermore, we show that in general, k-set consensus is impossible. Second, we aim to minimize storage complexity. Existing algorithms require Ω(n log n) bits. We propose four wait-free consensus algorithms that only need constant storage complexity. (Two approximate consensus and two randomized binary consensus algorithms.) One randomized algorithm terminates with O(n log n) expected broadcasts. All our consensus algorithms are anonymous, meaning that at the algorithm level, nodes do not need to have a unique identifier.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑