Network reliability : measures and evaluation

Network reliability measures and evaluation

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 reliab...

Descripción completa

Detalles Bibliográficos
Otros Autores: Chaturvedi, Sanjay K., author (author)
Formato: Libro electrónico
Idioma:Inglés
Publicado: Salem, Massachusetts : Hoboken, New Jersey : Scrivener Publishing 2016.
Edición:First edition
Colección:Performability engineering series.
Materias:
Computer networks > Reliability.
Computer networks > Mathematical models.
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009631488406719
Tabla de Contenidos:
  • Cover
  • Title Page
  • Copyright
  • Dedication
  • Contents
  • Preface
  • Acknowledgements
  • 1 Introduction
  • 1.1 Graph Theory: A Tool for Reliability Evaluation
  • 1.1.1 Undirected Networks
  • 1.1.2 Directed Networks
  • 1.1.3 Mixed Networks
  • 1.2 Large versus Complex System
  • 1.2.1 Large System
  • 1.2.2 Complex System
  • 1.2.3 Large and Complex System
  • 1.3 Network Reliability Measures: Deterministic versus Probabilistic
  • 1.3.1 Terminal-pair Reliability Measure
  • 1.3.2 All-Terminal Reliability Measure
  • 1.3.3 k-terminal Reliability Measure
  • 1.4 Common Assumptions
  • 1.5 Approaches for NSP Network Reliability Evaluation
  • 1.5.1 Non Path or Cut Sets Based Techniques
  • 1.5.1.1 State Enumeration Technique
  • 1.5.1.2 Network Decomposition Technique
  • 1.5.1.3 Probability Transformation Technique
  • 1.5.1.4 Binary Decision Diagram Based Technique
  • 1.5.2 Minimal POC Based Techniques
  • 1.5.2.1 Inclusion-Exclusion Technique
  • 1.5.2.2 Monte-Carlo Simulation Based Technique
  • 1.5.2.3 Domination Theory Based Technique
  • 1.5.2.4 Reliability Bounds Technique
  • 1.5.2.5 Sum-of-disjoint Product Based Technique
  • Exercises
  • References
  • 2 Reliability Evaluation of General SP-Networks
  • 2.1 Notation and Assumptions
  • 2.2 Unit-Reliability and Failure Models
  • 2.2.1 Constant-Hazard Model
  • 2.2.2 Linear-Hazard Model
  • 2.2.3 Weibull-Hazard Model
  • 2.2.4 Extreme Value-Hazard Model
  • 2.3 Module Representation of Reliability Graphs
  • 2.3.1 Single-Unit Module
  • 2.3.2 Multi-Unit Module
  • 2.3.2.1 Series Model
  • 2.3.2.2 Parallel Model
  • 2.3.2.3 Standby Model
  • 2.3.2.4 k-out-of-m Model
  • 2.4 Misra Matrix Method
  • 2.5 Algorithm
  • 2.6 Implementation and Documentation
  • 2.6.1 Main Module
  • 2.6.2 Function formCmat
  • 2.6.3 Function processCmat
  • 2.6.4 Function systDetail
  • 2.7 Remarks
  • Exercises
  • References
  • 3 Path Sets Enumeration.
  • 3.1 Enumeration of (s, f) Connected Path Sets
  • 3.1.1 Method 1: Using Powers of Connection matrix
  • 3.1.2 Method 2: Traversing Through Connection Matrix
  • 3.1.3 Method 3: Using Incidence Matrix
  • 3.2 Enumeration of All-node Connected Path Sets: Spanning Tree
  • 3.2.1 Method 1: Using the Cartesian Product of the Node Cut Sets
  • 3.2.2 Method 2: Using the Incidence Matrix
  • 3.3 Number of Spanning Trees
  • 3.3.1 Matrix Tree Theorem
  • 3.4 Enumeration of k-node Connected Path Sets: k-Trees
  • Appendix 3A.1: Enumeration of Path Sets Algorithm, Illustration and Matlab® Code Notation
  • Appendix 3A.2: Sample program I/O for Figure 3A.1
  • Exercises
  • References
  • 4 Cut Sets Enumeration
  • 4.1 (s, f) Cut Sets Enumeration
  • 4.1.1 Method 1: Using Connection Matrix
  • 4.1.2 Method 2: Using Minimal Path Sets
  • 4.1.2.1 Using Set-theoretic Product of Path Sets
  • 4.1.2.2 Using Path Sets Matrix
  • 4.1.2.3 Using Path Sets Inversion
  • 4.2 Global Cut Sets Enumeration
  • 4.2.1 Testing Connectivity of a Specified Node Set
  • 4.2.1.1 Node Fusion Technique
  • 4.2.2 Generation of Node Set Combination from its Lower Order Node-Sets
  • 4.2.3 Checking Validity of a Node Set
  • 4.2.4 Formation of Cutset
  • 4.2.5 General Algorithm to Enumerate Minimal Cutsets for a Reliability Measure
  • Appendix 4A.1: Node Fusion Technique and Generation of Node Set Combination
  • Appendix 4A.2: Code for Checking Validity of a Node Set and Converting Node-Sets into Link Cutsets
  • Appendix 4A.3: Sample Program I/O for Network Graph of Figure 4.3
  • Appendix 4A.4: g-Terminal Reliability Evaluation Program Sample I/O for Example of Figure 4.3 and Results Provided by the Program (Output of g-reliability Expression for the Figure 4.3 for Method HM-1 of (Chaturvedi &amp
  • Misra, 2002)
  • Exercises
  • References
  • 5 Reliability Evaluation using MVI Techniques.
  • 5.1 Notation and Assumptions
  • 5.2 Preliminaries
  • 5.2.1 Definitions
  • 5.3 MVI Methods
  • 5.3.1 Method 1: KDH88
  • 5.3.2 Method 2: CAREL
  • 5.3.3 Comparison between KDH88 and CAREL
  • 5.4 Method 3: Hybrid Methods-HM
  • 5.4.1 An Alternative Representation of Path or Cut Sets
  • 5.4.2 Hybrid Methods (HM)
  • 5.4.2.1 HM-1
  • 5.4.2.2 HM-2
  • 5.5 Applying HM-1 and HM-2
  • 5.5.1 Applying HM-1
  • 5.5.2 Applying HM-2
  • 5.5.3 Complete Solution to Example 5.2
  • 5.6 Global and k-terminal Reliability with SDP Approach
  • 5.6.1 All-terminal Reliability Evaluation
  • 5.6.2 Characteristics of a g-reliability Expression
  • 5.6.3 k-terminal Reliability Evaluation
  • 5.6.4 Number of k-trees
  • 5.7 Unreliability with SDP Approach
  • 5.8 Some Suggested Guidelines
  • Appendix 5A.1: Program Output of g-reliability Expression for the Figure 5.1(b)
  • Appendix 5A.2: Program Output of k-terminal Reliability Expression for Figure 5.1(b)
  • Appendix 5A.3: Program Output of k-terminal Reliability Expression for Figure 5.1(b)
  • Exercises
  • References
  • 6 Unified Framework and Capacitated Network Reliability
  • 6.1 The Unified Framework
  • 6.2 Capacitated Reliability Measure: An Introduction
  • 6.2.1 Some Related Definitions
  • 6.2.1.1 Minimal Cutset and Subset Cut Group
  • 6.2.1.2 External Redundant Subset Cut Group
  • 6.2.1.3 Internal Redundant Subset Cut Group
  • 6.2.1.4 Invalid Cut Set Cut Group
  • 6.2.1.5 Description of the Algorithm
  • 6.3 Algorithm Description
  • 6.3.1 Equations: The idea
  • 6.3.2 Is Cut itself a SCG or does it need its Subsets Enumeration?
  • 6.3.3 What Initial Order?
  • 6.3.4 Efficient Enumeration of Particular Order SCG of a Minimal Cut
  • 6.3.5 External or Both External/ Internal Redundancy Removal
  • 6.3.6 Internal Redundancy Removal
  • 6.4 The CRR Evaluation Algorithm
  • 6.5 A Complete Example.
  • 6.6 Experimental Results, Comparison and Discussion
  • References
  • 7 A LAN and Water Distribution Network: Case Studies
  • 7.1 Case Study-I: IIT Kharagpur LAN Network
  • 7.1.1 k-Terminal and Global Reliability Evaluation for Hostel Area of IIT Kharagpur LAN
  • 7.1.2 All Terminal Reliability Evaluation for Academic Area of LAN
  • 7.1.3 All Terminal Reliability Evaluation for IIT Kharagpur LAN Network
  • 7.2 Case Study-II: Real-Type of Large Size Unsaturated Water Distribution Networks
  • References
  • Epilogue
  • References
  • Bibliography
  • Index
  • EULA.

Ejemplares similares