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

Research on hypercube and double Petersen graph connected interconnection networks

基于Petersen图的短直径与超立方体节点的高可连接性,提出了一种新型的互连网络拓扑结构———基于超立方体的双Petersen图连接的互联网络PHP(n);并对其拓扑性质进行了研究。研究表明PHP(n)网络具有正则性和良好的可扩展性与容错性。另外,还设计了PHP(n)网络上的单播、广播路由算法,证明了其通信效率均为n+4。

Based on the short diameter of Petersen Graph and high connectivity of hypercube,an innovative interconnection network topological structure,Hypercube and double Petersen Graph Connected Networks（PHP（n））,is proposed,and whose characteristics are studied.It is shown that PHP（n） has regularity,good extensibility and good fault-tolerant ability.In addition,the unicast and broadcast routing algorithms are designed for PHP（n）,whose communication efficiency are proved to be n＋4.