A gossip-based asynchronous aggregation protocol for P2P systems

Gossip-based protocols are a popular approach to estimate aggregates in P2P systems. For gossip-based aggregation protocols, the accuracy of the estimated aggregate heavily depends upon conservation of the system mass. In this paper, we present a gossip-based asynchronous aggregation protocol. Our protocol conserves the system mass under asynchronous settings and churn. Simulation results show that our proposed protocol converges to the correct system aggregate even in the presence of very dynamic and adverse network delays and under churn.