{"title":"为什么Kad的路由表有数百个节点","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":"{\"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}","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}
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.