Routing networks for distributed hash tables

DOI10.1145/872035.872054MaRDI QIDQ2943752zbMATH OpenOpenAlexFDO

Authors Gurmeet Singh Manku

Publication date 4 September 2015

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

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

Mathematics Subject Classification ID

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

Recommendations

• Degree-optimal routing for P2P systems
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Novel architectures for P2P applications: the continuous-discrete approach
• Fault-tolerant routing in peer-to-peer systems
• Structured peer-to-peer systems. Fundamentals of hierarchical organization, routing, scaling, and security. Foreword by Ion Stoica.

Cited in

(15)

• Adaptive hash routing for a cluster of client-side web proxies
• Peer counting and sampling in overlay networks based on random walks
• The expansion and mixing time of skip graphs with applications
• Choosing a random peer in Chord
• Shortest-path routing in randomized DHT-based peer-to-peer systems
• Formal specification of the Kademlia and the Kad routing tables in Maude
• scientific article; zbMATH DE number 2089334 (Why is no real title available?)
• Novel architectures for P2P applications: the continuous-discrete approach
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Breeding diameter-optimal topologies for distributed indexes
• Virtual Ring Routing Trends
• Viceroy, a scalable and dynamic emulation of the butterfly
• Choosing a random peer
• Principles of Distributed Systems
• Degree-optimal routing for P2P systems

This page was built for publication: Routing networks for distributed hash tables

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