Skip to main content
SpringerLink
Log in

Connectivity Recovery in Epidemic Membership Protocols

  • Conference paper
  • First Online:
Internet and Distributed Computing Systems (IDCS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9258))

Included in the following conference series:

Abstract

Epidemic protocols are a bio-inspired communication and computation paradigm for extreme-scale network system based on randomized communication. The protocols rely on a membership service to build decentralized and random overlay topologies. In a weakly connected overlay topology, a naive mechanism of membership protocols can break the connectivity, thus impairing the accuracy of the application. This work investigates the factors in membership protocols that cause the loss of global connectivity and introduces the first topology connectivity recovery mechanism. The mechanism is integrated into the Expander Membership Protocol, which is then evaluated against other membership protocols. The analysis shows that the proposed connectivity recovery mechanism is effective in preserving topology connectivity and also helps to improve the application performance in terms of convergence speed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bansod, N., Malgi, A., Choi, B.K., Mayo, J.: Muon: epidemic based mutual anonymity in unstructured p2p networks. Comput. Netw. 52(5), 915–934 (2008)

    Article  MATH  Google Scholar 

  2. Sheng, Di., Wang, C-L., Hu, D.H.: Gossip-based dynamic load balancing in an autonomous desktop grid. In Proceedings of the 10th International Conference on High-Performance Computing in Asia-Pacific Region, pp. 85–92 (2009)

    Google Scholar 

  3. Ma, Y., Jamalipour, A.: An epidemic P2P content search mechanism for intermittently connected mobile ad hoc networks. In: IEEE GLOBECOM, pp. 1–6 (2009)

    Google Scholar 

  4. Galzarano, S., Savaglio, C., Liotta, A., Fortino, G.: Gossiping-based aodv for wireless sensor networks. In: IEEE International Conference on in Systems, Man and Cybernetics (SMC 2013), pp. 26–31, October 2013

    Google Scholar 

  5. Strakov, H., Niederbrucker, G., Gansterer, W.N.: Fault tolerance properties of gossip-based distributed orthogonal iteration methods. Proc. Int. Conf. Comput. Sci. 18, 189–198 (2013)

    Article  Google Scholar 

  6. Soltero, P., Bridges, P., Arnold, D., Lang, M.: A gossip-based approach to exascale system services. In: Proceedings of the 3rd International Workshop on Runtime and Operating Systems for Supercomputers, Services (ROSS 2013), ACM (2013)

    Google Scholar 

  7. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. 25(3), 8 (2007)

    Article  Google Scholar 

  8. Blasa, F., Cafiero, S., Fortino, G., Di Fatta, G.: Symmetric push-sum protocol for decentralised aggregation. In: Proceeidngs of the International Conference on Advances in P2P Systems, pp. 27–32 (2011)

    Google Scholar 

  9. Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: inexpensive membership management for unstructured p2p overlays. J. Netw. Syst. Manage. 13(2), 197–217 (2005)

    Article  Google Scholar 

  10. Ogston, E., Jarvis, S.A.: Peer-to-peer aggregation techniques dissected. Int. J. Parallel Emerg. Distrib. Syst. 25(1), 51–71 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Poonpakdee, P., Di Fatta, G.: Expander graph quality optimisation in randomised communication. In: IEEE International Conference on Data Mining Workshop (ICDMW 2014), pp. 597–604, December 2014

    Google Scholar 

  12. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439–561 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Montresor, A., Jelasity, M.: PeerSim: A scalable P2P simulator. In: Proceedings of the 9th International Conference on Peer-to-Peer (P2P 2009), pp. 99–100, September 2009

    Google Scholar 

  14. Makridakis, S., Hibon, M.: The M3-competition: results, conclusions and implications. Int. J. Forecast. 16, 451–476 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Systems Engineering, University of Reading, Whiteknights, Reading, Berkshire, RG6 6AY, UK

    Pasu Poonpakdee & Giuseppe Di Fatta

Authors
  1. Pasu Poonpakdee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Di Fatta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pasu Poonpakdee .

Editor information

Editors and Affiliations

  1. School of Systems Engineering, University of Reading, Reading, Berkshire, United Kingdom

    Giuseppe Di Fatta

  2. Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, University of Calabria Dipartimento di Ingegneria Informat, Rende, Italy

    Giancarlo Fortino

  3. School of Logistics and Engineer, University of Technology Wuhan, Wuhan, China

    Wenfeng Li

  4. CSIRO ICT, Acton, Australia

    Mukaddim Pathan

  5. School of Systems Engineering, University of Reading, Whiteknights, Reading, United Kingdom

    Frederic Stahl

  6. Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, University of Calabria, Rende, Italy

    Antonio Guerrieri

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Poonpakdee, P., Di Fatta, G. (2015). Connectivity Recovery in Epidemic Membership Protocols. In: Di Fatta, G., Fortino, G., Li, W., Pathan, M., Stahl, F., Guerrieri, A. (eds) Internet and Distributed Computing Systems. IDCS 2015. Lecture Notes in Computer Science(), vol 9258. Springer, Cham. https://doi.org/10.1007/978-3-319-23237-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23237-9_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23236-2

  • Online ISBN: 978-3-319-23237-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation