Title :
Tracking highly available peers in KAD
Author :
Yan, He ; Liao, Fangfang ; Wang, Lei ; Cheng, Wenqing
Author_Institution :
Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China
Abstract :
KAD is the largest DHT system with several million simultaneous users. Available peers play an important role in its healthy operations. In this paper, we performed an active measurement study to track highly available peers in KAD. Our measurement results show that the probability of KAD ID appearance in routing tables can be used to characterize peers´ availability. When a peer is online with a longer duration, the probability of its KAD ID appears in other peers´ routing tables increases, due to the message exchanges among peers. We characterize different types of KAD IDs in routing tables and find that the repeat times of KAD IDs follows the Pareto Law during one crawling session. In particular, we take some contrastive measurements to show the availability of the peers with high repeat times of KAD ID appearance in routing tables are much higher than the normal ones. At the end of this paper, we propose a simple way to improve lookup performance by using highly available peers in KAD.
Keywords :
peer-to-peer computing; public domain software; search engines; table lookup; telecommunication network routing; transport protocols; DHT system; KAD ID appearance probability; KAD ID repeat times; P2P systems; Pareto Law; crawling session; lookup performance improvement; message exchanges; open-source peer-to-peer system; peer availability tracking; peer routing tables; Availability; Crawlers; IP networks; Peer to peer computing; Routing; Active Measurement; Availability; KAD; Peer-to-Peer; Routing Tables;
Conference_Titel :
Telecommunication Networks and Applications Conference (ATNAC), 2012 Australasian
Conference_Location :
Brisbane, QLD
Print_ISBN :
978-1-4673-4408-1
Electronic_ISBN :
978-1-4673-4409-8
DOI :
10.1109/ATNAC.2012.6398072