Abstract
First, the state space tree method for finding communication network overall reliability is presented. It directly generates one disjoint tree multilevel polynomial of a network graph. Its advantages are smaller computational effort (its computing time complexity isO (en i ), wheree is the number of edges andn i is the number of leaves) and shorter resulting expression. Second, based on it an exact decomposition algorithm for finding communication network overall reliability is presented by applying the hypergraph theory. If we use it to carry out them-time decomposition of a network graph, the communication network scale which can be analyzed by a computer can be extended tom-fold.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. S. Wilkov,IEEE Trans. on Communication,COM-20 (1972), 660–678.
S. Rai, Some Aspects of Reliability of Computer and Communication Networks, Ph.D. Dissertation, Kurukshetra University, India, 1979.
I. M. Soi, K. K. Aggarwal,Microelectron Reliab.,25 (1985), 215–222.
S. C. Lee, Modern Switching Theory and Digital Design, Prentice-Hall Inc., Englewood Cliffs, N. J., 1978.
E. Horowitz, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, Maryland, 1978.
Author information
Authors and Affiliations
About this article
Cite this article
Ruji, H. State space tree method and exact decomposition algorithm for finding network overall reliability. J. of Electron.(China) 7, 296–305 (1990). https://doi.org/10.1007/BF02892752
Issue Date:
DOI: https://doi.org/10.1007/BF02892752