Polygon-to-Chain Reductions and Extensions for Reliability Evaluation of Undirected Networks.

Abstract

Analysis of network reliability is important in computer, communication, power and various other networks. Components of a particular network may be subject to random failure and the network may or may not continue to function after some of its components have failed. We wish, as efficiently as possible, to determine the probability that the network is functional. The purpose of this thesis is to develop new reduction techniques for computing network reliability and to show how computational complexity can be decreased by using these techniques. The network model which is used to this work may be thought of as a communication network with duplex communication links connecting various transceiving stations. Communication can pass in both directions along a link if the link is working; no communication in either direction is possible if the link has failed. The network is considered functional if a specified set of the transceiving stations is able to communicate. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1982
Accession Number
ADA124145

Entities

People

  • R. Kevin Wood

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Artificial Intelligence
  • Computational Complexity
  • Computations
  • Computer Networks
  • Computer Science
  • Computers
  • Failed States
  • Graph Theory
  • Multiplication Factor
  • Operations Research
  • Polynomials
  • Probability
  • Reliability
  • Scientific Research
  • Standards

Fields of Study

  • Computer science
  • Engineering

Readers

  • Graph Algorithms and Convex Optimization.
  • Software Engineering
  • Tactical Satellite Communications Systems Engineering.