ID repetition in Kad
ID repetition in Kad
复制标题
DOI：
10.1109/p2p.2009.5284551
复制
发表时间：
2009-10
期刊：
影响因子：
--
通讯作者：
Jie Yu;Chengfang Fang;Jia Xu;E. Chang;Zhoujun Li
中科院分区：
文献类型：
--
作者：
Jie Yu;Chengfang Fang;Jia Xu;E. Chang;Zhoujun Li
在基于DHT的系统中，ID唯一性是必不可少的，因为对等查找和资源搜索依赖于ID匹配。许多以前的工作和Kad的测量没有考虑到，在同行的ID可能不是唯一的。我们观察到，相当一部分的对等体，19.5%的对等体在路由表和4.5%的活动对等体（那些谁响应KAD协议），没有唯一的ID。这些重复会误导Kad网络的测量。我们进一步观察到，有大量的peer频繁地改变他们的UDP端口，有一些ID重复了很多次，所有具有这些ID的peer都不响应Kad协议。我们分析了简化设置下ID重复的影响，发现ID重复降低了Kad的发布和搜索性能，但对查找过程的影响不明显。这些测量和分析有助于确定重复的来源，也有助于找到适当的出版和搜索参数。
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on ID-matching. 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.