DocumentCode :
2106476
Title :
Computing network reliability of redundant MINs
Author :
Rai, Suresh ; Trahan, Jerry
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fYear :
1989
fDate :
26-28 Mar 1989
Firstpage :
221
Lastpage :
225
Abstract :
A reliability analysis technique for MINs (multistage interconnection networks) is discussed. The technique obtains a reliability expression in two steps. Step 1 enumerates paths that are responsible for maintaining one-to-one, one-to-many, or many-to-many connections in a MIN. Step 2 modifies the path information into an equivalent reliability expression. For both step methods techniques that are straightforward, general, and efficient are presented. Examples are used to illustrate the underlying concepts
Keywords :
multiprocessor interconnection networks; redundancy; reliability theory; computer networks; multistage interconnection networks; path information; redundancy; reliability analysis; Computer network reliability; Computer networks; Concurrent computing; Explosions; Large-scale systems; Maintenance engineering; Multiprocessor interconnection networks; Packet switching; Parallel processing; Reliability engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location :
Tallahassee, FL
ISSN :
0094-2898
Print_ISBN :
0-8186-1933-3
Type :
conf
DOI :
10.1109/SSST.1989.72465
Filename :
72465
Link To Document :
بازگشت