ID Repetition in Kad

ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on IDmatching. Many previous works and measurements on Kad do not take into account that IDs among peers may not be unique. We observe that a significant portion of peers, 19.5% of the peers in routing tables and 4.5% of the active peers (those who respond to Kad protocol), do not have unique IDs. These repetitions would mislead the measurements of Kad network. We further observe that there are a large number of peers that frequently change their UDP ports, and there are a few IDs that repeat for a large number of times and all peers with these IDs do not respond to Kad protocol. We analyze the effects of ID repetitions under simplified settings and find that ID repetition degrades Kad’s performance on publishing and searching, but has insignificant effect on lookup process. These measurement and analysis are useful in determining the sources of repetitions and are also useful in findin...

• Type: Conference
• Year: 2009
• Where: P2P
• Authors: Jie Yu, Chengfang Fang, Jia Xu, Ee-Chien Chang, Zhoujun Li
• Keywords: Id Repetition, Kad Network, P2P 2009, Peer-to-Peer Computing, Repetition Degrades Kad