General and efficient decentralized consensus protocols

  • Bermond Jean-Claude
  • Konig Jean-Claude
  • Raynal Michel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)


In this article we are interested in computing a function or a predicate whose arguments are distributed on the nodes (or processors) of a network. When the computation is finished two cases may occur according to the application. The result is either known by each node or distributed on each node. Furthermore during the computation all the nodes have the same behaviour (there is no privileged node). We shall call the distributed algorithms which achieve such computations "consensus protocols".

A general and efficient consensus protocol is presented here. It is based on the concepts of phases and filterings. This algorithm can be applied to many problems, for example to compute a minimum routing table for the nodes of the network or to find the maximum of the identities of the nodes (election). If we denote by D the diameter of the network and by m the number of channels (communication links), its message complexity is at most 2(D+1)m and its time complexity is at most (2D+1)τ, where τ is the maximum transmission delay on a channel.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A85]
    Awerbuch B. "Complexity of Network synchronization", Journal of the ACM, 32, 4, 1985, 804–823.CrossRefGoogle Scholar
  2. [BDQ86]
    Bermond J-C., Delorme C., Quisquater J-J. "Strategies for Interconnection Networks: Some Methods from Graph Theory", Journal of Parallel and Distributed Computing, 4 1986, 433–449.CrossRefGoogle Scholar
  3. [B87]
    Bougé L. "Modularité et symétrie pour les Systèmes répartis", Thèse d'Etat, Paris, March 1987.Google Scholar
  4. [HP85]
    Harel D., Pnueli A. "On the development of reactive systems", in Logic and Models of Concurrent systems, NATO ASI Series F 13, Apt. Ed., 1985 477–498.Google Scholar
  5. [G82]
    Gallagher R.G. Distributed minimum hop algorithms. MIT, Tech. Depart. LIDS-P-1175, 1982.Google Scholar
  6. [K87]
    Konig J-C. "Les réseaux d'interconnection et les algorithmes distribués", Thèse, Orsay, April 1987.Google Scholar
  7. [LA86]
    Lakshman T.V., Agrawala A.K. "Efficient decentralized Consensus Protocols", IEEE Trans. on Software Engineering, Vol SE12, 5, 1986, 600–607.Google Scholar
  8. [R87]
    Raynal M. "Systèmes Répartis et Réseaux, concepts outils et algorithmes", Eyrolles, 1987, 200 p.Google Scholar
  9. [S86]
    Santoro N. Problem 5, in Distributed Algorithms on Graphs, Proc 1st International Workshop on distributed algorithms, Carleton University Press, 1986, 164.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Bermond Jean-Claude
    • 1
  • Konig Jean-Claude
    • 1
  • Raynal Michel
    • 2
  1. 1.LRI, Informatique, U.A. C.N.R.S. 410, bât 490Université Paris-SudOrsayFrance
  2. 2.IRISA, Université de RennesRennesFrance

Personalised recommendations