Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
نویسنده
چکیده
We consider the problem of leader election in asynchronous oriented N-node complete networks. We present a leader election algorithm with O(N) message and O(log log N) time complexity. The message complexity is optimal and the time complexity is the best possible under the assumption of message optimality. The best previous leader election algorithm for asynchronous oriented complete networks by Singh 16] achieves O(N) message and O(log N) time complexity.
منابع مشابه
Asynchronous Bounded Expected Delay Networks
The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the ABE model requires only a bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all as...
متن کاملSublinear Bounds for Randomized Leader Election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...
متن کاملEecient Leader Election Using Sense of Direction *
This paper presents a protocol for leader election in complete networks with a sense of direction. Sense of direction provides nodes the capability of distinguishing between their incident links according to a global scheme. We propose a protocol for leader election which requires O(N) messages and O(log N) time. The protocol is message optimal and the time complexity is a signiicant improvemen...
متن کاملFast leader election in anonymous rings with bounded expected delay
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 algo...
متن کاملA MODULAR TECHNIQUE FOR THE DESIGN OF EFFICIENT DISTRffiUTED LEADER FINDING ALGORITHMS
A general, modular technique for designing efficient leader finding algorithms in distributed. asynchronous networks is developed. This technique reduces the problem of efficient leader finding to a simpler problem of efficient serial traversing of the corresponding network. The message complexity of the resulting leader finding algorithms is bounded by (f(n)+n)(log2k+ 1) [or (f(m)+n)(log2k+ 1)...
متن کامل