Connectivity Recovery in Epidemic Membership Protocols

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.

[1]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[2]  G. Fortino,et al.  Symmetric Push-Sum Protocol for Decentralised Aggregation , 2011, AP2PS 2011.

[3]  Wilfried N. Gansterer,et al.  Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods , 2013, ICCS.

[4]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[5]  Jean Mayo,et al.  MuON: Epidemic based mutual anonymity in unstructured P2P networks , 2008, Comput. Networks.

[6]  Stephen A. Jarvis,et al.  Peer-to-peer aggregation techniques dissected , 2010, Int. J. Parallel Emergent Distributed Syst..

[7]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[8]  Giuseppe Di Fatta,et al.  Expander Graph Quality Optimisation in Randomised Communication , 2014, 2014 IEEE International Conference on Data Mining Workshop.

[9]  Spyros Makridakis,et al.  The M3-Competition: results, conclusions and implications , 2000 .

[10]  Abbas Jamalipour,et al.  An Epidemic P2P Content Search Mechanism for Intermittently Connected Mobile Ad Hoc Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[11]  Márk Jelasity,et al.  PeerSim: A scalable P2P simulator , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[12]  Michael Lang,et al.  A gossip-based approach to exascale system services , 2013, ROSS '13.

[13]  Giancarlo Fortino,et al.  Gossiping-Based AODV for Wireless Sensor Networks , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.