Robust Epidemic Aggregation Under Churn

In large-scale distributed systems data aggregation is a fundamental task that provides a global synopsis over a distributed set of data values. Epidemic protocols are based on a randomised communication paradigm inspired by biological systems and have been proposed to provide decentralised, scalable and fault-tolerant solutions to the data aggregation problem. However, in epidemic aggregation, nodes failure and churn have a detrimental effect on the accuracy of the local estimates of the global aggregation target. In this paper, a novel approach, the Robust Epidemic Aggregation Protocol (REAP), is proposed to provide robustness in the presence of churn by detecting three distinct phases in the aggregation process. An analysis of the impact of each phase over the estimation accuracy is provided. In particular, a novel mechanism is introduced to improve the phase that is most critical for the protocol accuracy. REAP is validated by means of simulations and is shown to achieve convergence with a good level of accuracy for a reasonable range of node churn rates.

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

[2]  Giuseppe Di Fatta,et al.  Convergence Detection in Epidemic Aggregation , 2013, Euro-Par Workshops.

[3]  Giancarlo Fortino,et al.  Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks , 2013, J. Parallel Distributed Comput..

[4]  P. S. Almeida,et al.  Flow updating: Fault-tolerant aggregation for dynamic networks , 2015, J. Parallel Distributed Comput..

[5]  Giuseppe Di Fatta,et al.  Agreement in Epidemic Information Dissemination , 2016, IDCS.

[6]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[7]  Dominique Gaïti,et al.  Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey , 2009, MACE.

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

[9]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[10]  Sanjay Ranka,et al.  Aggregation methods for large-scale sensor networks , 2008, TOSN.

[11]  Giuseppe Di Fatta,et al.  Epidemic failure detection and consensus for extreme parallelism , 2018, Int. J. High Perform. Comput. Appl..

[12]  Indranil Gupta,et al.  Decentralized Schemes for Size Estimation in Large and Dynamic Groups , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[13]  Shanika Karunasekera,et al.  Gossip-based asynchronous and robust aggregation protocol — A pessimistic approach , 2011, 2011 IEEE Consumer Communications and Networking Conference (CCNC).