An Algorithm For Approximating The Reliability of Network with Multistate Units

다중상태 유닛들의 망 신뢰도 근사 계산을 위한 알고리즘

  • 오대호 (한림정보산업대학 컴퓨터응용과) ;
  • 염준근 (동국대학교 통계학과)
  • Published : 2002.03.01

Abstract

A practical algorithm of generating most probable states in decreasing order of probability, given the probability of each unit\`s state, is suggested for approximating reliability(performability) evaluation of a network with multistate(multimode) units. Method of approximating network reliability for a given measure with most probable states is illustrated with a numerical example. The proposed method in this paper is compared with the previous method regarding memory requirement. Our method has some advantages for computation and achieves improvement with regard to memory requirement for a certain condition judging from the computation experiment.

Keywords

References

  1. V.O.K. Li and J.A. Silvester(1984), unreliable components', IEEE Transac- tions on Communications, vol. COM 32, pp.l105-1110 https://doi.org/10.1109/TCOM.1984.1095978
  2. Y.F. Lam and V.O.K. Li(1986), 'An improved algorithm for performance analysis of networks with unreliable components', IEEE Transactions on Communications, vol. C0M-34, PP. 496-497 https://doi.org/10.1109/TCOM.1986.1096560
  3. D.R. Shier(1988), 'A new algorithm for performance Analysis of communication systems', IEEE Transactions on Communications, vol. C0M-36, pp. 516-519 https://doi.org/10.1109/26.2780
  4. Shen-Neng Chiou and V.O.K. Li(1986), 'Reliability Analysis of a Communication Network with Multimode Components' ,IEEE Journal on Selected Areas in Communications, Vol. SAC-4, No. 7, pp. 1156-1161 https://doi.org/10.1109/JSAC.1986.1146426
  5. R.F. Gabler and R.J.Chen(1987), 'An Efficient Algorithm for Enumerating States of a System with Multimode Unreliable Components', U.S. Sprint Communications. Overland Park, Kansas, Technical Report
  6. E. Horowitz and S. Sahni(1976) 'Fundamentals of a Data Structure'Pitman