A Highly Available Local Leader Service

Research output: Contribution to journal › Research article › Contributed › peer-review

Contributors

  • Christof Fetzer - , AT&T (Author)
  • Flaviu Cristian - , University of California at San Diego (Author)

Abstract

We define the highly available local leader election problem (G. LeLann, 1977), a generalization of the leader election problem for partitionable systems. We propose a protocol that solves the problem efficiently and give some performance measurements of our implementation. The local leader election service has been proven useful in the design and implementation of several fail-aware services for partitionable systems.

Details

Original languageEnglish
Pages (from-to)603-618
Number of pages16
JournalIEEE Transactions on Software Engineering
Volume25
Issue number5
Publication statusPublished - 1999
Peer-reviewedYes
Externally publishedYes

Keywords

Research priority areas of TU Dresden

DFG Classification of Subject Areas according to Review Boards

Keywords

  • Nominations and elections, Protocols, Broadcastin, Measurement, Bridges, Local area networks, Availability, Clocks, Synchronization, highly available local leader electioin service, partitionalbe systems, performance measurements, fail-ware services, timed asynchronous systems, local lieader election, global leader election