When Multi-hop Peer-to-Peer Lookup Matters

Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multihop optimizations make sense only for truly vast and very dynamic peer networks. We also observe that resource trends indicate this scale is on the rise.

• Type: Conference
• Year: 2004
• Where: IPTPS
• Authors: Rodrigo Rodrigues, Charles Blake
• Keywords: Distributed Hash Tables, IPTPS 2004, Multi-hop Lookup Optimizations, Optimizations Make Sense