| 一种新的结构化P2P覆盖网络路由算法 |
| |
| 引用本文： | 谭振华,程维,常桂然,高晓兴. 一种新的结构化P2P覆盖网络路由算法[J]. 东北大学学报(自然科学版), 2009, 30(2): 195-199. DOI: - |
| |
| 作者姓名： | 谭振华 程维 常桂然 高晓兴 |
| |
| 作者单位： | 1. 东北大学,软件学院,辽宁,沈阳,110004
2. 东北大学,计算中心,辽宁,沈阳,110004 |
| |
| 摘 要： | 为提高结构化P2P覆盖网络的路由算法效率,在DHT网络的基础上,提出了一种用较小路由维护开销获取较大路由长度的路由算法CSSP.定义了简短的常数级别的路由表,用来记录L长度的缓存节点、1单位长度的超级节点、1单位长度的后继节点,并给出了节点加入和离开网络时的路由表维护算法以及超级节点的分布式选举算法.与Chord等典型算法的性能比较分析证明,CSSP算法在路由表维护的复杂度、路由复杂度、容错性以及节点加入和退出时的网络抖动量等性能方面都有明显改善,是一种有效的路由算法.
|
| 关 键 词： | 结构化P2P 路由算法 分布式系统 覆盖网络 DHT(分布式哈希表) |
A New Routing Algorithm of Structured Peer-to-Peer Overlay Networks |
| |
| TAN Zhen-hua,CHENG Wei,CHANG Gui-ran,GAO Xiao-xing. A New Routing Algorithm of Structured Peer-to-Peer Overlay Networks[J]. Journal of Northeastern University(Natural Science), 2009, 30(2): 195-199. DOI: - |
| |
| Authors: | TAN Zhen-hua CHENG Wei CHANG Gui-ran GAO Xiao-xing |
| |
| Affiliation: | TAN Zhen-hua1,CHENG Wei1,CHANG Gui-ran2,GAO Xiao-xing1 (1.School of Software,Northeastern University,Shenyang 110004,China,2.Computing Center,China.) |
| |
| Abstract: | In order to improve the routing algorithm efficiency of the structured peer-to-peer overlay networks,a new DHT-based CSSP algorithm was presented with lower maintenance over head and longer route.A short routing table was defined at constant level to record L cache nodes' fingers,one super node finger and one successor node finger.The algorithms maintaining the route table for node entering/exiting were presented,as well as the distributed election algorithm for super node that could cache all of the nodes.... |
| |
| Keywords: | structured peer-to-peer routing algorithm distributed system overlay networks DHT(distributed hash table) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《东北大学学报(自然科学版)》下载全文 |
|
