DocumentCode
2627479
Title
Dependability analysis for large systems: A hierarchical modeling approach
Author
Dahlberg, Teresa A. ; Agrawal, Dharma P.
Author_Institution
IBM Corp., Charlotte, NC, USA
fYear
1993
fDate
1-4 Dec 1993
Firstpage
456
Lastpage
459
Abstract
Dependability analysis of a large network is NP-hard due to the state space explosion. A hierarchical Boolean algebraic method was recently introduced to efficiently evaluate static terminal reliability and task-based reliability by dividing the problem into smaller, more manageable pieces. We extend this method to evaluate time-dependent reliability and availability, collectively referred to as "dependability", and to approximate MTTF
Keywords
computer network reliability; graph theory; dependability analysis; hierarchical Boolean algebraic method; hierarchical modeling approach; state space explosion; static terminal reliability; task-based reliability; time-dependant availability; time-dependent reliability; Availability; Computational complexity; Computer network reliability; Distributed computing; Explosions; Graph theory; Hypercubes; Multiprocessing systems; Telecommunication network reliability; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-4222-X
Type
conf
DOI
10.1109/SPDP.1993.395498
Filename
395498
Link To Document