Reliability analysis of distributed computing systems in ring networks

Author

Chang, Ming-Sang ; Chen, Deng-Jyi ; Lin, Min-Sheng ; Ku, Kuo-Lung

Author_Institution

Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsin Chu, Taiwan, R.O.C.

Volume

1

Issue

1

fYear

1999

fDate

3/1/1999 12:00:00 AM

Firstpage

68

Lastpage

77

Abstract

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.

Keywords

Algorithm design and analysis; Clocks; Distributed databases; Network topology; Reliability; Topology; Algorithms; Computational Complexity; Distributed Program Reliability; Minimal File Spanning Tree; Ring of Tree;

fLanguage

English

Journal_Title

Communications and Networks, Journal of

Publisher

ieee

ISSN

1229-2370

Type

jour

DOI

10.1109/JCN.1999.6596700

Filename

6596700