Affordable Access

Leader Election in Hyper-Butterfly Graphs

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Computer Science
  • Design


Leader election in a network is one of the most important problems in the area of distributed algorithm design. Consider any network of nodes; a node is defined to be any node of the network unambiguously identified by some characteristics (unique from all other nodes). A leader election process is defined to be a uniform algorithm (code) executed at each node of the network; at the end of the algorithm execution, exactly one node is elected the and all other nodes are in the non-leader state [GHS83, LMW86, Tel93, Tel95a, SBTS01]. In this paper, our purpose is to propose an election algorithm for the oriented hyper butterfly networks with messages.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

A Self-Stabilizing Leader Election Algorithm for T...

on Journal of Parallel and Distri... Jan 01, 1996

Linear election in pancake graphs

on Information Processing Letters Jan 01, 2008
More articles like this..