The Analysis of Kademlia for Random IDs

Q3 Mathematics Internet Mathematics Pub Date : 2014-02-06 DOI:10.1080/15427951.2015.1051674
Xing Shi Cai, L. Devroye
{"title":"The Analysis of Kademlia for Random IDs","authors":"Xing Shi Cai, L. Devroye","doi":"10.1080/15427951.2015.1051674","DOIUrl":null,"url":null,"abstract":"Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/uinm. Kademlia is thede factostandard searching algorithm for P2P (peer-to-peer) networks on the Internet. In our earlier work, we introduced two slightly different models for Kademlia and studied how many steps it takes to search for a target node by using Kademlia’s searching algorithm. The first model, in which nodes of the network are labeled with deterministic IDs, was discussed in that article. In the second, the Random ID Model, in which nodes are labeled with random IDs, was only briefly mentioned. Refined results with detailed proofs for this model are given in this article. Our analysis shows that, with high probability, it takes about clog n steps to locate any node, where n is the total number of nodes in the network and c is a constant that does not depend on n.","PeriodicalId":38105,"journal":{"name":"Internet Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/15427951.2015.1051674","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/15427951.2015.1051674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 6

Abstract

Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/uinm. Kademlia is thede factostandard searching algorithm for P2P (peer-to-peer) networks on the Internet. In our earlier work, we introduced two slightly different models for Kademlia and studied how many steps it takes to search for a target node by using Kademlia’s searching algorithm. The first model, in which nodes of the network are labeled with deterministic IDs, was discussed in that article. In the second, the Random ID Model, in which nodes are labeled with random IDs, was only briefly mentioned. Refined results with detailed proofs for this model are given in this article. Our analysis shows that, with high probability, it takes about clog n steps to locate any node, where n is the total number of nodes in the network and c is a constant that does not depend on n.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机id的Kademlia分析
文章中一个或多个人物的彩色版本可以在www.tandfonline.com/uinm网站上找到。Kademlia是Internet上P2P(点对点)网络的基本标准搜索算法。在我们早期的工作中,我们为Kademlia引入了两个略有不同的模型,并研究了使用Kademlia的搜索算法搜索目标节点需要多少步。本文讨论了第一种模型,其中网络节点用确定性id标记。在第二篇文章中,只简要地提到了随机ID模型,其中节点用随机ID标记。本文给出了该模型的改进结果,并给出了详细的证明。我们的分析表明,在高概率下,定位任何节点大约需要clog n步,其中n是网络中节点的总数,c是一个不依赖于n的常数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Internet Mathematics
Internet Mathematics Mathematics-Applied Mathematics
自引率
0.00%
发文量
0
期刊最新文献
Graph search via star sampling with and without replacement Preferential Placement for Community Structure Formation A Multi-type Preferential Attachment Tree Editorial Board EOV A Theory of Network Security: Principles of Natural Selection and Combinatorics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1