Title :
On hypercube reliability
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
Techniques for generating approximate measures for terminal and network reliability in a hypercube architecture are described. First, the author considers the total number of s-t paths of cardinability H(s,t) and H(s,t)+2, where H(s,t ) represents the Hamming distance between source s and terminal t, and generates a bound on terminal reliability. Various theorems which help arrive at the solution are stated and proved. Second, utilizing the concept of degree matrix (for B n), the author presents a method to obtain the total number of spanning trees in Bn and hence an approximate measure for network reliability
Keywords :
hypercube networks; reliability theory; trees (mathematics); Hamming distance; cardinability; degree matrix; hypercube architecture; network; reliability; spanning trees; terminal; Computer architecture; Computer network reliability; Computer networks; Electric variables measurement; Hypercubes; Network topology; Polynomials; Reliability engineering; Scalability; Zinc;
Conference_Titel :
System Theory, 1990., Twenty-Second Southeastern Symposium on
Conference_Location :
Cookeville, TN
Print_ISBN :
0-8186-2038-2
DOI :
10.1109/SSST.1990.138163
