Four Shades of Deterministic Leader Election in Anonymous Networks

Cited by: 0|Bibtex|Views2|Links

Abstract:

Leader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way, where one node outputs 'leader' and all other nodes output 'non-leader', or in a strong way, where all nodes must also learn which node is the leader. If the ...More

Code:

Data:

Your rating :
0

 

Tags
Comments