Advertisement

Journal of Electronics (China)

, Volume 7, Issue 4, pp 296–305 | Cite as

State space tree method and exact decomposition algorithm for finding network overall reliability

  • Huang Ruji
Article
  • 20 Downloads

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.

Key words

Communication network Overall reliability Graph Hypergraph State space tree Exact decomposition algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. S. Wilkov,IEEE Trans. on Communication,COM-20 (1972), 660–678.CrossRefGoogle Scholar
  2. [2]
    S. Rai, Some Aspects of Reliability of Computer and Communication Networks, Ph.D. Dissertation, Kurukshetra University, India, 1979.Google Scholar
  3. [3]
    I. M. Soi, K. K. Aggarwal,Microelectron Reliab.,25 (1985), 215–222.CrossRefGoogle Scholar
  4. [5]
    S. C. Lee, Modern Switching Theory and Digital Design, Prentice-Hall Inc., Englewood Cliffs, N. J., 1978.Google Scholar
  5. [6]
    E. Horowitz, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, Maryland, 1978.MATHGoogle Scholar

Copyright information

© Science Press 1990

Authors and Affiliations

  • Huang Ruji
    • 1
  1. 1.Beijing University of Science and TechnologyBeijing

Personalised recommendations