Leader election in the presence of link failures

Gurdip Singh

doi:10.1109/71.491576

Leader election in the presence of link failures

Gurdip Singh

Research output: Contribution to journal › Article › peer-review

66 Scopus citations

Abstract

We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2 -1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N²).

Original language	English (US)
Pages (from-to)	231-236
Number of pages	6
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	7
Issue number	3
DOIs	https://doi.org/10.1109/71.491576
State	Published - 1996
Externally published	Yes

Keywords

Complete networks
Distributed algorithms
Election
Intermittent link failures
Message complexity

ASJC Scopus subject areas

Signal Processing
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/71.491576

Cite this

@article{5267e4fdb92b4f61a90c937ddec05b66,

title = "Leader election in the presence of link failures",

abstract = "We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2 -1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N2).",

keywords = "Complete networks, Distributed algorithms, Election, Intermittent link failures, Message complexity",

author = "Gurdip Singh",

note = "Funding Information: This work was supported by National Science Foundation grants CCR-9211621 and CCR-9502506.",

year = "1996",

doi = "10.1109/71.491576",

language = "English (US)",

volume = "7",

pages = "231--236",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "3",

}

TY - JOUR

T1 - Leader election in the presence of link failures

AU - Singh, Gurdip

N1 - Funding Information: This work was supported by National Science Foundation grants CCR-9211621 and CCR-9502506.

PY - 1996

Y1 - 1996

N2 - We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2 -1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N2).

AB - We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2 -1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N2).

KW - Complete networks

KW - Distributed algorithms

KW - Election

KW - Intermittent link failures

KW - Message complexity

UR - http://www.scopus.com/inward/record.url?scp=0030108244&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030108244&partnerID=8YFLogxK

U2 - 10.1109/71.491576

DO - 10.1109/71.491576

M3 - Article

AN - SCOPUS:0030108244

SN - 1045-9219

VL - 7

SP - 231

EP - 236

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 3

ER -

Leader election in the presence of link failures

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this