Abstract
Efficient methods for determining the lower and upper bounds on the probabilities of source-to-terminal communication in a multistage interconnection network are developed. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (renormalization) are presented; both can be computed in polynomial time. These strategies can be combined with existing methods based on coherence, and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. A second efficient upper bound (averaging) is developed. An empirical evaluation of the bounds is discussed. Finally, the value of these bounding strategies in assessing the reliability of interconnection networks is examined.
Original language | English (US) |
---|---|
Pages (from-to) | 1207-1221 |
Number of pages | 15 |
Journal | IEEE Transactions on Computers |
Volume | 42 |
Issue number | 10 |
DOIs | |
State | Published - Oct 1993 |
Externally published | Yes |
Keywords
- Multistage interconnection network
- approximation strategy
- blocking probability
- channel graph
- computational method
- two-terminal reliability
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics