Routing Algorithms for DHTs: Some Open Questions

By Sylvia Ratnasamy, Ion Stoica, Scott Shenker. International Workshop on Peer-to-Peer Systems, 2002

333 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “The CAN team documented several open research questions pertaining to state/hopcount tradeoffs, resilience, load, locality and heterogeneous peers [44,294].”
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience (2003, background): “Categories and Subject Descriptors C.2.2 [Communication Networks]: Network Protocols General Terms Algorithms, Performance, Theory Keywords Peer-to-peer, Modeling, Graph Theory, DHT, de Bruijn 1.”
MAAN: A Multi-Attribute Addressable Network for Grid Information Services (2003, background): “These systems typically support distributed hash table (DHT) functionality and the basic operation they offer is lookup (key), which returns the identity of the node storing the object with the key [12].”
Efficient content location using interest-based locality in peer-to-peer systems (2003, background): “Although DHTs are elegant and scalable, their performance under the dynamic conditions common for peer-to-peer systems is unknown [8].”
A scalable distributed information management system (2004, methodology): “The observation that DHTs internally provide a scalable forest of reduction trees is not new.”