An O(n)-time self-stabilizing leader election algorithm

Datta, Ajoy K.

doi:10.1016/j.jpdc.2011.05.008

An O(n)-time self-stabilizing leader election algorithm

2011-11-01

27

PRE

AI

DOI：10.1016/j.jpdc.2011.05.008

原文链接

原文求助

摘要

En 中文

A self-stabilizing asynchronous distributed leader election algorithm is presented. The algorithm works for any connected unoriented (bidirectional) network with unique IDs. The solution also constructs a BFS tree of the network rooted at the elected leader. The proposed solution is silent and works under the unfair daemon. The algorithm stabilizes in O(n) rounds, where n is the number of processes in the network. (C) 2011 Elsevier Inc. All rights reserved.

Keyword:

Distributed algorithm

Leader election

Self-stabilization

Silent algorithm

Unfair daemon

An O(n)-time self-stabilizing leader election algorithm

摘要

期刊

机构

引用论文