Distributed Multivalued Consensus

Conference paper

Abstract

Motivated by the distributed binary consensus algorithm in [4] we propose a distributed algorithm for the multivalued consensus problem. In multivalued consensus problem, each node initially chooses from one of k available choices and the objective of all nodes is to find the choice which was initially chosen by the majority in a distributed fashion. Although the voter model (e.g. [1]) can be used to find a consensus on multiple choices, it only guarantees the consensus and not the consensus on the majority. We derive the time of convergence and an upper bound for the probability of error of our proposed algorithm which shows that, similar to [4], having an additional state would result in significant improvement of both convergence time and probability of error for complete graphs. We also show that our algorithm could be used in Erdos-Renyi and regular graphs by using simulations.

Notes

Acknowledgments

Moez Draief is supported by QNRF through NPRP grant number 09-1150-2-148.

References

  1. 1.
    Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput. 171(2), 248–268 (2002)Google Scholar
  2. 2.
    Jung, K., Kim, B.Y., Vojnovic, M.: Distributed ranking in networks with limited memory and communication. http://research.microsoft.com (2011)Google Scholar
  3. 3.
    Kurtz, T.G.: Approximation of Population Processes. Society for Industrial and Applied Mathematics-Social Science, Philadelphia (1981)Google Scholar
  4. 4.
    Perron, E., Vasudevan, D., Vojnovic, M.: Using three states for binary consensus on complete graphs. In: Proceedings of IEEE INFOCOM, pp. 2527–2535. April (2009)Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Intelligent Systems and Networks Group, Department of Electrical and Electronic EngineeringImperial College LondonLondonUK

Personalised recommendations