Gracefully degrading consensus and k-set agreement in directed dynamic networks

Theoretical Computer Science, pp. 41-77, 2018.

Cited by: 34|Views6
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments