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 501–600 of 1,004
Flow updating: Fault-tolerant aggregation for dynamic networks
Jesus, P., Baquero, C., & Almeida, P. S. (2015) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2015.02.003 · Cited by 21
A gossiping protocol for detecting global threshold crossings
Wuhib, F., Dam, M., & Stadler, R. (2010) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2010.i9p0329 · Cited by 21
Estimation of a Population Size in Large-Scale Wireless Sensor Networks
Peng, S., Li, S., Liao, X., Peng, Y., & Xiao, N. (2009) · Journal of Computer Science and Technology · doi:10.1007/s11390-009-9273-9 · Cited by 21
Dependability in Aggregation by AveragingPreprint
Jesus, P., Baquero, C., & Almeida, P. S. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.6596 · Cited by 21
Distributed average consensus for wireless sensor networks
Bénézit, F. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-4509 · Cited by 20
Random Node-Asynchronous Updates on Graphs
Teke, O., & Vaidyanathan, P. P. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2910485 · Cited by 20
Manfredi, S. (2011) · Ad Hoc Networks · doi:10.1016/j.adhoc.2011.05.005 · Cited by 20
Diffusion of Information on Networked Lattices by Gossip
Riess, H., & Ghrist, R. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992539 · Cited by 20
Roy, B. V., & Moallemi, C. C. (2005) · neural information processing systems · Cited by 20
Gossip-Based Networking for Internet-Scale Distributed Systems
Rivière, É., & Voulgaris, S. (2011) · Lecture notes in business information processing · doi:10.1007/978-3-642-20862-1_18 · Cited by 20
Hossmann, T., Spyropoulos, T., & Legendre, F. (2010) · Cited by 20
Identifying frequent items in a network using gossip
Lahiri, B., & Tirthapura, S. (2010) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2010.07.006 · Cited by 20
Necchi, L., Bonivento, A., Lavagno, L., Sangiovanni-Vincentelli, A. L., & Vanzago, L. (2007) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2007.619 · Cited by 20
BlockTree: Location-aware decentralized monitoring in mobile ad hoc networks
Stingl, D., Groß, C., Nobach, L., Steinmetz, R., & Hausheer, D. (2013) · Conference on Local Computer Networks · doi:10.1109/lcn.2013.6761269 · Cited by 20
Dynamic Approaches to In-network Aggregation
Kennedy, O. A., Koch, C. E., & Demers, A. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.233 · Cited by 20
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
Haeupler, B., Mohapatra, J., & Su, H.-H. (2018) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3212734.3212770 · Cited by 20
A generic theoretical framework for modeling gossip-based algorithms
Fernandess, Y., Anta, A. F., & Monod, M. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1317379.1317384 · Cited by 20
Probabilistic Analysis of Rumor-Spreading Time
Mocquard, Y., Séricola, B., & Anceaume, E. (2019) · INFORMS journal on computing · doi:10.1287/ijoc.2018.0845 · Cited by 20
Processing proximity queries in sensor networks
Kotidis, Y. (2006) · doi:10.1145/1315903.1315905 · Cited by 20
Spectral methods for data analysis
McSherry, F., & Karlin, A. R. (2004) · Cited by 20
Accelerating the Decentralized Federated Learning via Manipulating Edges
Zhou, M., Liu, G., Lu, K., Mao, R., & Liao, H. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645509 · Cited by 19
Decentralized Consensus Optimization and Resource Allocation
Nedić, A., Olshevsky, A., & Shi, W. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97478-1_10 · Cited by 19
Asynchronous Subgradient-Push.Preprint
Assran, M., & Rabbat, M. (2018) · arXiv (Cornell University) · Cited by 19
Morral, G., Bianchi, P., & Fort, G. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666771 · Cited by 19
Saddle-point dynamics for distributed convex optimization on general directed graphs
Touri, B., & Gharesifard, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798375 · Cited by 19
Distributed Projection Approximation Subspace Tracking based on consensus propagation
Reyes, C., Hilaire, T., & Mecklenbräuker, C. F. (2009) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2009.5413263 · Cited by 19
Distributed on-line multidimensional scaling for self-localization in wireless sensor networks
Morral, G., & Bianchi, P. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.08.014 · Cited by 19
On the Push&Pull Protocol for Rumour Spreading
Acan, H., Collevecchio, A., Mehrabian, A., & Wormald, N. (2015) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2767386.2767416 · Cited by 19
Sven, S., Blochinger, W., & Hannak, H. (2009) · Journal of Grid Computing · doi:10.1007/s10723-008-9114-z · Cited by 19
Iterative Approximate Consensus in the Presence of Byzantine Link Failures
Tseng, L., & Vaidya, N. H. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09581-3_7 · Cited by 19
Self-Stabilizing Clock Synchronization with 1-bit Messages
Bastide, P., Giakkoupis, G., & Saribekyan, H. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976465.129 · Cited by 19
Distributed data clustering in sensor networks
Eyal, I., Keidar, I., & Rom, R. (2011) · Distributed Computing · doi:10.1007/s00446-011-0143-7 · Cited by 19
Epidemic-based self-organization in peer-to-peer systems
Voulgaris, S. (2006) · Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam) · Cited by 19
An efficient local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
Bhaduri, K., & Kargupta, H. (2008) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.14 · Cited by 18
Distributed Optimization With Asynchronous Computation and Event-Triggered Communication
Dong, Z., Jin, Y., Mao, S., Ren, W., Du, W., & Tang, Y. S. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3449140 · Cited by 18
Nomographic Gossiping for f-Consensus
Goldenbaum, M., Boche, H., & Stańczak, S. (2012) · mediaTUM (Technical University of Munich) · Cited by 18
Practical summation via gossip
Terpstra, W. W., Leng, C., & Buchmann, A. (2007) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1281100.1281188 · Cited by 18
Monitoring and management of peer-to-peer systems
Graffi, K. (2010) · ACM SIGMultimedia Records · doi:10.1145/2039331.2039337 · Cited by 18
Distributed EM Learning for Appearance Based Multi-Camera Tracking
Mensink, T., Zajdel, W., & Kröse, B. (2007) · ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC) · doi:10.1109/icdsc.2007.4357522 · Cited by 18
A Survey on Distributed Hash Table (DHT): Theory, Platforms, and Applications
Zhang, H., Wen, Y., Xie, H., & Yu, N. (2013) · Cited by 18
Su, H.-I., & Gamal, A. E. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048474 · Cited by 18
Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm
Gupta, R., & Singh, Y. N. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427793 · Cited by 18
Asymmetric information diffusion via gossiping on static and dynamic networks
Yildiz, M. E., Scaglione, A., & Ozdaglar, A. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717918 · Cited by 18
Haeupler, B., Pandurangan, G., Peleg, D., Rajaraman, R., & Sun, Z. (2016) · Random Structures and Algorithms · doi:10.1002/rsa.20621 · Cited by 18
Distributed Gradient Descent Localization in Wireless Sensor Networks
Alwan, N. A. S., & Mahmood, A. S. (2015) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-014-1552-2 · Cited by 18
Rumor Spreading with Bounded In-Degree
Daum, S., Kühn, F., & Maus, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48314-6_21 · Cited by 18
On the Computational Complexity of Gossip Protocols
Apt, K. R., Kopczyński, E., & Wojtczak, D. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/106 · Cited by 18
Decentralized Computation of Threshold Crossing Alerts
Wuhib, F., Dam, M., Stadler, R., & Clemm, A. (2005) · Lecture notes in computer science · doi:10.1007/11568285_19 · Cited by 18
Decentralized Federated Learning on the Edge Over Wireless Mesh Networks
Salama, A., Stergioulis, A., Zaidi, S. A. R., & McLernon, D. (2023) · IEEE Access · doi:10.1109/access.2023.3329362 · Cited by 17
Accelerated Distributed Stochastic Nonconvex Optimization Over Time-Varying Directed Networks
Chen, Y., Hashemi, A., & Vikalo, H. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3479888 · Cited by 17
A fast proximal gradient algorithm for decentralized composite optimization over directed networks
Zeng, J., He, T., & Wang, M. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.07.005 · Cited by 17
Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3216286 · Cited by 17
Ravi, N., & Scaglione, A. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.185 · Cited by 17
A general framework for population-based distributed optimization over networks
Ai, W., Chen, W., & Xie, J. F. (2017) · Information Sciences · doi:10.1016/j.ins.2017.08.010 · Cited by 17
Trust‐based self‐organising network control
Haus, T., Palunko, I., Tolić, D., Bogdan, S., Lewis, F. L., & Mikulski, D. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.0333 · Cited by 17
Secure Non-Consensus Based Spectrum Sensing in Non-Centralized Cognitive Radio Networks
Rajkumari, R., & Marchang, N. (2018) · IEEE Sensors Journal · doi:10.1109/jsen.2018.2816595 · Cited by 17
Dominating Set Model Aggregation for Communication-Efficient Decentralized Deep Learning
Fotouhi, F., Balu, A., Jiang, Z., Esfandiari, Y., Jahani, S., & Sarkar, S. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.11.057 · Cited by 17
Information Dissemination via Gossip: Applications to Averaging and CodingPreprint
Mosk-Aoyama, D., & Shah, D. (2005) · arXiv (Cornell University) · Cited by 17
Computation over Mismatched Channels
Karamchandani, N., Niesen, U., & Diggavi, S. N. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130405 · Cited by 17
On the uniformity of peer sampling based on view shuffling
Busnel, Y., Beraldi, R., & Baldoni, R. (2011) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2011.01.009 · Cited by 17
New broadcast based distributed averaging algorithm over wireless sensor networks
Iutzeler, F., Ciblat, P., Hachem, W., & Jakubowicz, J. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288575 · Cited by 17
Smoothed analysis of dynamic networks
Dinitz, M., Fineman, J. T., Gilbert, S. L., & Newport, C. (2017) · Distributed Computing · doi:10.1007/s00446-017-0300-8 · Cited by 17
The Cost of Fault Tolerance in Multi-Party Communication Complexity
Chen, B., Yu, H., Zhao, Y., & Gibbons, P. B. (2014) · Journal of the ACM · doi:10.1145/2597633 · Cited by 17
Network cardinality estimation using max consensus: The case of Bernoulli trials
Lucchese, R., Varagnolo, D., Delvenne, J., & Hendrickx, J. M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402342 · Cited by 17
Robust management of outliers in sensor network aggregate queries
Kotidis, Y., Vassalos, V., Deligiannakis, A., Stoumpos, V., & Delis, A. (2007) · ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE) · doi:10.1145/1254850.1254854 · Cited by 17
A cooperative spectrum sensing scheme for cognitive radio ad hoc networks based on gossip and trust
Vosoughi, A., Cavallaro, J. R., & Marshall, A. (2014) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2014.7032307 · Cited by 16
Randomized Matrix Weighted Consensus
Le-Phan, N.-M., Trinh, M. H., & Nguyen, P. D. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3376643 · Cited by 16
On Matrix Factorization and Scheduling for Finite-Time Average-Consensus
Ko, C.-K. (2010) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/gct7-5y66 · Cited by 16
Asynchronous decentralized optimization in heterogeneous systems
Rabbat, M., & Tsianos, K. I. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039532 · Cited by 16
Robust Privacy-Preserving Gossip Averaging
Pilet, A. B., Frey, D., & Taïani, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34992-9_4 · Cited by 16
Fully Asynchronous Push-Sum With Growing Intercommunication Intervals
Olshevsky, A., Paschalidis, I. C., & Spiridonoff, A. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431414 · Cited by 16
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs
Halldórsson, M. M., & Konrad, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48653-5_37 · Cited by 16
Verma, V. K., Singh, S., & Pathak, N. P. (2015) · Wireless Personal Communications · doi:10.1007/s11277-015-3049-z · Cited by 16
Order optimal information spreading using algebraic gossip
Avin, C., Borokhovich, M., Censor-Hillel, K., & Lotker, Z. (2011) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1993806.1993883 · Cited by 16
LiMoSense: live monitoring in dynamic sensor networks
Eyal, I., Keidar, I., & Rom, R. (2014) · Distributed Computing · doi:10.1007/s00446-014-0213-8 · Cited by 16
Strong robustness of randomized rumor spreading protocols
Doerr, B., Huber, A. L., & Levavi, A. (2012) · Discrete Applied Mathematics · doi:10.1016/j.dam.2012.10.014 · Cited by 16
Global Detection of Flooding-Based DDoS Attacks Using a Cooperative Overlay Network
Velauthapillai, T., Harwood, A., & Karunasekera, S. A. (2010) · International Conference on Network and System Security (NSS) · doi:10.1109/nss.2010.68 · Cited by 16
Description and composition of bio-inspired design patterns: the gradient case
Fernandez-Marquez, J. L., Arcos, J. L., Serugendo, G. D. M., Viroli, M., & Montagna, S. (2011) · doi:10.1145/1998570.1998575 · Cited by 16
Das, K., Bhaduri, K., Arora, S., Griffin, W., Borne, K. D., Giannella, C. R., & Kargupta, H. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.22 · Cited by 16
On the Communication Architecture for Wide-Area Real-Time Monitoring in Power Networks
Kirti, S., Wang, Z., Scaglione, A., & Thomas, R. J. (2007) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2007.405 · Cited by 16
Distributed Data Mining for Sustainable Smart Grids
Mallik, R., Sarda, N., & Kargupta, H. (2014) · Cited by 15
Local interference can accelerate gossip algorithms
Nazer, B., Dimakis, A. G., & Gastpar, M. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797612 · Cited by 15
Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
Beznosikov, A. N., Rogozin, A., Kovalev, D. A., & Gasnikov, A. V. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-91059-4_18 · Cited by 15
Distributed learning of average belief over networks using sequential observations
Zhang, K., Liu, Y., Liu, J., Liu, M., & Başar, T. (2020) · Automatica · doi:10.1016/j.automatica.2020.108857 · Cited by 15
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P., & Mosteiro, M. A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25873-2_35 · Cited by 15
Distributed Aggregate Function Estimation by Biphasically Configured Metropolis-Hasting Weight Model
Kenyeres, M., Kenyeres, J., Škorpil, V., & Bürget, R. (2017) · Radioengineering · doi:10.13164/re.2017.0479 · Cited by 15
Vosoughi, A., Cavallaro, J. R., & Marshall, A. (2014) · Globecom · doi:10.1109/glocom.2015.7417492 · Cited by 15
Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods
Straková, H., Niederbrucker, G., & Gansterer, W. N. (2013) · Procedia Computer Science · doi:10.1016/j.procs.2013.05.182 · Cited by 15
R-FAST: Robust Fully-Asynchronous Stochastic Gradient Tracking Over General Topology
Zhu, Z., Tian, Y., Huang, Y. T., Xu, J., & He, S. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3444484 · Cited by 15
Decentralized Federated Learning Over Imperfect Communication Channels
Li, W., Lv, T., Ni, W., Zhao, J., Hossain, E., & Poor, H. V. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3407208 · Cited by 15
Riggio, M., Mrissa, M., Krész, M., Včelák, J., Sandak, J., & Sandak, A. (2022) · Frontiers in Built Environment · doi:10.3389/fbuil.2022.887593 · Cited by 15
A parameter-free load balancing mechanism for P2P networks
Steele, T., Vishnumurthy, V., & Francis, P. (2008) · International Workshop on Peer-to-Peer Systems · Cited by 15
Robust Average Consensus using Total Variation Gossip Algorithm
Ben‐Ameur, W., Bianchi, P., & Jakubowicz, J. (2012) · International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS) · doi:10.4108/valuetools.2012.250316 · Cited by 15
ChurnDetect: A Gossip-Based Churn Estimator for Large-Scale Dynamic Networks
Pruteanu, A., Iyer, V., & Dulman, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23397-5_29 · Cited by 15
RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication
Luk, V. W.-H., Wong, A. K.-S., Lea, C., & Ouyang, R. W. (2013) · Journal of Internet Services and Applications · doi:10.1186/1869-0238-4-14 · Cited by 15
A self-organizing P2P framework for collective service discovery
Mastroianni, C., & Papuzzo, G. (2013) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2013.07.002 · Cited by 15
Jurca, D., & Stadler, R. (2010) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2010.06.i8p0292 · Cited by 15
Adaptive real-time monitoring for large-scale networked systems
Prieto, A. G., & Stadler, R. (2009) · IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2009.5188884 · Cited by 15
Generalized distributed rate limiting
Stanojević, R., & Shorten, R. N. (2009) · International Workshop on Quality of Service · doi:10.1109/iwqos.2009.5201389 · Cited by 15
A generic and adaptive aggregation service for large-scale decentralized networks
Pournaras, E., Warnier, M., & Brazier, F. M. T. (2013) · Complex Adaptive Systems Modeling · doi:10.1186/2194-3206-1-19 · Cited by 15
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.