Computer Science > Distributed, Parallel, and Cluster Computing
arXiv:2408.10779 (cs)
[Submitted on 20 Aug 2024]
Title:The Power of Abstract MAC Layer: A Fault-tolerance Perspective
View a PDF of the paper titled The Power of Abstract MAC Layer: A Fault-tolerance Perspective, by Qinzi Zhang and Lewis Tseng
View PDFAbstract: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 {\Omega}(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.
| Comments: | A full version for our DISC24 paper |
| Subjects: | Distributed, Parallel, and Cluster Computing (cs.DC) |
| Cite as: | arXiv:2408.10779 [cs.DC] |
| (orarXiv:2408.10779v1 [cs.DC] for this version) | |
| https://doi.org/10.48550/arXiv.2408.10779 arXiv-issued DOI via DataCite |
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled The Power of Abstract MAC Layer: A Fault-tolerance Perspective, by Qinzi Zhang and Lewis Tseng
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.