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

双环网的宽直径
引用本文:江小平.双环网的宽直径[J].山东大学学报(理学版),2010,45(11):73-78.
作者姓名:江小平
作者单位:成都信息工程学院数学学院, 四川 成都 610225
摘    要:宽直径是度量网络通信延迟和容错性能的重要指标,而环网是局域网中广泛应用的一种网络结构。根据环网的对称性和点传递性,用点不交的最短路径算法研究了一类双环网C(n;a,b)(其中a,b是n的非平凡因子且a,b互素)的k-宽直径,并得到如下结论:当n=ab时,d4(C(n;a,b))≤La/2」+b-1;当n=2ab时,d4(C(n;a,b))≤a+b-1;当n=abr,r>2时,d4(C(n;a,b))≤(r-1)a+b-2。

关 键 词:双环网  宽直径  点传递图  
收稿时间:2010-04-06

The wide-diameter of double loop networks
JIANG Xiao-ping.The wide-diameter of double loop networks[J].Journal of Shandong University,2010,45(11):73-78.
Authors:JIANG Xiao-ping
Institution:School of Mathematics, Chengdu University of Information Technology, Chengdu 610225, Sichuan, China
Abstract:The wide-diameter is an important parameter which is useful for simultaneously measuring communication delay and fault-tolerance in networks. Loop networks are suitable topologies for local area networks. According to the symmetry and vertex-transitive of the loop networks, the k-diameter of a class of double loop networks C(n;a,b) (where a and b are nontrivial factors of n, and a is relatively prime to b) was studied by using the algorithms for the disjoint shortest paths. Some results have been deduced: if n=ab then d4(C(n;a,b))≤La/2」+b-1; if n=2ab then d4(C(n;a,b))≤a+b-1; if n=abr and r>2 then d4(C(n;a,b))≤(r-1)a+b-2.
 
Keywords:double loop networks  wide-diameter  vertex-transitive graph
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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