Reliability and Survivability of Communication Networks.

Abstract

We assume that we have an (n,m)-graph with n vertices and m edges, representing a communications network with each vertex representing a processor and each edge a communications link. We have begun our work by concentrating on the cutting number/pair-connected reliability measure and have initially assumed that each vertex will always remain operable and that each edge has the same probability of failure q. Thus, p=1-q is the probability that any given edge is operable. A standard measure of system reliability is the probability that the graph remains connected. This is denoted by P(G;q), and the probability that a specified pair s and t of vertices is connected is denoted by Ps,t(G;q). The cutting number/pair-connected measure refines the connectivity reliability measure by considering the varying effects of different cutsets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1987
Accession Number
ADA186248

Entities

People

  • Ashok T. Amin
  • Kyle T. Siegrist
  • Peter J. Slater

Organizations

  • University of Alabama in Huntsville

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computations
  • Computer Networks
  • Contracts
  • Graph Theory
  • Mathematics
  • Military Research
  • Networks
  • Normal Distribution
  • Probability
  • Random Variables
  • Reliability
  • Sequences
  • Simulations
  • Standards

Readers

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