Faster content access in KAD
P2P 2008, 8th IEEE International Conference on Peer-to-Peer Computing, September 08, 2008, Aachen, Germany
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e.g. related to churn, or to the delay) that are often only marginally considered in the design. In this paper, we analyze in detail the content retrieval process in KAD, the implementation of the DHT Kademlia that is part of several popular peer-to-peer clients. In particular, we present a simple model to evaluate the impact of different design parameters on the overall lookup latency. We then perform extensive measurements on the lookup performance using an instrumented client. From the analysis of the results, we propose an improved scheme that is able to significantly decrease the overall lookup latency without increasing the overhead
| Keywords: | content management, cryptography, information retrieval, peer-to-peer computing |
| Type: | Conference |
| Language: | English |
| City: | Aachen |
| Country: | GERMANY |
| Date: | September 2008 |
| Department: | Networking and Security |
| Eurecom ref: | 2530 |
| Copyright: | © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Bibtex: | @inproceedings{EURECOM+2530, doi = {http://dx.doi.org/10.1109/P2P.2008.28 }, year = {2008}, title = {{F}aster content access in {KAD}}, author = {{S}teiner, {M}oritz and {C}arra, {D}amiano and {B}iersack, {E}rnst {W}}, booktitle = {{P}2{P} 2008, 8th {IEEE} {I}nternational {C}onference on {P}eer-to-{P}eer {C}omputing, {S}eptember 08, 2008, {A}achen, {G}ermany}, address = {{A}achen, {GERMANY}}, month = {09}, url = {http://www.eurecom.fr/publication/2530} } |
| See also: |
|
Permalink: http://www.eurecom.fr/publication/2530
