摘要： 结构化P2P网络Chord的路由表只能覆盖一半标识符空间，只要目标节点落入路由表没有覆盖的半环，就必须通过至少一个中间节点即2跳才能找到，导致其查找效率不高。由此提出一种层次式Chord路由模型——S-Chord，通过构建位于Chord环上的域间转发网，使与发起查找节点不在同一半环内的目标节点有可能只需1跳就能查找到，较好地解决了路由表覆盖面不足的问题。仿真实验表明， S-Chord能够减少平均查找跳数，提高查找效率。

关键词: 路由表, S-Chord路由模型, 分布式哈希表

Abstract: Chord is a kind of structured P2P network, but the route table in Chord only covers half of the identifier space. As long as target node is in the half ring which is not covered by the route table, the target node must be found via no less than one medium node, namely, two hops. So, Chord is not very efficient. A stratum route model for Chord(S-Chord) is proposed. By logically constructing inter-domain transmitting network on Chord, the target node which is not in the same half ring with the originating lookup node can be found in only one hop. The covering problem of Chord route table is solved better. Simulation experiments show that S-Chord can reduce the average lookup path length and get higher efficiency.

Key words: route table, S-Chord routing model, Distributed Hash Table(DHT)

中图分类号: 

• TP393