Why Kad's routing table has hundreds of peers

Qiang Li, Hui Li, Zhongling Wen, Pengfei Yuan
{"title":"Why Kad's routing table has hundreds of peers","authors":"Qiang Li, Hui Li, Zhongling Wen, Pengfei Yuan","doi":"10.1109/ICSESS.2017.8343003","DOIUrl":null,"url":null,"abstract":"Kad is the most popular P2P file sharing system. Previous works only focus on the global peers' collection or monitoring the lookup traffic. Based on our online measurement, we find that each benign peer's routing table only has 400–600 peers. We further study the Kad's source codes and track the routing table's change process. And finally, we explain that the unique Kad routing table's structure and the total online peer number lead to this result. We also do the large-scale experiment to prove our conclusion.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2017.8343003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Kad is the most popular P2P file sharing system. Previous works only focus on the global peers' collection or monitoring the lookup traffic. Based on our online measurement, we find that each benign peer's routing table only has 400–600 peers. We further study the Kad's source codes and track the routing table's change process. And finally, we explain that the unique Kad routing table's structure and the total online peer number lead to this result. We also do the large-scale experiment to prove our conclusion.
为什么Kad的路由表有数百个节点
Kad是最流行的P2P文件共享系统。以前的工作只关注全局对等节点的收集或监视查找流量。通过在线测量,我们发现每个良性对等体的路由表只有400-600个对等体。我们进一步研究了Kad的源代码,并跟踪路由表的变化过程。最后,我们解释了唯一的Kad路由表结构和在线对等体总数导致了这一结果。我们还做了大规模的实验来证明我们的结论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信