关键词: P2P, 分布式哈希表, 路由延迟, 随机技术, 超级节点

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.

Key words: P2P, Distributed Hash Table (DHT), routing delay, randomized strategy, super node