Algebraic And Computational Aspects Of Network Reliability Problems
Download Algebraic And Computational Aspects Of Network Reliability Problems PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Algebraic And Computational Aspects Of Network Reliability Problems book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Algebraic and Computational Aspects of Network Reliability Problems
This research has advanced both theoretical and computational aspects of evaluating the reliability of a complex system in terms of its structure and the reliability of its components. This type of problem arises in particular in the design and evaluation of telecommunication and distribution systems, which are commonly modelled as networks. The present research employs an algebraic approach for studying the reliability of such network systems. This approach has not only unified certain theoretical aspects of network reliability problems but has always suggested a number of new algorithms for calculating various reliability measures. Based on this approach, both exact and approximate computational schemes have been developed, together with supporting data structures for implementing the necessary computations in efficient manner. Approximation schemes, also based on an underlying algebraic structure, have also been developed for evaluating more general measures of system performance such as average delay or throughput. (kr).
Algebraic and Computational Aspects of Network Reliability and Problems
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.