Abstract: Chord is a kind of structured P2P network，but the routing table in Chord suffers serious information redundancy and it is not very efficient.Therefore，a routing model and algorithm implementation for Chord based on hierarchical dividing（H-Chord） is proposed.Simulation experiments show that H-Chord compresses the routing table length of most nodes into only one so as to eliminate repetitious entries and depress information redundancy.Simulation experiments also show that H-Chord reduces the average lookup path length and gets higher efficiency.H-Chord coordinates lookup efficiency and routing table length well.

Key words: Hierarchical-Chord, routing table, Distributed Hash Table（DHT）

摘要： Chord是一种结构化的P2P网络，但是存在路由表信息冗余、查找效率不高的问题。为此，提出了一种基于层次划分的Chord路由模型（H-Chord）及其算法实现。仿真实验表明，H-Chord将大多数节点的路由表长度压缩到只有一项，消除了重复表项，降低了信息冗余，减少了平均查找跳数，提高了查找效率，使控制路由表长度和提高查找效率得到很好的统一。

关键词: H-Chord, 路由表, 分布式哈希表