SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Label-connected graphs and the gossip problem
Discrete Mathematics
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Computer Systems (TOCS)
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
On collaborative content distribution using multi-message gossip
Journal of Parallel and Distributed Computing
The promise, and limitations, of gossip protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Dynamic address allocation for self-organised management and control in sensor networks
International Journal of Mobile Network Design and Innovation
An epidemiological model for semantics dissemination
Proceedings of the 3rd international conference on Mobile multimedia communications
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the application of epidemical spreading in collaborative context-aware computing
ACM SIGMOBILE Mobile Computing and Communications Review
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Do neighbor-avoiding walkers walk as if in a small-world network?
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An analytical model for multi-epidemic information dissemination
Journal of Parallel and Distributed Computing
On collaborative content distribution using multi-message gossip
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Niche-seeking in influence maximization with adversary
Proceedings of the 14th Annual International Conference on Electronic Commerce
An adaptive epidemic information dissemination model for wireless sensor networks
Pervasive and Mobile Computing
Brief announcement: node sampling using centrifugal random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Journal of the ACM (JACM)
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Journal of the ACM (JACM)
Hi-index | 0.00 |
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying deterministic or randomized algorithm, exchanging information in each communication step. In a variety of contexts, the use of randomization to propagate information has been found to provide better reliability and scalability than more regimented deterministic approaches.In many settings, such as a cluster of distributed computing hosts, new information is generated at individual nodes, and is most "interesting" to nodes that are nearby. Thus, we propose distance-based propagation bounds as a performance measure for gossip mechanisms: a node at distance d from the origin of a new piece of information should be able to learn about this information with a delay that grows slowly with d, and is independent of the size of the network.For nodes arranged with uniform density in Euclidean space, we present natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to nodes at distance d, with high probability, in O(log1 + ϵ d) time steps. Such a bound combines the desirable qualitative features of uniform gossip, in which information is spread with a delay that is logarithmic in the full network size, and deterministic flooding, in which information is spread with a delay that is linear in the distance and independent of the network size. Our mechanisms and their analysis resolve a conjecture of Demers et al. [1987].We further show an application of our gossip mechanisms to a basic resource location problem, in which nodes seek to rapidly learn the location of the nearest copy of a resource in a network. This problem, which is of considerable practical importance, can be solved by a very simple protocol using Spatial Gossip, whereas we can show that no protocol built on top of uniform gossip can inform nodes of their approximately nearest resource within poly-logarithmic time. The analysis relies on an additional useful property of spatial gossip, namely that information travels from its source to sinks along short paths not visiting points of the network far from the two nodes.