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 701–800 of 1,004
A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function
Hamedani, E. Y., & Aybat, N. S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3130082 · Cited by 11
Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs
Song, Z., Shi, L., Pu, S., & Yan, M. (2024) · SIAM Journal on Optimization · doi:10.1137/22m148570x · Cited by 11
Robustness Against Data Integrity Attacks in Decentralized Federated Load Forecasting
Shabbir, A., Manzoor, H. U., Manzoor, M. Z., Hussain, S., & Zoha, A. (2024) · Electronics · doi:10.3390/electronics13234803 · Cited by 11
Dynamic Estimation Over Distributed Sensing Network With Communication Delays
Chen, G., & Zhou, Y. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2023.3334307 · Cited by 11
Distributed Chernoff Test: Optimal Decision Systems Over Networks
Rangi, A., Franceschetti, M., & Maranò, S. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3046191 · Cited by 11
Distributed linear discriminant analysis
Macua, S. V., Belanović, P., & Zazo, S. (2011) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2011.5946724 · Cited by 11
Paving the Way for Consensus: Convergence of Block Gossip Algorithms
Haddock, J., Jarman, B., & Yap, C. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3202733 · Cited by 11
Randomization and Quantization for Average Consensus
Charron-Bost, B., & Lambein-Monette, P. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619817 · Cited by 11
Computing Outside the Box: Average Consensus over Dynamic Networks
Charron-Bost, B., & Lambein-Monette, P. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sand.2022.10 · Cited by 11
Variance Reduced Stochastic Optimization Over Directed Graphs with Row and Column Stochastic Weights
Qureshi, M. I., Xin, R., Kar, S., & Khan, U. A. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10476854 · Cited by 11
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
Chen, H., Jin, H., Liu, Y., & Ni, L. M.-S. (2007) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2007.35 · Cited by 11
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
Ko, S. Y., Gupta, I., & Jo, Y. (2007) · IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) · doi:10.1109/saso.2007.40 · Cited by 11
Distributed and Robust Fair Optimization Applied to Virus Diffusion Control
Ramírez‐Llanos, E., & Martínez, S. (2016) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2016.2614751 · Cited by 11
Casas, M., Gansterer, W. N., & Wimmer, E. (2018) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342018762531 · Cited by 11
Chen, F., Jin, J., Xiang, L., & Ren, W. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3131678 · Cited by 11
Fault-tolerant least squares solvers for wireless sensor networks based on gossiping
Prikopa, K. E., & Gansterer, W. N. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.09.006 · Cited by 11
FailDetect: Gossip-Based Failure Estimator for Large-Scale Dynamic Networks
Pruteanu, A., Iyer, V., & Dulman, S. (2011) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2011.6006082 · Cited by 11
Attamah, M., van Ditmarsch, H., Grossi, D., & van der Hoek, W. (2017) · Outstanding contributions to logic · doi:10.1007/978-3-319-47843-2_9 · Cited by 11
On chemical and self-healing networking protocols
Meyer, T. (2011) · edoc (University of Basel) · doi:10.5451/unibas-005581929 · Cited by 11
Non Trivial Computations in Anonymous Dynamic Networks
Luna, G. D., & Baldoni, R. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2015.33 · Cited by 11
Faster Rumor Spreading With Multiple Calls
Παναγιώτου, Κ., Pourmiri, A., & Sauerwald, T. (2015) · The Electronic Journal of Combinatorics · doi:10.37236/4314 · Cited by 11
Resilient gossip algorithms for collecting online management information in exascale clusters
Barak, A., Drezner, Z., Levy, E., Lieber, M., & Shiloh, A. (2015) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.3465 · Cited by 11
Continuous Gossip-Based Aggregation through Dynamic Information Aging
Rapp, V., & Graffi, K. (2013) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2013.6614118 · Cited by 11
Decentralized real-time monitoring of network-wide aggregates
Stadler, R., Dam, M., Gonzalez, A., & Wuhib, F. (2008) · doi:10.1145/1529974.1529984 · Cited by 11
Description and Composition of Bio-inspired Design Patterns: The Gossip Case
Fernandez-Marquez, J. L., Arcos, J. L., Serugendo, G. D. M., & Casadei, M. (2011) · IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems (EASe) · doi:10.1109/ease.2011.15 · Cited by 11
Efficient and fast distributed top-k query protocol in wireless sensor networks
Tang, S., Mao, X., & Li, X. (2011) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2011.6089087 · Cited by 11
Fast Decentralized Averaging via Multi-scale Gossip
Tsianos, K. I., & Rabbat, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13651-1_23 · Cited by 11
Rafting Towards Consensus: Formation Control of Distributed Dynamical SystemsPreprint
Tariverdi, A., & Tørresen, J. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2308.10097 · Cited by 11
Epidemic Learning: Boosting Decentralized Learning with Randomized CommunicationPreprint
de Vos, M., Farhadkhani, S., Guerraoui, R., Kermarrec, A.-M., Pires, R. P., & Sharma, R. K. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.01972 · Cited by 11
Decentralized Multimedia Data Sharing in IoV: A Learning-Based Equilibrium of Supply and Demand
Fan, J., Xu, M., Guo, J., Shar, L. K., Kang, J., Niyato, D. T., & Lam, K. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3322270 · Cited by 10
Randomized Gossiping With Effective Resistance Weights: Performance Guarantees and Applications
Can, B., Soori, S., Aybat, N. S., Dehnavi, M. M., & Gürbüzbalaban, M. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3161201 · Cited by 10
Gradient-Push Algorithm for Distributed Optimization With Event-Triggered Communications
Kim, J., & Choi, W. (2022) · IEEE Access · doi:10.1109/access.2022.3233233 · Cited by 10
On the Convergence Rate of Average Consensus and Distributed optimization over Unreliable Networks
Su, L. (2018) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2018.8645184 · Cited by 10
Robust Decentralized Mean Estimation with Limited Communication
Danner, G., & Jelasity, M. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96983-1_32 · Cited by 10
Who started this rumor? Quantifying the natural differential privacy guarantees of gossip protocolsPreprint
Bellet, A., Guerraoui, R., & Hendrikx, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.07138 · Cited by 10
Randomized Information Dissemination in Dynamic Environments
Soh, D. W., Tay, W. P., & Quek, T. Q. S. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2209676 · Cited by 10
Chen, J., & Hu, J. (2008) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.40 · Cited by 10
Persistent graphs and consensus convergence
Shi, G., & Johansson, K. H. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426728 · Cited by 10
Distributed Gram-Schmidt orthogonalization based on dynamic consensus
Slučiak, O., Straková, H., Rupp, M., & Gansterer, W. N. (2012) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2012.6489213 · Cited by 10
Privacy-Preserving Push-sum Average Consensus Algorithm over Directed Graph Via State Decomposition
Wang, H., Xu, W., & Lu, J. (2021) · International Conference on Industrial Artificial Intelligence (IAI) · doi:10.1109/iai53119.2021.9619254 · Cited by 10
Makridis, E., Charalambous, T., & Hadjicostis, C. N. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10155891 · Cited by 10
Consensus Algorithms With State-Dependent Weights
Slučiak, O., & Rupp, M. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2515074 · Cited by 10
Average Consensus in the Presence of Delays and Dynamically Changing Directed Graph TopologiesPreprint
Hadjicostis, C. N., & Charalambous, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.4778 · Cited by 10
Distributed computation in wireless and dynamic networks
Lynch, N., & Oshman, R. (2012) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 10
ALADDIN: Asymmetric Centralized Training for Distributed Deep Learning
Ko, Y., Choi, K., Jei, H., Lee, D., & Kim, S. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482412 · Cited by 10
Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time
Xu, W., & Zhang, Z. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3583691 · Cited by 10
Chemical Networking Protocols.
Meyer, T., & Tschudin, C. (2009) · Cited by 10
Nedić, A. (2015) · Springer eBooks · doi:10.1007/978-1-4471-5058-9_219 · Cited by 10
Gossip-Based Self-Organising Agent Societies and the Impact of False Gossip
Savarimuthu, S., Purvis, M., Purvis, M., & Savarimuthu, B. T. R. (2013) · Minds and Machines · doi:10.1007/s11023-013-9304-8 · Cited by 10
Streaming techniques and data aggregation in networks of tiny artefacts
Becchetti, L., Chatzigiannakis, I., & Giannakopoulos, Y. (2010) · Computer Science Review · doi:10.1016/j.cosrev.2010.09.007 · Cited by 10
Distributed Averaging in Opinion Dynamics
Berenbrink, P., Cooper, C., Gava, C., Marzagão, D. K., Mallmann-Trenn, F., Radzik, T., & Rivera, N. (2023) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3583668.3594593 · Cited by 10
PARS-Push: Personalized, Asynchronous and Robust Decentralized Optimization
Toghani, M. T., Lee, S., & Uribe, C. A. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3189317 · Cited by 10
Gossip Protocols for Renaming and Sorting
Giakkoupis, G., Kermarrec, A.-M., & Woelfel, P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41527-2_14 · Cited by 10
Stablity of reset control systems with variable reset: Application to PI+CI compensation
Vidal, A., & Baños, A. (2009) · European Control Conference (ECC) · doi:10.23919/ecc.2009.7075171 · Cited by 10
Analyzing the techniques that improve fault tolerance of aggregation trees in sensor networks
Chitnis, L., Dobra, A., & Ranka, S. (2009) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2009.04.013 · Cited by 10
Self-citationProFID: Practical frequent items discovery in peer-to-peer networks
Çem, E., & Özkasap, Ö. (2012) · Future Generation Computer Systems · doi:10.1016/j.future.2012.10.002 · Cited by 10
Statistical structures for Internet-scale data management
Ntarmos, N., Triantafillou, P., & Weikum, G. (2009) · The VLDB Journal · doi:10.1007/s00778-009-0140-7 · Cited by 10
Uniform Sampling for Directed P2P Networks
Hall, C. P., & Carzaniga, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03869-3_49 · Cited by 10
Node counting in wireless ad-hoc networks
Evers, J. H. M., Kiss, D., & Kowalczyk, W. (2011) · TU/e Research Portal · Cited by 10
A Decentralized Approach to Network-Aware Service Composition
Cardellini, V., D’Angelo, M., Grassi, V., Marzolla, M., & Mirandola, R. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24072-5_3 · Cited by 10
Counting in Practical Anonymous Dynamic Networks is Polynomial
Chakraborty, M., Milani, A., & Mosteiro, M. A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46140-3_10 · Cited by 10
Amar, L., Barak, A., Drezner, Z., & Okun, M. (2009) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.1418 · Cited by 10
Brief Announcement: Practical Summation via Gossip
Terpstra, W. W., Leng, C., & Buchmann, A. (2007) · Cited by 10
Agreement in Epidemic Information Dissemination
Ayiad, M. M., Katti, A. P., & Fatta, G. D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45940-0_9 · Cited by 10
Decidability of Fair Termination of Gossip Protocols
Apt, K. R., & Wojtczak, D. (2018) · Kalpa publications in computing · doi:10.29007/62s4 · Cited by 10
Peer-to-Peer Data Mining, Privacy Issues, and Games
Bhaduri, K., Das, K., & Kargupta, H. (2007) · Springer eBooks · doi:10.1007/978-3-540-72839-9_1 · Cited by 10
Gossiping for threshold detection
Wuhib, F., Stadler, R., & Dam, M. (2009) · IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2009.5188818 · Cited by 10
Integrated Copyright Protection in Peer-to-Peer Networks
Lou, X., Hwang, K., & Zhou, R. (2007) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2007.40 · Cited by 10
On the Computational Power of Simple Dynamics
Natale, E. (2017) · HAL · Cited by 10
Distributed Consistent Data AssociationPreprint
Leonardos, S., Zhou, X., & Daniilidis, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.07015 · Cited by 9
Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate
Cheng, S., & Liang, S. (2020) · Kybernetika · doi:10.14736/kyb-2020-3-0559 · Cited by 9
Fast distributed optimization over directed graphs
Xi, C., Wu, Q., & Khany, U. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526694 · Cited by 9
Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs
Xie, P., You, K., Song, S., & Wu, C. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2284 · Cited by 9
Vosoughi, A., Cavallaro, J. R., & Marshall, A. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2716361 · Cited by 9
Dynamic Median Consensus Over Random Networks
Yu, S., Chen, Y., & Kar, S. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683179 · Cited by 9
Order optimal information spreading using algebraic gossip
Avin, C., Borokhovich, M., Censor-Hillel, K., & Lotker, Z. (2013) · Distributed Computing · doi:10.1007/s00446-013-0187-y · Cited by 9
Tamburri, D. A., Razo-Zapata, I. S., Fernández, H., & Tedeschi, C. (2012) · Principles of Engineering Service-Oriented Systems · doi:10.1109/pesos.2012.6225933 · Cited by 9
Asynchronous privacy-preserving iterative computation on peer-to-peer networks
Naranjo, J. A. M., Casado, L. G., & Jelasity, M. (2012) · Computing · doi:10.1007/s00607-012-0200-5 · Cited by 9
A Method to Improve Consensus Averaging using Quantized ADMM
Sriranga, N., Murthy, C. R., & Aggarwal, V. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849561 · Cited by 9
Ko, Y., & Kim, S. (2021) · Applied Sciences · doi:10.3390/app12010292 · Cited by 9
Tight Bounds on the Convergence Rate of Generalized Ratio Consensus Algorithms
Gerencsér, B. S., & Gerencsér, L. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3067629 · Cited by 9
Homogenizing Non-IID datasets via In-Distribution Knowledge Distillation for Decentralized Learning
Ravikumar, D., Saha, G., Aketi, S. A., & Roy, K. (2024) · Transactions on machine learning research · doi:10.48550/arxiv.2304.04326 · Cited by 9
Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks
Tsianos, K. I., & Rabbat, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2239992 · Cited by 9
Estimating global statistics for unstructured P2P search in the presence of adversarial peers
Richardson, S., & Cox, I. J. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609567 · Cited by 9
Evolving Proactive Aggregation Protocols
Weise, T., Zapf, M., & Geihs, K. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78671-9_22 · Cited by 9
Designing linear distributed algorithms with memory for fast convergence
Roy, S., Wan, Y., Saberi, A., & Xue, M. (2011) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1778 · Cited by 9
On distributed computation of information potentials
Loukas, A., Woehrle, M., Glatz, P. M., & Langendoen, K. G. (2012) · Foundations of Mobile Computing · doi:10.1145/2335470.2335475 · Cited by 9
Incremental Maintenance of Global Aggregates
Ahmed, N., Hadaller, D., & Keshav, S. (2006) · Cited by 9
A survey and performance evaluation of decentralized aggregation schemes for autonomic management
Makhloufi, R., Doyen, G., Bonnet, G., & Gaïti, D. (2014) · International Journal of Network Management · doi:10.1002/nem.1875 · Cited by 9
Ant-Inspired Dynamic Task Allocation via Gossiping
Su, H.-H., Su, L., Dornhaus, A., & Lynch, N. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-69084-1_11 · Cited by 9
Gradient Descent Localization in Wireless Sensor Networks
Alwan, N. A. S., & Hussain, Z. M. (2017) · InTech eBooks · doi:10.5772/intechopen.69949 · Cited by 9
Fully-Distributed Accelerated ADMM for DC Optimal Power Flow Problems with Demand Response
Matsuda, Y., Wakasa, Y., & Masuda, E. (2019) · Asian Control Conference (ASCC) · Cited by 9
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing
Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., & Wastell, C. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2016.10 · Cited by 9
On the Influence of Graph Density on Randomized Gossiping
Elsässer⋆, R., & Kaaser, D. (2015) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2015.32 · Cited by 9
Effects of Component-Subscription Network Topology on Large-Scale Data Centre Performance Scaling
Sriram, I., & Cliff, D. (2010) · IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) · doi:10.1109/iceccs.2010.21 · Cited by 9
Distributed data classification in sensor networks
Eyal, I., Keidar, I., & Rom, R. (2010) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1835698.1835738 · Cited by 9
Managing Multidimensional Historical Aggregate Data in Unstructured P2P Networks
Furfaro, F., Mazzeo, G. M., & Pugliese, A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.160 · Cited by 9
NBgossip - Neighborhood Gossip with Network Coding Based Message Aggregation
Lu, F. Y., Chia, L.-T., & Tay, K.-L. (2007) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2007.4428609 · Cited by 9
Smart Cameras for Wireless Camera Networks: Architecture Overview
Živković, Z., & Kleihorst, R. P. (2009) · Elsevier eBooks · doi:10.1016/b978-0-12-374633-7.00023-9 · Cited by 9
Rumor spreading with bounded in-degree
Daum, S., Kühn, F., & Maus, Y. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.05.041 · Cited by 9
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.