| 利用分群与缓存的P2P路由 |
| |
| 引用本文： | 李照奎,王岩,石祥滨.利用分群与缓存的P2P路由[J].计算机工程与应用,2010,46(16):102-104. |
| |
| 作者姓名： | 李照奎 王岩 石祥滨 |
| |
| 作者单位： | 沈阳航空工,学院计算机学院,沈阳,110136 |
| |
| 摘 要： | 针对结构化P2P系统中由于动态性带来的路由性能低的问题，提出一种利用分群和缓存的路由改进算法，该算法重点考虑了位置信息的分群，同时采用了自适应内容缓存机制和自适应路径缓存机制。最后的实验表明，改进后的路由算法路由性能明显改善，查找成功率高，较好地适应了P2P网络的动态性。
|
| 关 键 词： | P2P网络 路由算法 分群 自适应缓存 |
| 收稿时间： | 2009-3-2 |
| 修稿时间： | 2009-4-20
|
P2P routing algorithm using clustering and cache |
| |
| LI Zhao-kui,WANG Yan,SHI Xiang-bin.P2P routing algorithm using clustering and cache[J].Computer Engineering and Applications,2010,46(16):102-104. |
| |
| Authors: | LI Zhao-kui WANG Yan SHI Xiang-bin |
| |
| Affiliation: | Shenyang Institute of Aeronautical Engineering,Shenyang 110136,China |
| |
| Abstract: | To the question of low resource searching efficiency for dynamic in structured P2P system,an advanced routing algorithm using clustering and cache is presented.The algorithm mainly considers the clustering of position information and the strategy of adaptive content caching and route caching is adopted.The simulation experiments show that the algorithm improves routing performance and gains high route success rate and adapts dynamic P2P network. |
| |
| Keywords: | P2P network routing algorithm clustering adaptive caching |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
