P2P DHT Based on a Contracted Star Graph

S. Fujita
{"title":"P2P DHT Based on a Contracted Star Graph","authors":"S. Fujita","doi":"10.1109/PDCAT.2011.63","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new network topology for P2P DHT (Distributed Hash Table) which provides a scalable lookup service for the peers participating in Peer-to-Peer (P2P) networks. The proposed topology is a contracted graph of the star graph, and realizes a short diameter with a small degree compared with conventional hyper cubic DHTs such as Chord and Kademlia.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2011.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we propose a new network topology for P2P DHT (Distributed Hash Table) which provides a scalable lookup service for the peers participating in Peer-to-Peer (P2P) networks. The proposed topology is a contracted graph of the star graph, and realizes a short diameter with a small degree compared with conventional hyper cubic DHTs such as Chord and Kademlia.
基于压缩星图的P2P DHT
在本文中,我们提出了一种新的P2P分布式哈希表(DHT)网络拓扑,它为参与P2P网络的对等体提供了可扩展的查找服务。该拓扑结构是星图的压缩图,与Chord和Kademlia等传统的超立方dht相比,实现了小程度的短直径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信