Efficient lookup on unstructured topologies

DOI10.1145/1073814.1073828zbMath1314.68385OpenAlexW2164319686MaRDI QIDQ5177227

Ruggero Morselli, Michael A. Marsh, Aravind Srinivasan, Bobby Bhattacharjee

Publication date: 10 March 2015

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

Full work available at URL: http://hdl.handle.net/1903/3331

zbMATH Keywords

random walksdistributed algorithmspeer-to-peer networkslookup protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

This page was built for publication: Efficient lookup on unstructured topologies