TL;DR
This paper introduces a formal model for anonymous systems, focusing on anonymous failure detectors, demonstrating their equivalence to classic detectors, and classifying their relationships to advance understanding of anonymous distributed computing.
Contribution
It presents a formal model of anonymous systems, introduces three anonymous failure detectors, and establishes their equivalence to classic detectors with a classification scheme.
Findings
Anonymous failure detectors can solve consensus.
They are equivalent to their classic counterparts.
The paper provides a classification of anonymous failure detectors.
Abstract
We put forward a formal model of anonymous systems. And we concentrate on the anonymous failure detectors in our model. In particular, we give three examples of anonymous failure detectors and show that they can be used to solve the consensus problem and that they are equivalent to their classic counterparts. Moreover, we show some relationship among them and provide a simple classification of anonymous failure detectors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Optimization and Search Problems · Cryptography and Data Security