Author :
Opatrny, Jaroslav ; Srinivasan, N. ; Alagar, Vangalur S.
Author_Institution :
Dept of Comput. Sci., Concordia Univ., Montreal, Que., Canada
Abstract :
Constructions of novel classes of highly fault-tolerant communication network models based on balanced incomplete block designs are presented. For a block design with parameters (b,n,r,k,1) the first two constructions give k-connected networks (K/sub 1,/b,n,r,k), (K/sub 1,k,/b,n,r,k) with degree sequence (r,k) of diameter 3 or 4, 4 or 5 on b+n, n(r+1) nodes respectively. It is shown that removal of any (k-1) nodes in these two classes of networks increases the diameter of the network at most by 1 and 3, respectively.<>
Keywords :
fault tolerant computing; graph theory; multiprocessor interconnection networks; network topology; switching theory; balanced incomplete block designs; communication network models; fault-tolerant; k-connected networks; multiprocessor networks; Circuit faults; Communication networks; Communication switching; Computer networks; Computer science; Degradation; Fault tolerance; Fault tolerant systems; Multiprocessing systems; Terminology;
