Improving Lookup Performance Based on Kademlia

Author

Wang, Chunzhi ; Yang, Nan ; Chen, Hongwei

Author_Institution

Coll. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China

Volume

1

fYear

2010

fDate

24-25 April 2010

Firstpage

446

Lastpage

449

Abstract

According to the P2P network based on Distributed Hash Table (DHT), Flooding will be combined with the DHT system, the physical proximity of nodes in the network will be used to reduce the latency and optimize routing before the formation of the logical topology. An improved EKademlia based on original model is constructed, EKademlia inherits the advantages of DHT and Kademlia, and it is superior to the original Kademlia model in the routing choices, the rate of successfully finding, the average logical path length and other aspects.

Keywords

peer-to-peer computing; table lookup; DHT system; Kademlia; P2P network; distributed hash table; flooding; logical topology; Application software; Collaborative work; Computer science; Computer security; Dictionaries; Network servers; Network topology; Peer to peer computing; Routing; Wireless communication; Distributed Hash table (DHT); Flooding; Kademlia; P2P network; Resource location;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks Security Wireless Communications and Trusted Computing (NSWCTC), 2010 Second International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-0-7695-4011-5

Electronic_ISBN

978-1-4244-6598-9

Type

conf

DOI

10.1109/NSWCTC.2010.111

Filename

5480923