Charles J. Colbourn

Miroslav Kraetzl

Daryl D Harms

Stanley J. Devitt

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.

Experiments with a Symbolic Algebra Environment

Network Reliability

D. Frank Hsu

Miltos D. Grammatikakis

This introduction to networking large scale parallel computer systems acts as a primary resource for a wide readership, including network systems engineers, electronics engineers, systems designers, computer scientists involved in systems design and implementation of parallel algorithms development, graduate students in systems architecture, design, or engineering.

Miroslav Kraetzl

About

Books

Join the club