一种基于双标识符的Chord路由模型

Routing Model for Chord Based on Double Identifier

针对Chord协议的路由表只能覆盖一半标识符空间的问题,提出了一种基于双标识符的Chord路由模型。该模型除了按照Chord协议给每个节点和关键字分配一个顺时针标识符,另外还分配一个逆时针标识符。这样,一个Chord环上的节点或待查找的关键字便拥有双标识符。因此,每个节点能构造顺时针和逆时针两张路由表,可以覆盖整个标识符空间。理论分析和仿真实验表明,改进的Chord路由模型减少了平均查找跳数,提高了路由效率。

A routing model for chord based on double identifier is proposed to address the problem that the routing table in Chord only covers half of the identifier space. The model assigns each node or key not only a clockwise identifier according to Chord but also a anticlockwise identifier in addition. So each node or key has double identifiers. Thus each node maintains two routing tables：clockwise routing table and anticlockwise routing table. Performance analysis and simulation experiments show that improved Chord routing model reduces the average lookup path length and gets higher efficiency.