| PRST-Chord:基于Chord的低延时查询改进算法 |
| |
| 引用本文： | 黄翼,吕智慧,吴杰,钟亦平.PRST-Chord:基于Chord的低延时查询改进算法[J].计算机工程与设计,2010,31(18). |
| |
| 作者姓名： | 黄翼 吕智慧 吴杰 钟亦平 |
| |
| 作者单位： | 复旦大学计算机科学技术学院,上海,200433 |
| |
| 摘 要： | 针对目前Chord协议中逻辑覆盖网与底层物理拓扑不匹配的问题,提出了一种改进算法PRST-Chord(proximity routing selection and topology-based Chord).该算法基于底层的拓扑信息来构造节点标识,使得物理上相邻的节点在逻辑上也尽可能相邻,同时修改了Chord的查询算法,通过预测节点问的网络延时优化下一跳节点的路由选择.仿真实验结果表明,改进算法有效地降低了查询延时,提高了资源定位的性能.
|
| 关 键 词： | Chord协议 界标节点 覆盖网 底层拓朴 路由选择 |
PRST-Chord: Improved lookup algorithm with lower latency on chord |
| |
| HUANG Yi,L Zhi-hui,WU Jie,ZHONG Yi-ping.PRST-Chord: Improved lookup algorithm with lower latency on chord[J].Computer Engineering and Design,2010,31(18). |
| |
| Authors: | HUANG Yi L Zhi-hui WU Jie ZHONG Yi-ping |
| |
| Affiliation: | HUANG Yi,L(U) Zhi-hui,WU Jie,ZHONG Yi-ping |
| |
| Abstract: | PRST-Chord(proximity routing selection and topology-based Chord) is proposed to address the problem that the overlay network in Chord protocol is incongruent with the underlying network topology.The improved algorithm decreases the incompatibility between the logical and physical network by constructing the node identifiers based on the topology of physical network.Meanwhile,the method revises the lookup algorithm by predicting the latency between two nodes to optimize the next hop routing.The simulation re... |
| |
| Keywords: | chord protocol landmark nodes overlay network physical topology routing selection |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
