Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It describes, in algorithmic outlines, efficient techniques for reliability bounds and discusses the implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are strongly supported by sound theoretical development.
Features include:
-Treatment of three central problems: all-terminal reliability, two-terminal reliability, and reliability of interconnection networks
-Unique coverage of symbolic algebra environment for reliability computations
-Extensive discussion of implementation issues
-Techniques described in algorithmic outline
-Never-before-published results of computational experiments
