By Topic

Reliability analysis of distributed computing systems in ring networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chang, Ming-Sang ; Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsin Chu, Taiwan, R.O.C. ; Chen, Deng-Jyi ; Lin, Min-Sheng ; Ku, Kuo-Lung

Distributed Computing System (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed Program Reliability (DPR) has to be addressed to obtain this reliability measure. An efficient network topology is quite important for the distributed computing system. For example, the ring network has been widely used in current distributed system design. In this paper, we focus on DCS with ring topologies. We propose polynomial-time algorithms to analyze the DPR of the dual ring topology and show that solving the DPR problem on a ring of trees topology is NP-hard.

Published in:

Communications and Networks, Journal of  (Volume:1 ,  Issue: 1 )