摘要
针对P2P网络中资源查找存在的问题,提出了一种改进的P2P网络模型。该模型引入了可信计算中的直接匿名认证机制、DHT、超级节点的思想,在此基础上设计了一种高效的可扩展查找算法,解决P2P网络查询延迟、冗余信息、可扩展性等关键问题。模拟实验表明,该模型能够有效减少网络带宽消耗并能显著提升P2P网络的查找效率。
Focusing on the problems of the resource searching in P2P network, an improved model for P2P network resource search is proposed. This model makes reference to the thought of DAA, DHT and superNode in trusted computing and based on this an efficient searching algorithm is designed to resolve some critical problems in P2P network. The experimental results show that this searching model is effective in reducing consumption of network bandwidth, and could significantly improve the searching efficiency.
出处
《通信技术》
2009年第4期73-75,共3页
Communications Technology
基金
国家自然科学基金项目(60873208)工程信息中心小世界效应研究
关键词
二叉树
超级节点
直接匿名认证
binary tree
supernode
direct anonymous attestation
