The Improved Bidirectional Routing Table Structure of Chord Protocol

It is very important to locate the nodes effectively and quickly in structured P2P network.Chord is a successful routing algorithm in structured network.However,there is redundant information in the routing tables of Chord,and Chord searches for one node only in one direction,thus the support of searching in back Chord is insufficiency,which leads to poor efficiency in searching and locating nodes.Based on these deficiencies,an improved routing table of Chord is put forward in this paper.The redundant information in the routing table of Chord is replaced by the information of some nodes in the counter-rotating ring.At the same time,the information of the other nodes in the counter-rotating ring is added to the routing tables.Since the redundancy item in original table is made good use,searching of bidirectional routing table is implemented without increasing the items of finger table.Simulation experiment shows that the improved routing table structure improved the inquiry efficiency.