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
Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
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
The diameter of a long range percolation graph
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Smart-tag based data dissemination
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Parametric probabilistic sensor network routing
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Web Communities: Models and Algorithms
World Wide Web
Fractionally cascaded information in a sensor network
Proceedings of the 3rd international symposium on Information processing in sensor networks
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Spatially-decaying aggregation over a network: model and algorithms
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
SPAWN: a swarming protocol for vehicular ad-hoc wireless networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
A churn-resistant peer-to-peer web caching system
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
An Efficient Topology-Adaptive Membership Protocol for Large-Scale Cluster-Based Services
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
ACM Computing Surveys (CSUR)
Proceedings of the 2005 ACM symposium on Applied computing
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Can unstructured P2P protocols survive flash crowds?
IEEE/ACM Transactions on Networking (TON)
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
Parametric probabilistic routing in sensor networks
Mobile Networks and Applications
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Streaming in a connected world: querying and tracking distributed data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Modeling spread of ideas in online social networks
AusDM '06 Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Gossiping on MANETs: the beauty and the beast
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Supporting self-organization for hybrid grid resource scheduling
Proceedings of the 2008 ACM symposium on Applied computing
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
International Journal of Distributed Sensor Networks
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
A random walk model for infection on graphs
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Continuous approximate window queries in wireless sensor networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Optimizing information flow in the gossip objects platform
ACM SIGOPS Operating Systems Review
Holistic operations in large-scale sensor network systems: a probabilistic peer-to-peer approach
Future directions in distributed computing
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Networked Graphics: Building Networked Games and Virtual Environments
Networked Graphics: Building Networked Games and Virtual Environments
In-network coding for resilient sensor data storage and efficient data mule collection
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
Discrete Event Dynamic Systems
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Near optimal routing in a small-world network with augmented local awareness
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
An efficient cluster-hierarchy architecture model ECHP2P for p2p networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
SDSR: a scalable data storage and retrieval service for wireless ad hoc networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Sub-linear universal spatial gossip protocols
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Push- and pull-based epidemic spreading in networks: Thresholds and deeper insights
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Think globally, act locally: on the reshaping of information landscapes
Proceedings of the 12th international conference on Information processing in sensor networks
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
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 --- consider a network of sensors, or 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 algorithms: 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 algorithms that satisfy such a guarantee: new information is spread to nodes at distance \DIST, with high probability, in O(\log^{1 + \ve} \DIST) 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 algorithms and their analysis resolve a conjecture of Demers et al. We show an application of our gossip algorithms to a basic resource location problem, in which nodes seek to rapidly