Network Reliability: Experiments with a Symbolic Algebra Environment

Network Reliability: Experiments with a Symbolic Algebra Environment

by Daryl D Harms, Charles J. Colbourn, Miroslav Kraetzl, Stanley J. Devitt
     
 

ISBN-10: 0849339804

ISBN-13: 9780849339806

Pub. Date: 06/16/1995

Publisher: Taylor & Francis

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

Overview

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.

Product Details

ISBN-13:
9780849339806
Publisher:
Taylor & Francis
Publication date:
06/16/1995
Series:
Discrete Mathematics and Its Applications Series, #1
Edition description:
New Edition
Pages:
240
Product dimensions:
7.20(w) x 10.20(h) x 0.70(d)

Table of Contents

BLOCKING PROPERTIES OF CHANNEL GRAPHS
Introduction for Channel Graphs
Motivation
Summary and Overview
Background for Channel Graphs
Channel Graphs
Optimal Channel Graphs
Reliability Polynomial and Kruskal-Katona Bounds
Consecutive Minimal Cutsets
The Esary-Proschan Upper Bound
Reachability
Monte Carlo Methods
Transformations on Channel Graphs
The Swap Transformation
An Application to Takagi's and Chung and Hwang's Result
Insplit and Outsplit Transformation
Renormalization
Threshold Channel Graphs
Shifting for Threshold Channel Graphs
Least Reliable Threshold Channel Graph
Most Reliable Threshold Channel Graph
Shifting in Many Stages and a Lower Bound
Different Operational Probabilities
The Averaging Transformation
Subgraph Counting Bounds
Improving the Kruskal-Katona Bounds
Lower Bounds on the Coefficients
Upper Bounds on the Coefficients
Test Results
An Empirical Evaluation
Interconnection Networks
Conclusions for Channel Graphs
Summary of Contributions
Directions for Future Work
A SYSTEM FOR TWO-TERMINAL RELIABILITY
Introduction for Two-Terminal Reliability
Overview of the Part
Two-Terminal Reliability
Network Model Graph Theoretic Definitions
Existing Connectivity Algorithms
Performability
New or Improved Methods
The Renormalization Method
Coefficient-Wise Bounds
Consecutive Cuts Orderings
Hybrid Methods for Performability
The System Developed
Requirements
Development Decisions
Pre-Existing System
New Development
Development Experience
Using the Package as a Research Tool
Test Results
Test Network Topologies
Performance of Upper Bounding Methods
Performance of the Lower Bounding Methods
Conclusions for Two-Terminal Reliability
Summary
Current (Ongoing) Research and System Development
Future of the System
APPENDICES
Interactive Session Using the System
Using the Networks Package
Using the Reliability Package
Using the Channel Package
Performance of the Connectivity Bounds
Absolute Performance Versus Exact Values
Relative Performance of Upper Bounds
Interpolating Reliability Polynomials
Bibliography

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >