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