Gossip-based protocols are one of the popular approaches to estimate aggregates in large scale distributed systems. In this paper, we propose a gossip-based asynchronous and robust protocol to compute aggregates. In our protocol, each node employs the proposed pessimistic approach to exchange its local estimate with one of its neighbors and also uses the proposed recovery scheme which conserves the system mass in the presence of asynchrony and churn. The simulation results presented in this paper show that our protocol yields accurate aggregates in comparatively lesser time.
展开▼
