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 301–400 of 1,004
Robust approximate aggregation in sensor data management systems
Considine, J., Hadjieleftheriou, M., Li, F., Byers, J. W., & Kollios, G. (2009) · ACM Transactions on Database Systems · doi:10.1145/1508857.1508863 · Cited by 39
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2014) · arXiv · doi:10.48550/arxiv.1406.2075 · Cited by 38
Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity
Vaidya, N. H., Hadjicostis, C. N., & Domínguez-García, A. D. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426252 · Cited by 38
Decentralized compression and predistribution via randomized gossiping
Rabbat, M., Haupt, J., Singh, A., & Nowak, R. M. (2006) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2006.244056 · Cited by 38
Spectrum Sensing in Cognitive Radio Networks: Potential Challenges and Future Perspective
Pandit, S., & Singh, G. K. (2017) · Springer eBooks · doi:10.1007/978-3-319-53147-2_2 · Cited by 38
Jelasity, M. (2011) · Natural computing series · doi:10.1007/978-3-642-17348-6_7 · Cited by 38
Fast information spreading in graphs with large weak conductance
Censor-Hillel, K., & Shachnai, H. (2011) · doi:10.5555/2133036.2133071 · Cited by 38
Efficient and decentralized computation of approximate global state
Keshav, S. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111338 · Cited by 38
Peer-to-Peer Variational Federated Learning Over Arbitrary Graphs
Wang, X., Lalitha, A., Javidi, T., & Koushanfar, F. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3189051 · Cited by 37
Local Interference Can Accelerate Gossip Algorithms
Nazer, B., Dimakis, A. G., & Gastpar, M. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2124440 · Cited by 37
Gossiping Models : Formal Analysis of Epidemic Protocols
Bakhshi, R. (2011) · VU Research Portal · Cited by 37
Asynchronous Distributed Power Iteration with Gossip-Based Normalization
Jelasity, M., Canright, G., & Engø‐Monsen, K. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74466-5_55 · Cited by 37
Distributed Slicing in Dynamic Systems
Anta, A. F., Gramoli, V., Jiménez, E., Kermarrec, A.-M., & Raynal, M. (2007) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2007.102 · Cited by 37
Gossip Algorithms for Decentralized Congestion Management of Distribution Grids
Koukoula, D. I., & Hatziargyriou, N. D. (2016) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2016.2520360 · Cited by 37
Asymptotically Optimal Randomized Rumor Spreading
Doerr, B., & Fouz, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22012-8_40 · Cited by 37
Push-SAGA: A Decentralized Stochastic Algorithm With Variance Reduction Over Directed Graphs
Qureshi, M. I., Xin, R., Kar, S., & Khan, U. A. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2021.3090652 · Cited by 36
Lu, J., & Tang, C. Y. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2594487 · Cited by 36
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2929206 · Cited by 36
Distributed Averaging Via Lifted Markov Chains
Jung, K., Shah, D., & Shin, J. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034777 · Cited by 36
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
Deligiannakis, A., Kotidis, Y., Vassalos, V., Stoumpos, V., & Delis, A. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.100 · Cited by 36
Robust State Estimation under False Data Injection in Distributed Sensor Networks
Zheng, S., Jiang, T., & Baras, J. S. (2010) · Globecom · doi:10.1109/glocom.2010.5685223 · Cited by 36
Coalescing random walks and voting on graphs
Cooper, C., Elsässer⋆, R., Ono, H., & Radzik, T. (2012) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2332432.2332440 · Cited by 36
Robust Monitoring of Network-wide Aggregates through Gossiping
Wuhib, F., Dam, M., Stadler, R., & Clemm, A. (2007) · IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2007.374787 · Cited by 36
Pseudo-random number generation for sketch-based estimations
Rusu, F., & Dobra, A. (2007) · ACM Transactions on Database Systems · doi:10.1145/1242524.1242528 · Cited by 36
Self-citationPlatform based design for wireless sensor networks
Bonivento, A., Carloni, L. P., & Sangiovanni-Vincentelli, A. L. (2006) · Mobile Networks and Applications · doi:10.1007/s11036-006-7194-1 · Cited by 36
HERO: Online Real-Time Vehicle Tracking in Shanghai
Zhu, H., Zhu, Y., Li, M., & Ni, L. M.-S. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.147 · Cited by 36
A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion
Birk, Y., Liss, L., Schuster, A., & Wolff, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30186-8_20 · Cited by 36
Surplus-based accelerated algorithms for distributed optimization over directed networks
Wang, D., Wang, Z., Lian, J., & Wang, W. (2022) · Automatica · doi:10.1016/j.automatica.2022.110569 · Cited by 35
Formal Analysis Techniques for Gossiping Protocols
Katoen, J.-P., Kok, J. N., Pol, J., van Kreveld, M. J., Speckmann, B., Bakhshi, R., Bonnet, F., Fokkink, W. J., & Haverkort, B. R. H. M. (2010) · Cited by 35
BEER: Fast $O(1/T)$ Rate for Decentralized Nonconvex Optimization with Communication CompressionPreprint
Zhao, H., Li, B., Li, Z., Richtárik, P., & Chi, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2201.13320 · Cited by 35
Boczkowski, L., Korman, A., & Natale, E. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.168 · Cited by 35
Kenyeres, M., Kenyeres, J., & Dolatabadi, S. H. (2025) · Journal of Low Power Electronics and Applications · doi:10.3390/jlpea15010006 · Cited by 35
Dissemination of compressed historical information in sensor networks
Deligiannakis, A., Kotidis, Y., & Roussopoulos, N. (2006) · The VLDB Journal · doi:10.1007/s00778-005-0173-5 · Cited by 35
An analytical model of information dissemination for a gossip-based protocol
Bakhshi, R., Gavidia, D., Fokkink, W. J., & van Steen, M. R. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.03.017 · Cited by 35
Majority Dynamics and the Retention of Information
Tamuz, O., & Tessler, R. J. (2014) · Israel Journal of Mathematics · doi:10.1007/s11856-014-1148-2 · Cited by 34
Cohen, A., Cohen, A., Médard, M., & Gurewitz, O. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2870831 · Cited by 34
Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks
Feldman, M., Immorlica, N., Lucier, B., & Weinberg, S. M. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2014.192 · Cited by 34
Efficiency of the gossip algorithm for wireless sensor networks
Zanaj, E., Baldi, M., & Chiaraluce, F. (2007) · International Conference on Software, Telecommunications and Computer Networks (SoftCOM) · doi:10.1109/softcom.2007.4446065 · Cited by 34
A Practical Approach to Network Size Estimation for Structured Overlays
Shafaat, T. M., Ghodsi, A., & Haridi, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92157-8_7 · Cited by 34
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful
Cooper, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22212-2_1 · Cited by 34
Peer-to-Peer Control of Microgrids
Almasalma, H., Engels, J., & Deconinck, G. (2017) · Lirias · doi:10.48550/arxiv.1711.04070 · Cited by 33
Finite-time Convergent GossipingPreprint
Shi, G., Li, B., Johansson, M., & Johansson, K. H. (2016) · Cited by 33
Decentralized Network Building Change in Large Manufacturing Companies towards Industry 4.0
Poonpakdee, P., Koiwanit, J., & Yuangyai, C. (2017) · Procedia Computer Science · doi:10.1016/j.procs.2017.06.113 · Cited by 33
Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailability
Xiang, M., Ioannidis, S., Yeh, E. M., Joe‐Wong, C., & Su, L. (2024) · neural information processing systems · doi:10.52202/079017-3313 · Cited by 33
Location-Aided Fast Distributed Consensus in Wireless Networks
Li, W., Dai, H., & Zhang, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2081030 · Cited by 33
Find Your Place: Simple Distributed Algorithms for Community Detection
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., & Trevisan, L. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.59 · Cited by 33
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
Makhloufi, R., Bonnet, G., Doyen, G., & Gaïti, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-05006-0_10 · Cited by 33
Epidemic Models, Algorithms, and Protocols in Wireless Sensor and Ad Hoc Networks
De, P., & Das, S. K. (2008) · Wiley eBooks · doi:10.1002/9780470396360.ch3 · Cited by 33
Parreira, J. X., Castillo, C., Donato, D., Michel, S., & Weikum, G. (2007) · The VLDB Journal · doi:10.1007/s00778-007-0057-y · Cited by 32
A Modified Saddle-Point Dynamics for Distributed Convex Optimization on General Directed Graphs
Touri, B., & Gharesifard, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2947184 · Cited by 32
A Case of Distributed Optimization in Adversarial Environment
Ravi, N., Scaglione, A., & Nedić, A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683442 · Cited by 32
A Game-Theoretic Approach for Elastic Distributed Data Stream Processing
Mencagli, G. (2016) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/2903146 · Cited by 32
Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation
Gansterer, W. N., Niederbrucker, G., Straková, H., & Grotthoff, S. S. (2013) · Journal of Computational Science · doi:10.1016/j.jocs.2013.01.006 · Cited by 32
Fault-Tolerant Aggregation by Flow Updating
Jesus, P., Baquero, C., & Almeida, P. S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02164-0_6 · Cited by 32
Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching
Chen, H., Jin, H., Chen, L., Liu, Y., & Ni, L. M.-S. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.14 · Cited by 32
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
Manitara, N. E., & Hadjicostis, C. N. (2016) · Automatica · doi:10.1016/j.automatica.2016.03.030 · Cited by 31
Experimental Analysis of Rumor Spreading in Social Networks
Doerr, B., Fouz, M., & Friedrich, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34862-4_12 · Cited by 31
TACO: tunable approximate computation of outliers in wireless sensor networks
Giatrakos, N., Kotidis, Y., Deligiannakis, A., Vassalos, V., & Theodoridis, Y. (2010) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1807167.1807199 · Cited by 31
Distributed QR Factorization Based on Randomized Algorithms
Straková, H., Gansterer, W. N., & Zemen, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31464-3_24 · Cited by 31
Kowalski, D. R., & Mosteiro, M. A. (2020) · Journal of the ACM · doi:10.1145/3385075 · Cited by 31
Distributed sparse signal recovery for sensor networks
Patterson, S., Eldar, Y. C., & Keidar, I. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638510 · Cited by 31
Probabilistic Estimation of Network Size and Diameter
Cardoso, J. C. S., Baquero, C., & Almeida, P. S. (2009) · Latin-American Symposium on Dependable Computing · doi:10.1109/ladc.2009.19 · Cited by 31
A Proximity-Based Self-Organizing Framework for Service Composition and Discovery
Forestiero, A., Mastroianni, C., Papuzzo, G., & Spezzano, G. (2010) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2010.48 · Cited by 31
Clustering Distributed Energy Resources for Large-Scale Demand Management
Ogston, E., Zeman, A. A., Prokopenko, M., & James, G. (2007) · IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) · doi:10.1109/saso.2007.13 · Cited by 31
Using Aggregation for Adaptive Super-Peer Discovery on the Gradient Topology
Sacha, J., Dowling, J., Cunningham, R., & Meier, R. (2006) · Lecture notes in computer science · doi:10.1007/11767886_6 · Cited by 31
Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups
Korman, A., Greenwald, E. E., & Feinerman, O. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003862 · Cited by 30
Algorithm-Level Confidentiality for Average Consensus on Time-Varying Directed Graphs
Gao, H. B., & Wang, Y. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3140274 · Cited by 30
Ouassal, H., Rocco, T., Yan, M., & Nanzer, J. A. (2020) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2020.2977751 · Cited by 30
On Endogenous Random Consensus and Averaging Dynamics
Touri, B., & Langbort, C. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2337973 · Cited by 30
Symmetric Push-Sum Protocol for Decentralised Aggregation
Blasa, F., Cafiero, S., Fortino, G., & Fatta, G. D. (2011) · Libera Università di Bolzano · Cited by 30
Fully decentralized emulation of best-effort and processor sharing queues
Stanojevi, R., & Shorten, R. N. (2008) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1375457.1375501 · Cited by 30
The Age of Information in Gossip Networks
Selen, J., Nazarathy, Y., Andrew, L. L. H., & Vu, H. L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39408-9_26 · Cited by 30
The Complexity of Data Aggregation in Directed Networks
Kühn, F., & Oshman, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24100-0_40 · Cited by 30
The price of validity in dynamic networks
Bawa, M., Gionis, A., García-Molina, H., & Motwani, R. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.10.007 · Cited by 30
Fault-Tolerant Aggregation for Dynamic Networks
Jesus, P., Baquero, C., & Almeida, P. S. (2010) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2010.13 · Cited by 30
NetDetect: Neighborhood Discovery in Wireless Networks Using Adaptive Beacons
Iyer, V., Pruteanu, A., & Dulman, S. (2011) · IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) · doi:10.1109/saso.2011.14 · Cited by 30
A note on efficient aggregate queries in sensor networks
Patt-Shamir, B. (2004) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1011767.1011809 · Cited by 30
Efficient multi-keyword search over p2p web
Chen, H., Jin, H., Wang, J., Chen, L., Liu, Y., & Ni, L. M.-S. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367631 · Cited by 30
On the Linear Convergence of Distributed Optimization over Directed Graphs
Xi, C., & Khan, U. A. (2015) · arXiv · doi:10.48550/arxiv.1510.02149 · Cited by 29
CountTorrent: ubiquitous access to query aggregates in dynamic and mobile sensor networks
Kamra, A., Misra, V., & Rubenstein, D. (2007) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/1322263.1322269 · Cited by 29
Chen, J., Pandurangan, G., & Xu, D. (2005) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2005.1440945 · Cited by 29
Distributed Estimation Under Sensor Attacks: Linear and Nonlinear Measurement Models
Meng, M., Li, X., & Xiao, G. (2021) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2021.3054981 · Cited by 29
Lu, J., & Tang, C. Y. (2009) · IFAC Proceedings Volumes · doi:10.3182/20090924-3-it-4005.00044 · Cited by 29
Heterogeneous decentralised machine unlearning with seed model distillation
Ye, G., Chen, T., Nguyen, Q. V. H., Huang, Z., Zhou, X., & Yin, H. (2024) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12281 · Cited by 29
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
Ko, S. Y., Gupta, I., & Jo, Y. (2008) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1380422.1380426 · Cited by 29
Decentralized Low-Rank Fine-Tuning of Large Language Models
Ghiasvand, S., Alizadeh, M., & Pedarsani, R. (2025) · Workshop for Research on Agent Language Models (REALM) · doi:10.18653/v1/2025.realm-1.24 · Cited by 29
Simultaneous Provision of Voltage and Frequency Control by PV-Battery Systems
Almasalma, H., & Deconinck, G. (2020) · IEEE Access · doi:10.1109/access.2020.3018086 · Cited by 29
On the Push&Pull Protocol for Rumor Spreading
Acan, H., Collevecchio, A., Mehrabian, A., & Wormald, N. (2017) · SIAM Journal on Discrete Mathematics · doi:10.1137/15m1033113 · Cited by 29
A Fuzzy Approach to Data Aggregation to Reduce Power Consumption in Wireless Sensor Networks
Lazzerini, B., Marcelloni, F., Vecchio, M., Croce, S., & Monaldi, E. (2006) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2006.365449 · Cited by 29
Scaling Bounds for Function Computation over Large Networks
Subramanian, S., Gupta, P., & Shakkottai, S. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557216 · Cited by 29
Lü, Q., Li, H., Wang, Z., Han, Q., & Ge, W. C. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.6026 · Cited by 28
Lu, J., & Tang, C. Y. (2009) · IFAC Proceedings Volumes · doi:10.3182/20090924-3-it-4005.00043 · Cited by 28
Network Size Estimation Using Distributed Orthogonalization
Slučiak, O., & Rupp, M. (2013) · IEEE Signal Processing Letters · doi:10.1109/lsp.2013.2247756 · Cited by 28
Distributed Stopping for Average Consensus in Digraphs
Manitara, N. E., & Hadjicostis, C. N. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2660242 · Cited by 28
Analysis of the propagation time of a rumour in large-scale distributed systems
Mocquard, Y., Séricola, B., Robert, S., & Anceaume, E. (2016) · IEEE International Symposium on Network Computing and Applications (NCA) · doi:10.1109/nca.2016.7778629 · Cited by 28
Component-Average Based Distributed Seismic Tomography in Sensor Networks
Kamath, G., Shi, L., & Song, W. (2013) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2013.17 · Cited by 28
An Efficient Data Aggregation Algorithm for Cluster-based Sensor Network
Mozumdar, M., Nan, G., Gregoretti, F., Lavagno, L., & Vanzago, L. (2009) · Journal of Networks · doi:10.4304/jnw.4.7.598-606 · Cited by 28
Distributed estimation of global parameters in delay-tolerant networks
Guerrieri, A., Carreras, I., Pellegrini, F. D., Miorandi, D., & Montresor, A. (2010) · Computer Communications · doi:10.1016/j.comcom.2010.01.019 · Cited by 28
Distributed monitoring and resource management for large cloud environments
Wuhib, F., & Stadler, R. (2011) · IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2011.5990531 · Cited by 28
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.