Research of routing algorithms in structured P2P network based on super nodes
基于超节点的结构化p2p路由算法的研究

Based on the research of classical routing algorithms in structured P2P network, a new routing algorithm, named Based Super Node Cube-Connect-Cycle (BSNCCC) was proposed. Based on O(d)(N=d*2d)hops per lookup request by using O(1) neighbors per node, the algorithm took advantage of the difference of nodes' capabilities in the network. The algorithm guaranteed that the nodes with the best capabilities served as the primary nodes. The simulation results show that BSNCCC routing algorithm has higher location efficiency than Cycloid in large scale and dynamic P2P networks that have frequent nodes arrival and departure.