一类新的层次双环网络及其最优路由算法

A New Kind of Hierarchical Double-loop Network and Its Optimal Routing Algorithm

用图的笛卡尔积Fm×Fm-1×…×F1×G构造一类新的层次双环网络,给出其最优路由算法。图G为Petersen图,Fi为特殊的无向双环网络。研究网络的一些基本性质,并与杜艳等构造的层次双环网络(计算机工程与应用,2010年,第34期)进行比较。分析结果表明,新构造的网络是一类接连度小、直径短,存在简单且路由算法最优的新型网络拓扑结构。

In this paper,a new kind of hierarchical double-loop networks constructed by the Cartesian product Fm×Fm-1×…×F1×G（where G is Petersen graph and Fi is a special undirected double-loop network） and its optimal routing algorithm are proposed.Its properties are discussed.Through compared with the hierarchical double-loop networks constructed by Du Yan,et al（computer engineering and application,2010,issue 34）.Experimental result shows that this kind of networks is a new topology with good connection,shorter diameter and has a simple and optimal routing algorithm.