期刊文献+

关于有向双环网络G(N;r,s)平均直径的研究

On the average diameter of directed double-loop networks G(N;r,s)
下载PDF
导出
摘要 针对有向双环网络的最小路径图,给出了一个快速计算有向双环网络平均直径的高效算法.根据该算法,只要知道有向双环网络G(N;r,s)的3个参数N,r和s,就能计算出L-型瓦的4个参数a,b,p和q,从而计算出平均直径.对直径与平均直径之间的关系进行了仿真研究,结果表明:在一个无限族中,直径与平均直径的分布呈轴对称图形;同一网络的平均直径约等于直径的一半;在任意无限族中,当直径达到下界值时,平均直径不一定达到下界值,但当平均直径达到下界值时,直径一定达到下界值.最终表明平均直径比直径能更好地衡量网络传输效率. A rapid algorithm to compute its average diameter is provided from the shortest path diagram of directed double-loop network. According to this algorithm, four parameters a,b,p and q of L-shaped tile can be worked out if three parameters N,r and s of G(N;r,s) are known, and thus the average diameter of directed double-loop network can be obtained by calculating afterwards. Through the simulation study of the relationship between the diameter and average diameter, the results show that the distribution of the diameter and average diameter are all axis-symmetrical figure in one infinite family and average diameter approaches to a half of the diameter to one network. For anyone of infinite families, average diameter doesn't always obtain minimum value even though diameter obtains minimum value, but if average diameter obtains minimum value, the diameter must obtain minimum value. The experiments show that average diameter is the better parameter to measure transmission efficiency about networks than diameter.
作者 李胜 李颖
出处 《东北师大学报(自然科学版)》 CAS CSCD 北大核心 2013年第1期55-59,共5页 Journal of Northeast Normal University(Natural Science Edition)
基金 安徽省自然科学基金资助项目(1208085MF106)
关键词 有向双环网络 直径 平均直径 L-型瓦 最短路径 无限族 directed double-loop networks diameter average diameter L-shaped tile shortest path infinite family
  • 相关文献

参考文献8

  • 1WONG C K . COPPERSMITH D. A combinatorial problem related to multimodule organizations [J ]. Journal of AssociationComputer, 1974,21(3) :392-402.
  • 2CHEN C Y, HWANG F K. The minimum distance diagram of double-loop networks[J]. IEEE Transactions on Computers,2000,49 (9):977-979.
  • 3CHEN C Y, JAMES K L’TANG W S. An efficient algorithm to find a double-loop network that realizes a given L-shape[J].Theoretical Computer Science.2006,359(1/2/3) :69-76.
  • 4CHEN C Y,HWANG F K. Equivalent L-shapes of double-loop networks for the degenerate case [J]. Journal of InterconnectionNetworks, 2000,1(1) : 47-60.
  • 5CHAN C F, CHEN C Y, HONG Z X. A simple algorithm to find the steps of double-loop networks [J]. Discrete AppliedMathematics’2002,121(1/2/3) :61-72.
  • 6方木云,屈玉贵,赵保华.双环网络的[+h]边优先寻径策略[J].计算机学报,2008,31(3):536-542. 被引量:24
  • 7方木云,汤红霞.非单位步长双环网络平均直径的研究[J].华中科技大学学报(自然科学版),2009,37(6):12-15. 被引量:12
  • 8边琼芳,姜太平,刘辉,方木云.双环网络平均直径的研究[J].安徽工业大学学报(自然科学版),2011,28(3):277-281. 被引量:5

二级参考文献23

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部