Enhancing peer-to-peer systems through redundancy

Peer-to-peer systems can share the computing resources and services by directly communicating within a widely distributed network. It is important that these systems can efficiently locate, in as few hops as possible, the node storing the desired data in a large system. Thus, it is worth consuming some extra storage to obtain better routing performance. In this paper, we propose redundant strategies to improve the routing performance and data availability on Chord and De Bruijn topologies. Hybrid-Chord combines multiple chord rings and successors, and Redundant D2B maintains successors, to improve the routing performance. The proposed systems can reduce the number of lookup hops significantly (by as much as 50%) compared to the original ones, and have better fault tolerance capabilities, with a small storage overhead.