Sub-Second Lookups on a Large-Scale Kademlia-Based Overlay
2011 (English)In: 11th IEEE International Conference on Peer-to-Peer Computing 2011 (P2P’11), IEEE , 2011, 82-91 p.Conference paper (Refereed)
Previous studies of large-scale (multimillion node) Kademlia-based DHTs have shown poor performance, measured in seconds, in contrast to the far more optimistic results from theoretical analysis, simulations and testbeds. In this paper, we unexpectedly find that in the Mainline BitTorrent DHT (MDHT), probably the largest DHT overlay on the Internet, many lookups already yield results in less than a second, albeit not consistently. With the backwards-compatible modifications we present, we show that not only can we reduce median latencies to between 100 and 200 ms, but also consistently achieve sub-second lookups. These results suggest that it is possible to deploy latency-sensitive applications on top of large-scale DHT overlays on the Internet, contrary to what some might have concluded based on previous results reported in the literature.
Place, publisher, year, edition, pages
IEEE , 2011. 82-91 p.
, IEEE International Conference on Peer-to-Peer Computing, ISSN 2161-3567
dht, kademlia, performance, large-scale
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-38313DOI: 10.1109/P2P.2011.6038665ISI: 000298838500010ScopusID: 2-s2.0-80055024024ISBN: 978-1-4577-0149-8OAI: oai:DiVA.org:kth-38313DiVA: diva2:436670
11th IEEE International Conference on Peer-to-Peer Computing 2011 (P2P’11)
FunderEU, FP7, Seventh Framework Programme, No. 216217
QC 201108252011-10-132011-08-242013-12-03Bibliographically approved