T-Chord: A Two-Layer Routing Model for Chord

Routing is essential in P2P applications. Chord is a kind of structured P2P network, but its routing table can only cover half of the Chord ring. As long as target node is in the half ring which is not covered by the routing table, the target node must be found via not less than one medium node, namely, two hops. So, Chord is not very efficient. Therefore, a two-layer routing model for Chord(T-Chord) is proposed. By logically constructing inter-domain transmitting network on the Chord, the target node which is not in the same half ring with the originating lookup node can possibly be found in only one hop. Thus, the covering problem of Chord routing table can be solved well. Simulation experiments show that T-Chord reduces the average lookup path length and gets higher efficiency.