Gossip-based computation of aggregate information

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 482-491

  Kempe, David ^a   Dobra, Alin ^a   Gehrke, Johannes ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING; AGGREGATES; COMPUTER SCIENCE; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION DISSEMINATION; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; PEER TO PEER NETWORKS; SCALABILITY; STRESSES; TEMPERATURE SENSORS;

AGGREGATE INFORMATION; DIFFUSION SPEED; GOSSIP-STYLE PROTOCOLS;

NETWORK PROTOCOLS; DISTRIBUTED COMPUTER SYSTEMS;

AGGREGATE FUNCTION; DIFFUSION SPEED; DISTRIBUTED SYSTEMS; FAULT TOLERANT SYSTEMS; FAULT-TOLERANT; GOSSIP-BASED PROTOCOL; PARADIGM SHIFTS; PEER-TO-PEER COMPUTING;

EID: 0344118858     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. Book in preparation - preprint available at http://www.stat.Berkeley.EDU/users/aldous.
2. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 5:567-583, 1986.
3. N. Alon, P. Gibbons, Y. Matias, and M. Szegedy. Tracking join and self-join sizes in limited storage. JCSS, 64:719-747, 2002.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58:137-147, 1999.
5. N. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 1975.
6. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Message multicasting in heterogeneous networks. SIAM J. on Computing, 30:347-358, 2001.
7. M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani. Estimating aggregates on a peer-to-peer network. Technical report, Stanford University, 2003. URL: http://dbpubs.stanford.edu/pub/2003-24.
8. K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM TOCS, 17:41-88, 1999.
9. I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, pages 311-320, 2000.
10. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. 7th ACM SOSP, pages 1-12, 1987.
11. A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi. Processing complex aggregate queries over data streams. In Proc. 2002 ACM SIGMOD, pages 61-72, 2002.
12. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1:447-460, 1990.
13. 1-difference algorithm for massive data streams. In Proc. 40th IEEE FOCS, pages 501-511, 1999.
14. P. Flajolet and N. Martin. Probabilistic counting algorithms for data base applications. JCSS, 31:182-209, 1985.
15. p-difference algorithm for massive data streams. In Proc. 17th STACS, pages 193-204, 2000.
16. A. Frieze and G. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discr. Appl. Mathematics, 10:57-77, 1985.
17. I. Gupta, R. van Renesse, and K. Birman. Scalable fault-tolerant aggregation in large process groups. In Proc. Conf. on Dependable Systems and Networks, pages 433-442, 2001.
18. S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
19. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st IEEE FOCS, pages 189-197, 2000.
20. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. 41st IEEE FOCS, pages 565-574, 2000.
21. D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In Proc. 43rd IEEE FOCS, pages 471-480, 2002.
22. P. Keyani, B. Larson, and M. Senthil. Peer pressure: Distributed recovery from attacks in peer-to-peer systems. In Intl. Workshop on Peer-to-Peer computing, pages 306-320, 2002.
23. L. Lovász. Random walks on graphs: a survey. In D. Miklos, V. T. os, and T. Szonyi, editors, Combinatorics, Paul Erdos is Eighty, Vol. 2, pages 353-398. János Bolyai Mathematical Society, Budapest, 1996.
24. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proc. 5th Symp. on Operating Systems Design and Implementation, 2002.
25. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1990.
26. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter P2P networks. In Proc. 42nd IEEE FOCS, pages 492-499, 2001.
27. B. Pittel. On spreading a rumor. SIAM J. Applied Math., 47:213-223, 1987.
28. G. Pottie and W. Kaiser. Wireless integrated network sensors. CACM, 43:51-58, 2000.
29. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. In Proc. 35th IEEE FOCS, pages 202-213, 1994.
30. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. 18th IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
31. L. Saloff-Coste. Lectures on finite markov chains. In Lecture Notes in Mathematics 1665, pages 301-408. Springer, 1997. École d'été de St. Flour 1996.
32. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM, pages 149-160, 2001.
33. N. Thaper, S. Guha, P. Indyk, and N. Koudas. Dynamic multidimensional histograms. In Proc. 2002 ACM SIGMOD, pages 428-439, 2002.
34. R. van Renesse, K. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM TOCS, 2003.
35. Y. Yao and J. Gehrke. Query processing in sensor networks. In Proc. 1st CIDR, 2003.
36. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, 2001.