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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
Ma, Y., Jamalipour, A.: An epidemic P2P content search mechanism for intermittently connected mobile ad hoc networks. In: IEEE GLOBECOM, pp. 1–6 (2009)
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
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)
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)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. 25(3), 8 (2007)
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)
Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: inexpensive membership management for unstructured p2p overlays. J. Netw. Syst. Manage. 13(2), 197–217 (2005)
Ogston, E., Jarvis, S.A.: Peer-to-peer aggregation techniques dissected. Int. J. Parallel Emerg. Distrib. Syst. 25(1), 51–71 (2010)
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
Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439–561 (2006)
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
Makridakis, S., Hibon, M.: The M3-competition: results, conclusions and implications. Int. J. Forecast. 16, 451–476 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)