|
Dobiesław Wróblewski
Universal Election Algorithm using forward links
970
Abstract
We consider finite connected undirected graphs as a model for anonymous computer networks. In this framework we show a general purpose distributed election protocol, which uses forward links over the standard communication channels between processors. The forward links are represented in the form of structured labels, so the algorithm is a graph relabelling system, however its transformations are not local in the classical sense. For this particular algorithm we define a new notion of extended locality and claim that it still conforms to the intuitive meaning of the locality term.
Keywords : distributed computing, election, enumeration, coverings, ambiguous graphs, anonymous networks.
|
|
 |
 |
