Why kad lookup fails

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

doi:10.1109/P2P.2009.5284547

Why kad lookup fails

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

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
Pages	121-130
Number of pages	10
DOIs	https://doi.org/10.1109/P2P.2009.5284547
State	Published - 2009
Event	IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing - Seattle, WA, United States Duration: Sep 9 2009 → Sep 11 2009

Publication series

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

Other

Other	IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
Country/Territory	United States
City	Seattle, WA
Period	9/9/09 → 9/11/09

Publisher link

10.1109/P2P.2009.5284547

Find It

Find It at U of M Libraries

Cite this

Kang, HJ, Chan-Tin, E, Hopper, N & Kim, Y 2009, Why kad lookup fails. in IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing., 5284547, IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing, pp. 121-130, IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing, Seattle, WA, United States, 9/9/09. https://doi.org/10.1109/P2P.2009.5284547

@inproceedings{c0b89a0b1c9741a194bbdb47fbfcf39a,

title = "Why kad lookup fails",

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.",

author = "Kang, {Hun J.} and Eric Chan-Tin and Nick Hopper and Yongdae Kim",

year = "2009",

doi = "10.1109/P2P.2009.5284547",

language = "English (US)",

isbn = "9781424450671",

series = "IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing",

pages = "121--130",

booktitle = "IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing",

}

TY - GEN

T1 - Why kad lookup fails

AU - Kang, Hun J.

AU - Chan-Tin, Eric

AU - Hopper, Nick

AU - Kim, Yongdae

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=73549114263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73549114263&partnerID=8YFLogxK

U2 - 10.1109/P2P.2009.5284547

DO - 10.1109/P2P.2009.5284547

M3 - Conference contribution

AN - SCOPUS:73549114263

SN - 9781424450671

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

SP - 121

EP - 130

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

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

Y2 - 9 September 2009 through 11 September 2009

ER -

Why kad lookup fails

Abstract

Publication series

Other

Publisher link

Find It

Other files and links

Fingerprint

Cite this