一种新的结构化点对点覆盖网络路由协议

Zhenhua Tan, G. Chang, Wei Cheng, Xiaoxing Gao, He Wang, Lili
{"title":"一种新的结构化点对点覆盖网络路由协议","authors":"Zhenhua Tan, G. Chang, Wei Cheng, Xiaoxing Gao, He Wang, Lili","doi":"10.1109/SEC.2008.14","DOIUrl":null,"url":null,"abstract":"The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. A short routing table was made to record ldquoLrdquo cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of churning nodes while some nodes inject and eject the CSSP p2p system. The simulations and analysis shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Routing Protocol of Structured Peer-to-Peer Overlay Networks\",\"authors\":\"Zhenhua Tan, G. Chang, Wei Cheng, Xiaoxing Gao, He Wang, Lili\",\"doi\":\"10.1109/SEC.2008.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. A short routing table was made to record ldquoLrdquo cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of churning nodes while some nodes inject and eject the CSSP p2p system. The simulations and analysis shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.\",\"PeriodicalId\":231129,\"journal\":{\"name\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEC.2008.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fifth IEEE International Symposium on Embedded Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEC.2008.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

结构化点对点覆盖网络的路由协议影响着p2p网络在路由表维护、路由跳数和网络搅动等方面的性能。我们使用的当前协议通常维护O(logN)路由表和O(logN)路由跳数。为了在路由表规模较小的情况下获得更好的路由速度,采用O(1)个节点指来获得O(N)条路由路径,提出了一种新的CSSP协议。创建一个短路由表,记录ldquoLrdquo缓存节点、一个超级节点和一个后继节点。提出了维护路由表的算法。提出了一种选择算法来选择能够缓存所有节点的超级节点。缓存节点、超级节点和继承节点保证了CSSP的高性能。与chord、pastry等相比,CSSP在路由表维护、路由跳数、容错性和搅拌节点数量等方面的性能都有所提高,同时也有一些节点注入和退出CSSP p2p系统。仿真和分析表明,CSSP算法是一种有效的路由算法,但也存在一些有待进一步研究的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A New Routing Protocol of Structured Peer-to-Peer Overlay Networks
The routing protocol of structured peer-to-peer overlay networks influences the p2p network performances in route table maintenance, routing hops, and network churning. Current protocols we used usually maintain a O(logN) route table and O(logN) routing hops. To get better routing speed with less scale routing table, using O(1) node finger to get O(N) route path, a new protocol named CSSP was presented. A short routing table was made to record ldquoLrdquo cache nodes, one super node and one successor node. Algorithms for maintaining the route table was presented in this paper. A selection algorithm was presented to select the super node who could cache all of the nodes. And the cache-nodes, super-node and successor-node ensure the high performance of the CSSP. Compared to chord, pastry and etc., the CSSP increases the performance in routing table maintaining, routing hops, fault-tolerance and the amount of churning nodes while some nodes inject and eject the CSSP p2p system. The simulations and analysis shows that the CSSP is an efficient route algorithm, but also some problems waiting for further study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Communication Analysis and Synthesis of Distributed Embedded Network System Validation of ASIP Architecture Description The Hardware/Software Partitioning in Embedded System by Improved Particle Swarm Optimization Algorithm Research on Service Robot Vision Alignment Algorithm Based on the SIFT Characteristic Dual OS Support Peripheral Device Encapsulation
×
引用
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