Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
