Brief announcement: Practical summation via gossip

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 390-391

  Terpstra, Wesley W ^a   Leng, Christof ^a   Buchmann, Alejandro P ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Gossip; Peer to peer; Simulation; Sums

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; PROBLEM SOLVING;

GOSSIP; PEER-TO-PEER; PUSH-SUM ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 36849054516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281188     Document Type: Conference Paper

References (6)

1. B. Bollobás. Random Graphs. Cambridge University Press, 2nd edition, 2001.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip Algorithms: Design, Analysis and Applications. In INFOCOMM, pages 1653-1664, 2005.
3. D. Kempe, A. Dobra, and J. Gehrke. Gossip-Based Computation of Aggregate Information. In FOCS, pages 482-491, 2003.
4. L. Massoulié, E. Le Merrer, A.-M. Kermarrec, and A. Ganesh. Peer Counting and Sampling in Overlay Networks: Random Walk Methods. In PODC, pages 123-132, 2006.
5. D. Mosk-Aoyama and D. Shah. Computing Separable Functions via Gossip. In PODC, pages 113-122, 2006.
6. W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann. BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search. To appear in SIGCOMM, 2007.