TY - GEN
T1 - ID repetition in kad
AU - Yu, Jie
AU - Fang, Chengfang
AU - Xu, Jia
AU - Chang, Ee Chien
AU - Li, Zhoujun
PY - 2009
Y1 - 2009
N2 - 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 finding suitable parameters for publishing and searching.
AB - 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 finding suitable parameters for publishing and searching.
UR - https://www.scopus.com/pages/publications/73549101732
U2 - 10.1109/P2P.2009.5284551
DO - 10.1109/P2P.2009.5284551
M3 - 会议稿件
AN - SCOPUS:73549101732
SN - 9781424450671
T3 - IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
SP - 111
EP - 120
BT - IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
T2 - IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
Y2 - 9 September 2009 through 11 September 2009
ER -