Discovery Through Gossip

DOI10.1002/rsa.20621zbMath1338.05253arXiv1202.2092OpenAlexW2302291170MaRDI QIDQ2811164

Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Bernhard Haeupler, David Peleg

Publication date: 10 June 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.2092

zbMATH Keywords

probabilistic analysisrandom processsocial networkdistributed algorithmresource discoverygossip-based algorithm

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Dynamic gossip ⋮ Self-stabilizing repeated balls-into-bins ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• T-Man: Gossip-based fast overlay topology construction
• Problems and results in extremal combinatorics. II
• Almost tight bounds for rumour spreading with conductance
• Almost-Optimal Gossip-Based Aggregate Computation
• Flooding time in edge-Markovian dynamic graphs
• Resource discovery in distributed networks
• A stochastic process on the hypercube with applications to peer-to-peer networks
• Fast Distributed Computation in Dynamic Networks via Random Walks
• Randomized Rumor Spreading in Dynamic Graphs
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Spatial gossip and resource location protocols
• Fast byzantine agreement in dynamic networks
• Computing separable functions via gossip
• Social networks spread rumors in sublogarithmic time
• Probability and Computing
• Self-* properties through gossiping
• Asynchronous resource discovery

This page was built for publication: Discovery Through Gossip