Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

An Effective Algorithm for Optimal K-terminal Reliability of Distributed Systems.

Chiu, Chin Ching and Yeh, Yi Shiung and Chou, Jue Sam (2001) An Effective Algorithm for Optimal K-terminal Reliability of Distributed Systems. Malaysian Journal of Library & Information Science, 6 (2). pp. 101-118. ISSN 1394-6234

Full text not available from this repository.

Official URL: http://ejum.fsktm.um.edu.my/ArticleInformation.aspx?ArticleID=178

Affiliations

Private Takming College, Taipei, Taiwan, Dept. of Management Information System

Abstract

Distributed system provides a cost-effective means of enhancing a computer system's performance in areas such as throughput, fault-tolerance, and reliability optimization. Consequently, the reliability optimization of a distributed system has become a critical issue. A K-terminal reliability is defined as the probability that a specified set, K, of nodes is connected in a distributed system. A K-terminal reliability optimization with an order (the number of nodes in K-terminal) constraint problem is to select a K-terminal of nodes in a distributed system such that the K-terminal reliability is maximal and possesses sufficient order. It is evident that this is an NP-hard problem. This paper presents a heuristic method to reduce the computational time and the absolute error from the exact solution. The proposed algorithm is based on not only a simple method to compute each node’s weight and each link’s weight, but also an effective objective function to evaluate the weight of node sets. Before appending one node to a current selected set, instead of computing the weight of all links and all nodes of each set, only the weight of a node, which is adjacent to the current selected set, and links between the node and the current selected set are accumulated. Then the proposed algorithm depends on the maximum weight to find an adequate node and assign it to the current selected set in a sequential manner until the order of K-terminal constraint is satisfied. Reliability computation is performed only once, thereby saving much time and the absolute error of the proposed algorithm from exact solution is very small.

Item Type:Journal
Keywords:Heuristics distributed systems; Reliability optimization
Subjects:Z Bibliography. Library Science. Information Resources
Q Science
ID Code:456

Aggarwal, K. K. and S. Rai. 1981. Reliability evaluation in computer communication networks. IEEE Transactions on Reliability, R-30, no.1:32-35.

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.

Aziz, M. A. 1997. Pathset enumeration of directed graphs by the set theoretic Method. Microelectronics and Reliability, Vol. 37, no.5: 809-814.

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.

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.

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.

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.

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.

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.

Nakazawa, H. 1981. Decompositon methos for computing the reliability of complex networks. IEEE Transactions on Reliability, Vol. R-32, no.2:289-292.

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.

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.

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.

Stankovic, J. A. 1984. A perspective on distributed computer systems. IEEE Transaction on Computer, Vol.c-33, no.12: 1102-1115.

Torrieri, Don. 1994. Calculation of node-pair reliability in large networks with unreliable nodes. IEEE Transactions on Reliability, Vol.43, no.3: 375-377.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.