DocumentCode
2755005
Title
Active Measurement of Routing Table in Kad
Author
Yu, Jie ; Li, Zhoujun
Author_Institution
Sch. of Comput., Nat. Univ. of Defense Technol., Changsha
fYear
2009
fDate
10-13 Jan. 2009
Firstpage
1
Lastpage
5
Abstract
As the first DHT implemented in real applications and involving millions of simultaneous users, all aspects of Kad must be analyzed and measured carefully. This paper focuses on measuring the routing table of Kad in eMule/aMule. We present and analyze the availability and stability of routing table by crawling actively. We find the phenomenon of ID repetition in Kad that many peers use a same ID simultaneously, which will decrease the performance of routing and then reduce the availability of routing table. The connection availability of global routing table is relatively low, the average of which is about 64.9%. Connection availability influences the efficiency of searching and routing in Kad network directly.
Keywords
Internet; peer-to-peer computing; telecommunication network routing; Internet; Kad network; connection availability; global routing table; peer-to-peer technique; Availability; Computer crime; Peer to peer computing; Pollution measurement; Protocols; Routing; Stability analysis; Telecommunication traffic; Traffic control; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-2308-8
Electronic_ISBN
978-1-4244-2309-5
Type
conf
DOI
10.1109/CCNC.2009.4784962
Filename
4784962
Link To Document