Algebraic and Computational Aspects of Network Reliability and Problems.
Annual rept. 15 Jun 85-14 Jun 86,
CLEMSON UNIV SC
Pagination or Media Count:
It is important to be able to assess the reliability of a complex system in terms of the reliabilities of its components. This type of problem arises with increasing frequency in the analysis of telecommunication and distribution systems, which can be represented as networks. The present research employs an underlying algebraic structure to study network reliability problems and to develop new algorithms for their solution. Iterative techniques for calculating reliability both exactly and approximately have been developed for both general networks and a difficult class of specialized networks. These techniques allow the solution of fairly complex networks, ones that have previously resisted analysis. In addition, the underlying structure of network reliability problems has been approached by studying the combinatorial properties of a certain polynomial defined with respect to the underlying graph topology.
- Theoretical Mathematics
- Non-Radio Communications