作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (18): 90-92. doi: 10.3969/j.issn.1000-3428.2012.18.024

• 网络与通信 • 上一篇    下一篇

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

钟 玮a, 陈宝兴a, 陈 宇b   

  1. (漳州师范学院 a. 计算机科学与工程系;b. 数学与信息科学系,福建 漳州 363000)
  • 收稿日期:2011-10-17 修回日期:2012-01-06 出版日期:2012-09-20 发布日期:2012-09-18
  • 作者简介:钟 玮(1982-),女,实验师、硕士,主研方向:网络拓扑设计;陈宝兴,教授、博士;陈 宇,讲师、硕士
  • 基金资助:

    国家自然科学基金资助项目(60973150);福建省自然科学基金资助项目(2010J01354)

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

ZHONG Wei a, CHEN Bao-xing a, CHEN Yu b   

  1. (a. Department of Computer Science; b. Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou 363000, China)
  • Received:2011-10-17 Revised:2012-01-06 Online:2012-09-20 Published:2012-09-18

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

关键词: 互连网络, 双环网络, 笛卡尔积, 层次双环网络, 最优路由

Abstract: 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.

Key words: interconnection network, double-loop network, Cartesian product, hierarchical double-loop network, optimal routing

中图分类号: