Improved Lower Bounds on the Reliability of Hypercube Architectures

Document Type

Article

Publication Date

1-1-1994

Abstract

The hypercube topology, also known as the Boolean n-cube, has recently been used for multiprocessing systems. This paper considers two structural-reliability models, namely, terminal reliability (TR) and network reliability (NR), for the hypercube. Terminal (network) reliability is defined as the probability that there exists a working path connecting two (all) nodes. There are no known polynomial time algorithms for exact computation of TR or NR for the hypercube. Thus, lower-bound computation is a better alternative, because it is more efficient computationally, and the system will be at least as reliable as the bound. This paper presents algorithms to compute lower bounds on TR and NR for the hypercube considering node and/or link failures. Our algorithms provide tighter bounds for both TR and NR than known results and run in time polynomial in the cube dimension n, specifically, within time O(n2). © 1994 IEEE

Publication Source (Journal or Book title)

IEEE Transactions on Parallel and Distributed Systems

First Page

364

Last Page

378

This document is currently not available here.

Share

COinS