一种具有多维收敛能力的内容寻址网络

A content-addressable network with multi-dimensional convergence capacity

CAN(Content-Addressable Network)在d维的虚拟空间中利用分布式哈希表(Distributed Hash Table,DHT)来定位资源。CAN提供了一套比较有效的路由算法,但是节点能力的异构性并没有被考虑到算法中。这里提出了一种CAN路由的改进算法,通过扩展CAN邻居的定义和重构路由表等方式,使节点的异构性被考虑在路由算法中。同时该算法使得定位消息能从多维方向向着目标区域收敛,有效地提高了CAN路由消息的效率。

The content-addressable network（CAN） uses the distributed hash table （DHT） to locate the resource on a virtual d-dimensional Cartesian coordinate space.CAN provides a successful routing algorithm,but the differences between nodes are not a part of the algorithm.An improved routing algorithm is presented.By redefining the neighbors of the CAN and reconstructing the route table the differences between nodes are included in the new routing algorithm.It is a more effective routing algorithm.