Accession Number : ADA186248
Title : Reliability and Survivability of Communication Networks.
Descriptive Note : Annual rept.,
Corporate Author : ALABAMA UNIV IN HUNTSVILLE
Personal Author(s) : Slater, Peter J ; Amin, Ashok T ; Siegrist, Kyle T
PDF Url : ADA186248
Report Date : Aug 1987
Pagination or Media Count : 6
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.
Descriptors : *COMMUNICATIONS NETWORKS, *RELIABILITY, EDGES, FAILURE, GRAPHS, PROBABILITY
Subject Categories : Command, Control and Communications Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE