Symmetry Breaking in Anonymous Networks: Characterizations

Abstract

We characterize exactly the cases in which it is possible to elect a leader in an anonymous network of processors by a deterministic algorithm, and we show that for every network there is a weak election algorithm (i.e., if election is impossible all processors detect this fact in a distributed way). 

Topics

  • Presentations referencing similar topics