Estimating Aggregates on a Peer-to-Peer Network

As Peer-to-Peer (P2P) networks become popular, there is an emerging need to collect a variety of statistical summary information about the participating nodes. The P2P networks of today lack mechanisms to compute even such basic aggregates as min, max, sum, count or avg. In this paper, we define and study the NodeAggregation problem that is concerned with aggregating data stored at nodes in the network. We present generic schemes that can be used to compute any of the basic aggregation functions accurately and robustly. Our schemes can be used as building blocks for tools to collect statistics on network topology, user behavior and other node characteristics.

[1]  Christos Faloutsos,et al.  ANF: a fast and scalable tool for data mining in massive graphs , 2002, KDD.

[2]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[3]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[4]  Brian Larson,et al.  Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems , 2002, NETWORKING Workshops.

[5]  Steve Chien,et al.  Approximating Aggregate Queries about Web Pages via Random Walks , 2000, VLDB.

[6]  Marc Najork,et al.  On near-uniform URL sampling , 2000, Comput. Networks.

[7]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[8]  Robbert van Renesse,et al.  Scalable and Secure Resource Location , 2000, HICSS.

[9]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[10]  Philippe Flajolet,et al.  Probabilistic counting , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[12]  Indranil Gupta,et al.  Scalable fault-tolerant aggregation in large process groups , 2001, 2001 International Conference on Dependable Systems and Networks.

[13]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[14]  Noga Alon,et al.  The Space Complexity of Approximating the Frequency Moments , 1999 .

[15]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.