Research Article
Understanding Lookup Performance Deficiencies in the KAD Network
@INPROCEEDINGS{10.4108/icst.collaboratecom.2012.250424, author={Yunzhao Li and Don Gruenbacher and Caterina Scoglio}, title={Understanding Lookup Performance Deficiencies in the KAD Network}, proceedings={8th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing}, publisher={IEEE}, proceedings_a={COLLABORATECOM}, year={2012}, month={12}, keywords={p2p kad dht planetlab measurement}, doi={10.4108/icst.collaboratecom.2012.250424} }- Yunzhao Li
Don Gruenbacher
Caterina Scoglio
Year: 2012
Understanding Lookup Performance Deficiencies in the KAD Network
COLLABORATECOM
ICST
DOI: 10.4108/icst.collaboratecom.2012.250424
Abstract
The KAD network is one of the largest distributed hash tables utilized by the popular P2P file-sharing systems: aMule and eMule. However, its lookup performance is recognized as inefficient. In this work, based on the fact that peers publish and retrieve information with the help of their routing tables and publishing tables, we evaluate this inefficiency problem via a series of real world tests. Our measurements show that even though the maintenance policy of routing tables is well designed, the current refresh scheme of the publishing table and the selfishness of publishing peers cause the poor lookup performance. To mitigate this problem, we propose there different modifications and analyze their advantages and weaknesses.
