Gossip-based computation of aggregate information
The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Abstract
Over the last decade, we have seen a revolution in connectivity between computers, and a resulting paradigm shift from centralized to highly distributed systems. With massive scale also comes massive instability, as node and link failures become the norm rather than the exception. For such highly volatile systems, decentralized gossip-based protocols are emerging as an approach to maintaining simplicity and scalability while achieving fault-tolerant information dissemination. In this paper, we study the problem of computing aggregates with gossip-style protocols. Our first contribution is an analysis of simple gossip-based protocols for the computation of sums, averages, random samples, quantiles, and other aggregate functions, and we show that our protocols converge exponentially fast to the true answer when using uniform gossip. Our second contribution is the definition of a precise notion of the speed with which a node's data diffuses through the network. We show that this diffusion speed is at the heart of the approximation guarantees for all of the above problems. We analyze the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms. The latter expose interesting connections to random walks on graphs.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As previously remarked, our protocol is a perturbation of the so-called 'push-sum' protocol for averaging studied in [1], [4], [10].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [10]
In the citing paper
“Instead, if every agent knows its out-degree, it is possible for the agents to construct a column stochastic matrix C and perform the following recursions with initialization u (0) = x (0) and v (0) = 1 to achieve the average (push-sum protocol [27]):”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [27]
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844142 · Cited by 2,719
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · UC Berkeley · Cited by 2,266
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Research works printed but not linked: 2
- fong, 2000, An approximate lp-difference algorithm for massive data streams, Proc 17th STACS, 193
- feigenbaum, 1999, An approximate l1-difference algorithm for massive data streams, Proc of 40th IEEE FOCS, 501
Cited by
Items 901–1,000 of 1,004
Li, C., & Yu, C. (2025) · Automatica · doi:10.1016/j.automatica.2025.112702 · Cited by 6
Handel: Practical Multi-Signature Aggregation for Large Byzantine CommitteesPreprint
Bégassat, O., Kolad, B., Gailly, N., & Liochon, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.05132 · Cited by 6
Robustness verification of soft security systems
Bidgoly, A. J. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102632 · Cited by 6
Distributed estimation and optimization in asynchronous networks
Iutzeler, F. (2013) · theses.fr (ABES) · doi:10.70675/3bc3906azc7fez413az854aze520767f5dd7 · Cited by 6
Anonymous, Fault-Tolerant Distributed Queries for Smart Devices
Tremel, E., Birman, K., Kleinberg, R., & Jelasity, M. (2018) · ACM Transactions on Cyber-Physical Systems · doi:10.1145/3204411 · Cited by 6
Black-Box Parallelization for Machine Learning
Kamp, M. (2020) · bonndoc (University of Bonn) · doi:10.26180/12830987 · Cited by 6
Broadcast gossip averaging algorithms: interference and asymptotical error in large networksPreprint
Frasca, P., & Fagnani, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.1292 · Cited by 6
Community-Based Gossip Algorithm for Distributed Averaging
Sirocchi, C., & Bogliolo, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35260-7_3 · Cited by 6
Multi-dimensional data density estimation in P2P networks
Zhou, M., Qian, W., Gong, X., & Zhou, A. (2009) · Distributed and Parallel Databases · doi:10.1007/s10619-009-7045-8 · Cited by 6
Monitoring Cost Reduction in Sensor Networks using Proximity Queries
Haque, M. R., & Naznin, M. (2011) · Journal of Networks · doi:10.4304/jnw.6.1.4-11 · Cited by 6
Gossip-based aggregate computation: computing faster with non address-oblivious schemes
Pietro, R. D., & Michiardi, P. (2008) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1400751.1400837 · Cited by 6
Breaking the $$\log n$$ log n barrier on rumor spreading
Avin, C., & Elsässer⋆, R. (2017) · Distributed Computing · doi:10.1007/s00446-017-0312-4 · Cited by 6
Distributed Multi-Armed Bandit over Arbitrary Undirected Graphs
Zhu, J., & Liu, J. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683253 · Cited by 6
Minimum-cost First-Push-Then-Pull gossip algorithm
Saidi, A. G., & Mohtashemi, M. (2012) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2012.6214229 · Cited by 6
A hybrid approach for estimating document frequencies in unstructured P2P networks
Neumayer, R., Doulkeridis, C., & Nørvåg, K. (2010) · Information Systems · doi:10.1016/j.is.2010.08.006 · Cited by 6
Distributed computing in fault-prone dynamic networks
Brandes, P., & der Heide, F. M. A. (2012) · doi:10.1145/2414815.2414818 · Cited by 6
Efficient Information Dissemination in Dynamic Networks
Yang, Z., Wu, W., Chen, Y.-S., & Zhang, J. (2013) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2013.74 · Cited by 6
Dumard, C., & Riegler, E. (2009) · doi:10.1109/ictel.2009.5158639 · Cited by 6
Computing Frequent Elements Using Gossip
Lahiri, B., & Tirthapura, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69355-0_11 · Cited by 6
An Algorithm for Selecting the Cluster Leader in a Partially Connected Sensor Network
Mozumdar, M., Gregoretti, F., Lavagno, L., & Vanzago, L. (2008) · International Conference on Systems and Networks Communications · doi:10.1109/icsnc.2008.50 · Cited by 6
Distributed Convex Thresholding
Wolff, R. (2015) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2767386.2767387 · Cited by 6
Data aggregation in partially connected networks
Srinivasan, S. M., & Azadmanesh, A. (2008) · Computer Communications · doi:10.1016/j.comcom.2008.11.021 · Cited by 6
Agreement in Epidemic Data Aggregation
Ayiad, M. M., & Fatta, G. D. (2017) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2017.00099 · Cited by 6
Rational Fair Consensus in the Gossip Model
Clementi, A. E. F., Gualà, L., Proietti, G., & Scornavacca, G. (2017) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2017.67 · Cited by 6
An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults
Tseng, L. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69084-1_8 · Cited by 6
Open Problems in a Logic of Gossips
Apt, K. R., & Wojtczak, D. (2019) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.297.1 · Cited by 6
Faster Rumor Spreading with Multiple Calls
Παναγιώτου, Κ., Pourmiri, A., & Sauerwald, T. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45030-3_42 · Cited by 6
Distributed churn measurement in arbitrary networks
Gramoli, V., Kermarrec, A.-M., & Merrer, E. L. (2008) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1400751.1400824 · Cited by 6
NBgossip: An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks
Lu, F. Y., Chia, L.-T., Tay, K.-L., & Chong, W.-H. (2008) · Journal of Computer Science and Technology · doi:10.1007/s11390-008-9144-9 · Cited by 6
Comparing and Refining Gossip Protocols for Fault Tolerance in Wireless P2P Systems
Yang, J. S., Simon, T., Mueller, C., Klan, D., & Sattler, K.-U. (2011) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2011.73 · Cited by 6
Impacts of Asynchrony on Epidemic-Style Aggregation Protocols
Rao, I., Harwood, A., & Karunasekera, S. A. (2010) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2010.130 · Cited by 6
A loosely synchronized gossip-based algorithm for aggregate information computation
Peng, D., Liu, W., Lin, C., Chen, Z., & Song, J. (2008) · Conference on Local Computer Networks · doi:10.1109/lcn.2008.4664203 · Cited by 6
Bridging the Gap between Population and Gossip-based Protocols
Busnel, Y., Bertier, M., & Kermarrec, A.-M. (2008) · HAL · Cited by 6
Trust Estimation and Aggregation in Peer-to-Peer Network Using Differential Gossip AlgorithmPreprint
Gupta, R., & Singh, Y. N. (2012) · arXiv (Cornell University) · Cited by 6
Comparison of Averaging Algorithms for Wireless Sensor Networks
Baldi, M., Chiaraluce, F., & Zanaj, E. (2008) · International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA) · doi:10.1109/ictta.2008.4530166 · Cited by 6
Kowalski, D. R., & Mosteiro, M. A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.07167 · Cited by 6
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
Distributed computing environment: Approaches and applications
Zeng, L., Xu, L., Shi, Z., Wang, M., & Wu, W. (2007) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2007.4413876 · Cited by 5
An Analysis Tool for Push-Sum-Based Distributed Optimization
Lin, Y., Zhu, Z., & Liu, J. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3596669 · Cited by 5
A Decentralized Variance-Reduced Method for Stochastic Optimization Over Directed Graphs
Qureshi, M. I., Xin, R., Kar, S., & Khan, U. A. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413600 · Cited by 5
Distributed aggregative optimization over directed networks with column-stochasticity
Zhou, Q., Zhang, K., Zhou, H., Lü, Q., Liao, X., & Li, H. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.107492 · Cited by 5
Dynamics Based Privacy Protection for Average Consensus on Directed GraphsPreprint
Gao, H. B., & Wang, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.02255 · Cited by 5
DC-DistADMM: ADMM Algorithm for Contsrained Distributed Optimization over Directed GraphsPreprint
Khatana, V., & Salapaka, M. V. (2020) · arXiv (Cornell University) · Cited by 5
Decentralized Optimization On Time-Varying Directed Graphs Under Communication ConstraintsPreprint
Chen, Y., Hashemi, A., & Vikalo, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13189 · Cited by 5
Push–Pull With Device Sampling
Hsieh, Y.-G., Laguel, Y., Iutzeler, F., & Malick, J. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3250339 · Cited by 5
Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension
Melbourne, J., Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3344721 · Cited by 5
A dynamical systems approach to distributed eigenvector computation
Leonardos, S., Preciado, V. M., & Daniilidis, K. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263972 · Cited by 5
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip AlgorithmsPreprint
Liu, Y., Wu, J., Manchester, I. R., & Shi, G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.00120 · Cited by 5
ILGT: Group Reputation Aggregation Method for Unstructured Peer-to-Peer Networks
Matsumoto, A., Mashimo, Y., Yasutomi, M., & Shigeno, H. (2010) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2010.87 · Cited by 5
An Algorithmic Framework for Decentralised Matrix Factorisation
Duriakova, E., Huáng, W., Τράγος, Η., Lawlor, A., Smyth, B., Geraci, J. R., & Hurley, N. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-67661-2_19 · Cited by 5
Compressed Sensing in Wireless Sensor Networks Without Explicit Position Information
Lindberg, C., Amat, A. G. I., & Wymeersch, H. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2623091 · Cited by 5
Randomized gossiping with unreliable communication: Dependent or independent node updates
Shi, G., Johansson, M., & Johansson, K. H. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426729 · Cited by 5
Distributed averaging in wireless sensor networks with triplewise gossip algorithms
Yang, B., Wu, W., & Zhu, G. (2013) · IEEE TENCON Spring Conference (TENCON Spring) · doi:10.1109/tenconspring.2013.6584436 · Cited by 5
Improved Distributed Cooperative Spectrum Sensing (DCSS) For Cognitive Radio Adhoc Network
Rajesh, D. H. (2015) · International Journal of MC Square Scientific Research · doi:10.20894/ijmsr.117.007.001.016 · Cited by 5
Local Structures Determine Performance within Complex Networks
Krumov, L. (2010) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00002321 · Cited by 5
Context Augmented Spectrum Sensing in Cognitive Radio Networks
Gohider, N. (2016) · UWSpace (University of Waterloo) · Cited by 5
Localization in Sensor Networks Using Distributed Low-Rank Matrix Completion
Fan, Y., & Pesavento, M. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447748 · Cited by 5
Practical Continuous Aggregation in Wireless Edge Environments
Costa, P. Á., & Leitao, J. C. A. (2018) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2018.00015 · Cited by 5
A Theory of Packet Flows Based on Law-of-Mass-Action Scheduling
Meyer, T., & Tschudin, C. (2012) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2012.2 · Cited by 5
GOSH! Gossiping Optimization Search Heuristics
Brunato, M., Battiti, R., & Montresor, A. (2007) · Institutional Research Information System (Università degli Studi di Trento) · Cited by 5
LossEstimate: Distributed failure estimation in wireless networks
Pruteanu, A., & Dulman, S. (2012) · Journal of Systems and Software · doi:10.1016/j.jss.2012.07.051 · Cited by 5
Grid Scheduling Based on Collaborative Random Early Detection Strategies
Brugnoli, M., Heymann, E., & Senar, M. À. (2010) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2010.57 · Cited by 5
On indigenous random consensus and averaging dynamics
Touri, B., & Langbort, C. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760870 · Cited by 5
Self-Stabilizing Clock Synchronization in Dynamic Networks
Charron-Bost, B., & de Monterno, L. P. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2022.28 · Cited by 5
Katib, A., Rao, P. R., Barnard, K., & Kamhoua, C. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3301304 · Cited by 5
ARQ-based Average Consensus over Directed Network Topologies with Unreliable Communication LinksPreprint
Makridis, E., Charalambous, T., & Hadjicostis, C. N. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.14699 · Cited by 5
Gossip-based asynchronous and robust aggregation protocol — A pessimistic approach
Rao, I., Harwood, A., & Karunasekera, S. A. (2011) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc.2011.5766539 · Cited by 5
The Singular Optimality of Distributed Computation in LOCAL
Dufoulon, F., Pandurangan, G., Robinson, P., & Scquizzato, M. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2024.26 · Cited by 5
Eventual Consensus: Applications to Storage and Blockchain : (Extended Abstract)
Tseng, L. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919675 · Cited by 5
Prikopa, K. E., Straková, H., & Gansterer, W. N. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09873-9_34 · Cited by 5
A Gossip-Based Protocol to Reach Consensus Via Uninorm Aggregation Operator
Huang, Q., Yin, S., & Huang, Z. (2008) · Springer eBooks · doi:10.1007/978-3-540-68083-3_32 · Cited by 5
Adaptive Data Quality for Persistent Queries in Sensor Networks
Rajamani, V., & Julien, C. (2009) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-10625-5_9 · Cited by 5
Designing linear distributed algorithms with memory for fast convergence
Roy, S., Wan, Y., Saberi, A., & Xue, M. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5400566 · Cited by 5
An improvement on LEACH algorithm with a fuzzy processor
Hamzeh, M., Arab, S., Fakhraie, S. M., & Lucas, C. L. (2008) · Asia-Pacific Conference on Communications (APCC) · Cited by 5
Checking global usage of resources handled with local policies
Bodei, C., Dinh, V. D., & Ferrari, G.-L. (2016) · Science of Computer Programming · doi:10.1016/j.scico.2016.06.005 · Cited by 5
Detecting proximity events in sensor networks
Deligiannakis, A., & Kotidis, Y. (2011) · Information Systems · doi:10.1016/j.is.2011.03.004 · Cited by 5
School Choice in a Market Environment: Individual versus Social Expectations
Canals, C., Chacc, E. G., Mascareño, A., Rica, S., & Ruz, G. A. (2018) · Complexity · doi:10.1155/2018/3793095 · Cited by 5
Distributed Data Summarization in Well-Connected Networks
Su, H.-H., & Vu, H. T. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.disc.2019.33 · Cited by 5
Spanning Tree or Gossip for Aggregation: A Comparative Study
Nyers, L., & Jelasity, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09873-9_32 · Cited by 5
Introducing Quasirandomness to Computer Science
Doerr, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03456-5_6 · Cited by 5
Fault tolerance in sensor networks: Performance comparison of some gossip algorithms
Baldi, M., Chiaraluce, F., & Zanaj, E. (2009) · Università Politecnica delle Marche (Università Politecnica delle Marche) · Cited by 5
Gossip-based density estimation in dynamic heterogeneous wireless sensor networks
Malazi, H. T., Zamanifar, K., Pruteanu, A., & Dulman, S. (2013) · International Journal of Autonomous and Adaptive Communications Systems · doi:10.1504/ijaacs.2014.058019 · Cited by 5
Adaptive Management of Shared Resource Pools with Decentralized Optimization and Epidemics
Loureiro, E., Nixon, P., & Dobson, S. (2010) · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) · doi:10.1109/pdp.2010.17 · Cited by 5
Peer sampling with improved accuracy
Ogston, E., & Jarvis, S. A. (2008) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-008-0017-3 · Cited by 5
Morales, R., & Gupta, I. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.03.006 · Cited by 5
Randomized broadcasting in wireless mobile sensor networks
Abdallah, N. O., Kacem, H. H., Mosbah, M., & Zemmari, A. (2012) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.2804 · Cited by 5
Lightning Fast Asynchronous Distributed K-Means Clustering
Berta, Á., Hegedűs, I., & Ormándi, R. (2014) · SZTE Publicatio Repozitórium (University of Szeged) · Cited by 5
Cluster-Based Fast Distributed Consensus
Li, W., & Dai, H. (2007) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2007.366503 · Cited by 5
On the tradeoff between playback delay and buffer space in streaming
Chow, A. L. H., Golubchik, L., Khuller, S., & Yao, Y. (2009) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2009.5161012 · Cited by 5
STP: In-network aggregation through proximity queries in a Sensor Network
Haque, M. R., Naznin, M., Asaduzzaman, M., & Ahmed, R. U. (2009) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccit.2009.5407297 · Cited by 5
A Formal Characterization of Uniform Peer Sampling Based on View Shuffling
Busnel, Y., Beraldi, R., & Baldoni, R. (2009) · International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) · doi:10.1109/pdcat.2009.61 · Cited by 5
Directed gossiping for distributed data aggregation
Yildiz, M. E., & Scaglione, A. (2009) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2009.5413241 · Cited by 5
Hakoura, B. (2011) · doi:10.82308/20415 · Cited by 5
Efficient Node Selection in Private Personalized Decentralized LearningPreprint
Zec, E. L., Östman, J., Mogren, O., & Gillblad, D. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2301.12755 · Cited by 5
Estimating the number of nodes in wireless sensor networks
Andersson, B., Pereira, N., & Tovar, E. (2009) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · Cited by 5
Anchor free localization for ad-hoc wireless sensor networks
Nawaz, S. (2008) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/17868 · Cited by 5
Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed NoisePreprint
Wang, M., Liu, Z., & Luo, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.11435 · Cited by 5
Pellegrino, L. (2014) · theses.fr (ABES) · doi:10.70675/893bdb65z2f78z4411z9e05zc7ece9c8d4ad · Cited by 5
Liu, J., Peng, Y., Zhang, X., Ning, Z., & Fan, D. (2025) · Technologies · doi:10.3390/technologies13080327 · Cited by 4
Hearing the shape of an arena with spectral swarm robotics
Cazenille, L., Lobato‐Dauzier, N., Loi, A., Macabre, L., Ito, M., Marchal, O., Kim, S. H., Aubert-Kato, N., Bredèche, N., & Genot, A. J. (2026) · Science Robotics · doi:10.1126/scirobotics.adr9578 · Cited by 4
Metadata
- Authors
- Kempe, D., Dobra, A., & Gehrke, J.
- Affiliations
- Cornell University (US)
- Venue
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Publisher
- IEEE Computer. Soc
- Published
- 2004-03-01
- Pages
- 482-491
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2110100895
- Cited by
- 1,480
- References
- 45
- Citations by year
- 2026: 13 · 2025: 34 · 2024: 46 · 2023: 38 · 2022: 40 · 2021: 71 · 2020: 66 · 2019: 70 · 2018: 75 · 2017: 79 · 2016: 80 · 2015: 76 · 2014: 75 · 2013: 88 · 2012: 100
- FWCI
- 26.31
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Annual Symposium on Foundations of Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Keywords
- gossip protocols, distributed aggregation, diffusion rate, fault tolerance, node and link failures, floods, random walks on graphs, approximation guarantees, exponential convergence, random sampling, quantile estimation, distributed computing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.