An effective algorithm for optimal K-terminal reliability of distributed systems

Malaysian Journal of Library and Information Science

Volumn 6, Issue 2, 2001, Pages 101-118

  Chiu, Chin Ching ^a   Yeh, Yi Shiung ^b   Chou, Jue Sam ^b  

^a TAKMING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Heuristics distributed systems; Reliability optimization

Indexed keywords

EID: 79952730664     PISSN: 13946234     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Aggarwal, K. K. and S. Rai. 1981. Reliability evaluation in computer communication networks. IEEE Transactions on Reliability, R-30, no.1: 32-35.
2. Aggarwal, K. K., Y. C. Chopra, and J. S. Bajwa. 1982. Topological layout of links for optimizing the S-T reliability in a computer communication system. Microelectronics and Reliability, vol.22, no.3: 341-345.
3. Aziz, M. A. 1997. Pathset enumeration of directed graphs by the set theoretic Method. Microelectronics and Reliability, Vol. 37, no.5: 809-814.
4. Hariri, Salim. and C. S. Raghavendra. 1987. SYREL: a symbolic reliability algorithm based on path and cuset methods. IEEE Transactions on Computers, Vol.C-36, no.10: 1224-1232.
5. Irani, K. B. and N. G. Khabbaz. 1982. A methodology for the design of communication networks and the distribution of data in distributed supercomputer systems. IEEE Transaction on Computers, Vol. C-31, no.5: 420-434.
6. Kumar, Anup. and Dharme P. Agrawal. 1993. A generalized algorithm for evaluation distributed program reliability. IEEE Transactions on Reliability, Vol.42, no.3: 416-426.
7. Lin, M. S. and D. J. Chen. 1992. New reliability evaluation algorithms for distributed computing systems. Journal of Information Science and Engineering, Vol.8, no.3: 353-391.
8. Lin M. S., M. S. Chang and D. J. Chen. 1999. Efficient algorithms for reliability analysis of distributed computing systems. Journal of Information Science and Engineering, Vol.117, no.1-2.
9. Makri, F. S. and Z. M. Psillakis. 1997. Bound for reliability of k-within connected-(v,s) out-of (m,n) failure systems. Microelectronics and Reliability, Vol.37, no.8: 1217-1224.
10. Nakazawa, H. 1981. Decompositon methos for computing the reliability of complex networks. IEEE Transactions on Reliability, Vol. R-32, no.2: 289-292.
11. Politof, T. and A. Satyanarayana. 1986. Efficient algorithms for reliability analysis of planar netwotks-a survey. IEEE Transactions on Reliability, Vol.R-35, no.3: 252-259.
12. Rai, S., A. K. Sarje, E. V. Prasad and A. Kumar. 1987. Two recursive for computing the reliability of k-out-of-n systems. IEEE Transactions on Reliability, Vol.R-36, no.2: 261-265.
13. Satyanarayana, A., and J. N. Hagstrom. 1981. A new algorithm for the reliability analysis of multi-terminal networks. IEEE Transactions on Reliability, Vol.R-30, no.4: 325-333.
14. Stankovic, J. A. 1984. A perspective on distributed computer systems. IEEE Transaction on Computer, Vol.c-33, no.12: 1102-1115.
15. Torrieri, Don. 1994. Calculation of node-pair reliability in large networks with unreliable nodes. IEEE Transactions on Reliability, Vol.43, no.3: 375-377.