摘要
对等网络(Peer-to-Peer,P2P)系统中,对于目标节点的准确定位是一个很重要的研究方向.目前已有的基于分布式哈希表(Distributed Hash Tables,DHT)技术的结构化P2P系统,最基本的功能是提供文件的精确定位.但是这些结构化P2P系统都没有考虑现实网络中节点的异构性,无一例外的都认为每个P2P节点的资源1是等同的,这一点和现实网络相违背.本文在此基础上提出结合IPv6地址聚类性,同时考虑各个节点资源差异的一种改进寻路效率的P2P系统模型RCchord6(Resource-Considered Chord in IPv6),该模型能够贴合现实网络的布局.分析和仿真结果表明,该模型能够有效地减小P2P系统的寻路延时,提高寻路效率.
In P2P （Peer-to-Peer） systems, it＇s a hot point to locate the node that stores the desired data item efficiently. To address the problem, several research groups independently proposed structured P2P systems based on DHT （distributed hash table）, which include Chord, CAN, Pastry and Tapestry. But all of these systems didn＇ t take into account the different resource of nodes such as bandwidth and CPU processing data ability. This paper proposed a 2-layer structured P2P model taking into account resource of nodes and physical network topology based on IPv6. The main idea of this method is to separate the p2p network into several domains and use domain representative nodes to reduce communication probability between two low- resource nodes from different domains. Simulation results show that this method can reduce the query delay and improve the performance well.
出处
《小型微型计算机系统》
CSCD
北大核心
2007年第3期407-410,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60272043)资助.
