Leader election in the presence of link failures

Gurdip Singh

Research output: Contribution to journalArticlepeer-review

65 Scopus citations


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
Issue number3
StatePublished - 1996
Externally publishedYes


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

ASJC Scopus subject areas

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


Dive into the research topics of 'Leader election in the presence of link failures'. Together they form a unique fingerprint.

Cite this