Algebraic and Computational Aspects of Network Reliability Problems

Abstract

This research has advanced both theoretical and computational aspects of evaluating the reliability of a complex system in terms of its structure and the reliability of its components. This type of problem arises in particular in the design and evaluation of telecommunication and distribution systems, which are commonly modelled as networks. The present research employs an algebraic approach for studying the reliability of such network systems. This approach has not only unified certain theoretical aspects of network reliability problems but has always suggested a number of new algorithms for calculating various reliability measures. Based on this approach, both exact and approximate computational schemes have been developed, together with supporting data structures for implementing the necessary computations in efficient manner. Approximation schemes, also based on an underlying algebraic structure, have also been developed for evaluating more general measures of system performance such as average delay or throughput.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 13, 1988
Accession Number
ADA204639

Entities

People

  • James P. Jarvis

Organizations

  • Clemson University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Classification
  • Communication Systems
  • Complex Systems
  • Computational Complexity
  • Computations
  • Computer Science
  • Graph Theory
  • Mathematics
  • North Carolina
  • Operations Research
  • Polynomials
  • Probability
  • Reliability
  • Security
  • Universities

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Statistical inference.
  • Systems Analysis and Design