链路失效情况下网络点对联通可靠度的近似计算

Link failure cases network poins of unicom approximate calculation of reliability

基于连通性的网络可靠性分析是网络可靠性研究中的经典问题,根据具体问题的不同而采用的最小枚举、最小生成树枚举、边割集枚举、容斥原理、不交和方法等都是随机性网络可靠性指标的精确计算方法.这些计算方法在网络可靠性分析研究中具有重要的作用和意义,它们构成了网络可靠性分析计算的重要理论依据.然而对任意网络的k终端可靠度、全终端可靠度以及剩余边连通可靠度和点对联通可靠度,都已经证明他们的精确计算属于NP-hard问题[1][10].因此网络可靠性的估计是获得以上可靠性测度的重要手段.同时在网络的拓扑优化设计中,追求高可靠性的代价就是费用的无限增加,因此在一般商用的设计中,网络可靠性测度只要满足给定的标准即可,需要对不同的网络拓扑估计有关的可靠性值.

Based on the connectivity of network reliability analysis, which is a classic problem in the study of network reliability, depending on the specific issues and using the smallest enumeration, minimum spanning tree enumeration, edge cut set enumeration, principle of a class, don＇t pay, and methods and so on all is the accurate calculation method of random network reliability index. These calculation methods in the study of network reliability analysis have important function and meaning, they constitute the important theory basis for network reliability analysis and calculation. However for any network of k terminal reliability, all terminal reliability and remaining edge connectivity reliability, reliability and point to unite has proved their accurate calculation is NP-hard problem [1] [10]. So the network reliability estimates is important means to obtain the above reliability measure. At the same time in the network topology optimization design, the pursuit of high reliability,the cost is the cost of unlimited increase, so in the design of general commercial, as long as can satisfy the criteria for a given network reliability measures, to different network topology estimation about the reliability of the value.