Accession Number : ADA188307
Title : Algebraic Methods Applied to Network Reliability Problems. Revision.
Descriptive Note : Technical rept.,
Corporate Author : CLEMSON UNIV SC DEPT OF MATHEMATICAL SCIENCES
Personal Author(s) : Shier, Douglas R ; Whited, David E
PDF Url : ADA188307
Report Date : Sep 1986
Pagination or Media Count : 21
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.
Descriptors : *ALGEBRA, *ALGORITHMS, *NETWORK ANALYSIS(MANAGEMENT), COMMUNICATIONS NETWORKS, COMPUTATIONS, FORTRAN, ITERATIONS, POLYNOMIALS, RELIABILITY, SOLUTIONS(GENERAL), TIME, PROBLEM SOLVING, GRAPHS, LABELS
Subject Categories : Operations Research
Command, Control and Communications Systems
Distribution Statement : APPROVED FOR PUBLIC RELEASE