By Topic

An Improved Kademlia Routing Algorithm for P2P Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Liang Guangmin ; Sch. of Electron. & Inf. Eng., Shenzhen Polytech., Shenzhen, China

Kademlia is a famous routing algorithm based on DHT in P2P network research. To conquer the shortages of Kademlia in searching efficiency and the strategy of cache, an improved Kademlia routing algorithm is proposed which can accelerate the hotspots inquiry speed in P2P network and is implemented by using fast table look-up and weights setting method. This technique avoids inefficient inquiry under the high refreshing frequency in cache and congregates hotspot resources for high query hit rate. Simulation tests show that the improved algorithm has lower average route step and inquiry time delay than the original one.

Published in:

New Trends in Information and Service Science, 2009. NISS '09. International Conference on

Date of Conference:

June 30 2009-July 2 2009