Algebraic Methods Applied to Network Reliability Problems. Revision.

Abstract

An algebraic structure underlying communications network reliability problems is presented for determining the 2-terminal reliability of directed networks. An iterative algorithm is derived from this algebraic perspective to solve the (s,j)-terminal reliability problem simultaneously for all nodes j. In addition to providing an exact answer (in the form of a reliability polynomial), the algorithm also yields a nondecreasing sequence of approximate solutions guaranteed to be lower bounds on the exact solution. Empirical results, presented for two different implementations of the algorithm, show that useful approximate solutions can be obtained in a reasonable amount of computation time. Keywords: Fortran; Computations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1986
Accession Number
ADA188307

Entities

People

  • David E. Whited
  • Douglas R. Shier

Organizations

  • Clemson University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Communication Systems
  • Computations
  • Equations
  • Iterations
  • Network Topology
  • Operations Research
  • Polynomials
  • Probability
  • Procurement
  • Reliability
  • Scientific Research
  • Security
  • Sequences
  • Terminals
  • United States Government

Fields of Study

  • Engineering

Readers

  • Calculus or Mathematical Analysis
  • Neural Network Machine Learning.
  • Statistical inference.