Bilgisayar iletişim ağı güvenilirliği: İki terminal güvenilirliğinin değerlendirilmesi

Reliability of computer networks plays essential role in managing and performing almost all the sensitive applications fields. Since networks dimension is increasing continually, the problem of long execution time becomes serious issue. In order to get the desired network topology, we need to evaluate the reliability at every phase quickly. Hence, fast, accurate algorithm is highly appreciated. That's way in this work we propose an algorithm to do this task efficiently. For some network reliability parameters to be basically evaluated there are two steps have to be taken. Firstly, interpreting the network topology into a reliability formula which does not considered to be a problem, since a little time is adequate to perform. Whereas, in the second step the reliability of a network is numerically computed. The proposed algorithm is a multistage hybrid algorithm (MHRT) based on graph reduction techniques with the minimal tie- set to measure the reliability of all commodities within a network. Both directional and unidirectional links can be considered. There are no restrictions on the size or the shape of handled network. A new approach has been introduced for tracing all minimal paths. Compared with the well-known algorithms Backtracking, Edge Replacement, and Acyclic Path Mergence; it needs less memory. And comparing with Matrix Multiplication, and Node Removal; it does not require the application of Boolean algebra.