Fast leader election in anonymous rings with bounded expected delay

Abstract

We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. Thus, the ABE model captures asynchrony that occurs in sensor networks and ad-hoc networks.At the example of an election algorithm, we show that the minimal assumptions of ABE networks are sufficient for the development of efficient algorithms. For anonymous, unidirectional ABE rings of known size n we devise a probabilistic election algorithm having average message and time complexity O(n).

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies

“…In Ref. 15 , Bakhshi et al proposed a fast leader election algorithm for asynchronous anonymous rings where there is a known bound on the expected message delay. This assumption strengthens the properties of asynchronous networks and hence makes the algorithm fall between the extremes of synchronous and asynchronous.…”

“…Bakhshi et al claim the algorithm in Ref. 15 as the first leader election algorithm having linear expected time and message complexity in the settings of asynchronous anonymous rings with no fixed bound on the message delay.…”

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

“…A probabilistic election algorithm with average message complexity O (n) for anonymous, unidirectional asynchronous bounded expected delay network is presented in [8]. Every node is in one of the following states: idle, active, passive or leader.…”

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

“…Bakhshi et al [14] presented a probabilistic elect ion algorith m with average message complexity O (n) for anonymous, unidirectional asynchronous bounded expected delay network. Every node is in one of the following states: id le, active, passive or leader wh ich idle is the defau lt one.…”

“…Therefore, the worst case of the algorithm is calculated by (14). It should be mentioned this number is achieved when all the VM in cloud are crashed except in former, so there is no need to inform the others about the elected coordinator, which is the informer itself.…”