A decentralized redundant peer-to-peer system based on Chord: Routing, scalability, robustness

Peer-to-peer systems can share the computing resources and services by directly communicating within a widely distributed network. Our research focuses on locating, routing, scalability and robustness in the decentralized redundant P2P system. Chord[1] is an efficient peer-to-peer lookup protocol for its simplicity, provable correctness and performance. It can locate a key through a sequence of O(log n) other nodes toward the destination, where n is the total number of nodes. In this thesis, we present three enhanced models based on Chord to improve the routing performance and data availability. The k-Chord model helps lookup to approach the destination rapidly within the first several hops. The successor routing model applies the successor list as a part of the routing table to locate the destination accurately by merging the last several hops into one hop if the current lookup location is located within the range of the successors. The hybrid model is a combination of the former two models, and nearly halves the routing path length of Chord system. We also discuss the scalability and fault tolerance of the three models