D1HT: A Distributed One Hop Hash Table

DMCA

D1HT: A Distributed One Hop Hash Table

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Luiz R. Monnerat , Claudio L. Amorim

Venue:	in Proc. of IPDPS, Apr 2006. [Online]. Available: http://www.lcp.coppe.ufrj.br
Citations:	15 - 2 self

BibTeX

@INPROCEEDINGS{Monnerat_d1ht:a,
    author = {Luiz R. Monnerat and Claudio L. Amorim},
    title = {D1HT: A Distributed One Hop Hash Table},
    booktitle = {in Proc. of IPDPS, Apr 2006. [Online]. Available: http://www.lcp.coppe.ufrj.br},
    year = {}
}

OpenURL

Abstract

Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for huge and dynamic peer-to-peer (P2P) systems. We formally define the algorithm we propose to detect and notify any membership change in the system, prove its correctness and performance properties, and present a Quarantine-like mechanism to reduce the overhead caused by volatile peers. Our analyses show that D1HT has reasonable maintenance bandwidth requirements even for very large systems, while presenting at least twice less bandwidth overhead than previous single hop DHT. 1.

Keyphrases

hop hash table dynamic peer-to-peer previous single hop dht reasonable maintenance bandwidth requirement volatile peer large system membership change maintenance traffic reasonable maintenance traffic multiple hop hash table bandwidth overhead performance property quarantine-like mechanism novel single hop dht

DMCA