论文部分内容阅读
传统Chord的节点通过路由表记录后继节点的信息,一次最大跨度是Chord环上一半的地址空间,假如要查询在Chord环上中间节点后面另一半地址空间上的关键字,就必须先查询中间节点以前的地址空间,然后再路由到另一半地址空间,这样便会导致查询效率低下的问题。为了解决这一缺陷,本文结合Chord的“双向查询”改进算法,提出了基于Chord的结构化P2P路由模型的改进,大大提高了资源查询的速度。
The traditional Chord node records the successor node information through the routing table. One maximum span is half the address space on the Chord ring. If you want to query the keywords in the address space on the other half of the Chord ring after the intermediate node, you must first query the intermediate node Previous address space, and then rerouted to the other half of the address space, this will result in inefficient query. In order to solve this defect, this paper proposes an improved Chord-based structured P2P routing model based on Chord’s improved bidirectional query algorithm, which greatly improves the speed of resource query.