双环网络并行最优寻径策略及宽直径的研究

刘辉; 张珍; 方木云; 郑啸; 陈业斌

doi:10.3969/j.issn.1000-436x.2014.08.009

您当前的位置：

首页 >

文章列表页 >

双环网络并行最优寻径策略及宽直径的研究

学术论文 | 更新时间：2024-10-11

- 双环网络并行最优寻径策略及宽直径的研究
- Research on optimal parallel routing and wide diameter of unidirectional double-loop networks
- 通信学报 2014年35卷第8期页码：63-70
- 作者机构：
- 作者简介：
  
  [ "刘辉（1979-），男，安徽桐城人，安徽工业大学副教授，主要研究方向为计算机网络、数据挖掘与分析处理等。" ]
  [ "张珍（1990-），女，安徽蚌埠人，安徽工业大学硕士生，主要研究方向为计算机网络、数据处理等。" ]
  [ "方木云（1968-），男，湖北罗田人，安徽工业大学教授，主要研究方向为软件度量、软件可靠性等。" ]
  [ "郑啸（1975-），男，福建莆田人，安徽工业大学教授，主要研究方向为计算机网络和分布式系统、服务计算。" ]
  [ "陈业斌（1971-），男，安徽全椒人，安徽工业大学教授，主要研究方向为计算机网络和数据库。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(；;61003311);国家自然科学基金资助项目;The National Natural Science Foundation of China(；;61300059);安徽省教育厅重大基金资助项目;The Major Project of the Education Department of Anhui Province(ZD2008005-1);安徽省教育厅重点基金资助项目;The Natural Science Foundation of Education Department of Anhui Province(KJ2012A262);安徽省教育厅重点基金资助项目;The Natural Science Foundation of Education Department of Anhui Province(KJ2013A058)
- DOI：10.3969/j.issn.1000-436x.2014.08.009
  中图分类号： O157.6;TP393
- 网络出版日期：2014-08，
  
  纸质出版日期：2014-08-25
- 稿件说明：
移动端阅览
刘辉, 张珍, 方木云, 等. 双环网络并行最优寻径策略及宽直径的研究[J]. 通信学报, 2014,35(8):63-70.

Hui LIU, Zhen ZHANG, Mu-yun FANG, et al. Research on optimal parallel routing and wide diameter of unidirectional double-loop networks[J]. Journal on communications, 2014, 35(8): 63-70.
刘辉, 张珍, 方木云, 等. 双环网络并行最优寻径策略及宽直径的研究[J]. 通信学报, 2014,35(8):63-70. DOI： 10.3969/j.issn.1000-436x.2014.08.009.

Hui LIU, Zhen ZHANG, Mu-yun FANG, et al. Research on optimal parallel routing and wide diameter of unidirectional double-loop networks[J]. Journal on communications, 2014, 35(8): 63-70. DOI： 10.3969/j.issn.1000-436x.2014.08.009.

摘要

将双环网络拓扑结构映射到平面直角坐标系，基于直角坐标系研究双环网络的并行最优寻径方法。首先研究坐标轴上节点及其等价节点的分布规律，建立等价节点分布模型，得出基于等价节点的并行最优寻径策略及双环网络宽直径求解方法。在双环网络最小路径图（MDD）的基础上拓展，提出并行路径图（PDD）的设计思路并予以仿真实现，基于PDD图，设计两点间2条内点不交的并行最短路径的快速求解方法。仿真实验表明，宽直径分布随步长的变化呈现一定波动性，相对于传统的寻径方式，并行最优寻径明显提高了网络传输效率。

Abstract

A new method to research optimal parallel routing of unidirectional double-loop networks (DLN) is presented based on Cartesian coordinates. Firstly

the ditributed model of copy nodes is obtained under the research on the distrib-uted rules of the copy nodes of nodes on both X axis and Y axis in the minium distance diagram(MDD). Using this ditrib-uted model of copy nodes

the optimal parallel routing method is provided

as well as calculating method of wide diame-ter of DLN. Secondly

the parallel distance diagram(PDD) of DLN which is expanded by MDD is designed and simulated. Based on the PDD

a method to find two shortest parallel pathes quickly without any repeating node was proposed. At last

the simulation of the distribution of wide diameter of DLN is given. The result of simulation indicates that the character-istic of wide diameter distribution is reposeful undulation. Compared with traditional routing method

optimal parallel routing method improved the transition efficiency of DLN obviously based on the simulation results.

关键词

Keywords

references

方木云，赵保华，屈玉贵 . 双环网络的[+h]边优先寻径策略 [J ] . 计算机学报， 2008 , 31 ( 3 ): 536 - 542 .

FANG M Y , ZHAO B H , QU Y G . [+h]-link prior routing strategy for dou-ble-loop network [J ] . Chinese Journal of Computers , 2008 , 31 ( 3 ): 536 - 542 .

陈协彬 . 步长有限制的双环网络的最优路由算法 [J ] . 计算机学报， 2004 , 27 ( 5 ): 596 - 603 .

CHEN X B . An optimal routing algorithm for double loop networks with restricted steps [J ] . Chinese Journal of Computers , 2004 , 27 ( 5 ): 596 - 603 .

HWANG F K . A survey on multi-loop networks [J ] . Computer Science , 2003 107 - 121 .

HWANG F K . A complementary survey on double-loop networks [J ] . Theoretical Computer Science , 2001 , 263 : 211 - 229 .

徐俊明 . 计算机互联双环网络的最优设计 [J ] . 中国科学(E 辑 , 1999 , 42 ( 5 ): 462 - 469 .

XU J M . Designing of optimal double loop networks [J ] . Science in China(Series E) , 1999 , 42 ( 5 ): 462 - 469 .

陈业斌，李颖，郑啸等 . 关于有向环网平均直径的研究 [J ] . 通信学报， 2013 , 34 ( 2 ): 138 - 146 .

CHEN Y B , LI Y , ZHENG X et al . On the average diameter of di-rected loop networks [J ] . Journal on Communications , 2013 , 34 ( 2 ): 138 - 146 .

徐俊明，谢歆 . 关于图的容错直径和宽直径 [J ] . 中国科学技术大学学报， 2002 , 32 ( 2 ): 135 - 139 .

XU J M , XIE X . On fault-tolerant diameter and wide diameter of graphs [J ] . Journal of University of Science and Technology of China , 2002 , 32 ( 2 ): 135 - 139 .

HSU D F . et al . On container width and length in graphs, groups, and net-works [J ] . IEICE Transaction on Fundamentals of Electronics, Com-munications and Computer Science , 1994 , 77 ( 4 ): 668 - 680 .

陈宝兴，杜妮，周书明 . 有向双环网络的宽直径公式 [J ] . 厦门大学学报(自然科学版) ， 2008 , 47 ( 6 ): 782 - 786 .

CHEN B X , DU N , ZHOU S M . The wide diameter formula of a di-rected double loop network [J ] . Journal of Xiamen University(Natural Science) , 2008 , 47 ( 6 ): 782 - 786 .

CHEN Y B , LI Y , WANG J K . On the wide diameter of directed dou-ble-loop networks [J ] . Journal of Network and Computer Applications , 2011 , 34 ( 1 ): 692 - 696 .

刘辉，方木云 . 直角坐标系下无向双环网络 G(N;±1,±s)的直径研究 [J ] . 通信学报， 2011 , 32 ( 1 ): 138 - 143 .

LIU H , FANG M Y . Research on the diameter of bidirectional dou-ble-loop networks G(N; ±1, ±s) in Cartesian coordinates [J ] . Journal on Communications . 2011 , 32 ( 1 ): 138 - 143 .

WONG C K , COPPERHMITH D , . combinatorial problem related to multi-module memory organizations [J ] . Journal of Association for Computing Machinery , 1974 , 21 ( 3 ): 392 - 402 .

刘焕平，杨义先，杨放春 . 双环网 G(N;s1,s2)的直径 [J ] . 系统工程理论与实践， 1999 , 19 ( 2 ): 58 - 61 .

LIU H P , YANG Y X , YANG F C . The diameter of double-loop net-works G(N; s1, s2) [J ] . System Engineering Theory ＆ Practice , 1999 , 19 ( 2 ): 58 - 61 .

CHEN C Y , HWANG F K . The minimum distance diagram of dou-ble-loop networks [J ] . IEEE Transactions on Computers , 2000 , 49 ( 9 ): 977 - 979 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据