提出基于主从结构的Chord路由算法。该算法根据区域组成多个子环,在子环中推选出处理能力强的节点为超节点彼此相连构成主环。每次路由都从子环开始,然后进入主环,确定路由跳节点后,再在该节点对应的子环查找目标节点,使得大部分路由都在子环执行,避免在整个P2P环上往复跨区域查找,减少路由跳数,提高路由延时性能。 A Chord routing algorithm based on master-slave structure is proposed. According to the region, the algorithm constructs multiple sub-rings, and selects the nodes with strong processing ability in the sub-rings to connect the super-nodes to each other to form the main ring. Each route starts from the sub-ring and then enters the main ring. After determining the route hop node, it searches for the target node on the sub-ring corresponding to this node, so that most of the routes are executed on the sub-ring and avoids the round-trip Area search, reduce the number of routing hops, improve routing delay performance.