Network s-t reliability bounds using a 2-dimensional reliability polynomial

Author

Bulka, Dov ; Dugan, Joanne Bechta

Author_Institution

IBM Corp., Research Triangle Park, NC, USA

Volume

43

Issue

1

fYear

1994

fDate

3/1/1994 12:00:00 AM

Firstpage

39

Lastpage

45

Abstract

Computing the reliability of a generic network is computationally difficult, and an exact solution is unattainable for many problems. Faced with this computational difficulty, two compromises are usually made: (1) be content with reliability bounds instead of exact reliability; and (2) simplify analysis by assuming that all but 1 component-type are perfectly reliable. This paper relaxes the assumption of perfect components and computes the s-t reliability of a network whose operation is a function of the reliability of 2 component types (nodes and links.) The extension of the reliability polynomial to 2 dimensions removes the need to assume that links or nodes are perfectly reliable

Keywords

polynomials; reliability theory; 2-dimensional reliability polynomial; 3D hypercube network; Red ARPA; generic network; links; network s-t reliability bounds; nodes; reduced Arpanet; Computer networks; Explosions; Hypercubes; Polynomials; Reliability theory; Telecommunication network reliability; Upper bound;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.285106

Filename

285106