Spatially-decaying aggregation over a network: model and algorithms
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
An empirical evaluation of internet latency expansion
ACM SIGCOMM Computer Communication Review
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient and decentralized computation of approximate global state
ACM SIGCOMM Computer Communication Review
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
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
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Spatially-decaying aggregation over a network
Journal of Computer and System Sciences
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Prioritized gossip in vehicular networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Time and communication efficient consensus for crash failures
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
Characterizing continuous time random walks on time varying graphs
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
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)
Prioritized gossip in vehicular networks
Ad Hoc Networks
Reprint of "Prioritized gossip in vehicular networks"
Ad Hoc Networks
Hi-index | 0.00 |
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise underlying distributed gossip is very simple: in each time step, each node v in the system selects some other node w as a communication partner 驴 generally by a simple randomized rule 驴 and exchanges information with w ; over a period of time, information spreads through the system in an "epidemic fashion".A fundamental issue which is not well understood is the following: how does the underlying low-level gossip mechanism 驴 the means by which communication partners are chosen 驴 affect one's ability to design efficient high-level gossip-based protocols? We establish one of the first concrete results addressing this question, by showing a fundamentallimitation on the power of the commonly used uniform gossip mechanism for solving nearest-resource location problems. In contrast, very efficient protocols for this problem can be designed using a non-uniform spatial gossip mechanism, as established in earlier work with Alan Demers.We go on to consider the design of protocols for more complex problems, providing an efficient distributed gossip-based protocol for a set of nodes in Euclidean space to construct an approximate minimum spanning tree. Here too, we establish a contrasting limitation on the power of uniform gossip for solving this problem. Finally, we investigate gossip-based packet routing as a primitive that underpins the communication patterns in many protocols, and as away to understand the capabilities of different gossip mechanisms at a general level.