一种快速构建CAN网络拓扑算法

受二叉树思想的启发，在P2P网络拓扑管理协议T-Man和Kademlia网络快速构建算法的基础上，提出了从非结构化P2P网络快速构建CAN网络的算法。Kademlia网络为二叉树拓扑结构，CAN网络基于空间划分，由于已经提出了Kademlia网络快速构建算法，通过把CAN的空间划分方式强制定义为树图的空间划分方式，研究问题转换为由Kademlia网络的二叉树结构向CAN网络的树图结构转换及构建相应路由表的问题。实验表明，该算法能在对数的时间内构建出CAN网络。

Fast algorithm for building CAN topology

Inspired by binary tree, based on T-Man protocol and fast algorithm for building Kademlia, this paper proposed a fast algorithm for building CAN over unstructured P2P network. Kademlia is binary tree structure, and CAN bases on virtual multi-dimensional Cartesian coordinate space partition. Because the fast algorithm for building Kademlia has benn proposed, by defining CAN space partition as tree map, the key problem came to convert Kademlia binary tree structure to CAN tree map and built the routing table.Experiments demonstrate that algorithm builds CAN in a logarithmic number of steps.