计算机应用研究
計算機應用研究
계산궤응용연구
Application Research of Computers
2015年
11期
3315-3318
,共4页
网络连通性%有向无环网络%可靠性%SCM%“与”合并运算%“或”合并运算
網絡連通性%有嚮無環網絡%可靠性%SCM%“與”閤併運算%“或”閤併運算
망락련통성%유향무배망락%가고성%SCM%“여”합병운산%“혹”합병운산
network connectivity%directed acyclic network%reliability%SCM%intersection compounding%union compounding
诸如交通网络、供水网络、电信网络、燃气网络等在人们的生活中极其重要，但是这些网络容易受到自然和人为等因素的影响导致失效，进而降低其连通性。为研究其连通性问题，改进 SCM（sequential compounding method）实现了考虑点和线可靠性的有向无环网络连通性的计算方法。该算法是一种快速可靠性评价算法，其结果是近似的，适用于分析可分解为点—线—点结构的网络，特别适用于有一定统计规律的网络。算法主要由两种运算组成，即“与”合并和“或”合并，通过这两种运算将网络化简直到合并为一个点为止。计算八种典型的网络，并将结果与文献和 MCS（Monte Carlo simulations）比较，结果表明，提出的算法与 MCS 相比计算得到的连通性略有不同，误差在－6．2％～4．6％；但是计算时间差别很大，大约是 MCS 的1．2％～9．2％。
諸如交通網絡、供水網絡、電信網絡、燃氣網絡等在人們的生活中極其重要，但是這些網絡容易受到自然和人為等因素的影響導緻失效，進而降低其連通性。為研究其連通性問題，改進 SCM（sequential compounding method）實現瞭攷慮點和線可靠性的有嚮無環網絡連通性的計算方法。該算法是一種快速可靠性評價算法，其結果是近似的，適用于分析可分解為點—線—點結構的網絡，特彆適用于有一定統計規律的網絡。算法主要由兩種運算組成，即“與”閤併和“或”閤併，通過這兩種運算將網絡化簡直到閤併為一箇點為止。計算八種典型的網絡，併將結果與文獻和 MCS（Monte Carlo simulations）比較，結果錶明，提齣的算法與 MCS 相比計算得到的連通性略有不同，誤差在－6．2％～4．6％；但是計算時間差彆很大，大約是 MCS 的1．2％～9．2％。
제여교통망락、공수망락、전신망락、연기망락등재인문적생활중겁기중요，단시저사망락용역수도자연화인위등인소적영향도치실효，진이강저기련통성。위연구기련통성문제，개진 SCM（sequential compounding method）실현료고필점화선가고성적유향무배망락련통성적계산방법。해산법시일충쾌속가고성평개산법，기결과시근사적，괄용우분석가분해위점—선—점결구적망락，특별괄용우유일정통계규률적망락。산법주요유량충운산조성，즉“여”합병화“혹”합병，통과저량충운산장망락화간직도합병위일개점위지。계산팔충전형적망락，병장결과여문헌화 MCS（Monte Carlo simulations）비교，결과표명，제출적산법여 MCS 상비계산득도적련통성략유불동，오차재－6．2％～4．6％；단시계산시간차별흔대，대약시 MCS 적1．2％～9．2％。
Such as the transportation network,water supply network,telecommunications network and gas networks was ex-tremely important in our life,but these networks were vulnerable to the influence of natural and man-made factors lead to the failure,and reduced its connectivity.For the study of the connectivity problem,based on sequential compounding method, this paper achieved the calculation method considering the reliability of node and line of directed acyclic network connectivity. The algorithm was a fast reliability evaluation algorithm,the result was similar,and it was suitable for the analysis the network that could be decomposed into node-line-node,especially the networks had certain statistical regularity.Algorithm mainly con-sists of two kinds of compounding operation “intersection”and “union”,through these two kinds of operation network was to compound into a single point.Calculation of 8 kinds of typical network,and compared the results with the literature and the MCS,the results show that the proposed algorithm is compared with the MCS calculated connectivity is slightly different,error in 6.2% ~4.6%.But calculating time difference is very big,is about 1.2% ~9.2% of the MCS.
