基于Petersen图互连的超立方体网络及其路由算法  

Topology and Routing Algorithms of Petersen Graph Connected Hypercube Networks

作　　者：王雷[1] 林亚平[1] 陈治平[2] 

机构地区：[1]湖南大学软件学院 [2]福建工程学院计算机与信息科学系,福州350014

出　　处：《系统仿真学报》2007年第6期1339-1343,共5页Journal of System Simulation

基　　金：福建省自然科学基金(A0510024);福建省青年科技人才创新项目(2005J051)

摘　　要：提出了一种新型互联网络PGCH(Petersen Graph Connected Hypercube),并对其特性进行了研究。证明了PGCH(k)网络不但具有正则性以及良好的可扩展性,同时还具有比Qk、TQk、CQk、以及HP(k)网络更短的直径和更好的可连接性。另外,还基于PGCH(k)网络分别给出了其上的单播、广播和容错路由算法,证明了其上的单播、广播路由算法的通信效率分别为k-2和k-2.且仿真实验表明,PGCH(k)上的容错路由算法具有良好的容错性能。An innovative interconnection network, PGCH （k） （Petersen Graph Connected Hypercube）, was proposed, and whose characteristics were studied simultaneously, It is proved that PGCH（k） is not only of regularity and good extensibility, but also of shorter diameter and better connectivity than those previous well-known interconnection networks such as Qk, TQk, CQk, and HP（k）. In addition, unicasting, broadcasting and fault-tolerant routing algorithms were designed for PGCH （k）, it is proved that the communication efficiency of its unicasting and broadcasting routing algorithms are k-2 and k-2 respectively. And simulation results show that the fault-tolerant routing algorithm is of good fault-tolerant performances either.

关 键 词：PETERSEN图 超立方体 互联网络 容错 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]