| 一种基于二叉树的P2P网络查找算法 |
| |
| 引用本文： | 樊金生,王贞化,李艳欣. 一种基于二叉树的P2P网络查找算法[J]. 石家庄铁道学院学报, 2008, 21(4): 25-29 |
| |
| 作者姓名： | 樊金生 王贞化 李艳欣 |
| |
| 作者单位： | 石家庄铁道学院计算机与信息工程分院,河北石家庄050043 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 针对P2P网络中资源查找以及其自身存在的问题，提出了一种基于二叉树的P2P网络模型。该模型借鉴了可信计算中的直接匿名认证机制、DHT、超级节点的思想，在此基础上设计了一种高效的可扩展查找算法，解决P2P网络查询延迟、冗余信息、可扩展性等关键问题。模拟实验表明，该算法能够有效减少网络带宽消耗并能显著提升P2P网络的查找效率。
|
| 关 键 词： | 二叉树 对等网 直接匿名认证机制 分布式哈希表 超级节点 |
P2P Network Resource Searching Algorithm Based on Strictly Binary Tree |
| |
| Fan Jinsheng,Wang Zhenhua,Li Yanxin. P2P Network Resource Searching Algorithm Based on Strictly Binary Tree[J]. Journal of Shijiazhuang Railway Institute, 2008, 21(4): 25-29 |
| |
| Authors: | Fan Jinsheng Wang Zhenhua Li Yanxin |
| |
| Affiliation: | Fan Jinsheng,Wang Zhenhua,Li Yanxin(School of Computer , Information Engineering,Shijiazhuang Railway Institute,Shijiazhuang 050043,China) |
| |
| Abstract: | Focusing on the problems of the resource searching in P2P network,a P2P network model based on strictly binary tree is proposed.With reference to the thought of DAA,DHT and superNode,an efficient searching algorithm is designed to resolve some critical problems in P2P network.The experimental results show that this searching algorithm is effective in reducing consumption of network bandwidth,and can significantly improve the searching efficiency. |
| |
| Keywords: | binary tree peer to peer DAA DHT super node |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
