一种层次式的低延迟Chord协议扩展算法  

An Extended Algorithm for Hierarchical Low-Latency Chord Protocols

作　　者：胡迎松[1] 郭守烈[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《计算机工程与科学》2007年第4期74-77,共4页Computer Engineering & Science

摘　　要：本文提出一种层次式的低延迟Chord协议扩展路由算法,并根据区域把节点组织成多层网络,不同区域内组成区域Chord环,每次路由都从最小区域环开始,然后进入上一层,确定一个路由跳节点后,再从该节点所在的最小区域开始,循环往复直至找到目标节点的前驱。这样使得大部分路由跳都在底层区域环内执行,代替了在整个P2P环上往复跨区域执行,提高了路由延迟性能。This paper proposes an extended algorithm for hierarchical low-latency Chord protocols and organizes nodes into a multi-layer network by partitioning different regions. Different regions contain different Chord rings. Routing tasks are first executed in the lowest level region ring before they go up to the higher level rings. After finding a hop node, routing tasks are executed again in the lowest level region containing the hop node. This procedure repeats until finding the predecessor of the target node. A large portion of routing hops previously to-and-fro executed in the global P2P ring via many different big regions are now replaced by the hops in lower level region rings, thus the routing delay performance can be improved.

关 键 词：对等网络 分布式哈希表 CHORD协议 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]