双环Petersen网络直径公式及最优路由算法

摘要

The Double-Loops Connected Petersen Graph network DLCPG(k) is Cartesian product of a double-loop network and the Petersen graph. It has good extensibility, short diameter and simple topology structure. By studying its topology structure, the diameter formula of DLCPG(k) is obtained, and a simple and optimal routing algorithm for the DLCPG(k) is given.%双环Petersen图互联网络DLCPG(k)是双环网络与Petersen图的笛卡尔积,它具有良好的可扩展性、较短的网络直径和简单的拓扑结构等特性.通过研究其拓扑结构,得到了DLCPG(k)直径的显式公式,并给出了该网络的最优单播路由算法.