Logo image
A Simple Algorithm to Search for All d-MCs
Journal article

A Simple Algorithm to Search for All d-MCs

Journal of Feng Chia University Journal of Feng Chia University, Vol.38, pp.83-88
2000

Abstract

With the arrival of the information age, computer links and communication via the information superhighway have become indispensable in our daily life. Evaluation of the traffic on the superhighway has shown potential in assisting the understanding of the nature and capabilities of the net. Such an evaluatio can be utilized as an important reference in the design, operation, and planning of new systems. Reliability of a system is considered as the most important indication in the evaluation of operational efficiency in a communications network. However the process of ascertaining reliability is a very complicated and multiple NP-hard problem. In this study, all MCs is assumed to be known in advance and we focused on how to find the entire d-MCs before calculating the reliability value of a network. Just based on the definition of d-MC, we develop an intuitive algorithm which is better than the desk-known exitsing method. Analysis of our algorithm and comparison to existing algorithms shows that our proposed method is easier to understand and implement. Finally, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods.

Metrics

1 Record Views

Details

Logo image