• DocumentCode
    3456849
  • Title

    An Improved Kademlia Routing Algorithm for P2P Network

  • Author

    Guangmin, Liang

  • Author_Institution
    Sch. of Electron. & Inf. Eng., Shenzhen Polytech., Shenzhen, China
  • fYear
    2009
  • fDate
    June 30 2009-July 2 2009
  • Firstpage
    63
  • Lastpage
    66
  • Abstract
    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.
  • Keywords
    Internet; cryptography; peer-to-peer computing; telecommunication network routing; Kademlia routing algorithm; P2P network; distributed hash tables; fast table look-up method; weights setting method; Acceleration; Automatic testing; Binary trees; Delay effects; Frequency; Network topology; Peer to peer computing; Robustness; Routing; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    New Trends in Information and Service Science, 2009. NISS '09. International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-0-7695-3687-3
  • Type

    conf

  • DOI
    10.1109/NISS.2009.172
  • Filename
    5260519