상태 발생확률 순서에 의한 네트워크 성능 분석 방법 연구

The traditional methods of evaluating the performance of a network by enumerating all possible states may quickly become computationally prohibitive, since the number of states grows exponentially as the number of components increases. In such cases, enumerating only the most probable states would provide a good approximation. In this paper, we propose a method which efficiently generates upper and lower bounds for coherent performance measures utilizing the most probable states. Compared with Yang and Kubat's method, our procedure significantly reduces the complexity and memory requirement per iteration for computing the bounds and thereby, achieves the given degree of accuracy or the coverage within a shorter time.