
TL;DR
This paper characterizes the minimal message survivability needed in synchronous dynamic networks with asymmetric links to solve wait-free read-write tasks, identifying a strongest adversary that matches read-write solvability.
Contribution
It provides a complete characterization of message adversaries that enable solving any wait-free read-write task, simplifying the proof of protocol complex properties.
Findings
Identifies a strongest message adversary for wait-free read-write tasks.
Shows this adversary matches the power of processor failure models like ABD.
Simplifies the topological proof of task solvability in dynamic networks.
Abstract
We consider synchronous dynamic networks which like radio networks may have asymmetric communication links, and are affected by communication rather than processor failures. In this paper we investigate the minimal message survivability in a per round basis that allows for the minimal global cooperation, i.e., allows to solve any task that is wait-free read-write solvable. The paper completely characterizes this survivability requirement. Message survivability is formalized by considering adversaries that have a limited power to remove messages in a round. Removal of a message on a link in one direction does not necessarily imply the removal of the message on that link in the other direction. Surprisingly there exist a single strongest adversary which solves any wait-free read/write task. Any different adversary that solves any wait-free read/write task is weaker, and any stronger…
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 · Functional Brain Connectivity Studies · Advanced Operator Algebra Research
