Experimental Results on Preprocessing of Path/Cut Terms in Sum of Disjoint Products Technique

IEEE Transactions on Reliability

Volumn 42, Issue 1, 1993, Pages 24-33

  Soh, Sieteng ^a   Rai, Suresh ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Benchmark network; Bit vector; Boolean technique; Disjoint product; Hamming distance; Minimal path cut; Terminal reliability

Indexed keywords

BOOLEAN ALGEBRA; POLYNOMIALS; PROBABILITY; TELECOMMUNICATION SYSTEMS; VECTORS;

BENCHMARK NETWORK; BIT VECTOR; HAMMING DISTANCE; MINIMAL PATH/CUT; NETWORK RELIABILITY ANALYSIS; SUM OF DISJOINT PRODUCTS; TERMINAL RELIABILITY;

RELIABILITY THEORY;

EID: 0027558205     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.210267     Document Type: Article

References (21)

1. E. J. McCluskey, Logic Design Principles with emphasis on Testable Semicustom Circuits, 1986; Prentice Hall.
2. J. A. Buzacott, “The ordering of terms in cut-based recursive disjoint products”, IEEE Trans. Reliability, vol R-32, 1983 Dec, pp 472–474.
3. S. Soh, S. Rai, “Experimental results on preprocessing of path/cut terms in sum of disjoint products technique”, INFOCOM’91, pp 533–542. (Miami, Florida)
4. S. Rai, D. P. Agrawal, Distributed Computing Network Reliability, 1990; IEEE Computer Society Press. (Tutorial Text)
5. C. J. Colbourn, The Combinatorics of Network Reliability, 1987; Oxford University Press.
6. M. O. Ball, J. S. Provan, “Disjoint products and efficient computation of reliability”, Operations Research, vol 36, 1988 Sep-Oct, pp 703–715.
7. S. Rai, K. K. Aggarwal, “An efficient method for reliability evaluation of a general network”, IEEE Trans. Reliability, vol R-27, 1978 Aug, pp 206–211.
8. J. A. Abraham, “An improved algorithm for network reliability”, IEEE Trans. Reliability, vol R-28, 1979 Apr, pp 58–61.
9. M. O. Locks, “A minimizing algorithm for the sum of disjoint products”, IEEE Trans. Reliability, vol R-36, 1987 Oct, pp 445–453.
10. J. M. Wilson. “An improved minimizing algorithm for sum of disjoint products”, IEEE Trans. Reliability, vol 39, 1990 Apr, pp 42–45.
11. S. Soh, S. Rai. “CAREL: Computer Aided RELiability evaluator for distributed computing networks”, IEEE Trans. Parallel and Distributed Systems, vol 2, 1991 Apr, pp 199–213.
12. David Y. Koo, “D/Boolean application in reliability analysis”, Proc. Annual Reliability and Maintainability Symp., 1990, pp 294–301.
13. S. Rai, J. Trahan, “Computing network reliability of redundant MINs”, Proc. 21st Southeastern Symp. System Theory, 1989 Mar, pp 221–225. (Tallahassee, Florida)
14. S. Hariri, C. S. Raghavendra, “SYREL: A Symbolic Reliability algorithm based on path cutset methods”, IEEE Trans. Computers, vol C-36(10), 1987 Oct, pp 1224–1232.
15. A. Grnarov L. Kleinrock, M. Gerla, “A new algorithm for network reliability computation”, Proc. Computer Networking Symp., 1979 Dec, pp 17–20.
16. R. G. Bennetts, “Analysis of reliability block diagrams by Boolean techniques”, IEEE Trans. Reliability, vol R-35, 1986 Jun, pp 159–166.
17. R. K. Tiwari, M. Verma, “An algebraic technique for reliability evaluation”, IEEE Trans. Reliability, vol R-29, 1980 Oct, pp 311–313.
18. M. Veeraraghavan, K. Trivedi, “An improved algorithm for symbolic reliability analysis”, IEEE Trans. Reliability, vol 40, 1991 Aug, pp 347–358.
19. L. Fratta, U.G. Montanari, “A recursive method based on case analysis for computing network terminal reliability- IEEE Trans. Communications, vol COM-26, 1978 Aug, pp 1166–1177.
20. A. V. Aho, J. E. Hoffcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974; Addison Wesley.
21. A. Rosenthal, “Approaches to comparing cut-set enumeration algorithms” IEEE Trans. Reliability, vol R-28, 1979 Apr, pp 62–65.