论文信息 - WIDE DIAMETERS OF BUTTERFLY NETWORKS

WIDE DIAMETERS OF BUTTERFLY NETWORKS

Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the $w$-wide diameter $d_w(G)$, the $(w-1)$-fault diameter $D_w(G)$, and the $w$-Rabin number $r_w(G)$ have been used to measure network reliability and efficiency. In this paper, we study wide diameters for an important class of parallel networks---butterfly networks. The main result of this paper is to determine their wide diameters.

Gerard J. Chang | Sheng-Chyang Liaw

[1] D.Frank Hsu,et al. On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

[2] M. Krishnamoorthy,et al. Fault diameter of interconnection networks , 1987 .

[3] D. Frank Hsu,et al. Fault-tolerant routing in circulant networks and cycle prefix networks , 1998 .

[4] Dominique Sotteau,et al. 2-diameter of de Bruijn graphs , 1996, Networks.

[5] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[6] Gerard J. Chang,et al. Generalized Diameters and Rabin Numbers of Networks , 1998, J. Comb. Optim..

[7] D. Frank Hsu,et al. On the k-diameter of k-regular k-connected graphs , 1994, Discret. Math..

[8] Yuh-Dauh Lyuu,et al. A graph-theoretical study of transmission delay and fault tolerance , 1994 .