Dissymmetrical P2P Topology and Resource Locating Algorithm

Yang Jing, He Liang
{"title":"Dissymmetrical P2P Topology and Resource Locating Algorithm","authors":"Yang Jing, He Liang","doi":"10.1109/CIS.WORKSHOPS.2007.67","DOIUrl":null,"url":null,"abstract":"The paper proposes a dissymmetrical and pure P2P topology based on K-ary-tree architecture named DSKTree topology, with the view of \"node symmetrical characteristic\", it can solve the unstable and linearly increasing scale problem in existing resource sharing application using pure P2P topology. We also design resource locating algorithm in DSKTree topology. The performance analysis shows that it can optimize the cost of locating and lower the impact to performance of pure P2P topology while the scale of the system increases.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The paper proposes a dissymmetrical and pure P2P topology based on K-ary-tree architecture named DSKTree topology, with the view of "node symmetrical characteristic", it can solve the unstable and linearly increasing scale problem in existing resource sharing application using pure P2P topology. We also design resource locating algorithm in DSKTree topology. The performance analysis shows that it can optimize the cost of locating and lower the impact to performance of pure P2P topology while the scale of the system increases.
非对称P2P拓扑及资源定位算法
本文提出了一种基于k - ry-tree结构的不对称纯P2P拓扑,称为DSKTree拓扑,从“节点对称特性”的角度出发,解决了现有纯P2P资源共享应用中规模不稳定且线性增长的问题。设计了基于DSKTree拓扑的资源定位算法。性能分析表明,当系统规模增大时,该方法可以优化定位成本,降低纯P2P拓扑对性能的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信