现有的P 2P覆盖网络都难以把具有共同兴趣的对等点连接起来,不适用于文件浏览服务.为此,文中推广了立方连接圈(CCC)图,研究了推广立方连接圈(GCCC)图的拓扑性质,进而基于GCCC图定义了一种新的结构化P 2P覆盖网络--推广立方连接圈网络(GCNET).与其它的P 2P覆盖网络相比,GCNET具有良好的小世界特征和更好的鲁棒性.模拟实验结果表明,GCNET的路由表和查询长度能达到理论下界.%As the existing P2P overlay networks can not closely connect peers with the same interest together, it is not practical to provide browsing service in such systems. In order to solve this problem, the existing cube-connec-ted cycle (CCC) graph is generalized, and the topological properties of the generalized CCC (GCCC) graph are investigated. Afterwards, a novel structured P2P overlay network marked as GCNET (Generalized Cube-Connected Cycle network) is defined based on GCCC, which possesses better small-world characteristics and stronger robustness than other P2P overlay networks. Simulated results show that GCNET can reach the theoretical lower bounds of both the routing table size and the query path length.
展开▼