基于超立方体环连接的Petersen图互联网络研究

基于环的简单扩展性，Petersen图的短直径与超立方体互联网络中节点的高可连接性相结合，提出了一种新型互联网络RHP(n)(Ringed Hypercube Connected Petersen)，并对其特性进行了研究．证明了RHP(n)网络不但具有正则性以及良好的可扩展性，同时还具有比Q、HP(n)网络更短的直径和更小的构造开销．另外，还基于RHP(n)网络分别给出了其上的单播和广播路由算法，证明了其通信效率分别为n-1和n-1．

Research on Hypercube & Ring Connected Petersen Graph Interconnection Networks

On the basis of the simple topology of ring, short diameter of Petersen graph, a nd high connectivity of hypercube, a novel interconnection network, RHP(n) (Ringed Hypercube Connected Petersen), is proposed, and whose characteristics are studied simultaneously. It is proved that RHP(n) is not only of regul arity and good extensibility, but also of shorter diameter and smaller construct ion costs than those previously well-known interconnection networks such as Q n and HP(n). In addition, the unicasting and broadcasting routing al gorithms are designed for RHP(n), whose communication efficiency are prove d to be n-1 and n-1 respectively.