Robust Leader Election in a Fast-Changing World

FOMC, pp. 38-49, 2013.

Cited by: 3|Views6
EI

Abstract:

We consider the problem of electing a leader among nodes in a highly dynamic network where the adversary has unbounded capacity to insert and remove nodes (including the leader) from the network and change connectivity at will. We present a randomized Las Vegas algorithm that (re)elects a leader in O(D\log n) rounds with high probabilit...More

Code:

Data:

Your rating :
0

 

Tags
Comments