Routing networks for distributed hash tables
From MaRDI portal
Publication:2943752
DOI10.1145/872035.872054zbMATH Open1321.68484OpenAlexW2142418251MaRDI QIDQ2943752FDOQ2943752
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
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.
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)
Cites Work
Cited In (15)
- Viceroy, a scalable and dynamic emulation of the butterfly
- Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
- Degree-optimal routing for P2P systems
- Formal specification of the Kademlia and the Kad routing tables in Maude
- Virtual Ring Routing Trends
- Adaptive hash routing for a cluster of client-side web proxies
- Choosing a random peer in Chord
- Title not available (Why is that?)
- Principles of Distributed Systems
- The expansion and mixing time of skip graphs with applications
- Choosing a random peer
- Breeding diameter-optimal topologies for distributed indexes
- Shortest-path routing in randomized DHT-based peer-to-peer systems
- Peer counting and sampling in overlay networks based on random walks
- Novel architectures for P2P applications: the continuous-discrete approach
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)
