NLU Meghalaya Library

Online Public Access Catalogue (OPAC)

Amazon cover image
Image from Amazon.com

Network reliability : measures and evaluation / Sanjay K. Chaturvedi.

By: Material type: TextSeries: Performability engineering seriesPublisher: Hoboken, New Jersey : John Wiley & Sons ; Salem, Massachusetts : Scrivener Publishing, 2016Description: 1 online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781119224013
  • 1119224012
  • 9781119224037
  • 1119224039
Subject(s): Additional physical formats: Print version:: Network reliabilityDDC classification:
  • 004.6 23
LOC classification:
  • TK5105.5956
Online resources:
Contents:
Reliability Evaluation of General SP Networks -- Path Sets Enumeration -- Cut Sets Enumeration -- Reliability Evaluation using MVI Techniques -- Unified Framework and Capacitated Network Reliability -- A LAN and Water Distribution Network: Case Studies
Summary: In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab� source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes index.

Description based on print version record and CIP data provided by publisher; resource not viewed.

In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in the form of a probabilistic graph. Among the several approaches of network reliability evaluation, the multiple-variable-inversion sum-of-disjoint product approach finds a well-deserved niche as it provides the reliability or unreliability expression in a most efficient and compact manner. However, it does require an efficiently enumerated minimal inputs (minimal path, spanning tree, minimal k-trees, minimal cut, minimal global-cut, minimal k-cut) depending on the desired reliability. The present book covers these two aspects in detail through the descriptions of several algorithms devised by the 'reliability fraternity' and explained through solved examples to obtain and evaluate 2-terminal, k-terminal and all-terminal network reliability/unreliability measures and could be its USP. The accompanying web-based supplementary information containing modifiable Matlab� source code for the algorithms is another feature of this book. A very concerted effort has been made to keep the book ideally suitable for first course or even for a novice stepping into the area of network reliability. The mathematical treatment is kept as minimal as possible with an assumption on the readers' side that they have basic knowledge in graph theory, probabilities laws, Boolean laws and set theory.

Reliability Evaluation of General SP Networks -- Path Sets Enumeration -- Cut Sets Enumeration -- Reliability Evaluation using MVI Techniques -- Unified Framework and Capacitated Network Reliability -- A LAN and Water Distribution Network: Case Studies

John Wiley and Sons Wiley Online Library: Complete oBooks

There are no comments on this title.

to post a comment.