| 基于缓存的结构化P2P路由算法研究 |
| |
| 引用本文： | 王岩,李照奎.基于缓存的结构化P2P路由算法研究[J].沈阳航空工业学院学报,2009,26(2). |
| |
| 作者姓名： | 王岩 李照奎 |
| |
| 作者单位： | 沈阳航空工业学院,计算机学院,辽宁,沈阳,110136 |
| |
| 摘 要： | P2P网络中的资源经常会被不同节点重复查找,有些热门资源被重复查找的概率更高,如何保证资源在重复查找时的效率,提高路由算法对已查找结果的自记忆能力,是一个亟待解决的问题.在分析传统的Pastry路由算法基础上,采用内容缓存机制和路径缓存机制来改善路由性能,重点研究了不同消息重复率下的路由性能.在不同节点个数和不同的消息重复率下进行大量模拟实验,结果表明改进后的路由算法随着消息重复率的升高,算法的路由性能明显改善.
|
| 关 键 词： | 路由算法 内容缓存 路经缓存 |
Routing algorithm on cache in structured peer-to-peer overlay networks |
| |
| WANG Yan,LI Zhao-kui.Routing algorithm on cache in structured peer-to-peer overlay networks[J].Journal of Shenyang Institute of Aeronautical Engineering,2009,26(2). |
| |
| Authors: | WANG Yan LI Zhao-kui |
| |
| Institution: | Shenyang Institute of Aeronautical Engineering;Liaoning Shenyang 110136 |
| |
| Abstract: | Resources in structured peer-to-peer overlay networks are repeatedly queried by different nodes,and the repeated querying probability of some focus resources will be great.It is an important issue to ensure querying efficiency when resources are repeatedly queried and to improve self-memorized ability of routing algorithm.Based upon the analysis of pastry routing algorithm,routing performance is improved by using content cache mechanism and route cache,and routing performance is mainly researched in the cas... |
| |
| Keywords: | P2P |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
