Why Kad Lookup Fails

Thumbnail Image

View/Download File

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Why Kad Lookup Fails

Published Date






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. This similarity results in duplicated responses from many peers en route to a target, which effectively limits the number of unique nodes found - hence the nodes responsible for storing replicated data are not located. We propose solutions which either exploit the high routing table similarity or avoid the duplicate returns using multiple target keys. Our solutions can locate more than 80% of nodes storing the replicated information while simultaneously balancing the lookup load.



Related to



Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

KangJeong, Hun; Chan-tin, Eric D.; Hopper, Nicholas J.; Kim, Yongdae. (2009). Why Kad Lookup Fails. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215806.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.