Abstract
With the rapid development of computer networking, distributed computer systems (DCS) have become an attractive and efficient way to share system resources, achieve fault-tolerance and obtain high extensibility and dependability. A new algorithm based on Binary Decision Diagrams (BDD) for dependability analysis of distributed computer systems (DCS) with imperfect coverage is proposed in this paper. Minimum file spanning trees (MFST) are generated and stored via BDD manipulation. By using the multistate concept, our algorithm can generate BDDs that can deal with imperfect coverage and obtain reliability expressions from these BDDs. Computation of various importance measure and ordering strategies for variables are discussed in this paper as well. Due to the nature of the BDD, the sum of disjoint products (SDP) can be implicitly represented by the BDD, which avoids huge storage and high computation complexity for large systems. In order to show the efficiency of BDD-based algorithm, several examples are given in the paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aggarwal, K. and Rai, S. (1981). Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability, R-30:32–35.
Bouissou, M. (1996). An ordering heuristic for building binary decision diagrams from fault-trees. Proc. Annual Reliability and Maintainability Symposium, pages 208–214.
Brace, K., Rudell, R., and Bryant, R. (1990). Efficient implementation of a BDD package. In Proc. 27th ACM/IEEE Design Automation Conference, pages 40–45.
Bryant, R. (1986). Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691.
Colbourn, C. (1989). The Combinatorics of Network Reliability. Oxford University Press, New York.
Coudert, O. and Madre, J. (1994). Metaprime: An interactive fault-tree analyzer. IEEE Transactions on Reliability, 43(1):121–127.
Doyle, S. and Dugan, J. (1995). Dependability assessment using binary decision diagrams. Proc. 25th International Symposium on Fault-Tolerant Computing, pages 249–258.
Doyle, S., Dugan, J., and Boyd, M. (1995). Combinatorial-models and coverage: a binary decision diagram (BDD) approach. In Proc. Annual Reliability and Maintainability Symposium, pages 82–89.
Dugan, J. and Trivedi, K. (1989). Coverage modeling for dependability analysis of fault-tolerant systems. IEEE Transactions on Computers, 38(6):775–787.
Ke, W. and Wang, S. (1997). Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Transactions on Reliability, 46(3):342–349.
Kini, V. and Siewiorek, D. (1982). Automatic generation of symbolic reliability functions for processor-memory-switch structures. IEEE Transactions on Computers, 31(8):752–771.
Kumar, A. and Agrawal, D. (1993). A generalized algorithm for evaluating distributed-program reliability. IEEE Transactions on Reliability, 42(3):416–426.
Kumar, A., Rai, S., and Agrawal, D. (1988). On computer communication network reliability under program execution constraints. IEEE Journal on Selected Areas in Communications, 6(8):1393–1399.
Kumar, V., Hariri, S., and Raghavendra, C. (1986). Distributed program reliability analysis. IEEE Transactions on Software Engineering, SE-12(1):42–50.
Lopez-Benitez, N. (1994). Dependability modeling and analysis of distributed programs. IEEE Transactions on Software Engineering, 20(5):345–352.
Malik, S., Wang, A., Brayton, R., and Sangiovanni-Vincentelli, A. (1988). Logic verification using binary decision diagrams in a logic synthesis environment. In Proc. IEEE International Conference on Computer-Aided Design (ICCAD-88), pages 6–9, Santa Clara, California.
Misra, K. (1992). Reliability Analysis and Prediction: A Methodology Oriented Treatment. Elsevier, Amsterdam, The Netherlands.
Rauzy, A. (1993). New algorithms for fault tree analysis. Reliability Engineering and System Safety, 40:203–211.
Satyanarayana, A. and Hagstrom, J. (1981). A new algorithm for reliability analysis of multi-terminal networks. IEEE Transactions on Reliability, R-30:325–333.
Sinnamon, R. and Andrews, J. (1997a). Improved accuracy in quantitative fault tree analysis. Quality and Reliability Engineering International, 13:285–292.
Sinnamon, R. and Andrews, J. (1997b). Improved efficiency in qualitative fault tree analysis. Quality and Reliability Engineering International, 13:293–298.
Zang, X., Sun, H., and Trivedi, K. (1998). A bdd-based algorithm for analysis of multistate systems with multistate components. Technical Report, CACC, Duke University.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zang, X., Sun, H., Trivedi, K.S. (2000). A BDD Approach to Dependability Analysis of Distributed Computer Systems with Imperfect Coverage. In: Avresky, D.R. (eds) Dependable Network Computing. The Springer International Series in Engineering and Computer Science, vol 538. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4549-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4549-1_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7053-6
Online ISBN: 978-1-4615-4549-1
eBook Packages: Springer Book Archive