DocumentCode
2609686
Title
Improving content retrieval recall in KAD
Author
Yan, He ; Wang, Lei ; Liao, Fangfang ; Cheng, Wenqing
Author_Institution
Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2012
fDate
15-17 Oct. 2012
Firstpage
368
Lastpage
369
Abstract
KAD is the largest DHT system with several million simultaneous users. The dynamic of peer participation which is called peer churn affects the performance of content retrieval in KAD. In this paper, we performed a simple way to improve content retrieval recall in KAD, by taking highly available contacts as lookup entries. We track highly available peers in KAD by the ID appearance ranks in routing tables from an running crawler designed by ourselves. The measurement study, compared with the normal content retrieval process, shows that the improved way is much effective.
Keywords
content-based retrieval; peer-to-peer computing; search engines; DHT system; KAD; content retrieval recall improvement; crawler design; lookup entries; peer churn affects; peer participation; Atmospheric measurements; Availability; Crawlers; Educational institutions; Particle measurements; Peer to peer computing; Routing; Active Measurement; Availability; Content Retrieval; KAD; Peer-to-Peer;
fLanguage
English
Publisher
ieee
Conference_Titel
ICT Convergence (ICTC), 2012 International Conference on
Conference_Location
Jeju Island
Print_ISBN
978-1-4673-4829-4
Electronic_ISBN
978-1-4673-4827-0
Type
conf
DOI
10.1109/ICTC.2012.6386861
Filename
6386861
Link To Document