Abstract
A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O (logn ) space per process and stabilizes in O (n ) rounds, where n is the number of processes in the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have