Resource discovery in distributed networks

DOI10.1145/301308.301362MaRDI QIDQ2942766zbMATH OpenOpenAlexFDO

Authors Mor Harchol-Balter, Tom Leighton, D. Lewin

Publication date 11 September 2015

Published in Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Cited in

(15)

• A note on models for graph representations
• Probabilistic quorums for dynamic systems
• Breaking the \(\log n\) barrier on rumor spreading
• A note on the parallel runtime of self-stabilizing graph linearization
• Faster rumor spreading with multiple calls
• A deterministic worst-case message complexity optimal solution for resource discovery
• Dynamic gossip
• Efficient communication in unknown networks
• Discovery through gossip
• Randomized rumor spreading in poorly connected small-world networks
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Probabilistic Analysis of Rumor-Spreading Time
• On the Push&Pull Protocol for Rumor Spreading
• Rumor spreading and vertex expansion
• Robust gossiping with an application to consensus

This page was built for publication: Resource discovery in distributed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942766)