关键词:对等网络; 控制器局域网; 拓扑管理
Fast algorithm for building CAN topology
DAI Chang-hua, ZHANG Hao
(School of Information System & Management, National University of Defense Technology, Changsha 410073, China)
Abstract: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.