On the complexity of greedy routing in ring-based peer-to-peer networks

DOI10.1145/1281100.1281117zbMath1283.68070OpenAlexW2098749004MaRDI QIDQ5401398

Vassos Hadzilacos, George Giakkoupis

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

random graphslower boundcouplinggreedy routingpeer-to-peersmall-worlds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Internet topics (68M11)

Related Items (2)

Greedy routing in circulant networks ⋮ Greedy routing in small-world networks with power-law degrees

This page was built for publication: On the complexity of greedy routing in ring-based peer-to-peer networks