31 Study of GR-Chord Algorithm Based on Redundancy-Reducing of Routing Table

The Chord protocol has the faults with serious redundancy and low searching efficiency in large scale network. Aiming to the problems, the paper puts forward of the GR-Chord algorithm which combines the records of the routes inside groups and recursion seeking in groups. The GR-Chord algorithm reduces the redundancy of routing table and lowers to seeking time and average seeking hops. The simulation experiment demonstrates that the algorithm is also simple and easy to be realized. The GR-Chord improves network performance significantly and search efficiency.