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 401–500 of 1,004
Dual-decomposition-based peer-to-peer voltage control for distribution networks
Almasalma, H., Engels, J., & Deconinck, G. (2017) · CIRED - Open Access Proceedings Journal · doi:10.1049/oap-cired.2017.0282 · Cited by 28
On collaborative content distribution using multi-message gossip
Fernandess, Y., & Malkhi, D. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2007.05.004 · Cited by 28
Chiaroscuro: Transparency and Privacy for Massive Personal Time-Series Clustering
Allard, T., Hébrail, G., Masséglia, F., & Pacitti, E. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2749453 · Cited by 27
Kenyeres, M., & Kenyeres, J. (2021) · Future Internet · doi:10.3390/fi13050134 · Cited by 27
Average consensus in sensor networks via broadcast multi-gossip algorithms
Wang, H., Liao, X., & Huang, T. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.01.013 · Cited by 27
Distributed 3D Deployment of Aerial Base Stations for On-Demand Communication
Kimura, T., & Ogura, M. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3086815 · Cited by 27
Kenyeres, M., & Kenyeres, J. (2020) · Sensors · doi:10.3390/s20133677 · Cited by 27
An In-Depth Analysis of Distributed Training of Deep Neural Networks
Ko, Y., Choi, K., Seo, J., & Kim, S. (2021) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps49936.2021.00108 · Cited by 27
Veracity radius: capturing the locality of distributed computations
Birk, Y., Keidar, I., Liss, L., Schuster, A., & Wolff, R. (2006) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1146381.1146399 · Cited by 27
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors
Clementi, A. E. F., Ghaffari, M., Gualà, L., Natale, E., Pasquale, F., & Scornavacca, G. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.3929/ethz-b-000295618 · Cited by 27
Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks
Ko, Y. M., & Gautam, N. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2048122 · Cited by 27
Rapid Asynchronous Plurality ConsensusPreprint
Elsässer⋆, R., Friedetzky, T., Kaaser, D., Mallmann-Trenn, F., & Trinker, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04667 · Cited by 27
Decentralized In-Network Management for the Future Internet
Prieto, A. G., Dudkowski, D., Meiroşu, C., Mingardi, C., Nunzi, G., Brunner, M., & Stadler, R. (2009) · IEEE International Conference on Communications workshops · doi:10.1109/iccw.2009.5207964 · Cited by 27
Efficient Approximate Query Processing in Peer-to-Peer Networks
Arai, B., Das, G., Gunopulos, D., & Kalogeraki, V. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1064 · Cited by 27
Resilient Average Consensus With Adversaries via Distributed Detection and Recovery
Yuan, L., & Ishii, H. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3426387 · Cited by 26
Asynchronous distributed averaging using double linear iterations
Liu, J., & Morse, A. S. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315266 · Cited by 26
Tight Bounds for the Cover Time of Multiple Random Walks
Elsässer⋆, R., & Sauerwald, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02927-1_35 · Cited by 26
Location-Aided Fast Distributed Consensus in Wireless NetworksPreprint
Li, W., Zhang, Y., & Dai, H. (n.d.) · Cited by 26
Distributed scheduling of sensor networks for identification of spatio-temporal processes
Patan, M. (2012) · International Journal of Applied Mathematics and Computer Science · doi:10.2478/v10006-012-0022-9 · Cited by 26
Fatta, G. D., Blasa, F., Cafiero, S., & Fortino, G. (2011) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2011.76 · Cited by 26
Algorithms for determining network robustness
LeBlanc, H. J., & Koutsoukos, X. (2013) · doi:10.1145/2461446.2461455 · Cited by 26
Cluster-based distributed consensus
Li, W., & Dai, H. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2009.071146 · Cited by 26
GDCluster: A General Decentralized Clustering Algorithm
Mashayekhi, H., Habibi, J., Khalafbeigi, T., Voulgaris, S., & van Steen, M. R. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2391123 · Cited by 26
Fast Information Spreading in Graphs with Large Weak Conductance
Censor-Hillel, K., & Shachnai, H. (2012) · SIAM Journal on Computing · doi:10.1137/110845380 · Cited by 26
Cooperative detection and protection against network attacks using decentralized information sharing
Zhang, G., & Parashar, M. (2010) · Cluster Computing · doi:10.1007/s10586-009-0116-9 · Cited by 26
Gossip-Based Counting in Dynamic Networks
van de Bovenkamp, R., Kuipers, F. A., & Mieghem, P. V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30054-7_32 · Cited by 26
In-network approximate computation of outliers with quality guarantees
Giatrakos, N., Kotidis, Y., Deligiannakis, A., Vassalos, V., & Theodoridis, Y. (2011) · Information Systems · doi:10.1016/j.is.2011.08.005 · Cited by 26
Fast Estimation of Aggregates in Unstructured Networks
Baquero, C., Almeida, P. S., & Menezes, R. (2009) · International Conference on Networking and Services · doi:10.1109/icas.2009.31 · Cited by 26
Distributed computation of the mode
Kühn, F., Locher, T., & Schmid, S. (2008) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1400751.1400756 · Cited by 26
A note on efficient aggregate queries in sensor networks
Patt-Shamir, B. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.10.032 · Cited by 26
A distributed gossip-based voltage control algorithm for peer-to-peer microgrids
Engels, J., Almasalma, H., & Deconinck, G. (2016) · IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgridcomm.2016.7778789 · Cited by 25
Manzoor, H. U., Habib, U., Hussain, S., Flynn, D., & Zoha, A. (2024) · Energy and Buildings · doi:10.1016/j.enbuild.2024.114871 · Cited by 25
A geometrically convergent method for distributed optimization over time-varying graphs
Nedić, A., Olshevsky, A., & Shi, W. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798402 · Cited by 25
Exploring the interdisciplinary connections of gossip-based systems
Costa, P., Gramoli, V., Jelasity, M., Jesi, G. P., Merrer, E. L., Montresor, A., & Querzoni, L. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1317379.1317388 · Cited by 25
Distributed Averaging Using Periodic Gossiping
Yu, C. B., Anderson, B. D. O., Mou, S., Liu, J., He, F., & Morse, A. S. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2688278 · Cited by 25
Building a Secure and Privacy-Preserving Smart Grid
Birman, K., Jelasity, M., Kleinberg, R., & Tremel, E. (2015) · ACM SIGOPS Operating Systems Review · doi:10.1145/2723872.2723891 · Cited by 25
Chakrabarti, D., & Faloutsos, C. (2005) · Carnegie Mellon University eBooks · Cited by 25
Noisy rumor spreading and plurality consensus
Fraigniaud, P., & Natale, E. (2018) · Distributed Computing · doi:10.1007/s00446-018-0335-5 · Cited by 25
Bounds on the mixing time and partial cover of ad-hoc and sensor networks
Avin, C., & Ercal, G. (2005) · European Workshop on Wireless Sensor Networks (EWSN) · doi:10.1109/ewsn.2005.1461994 · Cited by 25
Doerr, B., Friedrich, T., & Sauerwald, T. (2014) · ACM Transactions on Algorithms · doi:10.1145/2650185 · Cited by 25
LiMoSense – Live Monitoring in Dynamic Sensor Networks
Eyal, I., Keidar, I., & Rom, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28209-6_7 · Cited by 25
Modeling gossip-based content dissemination and search in distributed networking
Tang, S., Jaho, E., Stavrakakis, I., Koukoutsidis, I., & Mieghem, P. V. (2010) · Computer Communications · doi:10.1016/j.comcom.2010.10.001 · Cited by 25
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
Chen, H., Yan, J., Jin, H., Liu, Y., & Ni, L. M.-S. (2010) · IEEE Transactions on Computers · doi:10.1109/tc.2010.81 · Cited by 25
Estimating Spatial Averages of Environmental Parameters Based on Mobile Crowdsensing
Koukoutsidis, I. (2017) · ACM Transactions on Sensor Networks · doi:10.1145/3154423 · Cited by 25
Difficulty-Aware Hybrid Search in Peer-to-Peer Networks
Chen, H., Jin, H., Liu, Y., & Ni, L. M.-S. (2008) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.72 · Cited by 25
Decentralising a service-oriented architecture
Sacha, J., Biskupski, B., Dahlem, D., Cunningham, R., Meier, R., Dowling, J., & Haahr, M. (2009) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-009-0062-6 · Cited by 25
Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
Zhu, Y. N., Li, B., & Pu, K. Q. (2008) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.155 · Cited by 25
Network independent rates in distributed learning
Nedić, A., Olshevsky, A., & Uribe, C. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525057 · Cited by 24
A Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence
Gao, J., Liu, X., Dai, Y., Huang, Y., & Yang, P. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3160684 · Cited by 24
FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems
Baniata, H., & Kertész, A. (2021) · PeerJ Computer Science · doi:10.7717/peerj-cs.431 · Cited by 24
An Improved PageRank Algorithm for Multilayer Networks
Cheriyan, J., & Sajeev, G. P. (2020) · IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT) · doi:10.1109/conecct50063.2020.9198566 · Cited by 24
D-DistADMM: A O(1/k) Distributed ADMM for Distributed Optimization in Directed Graph Topologies
Khatana, V., & Salapaka, M. V. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304086 · Cited by 24
Distributed Unsupervised Gaussian Mixture Learning for Density Estimation in Sensor Networks
Safarinejadian, B., Menhaj, M. B., & KARRARI, M. (2010) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2009.2036348 · Cited by 24
Distributed TD(0) With Almost No Communication
Liu, R., & Olshevsky, A. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3287952 · Cited by 24
On positioning via distributed matrix completion
Montanari, A., & Oh, S. (2010) · IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM) · doi:10.1109/sam.2010.5606732 · Cited by 24
Boczkowski, L., Korman, A., & Natale, E. (2018) · Distributed Computing · doi:10.1007/s00446-018-0330-x · Cited by 24
Random geometric graphs: an algorithmic perspective
Pearl, J., Estrin, D. L., & Avin, C. (2006) · Cited by 24
Montresor, A. (2017) · Wiley eBooks · doi:10.1002/047134608x.w8353 · Cited by 23
Chen, Y., Hashemi, A., & Vikalo, H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3133372 · Cited by 23
Fast Coordination of Distributed Energy Resources Over Time-Varying Communication Networks
Zholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3213626 · Cited by 23
Li, B., & Chi, Y. (2025) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2025.3526081 · Cited by 23
Distributed Low-rank Matrix Factorization With Exact Consensus
Zhu, Z., Li, Q., Yang, X., Tang, G., & Wakin, M. B. (2019) · neural information processing systems · Cited by 23
Push-Sum With Transmission Failures
Gerencsér, B. S., & Hendrickx, J. M. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836861 · Cited by 23
On matrix factorization and finite-time average-consensus
Ko, C.-K., & Gao, X. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5399577 · Cited by 23
An analytic study of opinion dynamics in multi-agent systems
Monica, S., & Bergenti, F. (2017) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2017.03.008 · Cited by 23
Distributed Multiarmed Bandits
Zhu, J., & Liu, J. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3247982 · Cited by 23
Coflow: A Networking Abstraction for Distributed Data-Parallel Applications
Chowdhury, N. M. M. K. (2015) · eScholarship (California Digital Library) · Cited by 23
Asynchronous broadcast-based decentralized learning in sensor networks
Zhao, L., Song, W., Ye, X., & Gu, Y. (2017) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760.2017.1294690 · Cited by 23
Distributed energy sharing in energy internet through distributed averaging
Ming, Y., Yang, J., Cao, J., Zhou, Z., & Xing, C. (2018) · Tsinghua Science & Technology · doi:10.26599/tst.2018.9010039 · Cited by 23
Sampling-based estimators for subset-based queries
Joshi, S., & Jermaine, C. (2008) · The VLDB Journal · doi:10.1007/s00778-008-0095-0 · Cited by 23
Fast and Accurate Load Balancing for Geo-Distributed Storage Systems
Bogdanov, K., Reda, W., Maguire, G. Q., Kostić, D., & Canini, M. (2018) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/3267809.3267820 · Cited by 23
Haeupler, B., Pandurangan, G., Peleg, D., Rajaraman, R., & Sun, Z. (2012) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2312005.2312031 · Cited by 23
Gossip-Based Computation of a Gaussian Mixture Model for Distributed Multimedia Indexing
Nikseresht, A., & Gelgon, M. (2008) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2008.917343 · Cited by 23
OPAL - A survivability-oriented approach to management of tactical military networks
Hui, K.-P., Pourbeik, P., George, P., Phillips, D., Magrath, S., & Kwiatkowski, M. (2011) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2011.6127450 · Cited by 23
WHISPER: Middleware for Confidential Communication in Large-Scale Networks
Schiavoni, V., Rivière, É., & Felber, P. A. (2011) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2011.15 · Cited by 23
Asynchronous Peer-to-Peer Data Mining with Stochastic Gradient Descent
Ormándi, R., Hegedűs, I., & Jelasity, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23400-2_49 · Cited by 23
Berenbrink, P., Friedetzky, T., Kaaser, D., & Kling, P. (2019) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2019.00080 · Cited by 23
Counting in Anonymous Dynamic Networks: An Experimental Perspective
Luna, G. A. D., Bonomi, S., Chatzigiannakis, I., & Baldoni, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45346-5_11 · Cited by 23
Ntarmos, N., Triantafillou, P., & Weikum, G. (2009) · ACM Transactions on Computer Systems · doi:10.1145/1482619.1482621 · Cited by 23
Fault tolerant aggregation in heterogeneous sensor networks
Chitnis, L., Dobra, A., & Ranka, S. (2008) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2008.07.015 · Cited by 23
Self-citationSupporting Networked Software Development
Tamburri, D. A. (2014) · Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam) · Cited by 28
Towards Decentralised Detection of Emergence in Complex Adaptive Systems
O'Toole, E., Nallur, V., & Clarke, S. (2014) · IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) · doi:10.1109/saso.2014.18 · Cited by 22
Reddy, A. V. N., Kumar, A., Venu, N., & Reddy, R. V. K. (2022) · Measurement Sensors · doi:10.1016/j.measen.2022.100468 · Cited by 22
Distributed Slicing in Dynamic SystemsPreprint
Anta, A. F., Gramoli, V., Jiménez, E., Kermarrec, A.-M., & Raynal, M. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.3980 · Cited by 22
Maintaining replicas in unstructured P2P systems
Leng, C., Terpstra, W. W., Kemme, B., Stannat, W., & Buchmann, A. (2008) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/1544012.1544031 · Cited by 22
ISP-friendly peer selection in P2P networks
Shen, Z., & Zimmermann, R. (2009) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/1631272.1631435 · Cited by 22
P-Ring: An Index Structure for Peer-to-Peer Systems
Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J. E., & Shanmugasundaram, J. (2004) · eCommons (Cornell University) · Cited by 22
Self-citationAnalyzing Sharing in Peer-to-Peer Networks Under Various Congestion Measures
Johar, M. S., Menon, S., & Mookerjee, V. S. (2009) · Information Systems Research · doi:10.1287/isre.1090.0258 · Cited by 21
Distributed Randomized Kaczmarz and Applications to Seismic Imaging in Sensor Network
Kamath, G., Ramanan, P., & Song, W. (2015) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2015.27 · Cited by 21
Multi-Agent Control: A Graph-Theoretic Perspective
Chen, F., & Ren, W. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-1218-6 · Cited by 21
Directed-Distributed Gradient Descent
Xi, C., & Khan, U. A. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447120 · Cited by 21
Fine Synchronization for Wireless Sensor Networks Using Gossip Averaging Algorithms
Marechal, N., Pierrot, J., & Gorce, J.-M. (2008) · International Conference on Communications · doi:10.1109/icc.2008.930 · Cited by 21
Privacy Preserving Randomized Gossip AlgorithmsPreprint
Hanzely, F., Konečný, J., Loizou, N., Richtárik, P., & Grishchenko, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.07636 · Cited by 21
The Impact of Communication Delays on Distributed Consensus AlgorithmsPreprint
Tsianos, K. I., & Rabbat, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.5839 · Cited by 21
Ye, G., Chen, T., Li, Y., Cui, L., Nguyen, Q. V. H., & Yin, H. (2023) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2023.3247463 · Cited by 21
Differentially private average consensus with general directed graphs
Wang, Y., Lam, J., & Lin, H. S. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.06.016 · Cited by 21
Collaborative SVM classification in scale-free peer-to-peer networks
Khan, U., Schmidt-Thieme, L., & Νανόπουλος, Α. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.10.008 · Cited by 21
Reachability of consensus and synchronizing automata
Chevalier, P.-Y., Hendrickx, J. M., & Jungers, R. M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402864 · Cited by 21
Optimal gossip-based aggregate computation
Chen, J., & Pandurangan, G. (2010) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1810479.1810504 · Cited by 21
Almost-Optimal Gossip-Based Aggregate Computation
Chen, J., & Pandurangan, G. (2012) · SIAM Journal on Computing · doi:10.1137/100793104 · Cited by 21
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.