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/pairconnected 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=1q 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/pairconnected measure refines the connectivity reliability measure by considering the varying effects of different cutsets.
 Publication:

Alabama Univ., Huntsville Report
 Pub Date:
 August 1987
 Bibcode:
 1987alab.rept.....S
 Keywords:

 Communication Networks;
 Probability Theory;
 Reliability;
 Edges;
 Failure;
 Graphs (Charts);
 Polynomials;
 Communications and Radar