CAREL: computer aided reliability evaluator for distributed computing networks

Author

Soh, Sieteng ; Rai, Suresh

Author_Institution

Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA

Volume

2

Issue

2

fYear

1991

fDate

4/1/1991 12:00:00 AM

Firstpage

199

Lastpage

213

Abstract

An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a distributed computing system (DCS) is presented. It is assumed that the graph model G(V,E) for DCS is given and that the path and/or cut information for the network G(V,E) is available. Boolean algebraic concepts are used to define four operators: compare, reduce, combine, and generate. The proposed method, called CAREL, uses the four operators to generate exclusive and mutually disjoint events. CAREL has been implemented using bit vector representation on an Encore MULTIMAX 320 system. It is shown that CAREL solves large DCS networks (having a pathset on the order of 780 and a cutset on the order of 7300 or more) with a reasonable memory requirement. A comparison with other algorithms reveals the computational efficiency of the method. The proof of correctness of CAREL is included

Keywords

computer aided analysis; computer testing; distributed processing; performance evaluation; CAREL; Encore MULTIMAX; distributed computing networks; distributed computing system; graph model; reliability evaluator; terminal reliability; Boolean functions; Computational efficiency; Computer network reliability; Computer networks; Distributed computing; Distributed control; Iterative algorithms; Measurement; Polynomials; Telecommunication network reliability;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.89065

Filename

89065