Gracefully degrading consensus and k-set agreement in directed dynamic networks
Theoretical Computer Science, pp. 41-77, 2018.
We study distributed agreement in synchronous directed dynamic networks, where an omniscient message adversary controls the presence/absence of communication links. We prove that consensus is impossible under a message adversary that guarantees weak connectivity only, and introduce eventually vertex-stable source components (VSSCs) as a m...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)