Why kad lookup fails

Hun J. Kang, Eric Chan-Tin, Nick Hopper, Yongdae Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Scopus citations

Abstract

A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup performance of locating nodes responsible for replicated information in Kad - one of the largest DHT networks existing currently. Throughout the measurement study, we found that Kad lookups locate only 18% of nodes storing replicated data. This failure leads to limited reliability and an inefficient use of resources during lookups. Ironically, we found that this poor performance is due to the high level of routing table similarity, despite the relatively high churn rate in the network. We propose solutions which either exploit the high routing table similarity or avoid the duplicate returns using multiple target keys.

Original languageEnglish (US)
Title of host publicationIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
Pages121-130
Number of pages10
DOIs
StatePublished - 2009
EventIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing - Seattle, WA, United States
Duration: Sep 9 2009Sep 11 2009

Publication series

NameIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing

Other

OtherIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
CountryUnited States
CitySeattle, WA
Period9/9/099/11/09

Fingerprint

Dive into the research topics of 'Why kad lookup fails'. Together they form a unique fingerprint.

Cite this