Spanning tree approach in all-terminal network reliability expansion

A method is presented to maximize the reliability improvement of a communication network through a new edge addition between an existing node pair of the network. The method does not require the numerical reliability functions for determining such a node pair. The node pairs are compared by the number of spanning trees generated as a result of the connection of an additional link, and then the node pair connection, which results in generating the largest number of spanning trees, is determined. The counting process for the number of spanning trees of the expanded network is based on the degree matrix (DM) of the network.

[1]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[2]  V.V.B. Rao,et al.  Most-vital edge of a graph with respect to spanning trees , 1998 .

[3]  Avinash Agrawal,et al.  A Survey of Network Reliability and Domination Theory , 1984, Oper. Res..

[4]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[5]  K. K. Aggarwal,et al.  Reliability allocation in a general system with non-identical components—A practical approach , 1993 .

[6]  L. Page,et al.  Reliability polynomials and link importance in networks , 1994 .

[7]  S. Rai,et al.  An Efficient Method for Reliability Evaluation of a General Network , 1978, IEEE Transactions on Reliability.

[8]  Krishna Gopal,et al.  On Network Augmentation , 1986, IEEE Transactions on Reliability.

[9]  K. K. Aggarwal,et al.  Topological layout of links for optimizing the s-t reliability in a computer communication system , 1982 .

[10]  S. Jain,et al.  An efficient algorithm for computing global reliability of a network , 1988 .

[11]  J.M. Kontoleon.  Reliability Improvement of Multiterminal Networks , 1980, IEEE Transactions on Reliability.

[12]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[13]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[14]  K. K. Aggarwal,et al.  Nework topology for maximizing the terminal reliability in a Computer Communication Network , 1984 .

[15]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[16]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .