Improvement of Network Load and Fault-Tolerant of P2P DHT Systems
Bin Dai, Wang Furong, Yun Tian · 2006
Peer-to-Peer(P2P) filesharing systems are now one of the most popular Internet applications. The unstructured P2P networks have significant scaling problem and limited efficiency. The structured P2P network based on Distributed Hash Table(DHT) has proved to be a useful substrate for large distributed system. However, most commercialP2P systems do not adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms; it generates considerable network traffic and increases P2P system complexity, especially in a highly dynamic environment. So we proposed a self-stabilizing P2P network construction and maintenance protocol, called multi-layer ring network protocol, which adopts small-world network to construct the topology, and presents the corresponding routing algorithm for the system. In this paper, we will pay more attention on maintenance overhead and resilience to failures of P2P network routing algorithms.