Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Network reliability and algebraic structures
Shier D., Clarendon Press, New York, NY, 1991. Type: Book (9780198533863)
Date Reviewed: Sep 1 1992

Theoretical and practical results in the application of algebraic structures to network reliability analysis are presented briefly. The first chapter is a quick introduction to a variety of models (deterministic and probabilistic) and performance measures for assessing the reliability of networks. In the second chapter, for a particular model (directed network, two-terminal reliability measure R st ( G ) ), various approaches are presented for calculating network reliability (state-space enumeration, inclusion-exclusion, disjoint products, and factoring), and computational aspects are mentioned.

The third chapter develops an algebraic structure that forms a distribution lattice and is appropriate to calculate the two-terminal reliability polynomial R st ( x ). Shier also presents the list-directed iterative algorithm and the first test network due to Satyanarayana and Prabhakar.

The fourth chapter is dedicated to the approximation of network reliability. It gives methods for bounding the two-terminal reliability of a network (lower and upper bounds and algebraic bounds). The fifth chapter presents various algebraic methods for enumerating the s-t path (depth-first search DFS(i), DFSALL(i), and Gauss-Jordan), or the s-t cutsets in a directed network.

The sixth chapter introduces the concept of an underlying semilattice, which permits the development of a pseudopolynomial recursive algorithm for calculating reliability, and presents the technique of Möbius inversion. The seventh chapter is dedicated to the reliability covering problems and provides algorithms for undirected and directed trees that are polynomially solvable. The eighth chapter investigates the state-space enumeration method based on an algebraic structure, a distributive lattice, for generating the states of a binary system, in order of nonincreasing probability, and the state-space approximation approach for multistate systems.

Every chapter has illustrative examples, and the mathematical background is minimal, so the book can be used by everyone interested in network reliability. The presentation is coherent. The book may be too short, but the bibliographical references are fine and the index is suitable.

Reviewer:  Florin Popentiu-Vladicescu Review #: CR115782
Bookmark and Share
 
Reliability, Availability, And Serviceability (C.4 ... )
 
 
Network Problems (G.2.2 ... )
 
 
Network Architecture And Design (C.2.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Reliability, Availability, And Serviceability": Date
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider F. ACM Computing Surveys 22(4): 299-319, 2001. Type: Article
Jul 1 1992
On building systems that will fail
Corbató F. Communications of the ACM 34(9): 72-81, 1991. Type: Article
Sep 1 1992
A fault-tolerant multi-transputer system for space applications
Castro H., Gough M. Microprocessors & Microsystems 15(7): 361-367, 1991. Type: Article
Apr 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy