首页 | 本学科首页   官方微博 | 高级检索  
     

一类新的层次双环网络及其最优路由算法
引用本文:钟玮,陈宝兴,陈宇.一类新的层次双环网络及其最优路由算法[J].计算机工程,2012,38(18):90-92.
作者姓名:钟玮  陈宝兴  陈宇
作者单位:1. 漳州师范学院计算机科学与工程系,福建漳州,363000
2. 漳州师范学院数学与信息科学系,福建漳州,363000
基金项目:国家自然科学基金资助项目,福建省自然科学基金资助项目
摘    要:用图的笛卡尔积Fm×Fm-1×…×F1×G构造一类新的层次双环网络,给出其最优路由算法。图G为Petersen图,Fi为特殊的无向双环网络。研究网络的一些基本性质,并与杜艳等构造的层次双环网络(计算机工程与应用,2010年,第34期)进行比较。分析结果表明,新构造的网络是一类接连度小、直径短,存在简单且路由算法最优的新型网络拓扑结构。

关 键 词:互连网络  双环网络  笛卡尔积  层次双环网络  最优路由
收稿时间:2011-10-17
修稿时间:2012-01-06

A New Kind of Hierarchical Double-loop Network and Its Optimal Routing Algorithm
ZHONG Wei , CHEN Bao-xing , CHEN Yu.A New Kind of Hierarchical Double-loop Network and Its Optimal Routing Algorithm[J].Computer Engineering,2012,38(18):90-92.
Authors:ZHONG Wei  CHEN Bao-xing  CHEN Yu
Affiliation:b(a.Department of Computer Science;b.Department of Mathematics and Information Science,Zhangzhou Normal University,Zhangzhou 363000,China)
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.
Keywords:interconnection network  double-loop network  Cartesian product  hierarchical double-loop network  optimal routing
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号