双环网的宽直径

J4 ›› 2010, Vol. 45 ›› Issue (11): 73-78.

双环网的宽直径

江小平

成都信息工程学院数学学院, 四川成都 610225

收稿日期:2010-04-06 出版日期:2010-11-16 发布日期:2010-11-24
作者简介:江小平(1975-),女,讲师,硕士,研究方向为组合数学与图论. Email:jxping@cuit.edu.cn

The wide-diameter of double loop networks

JIANG Xiao-ping

School of Mathematics, Chengdu University of Information Technology, Chengdu 610225, Sichuan, China

Received:2010-04-06 Online:2010-11-16 Published:2010-11-24

摘要/Abstract

摘要：

宽直径是度量网络通信延迟和容错性能的重要指标,而环网是局域网中广泛应用的一种网络结构。根据环网的对称性和点传递性,用点不交的最短路径算法研究了一类双环网C(n;a,b)(其中a,b是n的非平凡因子且a,b互素)的k-宽直径，并得到如下结论:当n=ab时,d₄(C(n;a,b))≤La／2」+b-1;当n=2ab时,d₄(C(n;a,b))≤a+b-1;当n=abr,r>2时,d₄(C(n;a,b))≤(r-1)a+b-2。

关键词: 双环网;宽直径;点传递图

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 d₄(C(n;a,b))≤La／2」+b-1; if n=2ab then d₄(C(n;a,b))≤a+b-1; if n=abr and r>2 then d₄(C(n;a,b))≤(r-1)a+b-2.

Key words: double loop networks; wide-diameter; vertex-transitive graph

江小平. 双环网的宽直径[J]. J4, 2010, 45(11): 73-78.

JIANG Xiao-ping. The wide-diameter of double loop networks[J]. J4, 2010, 45(11): 73-78.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed