论文部分内容阅读
主要对当前结构化P2P网络中的节点动态性带来的资源查找和传输的延迟问题,提出了一种逻辑分放节点资源的RSTree结构算法,该算法在一定程度上借鉴原有的Chord协议的路由机制的思想和P2P网络中的树形拓扑结构,通过Chord的相容哈希算法在该网络结构中的各个节点上逻辑的映射分布资源,并根据各个节点的IP的哈希值来构造具有资源映射查找树特点的网络拓扑结构.此外还提出了为每个节点设置相应的出入度限制,最后通过性能仿真验证了算法的有效性.“,”The main structure of the current P2P network nodes in the dynamic brought about by the transfer of resources to find and delays,the logic of a sub-node release resources RSTree structure of the algorithm to a certain extent from the original Chord The agreement routing mechanism for ideological and P2P networks make up the structure of the tree formation through the Chord compatible hash algorithms in the network of nodes in all of the logical mapping the distribution of resources,and in accordance with each node of the IP hash Construction has the resources to the value of mapping features of the tree to find the network structure of the Rio meeting. In addition,each node to put forward a set of corresponding degree of access restrictions on the adoption of the final performance of the simulation algorithm.