Why Kad lookup fails

Kang, Hun Jeong; Chan-Tin, Eric; Hopper, Nicholas; Kim, Yong‐Dae

doi:10.1109/p2p.2009.5284547

Cited by 29 publications

(20 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kang et al [4] analyzed Kad's poor lookup performance from the perspective of inconsistency between the publish and search processes. They think that the lookup inconsistency is due to the high level of routing table similarity.…”

Section: B Related Workmentioning

confidence: 99%

“…In 2009, two fixes were proposed to improve Kad lookup reliability in [4]. At present, the Fix1 has been adopted by the latest eMule and aMule.…”

Section: A Reliability Of Current Kadmentioning

confidence: 99%

“…At present, the Fix1 has been adopted by the latest eMule and aMule. We implement Fix2 in Anthill according to the descriptions in [4] (our implementation has been sent and checked by the author of [4]). We conduct experiments to test their performance.…”

Section: A Reliability Of Current Kadmentioning

confidence: 99%

“…Kang et al investigated the unsatisfactory reliability of Kad in 2009 [4]. They found that failures were mostly due to the high level of routing table similarity.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Revisiting why Kad lookup fails

Liu

Wei

Zhang

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Abstract-Kad is one of the most popular peer-to-peer (P2P) networks deployed on today's Internet. Its reliability is dependent on not only to the usability of the file-sharing service, but also to the capability to support other Internet services. However, Kad can only attain around a 91% lookup success ratio today. We build a measurement system called Anthill to analyze Kad's performance quantitatively, and find that Kad's failures can be classified into four types: packet loss, selective Denial of Service (sDoS) nodes, search sequence miss, and publish/search space miss. The first two are due to environment changes, the third is caused by the detachment of routing and content operations in Kad, and the last one shows the limitations of the Kademlia DHT algorithm under Kad's current configuration. Based on the analysis, we propose corresponding approaches for Kad, which achieve a success ratio of 99.8%, with only moderate communication overhead.

show abstract

Section: B Related Workmentioning

confidence: 99%

“…In 2009, two fixes were proposed to improve Kad lookup reliability in [4]. At present, the Fix1 has been adopted by the latest eMule and aMule.…”

Section: A Reliability Of Current Kadmentioning

confidence: 99%

Section: A Reliability Of Current Kadmentioning

confidence: 99%

“…Kang et al investigated the unsatisfactory reliability of Kad in 2009 [4]. They found that failures were mostly due to the high level of routing table similarity.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Revisiting why Kad lookup fails

Liu

Wei

Zhang

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

show abstract

“…the the basic KAD scheme. The authors in [8] -another work specific to KAD -propose a load balancing scheme which is not adaptive, and does not avoid the loss of information.…”

Section: Related Workmentioning

confidence: 99%

Adaptive load balancing in KAD

Carra

Steiner²,

Michiardi

2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Abstract-The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, which pinpoints several deficiencies of the present KAD design in handling popular objects, we set off to design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity; (ii) it solves problems related to saturated peers, that entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

show abstract