Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Workshop on Self-Organizing Systems

IWSOS 2012: Self-Organizing Systems pp 104–108Cite as

  1. Home
  2. Self-Organizing Systems
  3. Conference paper
Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study

Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study

  • Alexander Gogolev18 &
  • Christian Bettstetter18,19 
  • Conference paper
  • 851 Accesses

  • 1 Citations

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7166)

Abstract

This short paper studies distributed consensus algorithms with focus on their robustness against communication errors. We report simulation results to verify and assess existing algorithms. Gacs-Kurdyumov-Levin and simple majority rule are evaluated in terms of convergence rate and speed as a function of noise and network topology.

Keywords

  • Networked systems
  • self-organization
  • consensus
  • robustness

Download conference paper PDF

References

  1. Moreira, A.A., Mathur, A., Diermeier, D., Amaral, L.: Efficient system-wide coordination in noisy environments. Proc. National Academy of Sciences of the USA 101(33), 12085–12090 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Gacs, P., Kurdyumov, G.L., Levin, L.A.: One dimensional uniform arrays that wash out finite islands (in Russian). Problemy Peredachi Informatsii 14, 92–98 (1978)

    Google Scholar 

  3. Boyd, R., Peter, J.R.: Why does culture increase human adaptability? Ethology and Sociobiology 16, 125–143 (1995)

    CrossRef  Google Scholar 

  4. Heyes, C.M., Galef Jr., B.G. (eds.): Social Learning in Animals: The Roots of Culture. Academic Press, San Diego (1996)

    Google Scholar 

  5. Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press (1999)

    Google Scholar 

  6. Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)

    MATH  Google Scholar 

  7. Newman, M.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Networked and Embedded Systems, University of Klagenfurt, Austria

    Alexander Gogolev & Christian Bettstetter

  2. Lakeside Labs GmbH, Klagenfurt, Austria

    Christian Bettstetter

Authors
  1. Alexander Gogolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Bettstetter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA, Delft, The Netherlands

    Fernando A. Kuipers

  2. Department of Telematics, Norwegian University of Science and Technology, O.S. Bragstads plass 2B, 7491, Trondheim, Norway

    Poul E. Heegaard

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Gogolev, A., Bettstetter, C. (2012). Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study. In: Kuipers, F.A., Heegaard, P.E. (eds) Self-Organizing Systems. IWSOS 2012. Lecture Notes in Computer Science, vol 7166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28583-7_11

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-28583-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28582-0

  • Online ISBN: 978-3-642-28583-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature