Open Access. Powered by Scholars. Published by Universities.®
Digital Communications and Networking
UNLV Theses, Dissertations, Professional Papers, and Capstones
Computer networks; Electronic data processing — Distributed processing
Articles 1 - 1 of 1
Full-Text Articles in Computer Engineering
Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti
Self-Stabilizing Leader Election In Dynamic Networks, Hema Piniganti
UNLV Theses, Dissertations, Professional Papers, and Capstones
The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network will eventually reach a legitimate configuration.
Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that the algorithm is starting over again from an arbitrary state. There are a number of such algorithms in the …