An effective single-hop distributed hash table with high lookup performance and low traffic overhead

摘要

Distributed hash tables (DHTs) have been used in several applications, but most DHTs have opted to solvernlookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paperrnpresents D1HT, an original DHT that has a peer-to-peer and self-organizing architecture and maximizesrnlookup performance with reasonable maintenance traffic, and a Quarantine mechanism to reduce overheadsrncaused by volatile peers. We implemented both D1HT and a prominent single-hop DHT, and we performedrnan extensive and highly representative DHT experimental comparison, followed by complementary analyticalrnstudies. In comparison with current single-hop DHTs, our results showed that D1HT consistently hadrnthe lowest bandwidth requirements, with typical reductions of up to one order of magnitude, and that D1HTrncould be used even in popular Internet applications with millions of users. In addition, we ran the first latencyrnexperiments comparing DHTs to directory servers, which revealed that D1HT can achieve latencies equivalentrnto or better than a directory server, and confirmed its greater scalability properties. Overall, our extensivernset of results allowed us to conclude that D1HT can provide a very effective solution for a broad range ofrnenvironments, from large-scale corporate data centers to widely deployed Internet applications.