Networks and distributed computation: concepts, tools, and algorithms
Networks and distributed computation: concepts, tools, and algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Probabilistic Analysis of an Election Algorithm in a Tree
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Handbook of Discrete and Combinatorial Mathematics, Second Edition
Handbook of Discrete and Combinatorial Mathematics, Second Edition
Uniform election in trees and polyominoids
Discrete Applied Mathematics
| Hi-index | 0.00 |
We design and analyze a randomized one-passage election algorithm in trees based on a result of Angluin in [Proceedings of the 12th Symposium on Theory of Computing, 1980, p. 82]. The election process is a distributed elimination scheme which removes leaves one-by-one reducing the tree to a single vertex, called the leader (or elected vertex). We define a locally computable parameter guiding randomly the elimination process. As a particular instance, we provide a parameter assignment in a Markovian type random process in which all vertices have the same chance of being elected.