Resource discovery in distributed networks

DOI10.1145/301308.301362zbMath1321.68083OpenAlexW2071294844MaRDI QIDQ2942766

Mor Harchol-Balter, Leighton, Tom, Daniel R. 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

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

Related Items (15)

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

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