【摘要】 RP2P路由算法将用于非结构化P2P网络中的随机邻居选择策略与结构化的分布式哈希表(DHT)环相结合,可在d跳内处理查询请求。但是,由于网络中的主机在网络带宽、内存、CPU等方面的能力差别很大,那些能力较弱的节点势必会影响整个系统的效率。利用网络中节点性能的差异,结合分层的概念,提出基于层次的RP2P路由算法,并对其性能进行了分析,算法在一定程度上缓解了网络中一部分节点的频繁加入和退出所引起的系统震荡。模拟实验表明,基于层次的RP2P路由算法有效提高了搜索的效率。更多还原

【Abstract】 RP2P algorithm combines arbitrary neighbor selection,typically used only in unstructured P2P networks,with a Distributed Hash Table(DHT) ring.It is the first of its kind to resolve requests in d hops with a chosen probability of 1-c.However,the capacities of the hosts participating in the network,such as bandwidth,memory,CPU,are very different,which will affect the efficiency of the whole system.On the other hand,the shock caused by some of the nodes in the network frequent joining in/departing from the system is also one of the factors affecting the performance.This paper analyzed the capacities of the nodes and proposed an efficient RP2P network based on hierarchical dividing.It improves the efficiency of the system,and solves the problem of system shocks.更多还原