Muutke küpsiste eelistusi

Network Reliability: Measures and Evaluation [Kõva köide]

  • Formaat: Hardback, 272 pages, kõrgus x laius x paksus: 236x160x23 mm, kaal: 553 g
  • Sari: Performability Engineering Series
  • Ilmumisaeg: 22-Jul-2016
  • Kirjastus: Wiley-Scrivener
  • ISBN-10: 1119223563
  • ISBN-13: 9781119223566
Teised raamatud teemal:
Network Reliability: Measures and EvaluationSuurem pilt
  • Formaat: Hardback, 272 pages, kõrgus x laius x paksus: 236x160x23 mm, kaal: 553 g
  • Sari: Performability Engineering Series
  • Ilmumisaeg: 22-Jul-2016
  • Kirjastus: Wiley-Scrivener
  • ISBN-10: 1119223563
  • ISBN-13: 9781119223566
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781119223566.html
Märksõnad:

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.

Preface xiii
Acknowledgements xvii
1 Introduction 1(30)
1.1 Graph Theory: A Tool for Reliability Evaluation
2(5)
1.1.1 Undirected Networks
4(1)
1.1.2 Directed Networks
4(1)
1.1.3 Mixed Networks
5(2)
1.2 Large versus Complex System
7(2)
1.2.1 Large System
7(1)
1.2.2 Complex System
7(2)
1.2.3 Large and Complex System
9(1)
1.3 Network Reliability Measures: Deterministic versus Probabilistic
9(3)
1.3.1 Terminal-pair Reliability Measure
11(1)
1.3.2 All-Terminal Reliability Measure
12(1)
1.3.3 k-terminal Reliability Measure
12(1)
1.4 Common Assumptions
12(1)
1.5 Approaches for NSP Network Reliability Evaluation
13(13)
1.5.1 Non Path or Cut Sets Based Techniques
14(7)
1.5.1.1 State Enumeration Technique
14(4)
1.5.1.2 Network Decomposition Technique
18(1)
1.5.1.3 Probability Transformation Technique
19(1)
1.5.1.4 Binary Decision Diagram Based Technique
20(1)
1.5.2 Minimal POC Based Techniques
21(13)
1.5.2.1 Inclusion-Exclusion Technique
21(1)
1.5.2.2 Monte-Carlo Simulation Based Technique
22(1)
1.5.2.3 Domination Theory Based Technique
23(1)
1.5.2.4 Reliability Bounds Technique
24(1)
1.5.2.5 Sum-of-disjoint Product Based Technique
25(1)
Exercises
26(1)
References
27(4)
2 Reliability Evaluation of General SP-Networks 31(32)
2.1 Notation and Assumptions
33(1)
2.2 Unit-Reliability and Failure Models
34(2)
2.2.1 Constant-Hazard Model
35(1)
2.2.2 Linear-Hazard Model
35(1)
2.2.3 Weibull-Hazard Model
35(1)
2.2.4 Extreme Value-Hazard Model
36(1)
2.3 Module Representation of Reliability Graphs
36(8)
2.3.1 Single-Unit Module
36(1)
2.3.2 Multi-Unit Module
36(19)
2.3.2.1 Series Model
37(1)
2.3.2.2 Parallel Model
38(1)
2.3.2.3 Standby Model
39(1)
2.3.2.4 k-out-of-m Model
40(4)
2.4 Misra Matrix Method
44(1)
2.5 Algorithm
45(10)
2.6 Implementation and Documentation
55(3)
2.6.1 Main Module
55(1)
2.6.2 Function formCmat
56(2)
2.6.3 Function processCmat
58(1)
2.6.4 Function systDetail
58(1)
2.7 Remarks
58(1)
Exercises
59(1)
References
60(3)
3 Path Sets Enumeration 63(40)
3.1 Enumeration of (s, f) Connected Path Sets
64(9)
3.1.1 Method 1: Using Powers of Connection matrix
65(2)
3.1.2 Method 2: Traversing Through Connection Matrix
67(2)
3.1.3 Method 3: Using Incidence Matrix
69(4)
3.2 Enumeration of All-node Connected Path Sets: Spanning Tree
73(3)
3.2.1 Method 1: Using the Cartesian Product of the Node Cut Sets
74(1)
3.2.2 Method 2: Using the Incidence Matrix
75(1)
3.3 Number of Spanning Trees
76(10)
3.3.1 Matrix Tree Theorem
84(2)
3.4 Enumeration of k-node Connected Path Sets: k-Trees
86(2)
Appendix 3A.1: Enumeration of Path Sets Algorithm, Illustration and Matlab® Code Notation
88(9)
Appendix 3A.2: Sample program I/O for Figure 3A.1
97(3)
Exercises
100(1)
References
101(2)
4 Cut Sets Enumeration 103(30)
4.1 (s, f) Cut Sets Enumeration
104(5)
4.1.1 Method 1: Using Connection Matrix
104(2)
4.1.2 Method 2: Using Minimal Path Sets
106(3)
4.1.2.1 Using Set-theoretic Product of Path Sets
106(1)
4.1.2.2 Using Path Sets Matrix
107(1)
4.1.2.3 Using Path Sets Inversion
108(1)
4.2 Global Cut Sets Enumeration
109(14)
4.2.1 Testing Connectivity of a Specified Node Set
110(2)
4.2.1.1 Node Fusion Technique
110(2)
4.2.2 Generation of Node Set Combination from its Lower Order Node-Sets
112(1)
4.2.3 Checking Validity of a Node Set
112(1)
4.2.4 Formation of Cutset
113(1)
4.2.5 General Algorithm to Enumerate Minimal Cutsets for a Reliability Measure
113(10)
Appendix 4A.1: Node Fusion Technique and Generation of Node Set Combination
123(1)
Appendix 4A.2: Code for Checking Validity of a Node Set and Converting Node-Sets into Link Cutsets
124(2)
Appendix 4A.3: Sample Program I/O for Network Graph of Figure 4.3
126(2)
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 & Misra, 2002)
128(2)
Exercises
130(1)
References
131(2)
5 Reliability Evaluation using MVI Techniques 133(54)
5.1 Notation and Assumptions
134(1)
5.2 Preliminaries
135(2)
5.2.1 Definitions
135(2)
5.3 MVI Methods
137(10)
5.3.1 Method 1: KDH88
137(2)
5.3.2 Method 2: CAREL
139(5)
5.3.3 Comparison between KDH88 and CAREL
144(3)
5.4 Method 3: Hybrid Methods-HM
147(2)
5.4.1 An Alternative Representation of Path or Cut Sets
147(2)
5.4.2 Hybrid Methods (HM)
149(1)
5.4.2.1 HM-1
149(1)
5.4.2.2 HM-2
149(1)
5.5 Applying HM-1 and HM-2
149(10)
5.5.1 Applying HM-1
150(1)
5.5.2 Applying HM-2
151(1)
5.5.3 Complete Solution to Example 5.2
152(7)
5.6 Global and k-terminal Reliability with SDP Approach
159(10)
5.6.1 All-terminal Reliability Evaluation
161(3)
5.6.2 Characteristics of a g-reliability Expression
164(1)
5.6.3 k-terminal Reliability Evaluation
164(3)
5.6.4 Number of k-trees
167(2)
5.7 Unreliability with SDP Approach
169(2)
5.8 Some Suggested Guidelines
171(2)
Appendix 5A.1: Program Output of g-reliability Expression for the Figure 5.1(b)
173(6)
Appendix 5A.2: Program Output of k-terminal Reliability Expression for Figure 5.1(b)
179(2)
Appendix 5A.3: Program Output of k-terminal Reliability Expression for Figure 5.1(b)
181(2)
Exercises
183(2)
References
185(2)
6 Unified Framework and Capacitated Network Reliability 187(26)
6.1 The Unified Framework
188(1)
6.2 Capacitated Reliability Measure: An Introduction
189(3)
6.2.1 Some Related Definitions
191(1)
6.2.1.1 Minimal Cutset and Subset Cut Group
191(1)
6.2.1.2 External Redundant Subset Cut Group
191(1)
6.2.1.3 Internal Redundant Subset Cut Group
192(1)
6.2.1.4 Invalid Cut Set Cut Group
192(1)
6.2.1.5 Description of the Algorithm
192(1)
6.3 Algorithm Description
192(8)
6.3.1 Equations: The idea
193(1)
6.3.2 Is Cut itself a SCG or does it need its Subsets Enumeration?
194(1)
6.3.3 What Initial Order?
194(3)
6.3.4 Efficient Enumeration of Particular Order SCG of a Minimal Cut
197(1)
6.3.5 External or Both External/ Internal Redundancy Removal
197(2)
6.3.6 Internal Redundancy Removal
199(1)
6.4 The CRR Evaluation Algorithm
200(2)
6.5 A Complete Example
202(5)
6.6 Experimental Results, Comparison and Discussion
207(5)
References
212(1)
7 A LAN and Water Distribution Network Case Studies 213(10)
7.1 Case Study-I: IIT Kharagpur LAN Network
213(6)
7.1.1 k-Terminal and Global Reliability Evaluation for Hostel Area of IIT Kharagpur LAN
215(1)
7.1.2 All Terminal Reliability Evaluation for Academic Area of LAN
215(1)
7.1.3 All Terminal Reliability Evaluation for IIT Kharagpur LAN Network
215(4)
7.2 Case Study-II: Real-Type of Large Size Unsaturated Water Distribution Networks
219(3)
References
222(1)
Epilogue 223(4)
References
225(2)
Bibliography 227(8)
Index 235
Sanjay K. Chaturvedi is currently working as an Associate Professor at Reliability Engineering Centre, Indian Institute of Technology, Kharagpur (WB) India. He received his Ph D. degree from Reliability Engineering Centre, IIT Kharagpur (India) in year 2003. He holds a Bachelor's degree in electrical engineering and Master's degree in system engineering and operations research, both from Indian Institute of Technology, Roorkee. He has research interests in the areas of reliability modeling and analysis, network reliability, life-data analysis, maintenance and optimization, and has done several consultancy projects, and delivered lectures in Indian industries in these areas. He has guided several Ph.Ds. and published papers in several international journals.