Leader election in the presence of link failures

Research output: Contribution to journalArticlepeer-review

61 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(N2).

Original languageEnglish (US)
Pages (from-to)231-236
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number3
DOIs
StatePublished - Dec 1 1996
Externally publishedYes

Keywords

  • Complete networks
  • Distributed algorithms
  • Election
  • Intermittent link failures
  • Message complexity

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this