Spatial gossip and resource location protocols

DOI10.1145/380752.380796zbMath1323.68015OpenAlexW1975950716MaRDI QIDQ5175964

Alan Demers, David Kempe, Jon M. Kleinberg

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380796

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12)

Related Items (15)

Unnamed Item ⋮ Agent-based randomized broadcasting in large networks ⋮ Spatially-decaying aggregation over a network ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ Rumor Spreading with No Dependence on Conductance ⋮ A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ Analysis of randomized protocols for conflict-free distributed access ⋮ Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing ⋮ Optimal routing in a small-world network ⋮ Discovery Through Gossip ⋮ Efficient distributed computation of distance sketches in networks ⋮ Sub-linear Universal Spatial Gossip Protocols ⋮ A probabilistic characterization of a fault-tolerant gossiping algorithm

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Spatial gossip and resource location protocols