Analysis and Improvement of Chord Protocol

According to Chord protocol of P2P network, entries in the routing table are placed at a long distances that are all powers of 2 and only cover half of the identifier space. Therefore, an improved Chord routing algorithm is proposed. The algorithm presents a new routing table structure formula, increases entries distribution density, and extends routing searching coverage areas. Performance analysis and simulation experiments show that improved algorithm reduces the average lookup path length and gets higher efficiency.