A self-stabilizing quorum-based protocol for maxima computing | Distributed Computing Skip to main content
Log in

A self-stabilizing quorum-based protocol for maxima computing

  • Orignial articles
  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract.

The goal of decentralized consensus protocols is to exchange information among nodes so that each node acquires the information held by every other node in the system. This paper presents a quorum-based, self-stabilizing maxima finding protocol which is based on a decentralized consensus protocol. The protocol exchanges information with less delay than existing ring-based, self-stablizing protocols. Furthermore, quorums can be composed, and the resulting composite quorums can be used to efficiently obtain a solution for any internetwork.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: October 1999 / Accepted: June 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiao, Y., Mizuno, M. & Neilsen, M. A self-stabilizing quorum-based protocol for maxima computing. Distrib Comput 15, 49–55 (2002). https://doi.org/10.1007/s446-002-8030-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s446-002-8030-8

Navigation