A simple way to improve lookup performance in KAD

Author

Yan, He ; Liao, Fangfang ; Xu, Wei ; Cheng, Wenqing

Author_Institution

Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2012

fDate

15-17 Oct. 2012

Firstpage

219

Lastpage

220

Abstract

KAD is the largest DHT system with several million simultaneous users. The dynamics of peer participation which is called churn affects the performance of lookup operations in P2P systems, since some individual peers in the routing tables might be missing or stale. In this paper, we performed a simple way to improve lookup performance in KAD, by taking highly available contacts as lookup entries instead of stale ones. We track highly available peers in KAD by a special designed crawler. When a stale contact is encountered in the lookup process, the closest XOR-distance highly available peer of the target will be found to replace the stale contact. The measurement study, compared with the normal lookup process, shows that it is much effective.

Keywords

peer-to-peer computing; table lookup; telecommunication network routing; DHT system; KAD; P2P systems; XOR-distance; measurement study; peer participation dynamics; routing tables; Availability; Crawlers; Educational institutions; Indexes; Peer to peer computing; Routing; Target tracking; Active Measurement; Availability; KAD; Lookup Performance; Peer-to-Peer;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (APCC), 2012 18th Asia-Pacific Conference on

Conference_Location

Jeju Island

Print_ISBN

978-1-4673-4726-6

Electronic_ISBN

978-1-4673-4727-3

Type

conf

DOI

10.1109/APCC.2012.6388135

Filename

6388135