Reliability analysis of probabilistic networks

Description

Thesis 241 c., 2010ContentsIntroductionStructure FunctionGraphical Representation of NetworksGraph RepresentationCuts and PathsNetwork ReliabilityAnalysis of Network ReliabilityComputational ComplexitySurvey of Existing Methods to Compute Network ReliabilitySeries Systems Parallel Systems Series-Parallel and Parallel-Series Systems Non Series-Parallel SystemsComplete State EnumerationFactoring MethodMinpaths and MincutsThe Inclusion-Exclusion MethodSum of Disjoint Products MethodBoolean ExpressionNormal FormsDisjunctive Normal Form (DNF)Conjunctive Normal Form (CNF) Binary Decision DiagramsOrdered BDD (OBDD)Reduced OBDD (ROBDD)Construction of Binary Decision DiagramsHow to Represent a Graph by Means of BDDComplexityNetwork Analysis Algorithms Calculating Reliability Using BDDK-terminal Reliability by Pivotal Decomposition2-terminal Reliability via Minpath Analysis2-terminal Reliability by Graph Visiting AlgorithmsThe Italian GARR Network Reliability Analysis of the GARR NetworkNetwork Reliability of IEEE 118 Bus Test Case Probabilistic Weighted NetworksWeighted NetworksProbabilistic Weighted NetworksDistance AlgorithmFlow Algorithm Reliability Computation Service Availability of the GARR NetworkWeighted GARR Network: Bandwidth AvailabilityWeighted GARR Network: Distance AvailabilityIEEE 118 Bus Test CaseWeights as ResistancesWeights as Capacities Structure and Characterization of Complex NetworksDegree DistributionClusteringLength of the Shortest PathBetweenness CentralityComplex Network AnalysisExact algorithmsNetwork generating algorithmScalable BenchmarkRegular NetworksRandom Graphs and Scale Free NetworksSimulative Analysis of Complex Network ReliabilitySimulationReliability SimulationSystem Reliability EstimationWireless Sensor NetworksChange Probability value