基于离散概率模型的二端网络可靠性分析
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
在经济生活日益依赖于通信网的今天,网络故障不仅会带来巨大的数据损失,甚至会导致灾难性后果。利用网络可靠性分析,工程人员可以增强网络可靠性,减少故障时损失。尽管网络可靠性分析已经取得了大量成果,但如下方面还需要开展进一步研究:
     第一,网络结点不可靠时的可靠性分析。传统的网络可靠性分析通常假设结点可靠,这在一些新的网络研究领域是不成立的,譬如自组织网络、灾难环境网络。而且,当网络结点众多时,可靠性分析中的计算量将变得非常庞大。
     第二,网络部件故障非统计独立时的可靠性分析。传统的网络可靠性分析通常假设部件故障统计独立,这会给某些网络的可靠度评估带来很大的偏差,譬如极端环境下的网络。另外,当非统计独立故障较多且网络规模较大时,可靠性分析将变得非常困难。
     第三,网络部件重要性分析。传统的网络可靠性分析主要讨论可靠度计算,不能从部件故障角度全面了解网络可靠性,缺乏高效的计算方法。
     第四,网络运行时可靠性分析。传统的网络可靠性分析主要研究可靠性设计指标,其成果不能很好地反映运行时的网络可靠性。
     通信网有着庞大的规模和动态复杂性,经典的故障分布函数很难描述网络的故障特性。为降低复杂性,解决一般性问题,本文采用了主流的网络可靠性模型——时间独立的离散概率模型。另外,本文只讨论了二端网络的可靠性问题,但其成果可以推广到K端网络和全端网络。
     针对网络可靠性分析中存在的上述问题,本文从四个方面开展了研究工作:
     (1)研究了结点不可靠网络的可靠性分析,提出了基于标记因子划分的网络可靠度评估算法——MFP(Marked Factor Partition)和基于特征识别的street网络可靠度评估算法——SNR(Street Network Reliability),解决了部分规模较大而结点不可靠的网络可靠度评估问题。最后,针对无线传感网的众多不可靠结点,提出了能有效评估可靠度的算法——EF(EnhancedFactoring)。
     1)MFP改进了基于有序二叉判定图(OBDD,Ordered Binary DecisionDiagram)的可靠性分析方法。在创建OBDD过程中,利用边替代(ER,EdgeReplacement)运算处理网络中的不可靠结点。同时,从两个方面减少了计算量:分解网络时,根据子网的标记因子划分来识别同构子网,避免分解同构子网带来的重复计算;利用OBDD来存储网络结点和边的状态,减少了冗余状态。
     2)SNR是专门针对street网络的方法,其基本原理与MFP相同。SNR利用源端位置信息作为子网特征,识别street网络分解过程中出现的同构子网,从而减少重复计算。
     3)增强因子分解算法在网络分解过程中采用hash表来存储同构子网的可靠度,提高了计算效率。
     (2)研究了一类常见的非统计独立故障——共因失效,提出了分析共因失效网络可靠性的算法——CNR(Common-cause-failure NetworkReliability)和无线传感网可靠性的算法——WR(Wireless-sensor-networksReliability)。解决了部分共因事件较多且规模较大网络的可靠度评估问题,讨论了有共因失效的无线传感网可靠度评估问题。
     1)CNR改进了基于OBDD的共因失效可靠性分析方法。为降低分析复杂性,CNR算法未考虑结点不可靠的情况。由于CNR方法只需要递归创建一个OBDD结构,在共因事件较多、网络规模较大时,这种方法可节省大量计算开销。关于如何创建共因失效网络的OBDD,本文又提出了两种方法:基于布尔运算的方法和基于共因变量集的方法。第一种方式比较灵活,第二种方式有较高的存储效率。
     2)WR算法充分考虑了无线传感网中的大量共因事件和不可靠结点,借用了CNR创建共因失效网络OBDD的思路,利用结点扩张法来处理无线传感网中的不可靠结点。
     (3)研究了网络部件重要性分析。讨论利用Birnbaum测度、关键重要度和风险增长区间等部件重要性指标来描述网络可靠性,提出了基于Birnbaum测度的链路重要性评估算法——BIL(Birnbaum Importance ofLink)和基于风险增长区间的网络可靠性评估算法——RI(Risk Increment)。BIL充分利用OBDD结构来高效计算Birnbaum测度、关键重要度和风险增长,发现网络薄弱环节,确定引发故障的最可能部件。而RI能够对部件故障时的网络稳定度进行分析,为网路抗毁性提供了又一个参考指标。另外,针对无线传感网中不可靠结点,提出了基于风险增长的结点重要性评估算法——WNI(Wireless Node Importance)。
     (4)针对网络运行时可靠性分析,提出了两个可靠性测度:基于故障检测的指标——容错MPLS网络的可靠性测度;基于可用带宽测量的指标——自愈IP网络可靠性测度。最后,为分析容错MPLS网络运行时可靠性,设计并实现了一个开销较低速度较快的故障检测方法——自适应的LSP故障检测机制。
As the economy society depends on communication networks more and more, the network failures will bring about a great data loss or even disaster. With the network reliability analysis, the engineers can enhance the network reliability and reduce the loss when the failures take place. Although the network reliability analysis has been discussed widely, some works need to be furthered:
     Firstly, the reliability analysis of network with imperfect nodes. The traditional assumption of perfect nodes is inappropriate for new fields such as ad hoc networks and some networks in disaster environment. Furthermore, the number of reliability computations will largely expand when there are many imperfect nodes.
     Secondly, the reliability analysis of network with dependent componets failures. Because the componets failures are usually assumed to be s-independent (statisticly-independent), the traditianl methods overestimate the network reliability. Furthermore, this assumption is inappropriate for networks in extreme environment. When the network scale and number of dependent failures are large, the network reliability analysis will become difficult.
     Thirdly, the importance analysis of network components. The tranditional methods mainly focus on the reliability values, and little reliability information can be known from the point of components failures. There needs some effective methods for the importance analysis of network components.
     Fourthly, the runtime reliability analysis about networks. The tranditional methods mainly discuss the reliability metrics for design, which can not indicate the reliability when the networks are operating.
     Because of the large scale and dynamic complexity, it is difficult to describe the network failures with those classic failure distribution functions. To simplify the complexity and resolve the general problem, this thesis makes use of current prevalent method--discrete probability models with time independence. Although olny the two terminals networks are discussed, the methods can be applied into the researches of K-terminal network and all terminal network.
     This thesis focuses on the network reliability analysis and carries out the following researches:
     (1) The reliability analysis about networks with imperfect nodes. Two enhanced OBDD (Ordered Binary Decision Diagram) method are presented, with the names of MFP (Marked Factor Partition) and SNR (Street Network Reliability). The MFP evaluates the network reliability based on the marked factor partition, and the SNR evaluates the network reliability based on character indentification. These methods can evaluate the reliabilities of some large networks with imperfect nodes. Otherwise, with consideration of many imperfect nodes, the EF (Enhanced Factoring) is presented to evaluate the reliability of WSN (wireless sensor networks).
     1) MFP enhances the reliability analysis method based on OBDD. During the OBDD construction, the ER (Edge Replacement) operations are executed to represent the imperfect nodes with OBDD nodes. Two points improve the computation efficiency for the large scale networks: during the decomposition, the marked factor partitions are used to identify the ismophic sub-networks and the repeated computations are decreased from these networks; the states of nodes and edges are stored in OBDD and the redundant states are decreased.
     2) The computation course of SNR is similar with MFP, but is is especial for the street networks. The difference is the identification of ismophic sub-networks, SNR makes use of the source node position to characterize each sub-networks and indentify those sub-networks with same structures.
     3) EF enhances the factoring and improves efficiency with hash table, which stores the reliabilities of ismophic sub-networks.
     (2) The reliability analysis about networks with CCF (Common Cause Failure). Based on the model of common cause failure, the CNR (Common-cause-failure Network Reliability) and WR (Wireless-sensor-networks Reliability) are presented. The CNR is for a general networks with CCF, and it can analyze the large networks with many common cause events (CCE).
     1) The CNR is an enhanced OBDD algorithm, and the nodes are assumed to be perfect for simplification. During the reliability computations, only one recursive OBDD construction is executed. When the network scale and CCE number are large, this kind of OBDD construction greately decreases the running time. About the OBDD constructions for CCF networks, two methods are proposed: the first one is based on Boolean operation, and it is more flexible; the second one is based on common cause variable sets, and it is more storage efficient.
     2) With the considerations of large number of CCEs and imperfect nodes, WR can evaluate the reliability of WSN. The basic principle of WR is samiliar with CNR, but it effectively resolves the imperfect nodes problem with node expansion.
     (3) The importance analysis of network components. Some importance metrics are dicussed: Birnbaum measurement, Critical importance, Risk increment interval, etc. Two importance ananlysis methods for general networks are presented: BIL (Birnbaum Importance of Link) and RI (Risk Increment). The BIO computes the Birnbaum importance of links, and indicates the weakness and the fault component with the most probability. As an evaluation method for the risk of component failure, the RIO can also analyze the network stability, which can be used as invulnerability metric. Otherwise, based on the risk increment, the WNI (Wireless Node Importance) is presented to evaluate the node importance of WSN.
     (4) The reliability analysis based on network measurement. The reliability metrics are presented for fault-tolerant MPLS network and resilient IP network. The one for MPLS network is based on the number of failure, and the one for IP network is based on available bandwidth. For the runtime reliability analysis of MPLS network, an adaptive loopback mechanism for LSP failure detection is presented. It is a fast and low costs method for MPLS failure detection.
引文
[1]Jan R H,Hwang F J,Cheng S T.Topological optimization of a communication network subject to a reliability constraint[J].IEEE Transactions on Reliability,1993,40(1):63-70
    [2]Soni S,Narasimhan S,LeBlanc L J.Telecommunication access network design with reliability constraints[J].IEEE Transactions on Reliability,2004,53(4):532-541
    [3]周炯槃.通信网理论基础[M].人民邮电出版社.1991
    [4]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报,1990,11(4):43-49
    [5]江光杰,李德毅.通信网络的可靠性评估[J].通信学报,1997,18(8):85-891
    [6]Ball M O.Computational complexity of network reliability analysis:an overview[J].IEEE Transactions on Reliability,1986,35(3):230-239.
    [7]陈勇.通信网可靠性的评价方法研究[D].南京:东南大学,2004
    [8]Tsen F P,Sung T Y,Lin M Y.Finding the most vital edges with respect to the number of spanning trees[J].IEEE Transactions on Reliability,1994,43(4):600-602.
    [9]Xing L D.An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis[J].IEEE Transactions on Systems,Man,and Cybernetics—Part A:Systems and Humans,2008,38(6):105-115
    [10]Hoyland A,Rausand M.System Reliability Theory:Models and Statistical Methods[M].Wiley Series in Probability and Mathematical Statistics.Hoboken,NJ:Wiley,1994.
    [11]Kumamoto H,Henley E J.Probabilistic Risk Assessment and Management for Engineers and Scientists,second ed.[M].IEEE Press,1996.
    [12]Singh C,Billinton R.System Reliability Modelling and Evaluation[M].Hutchinson & Co.,1977.
    [13]Ball M O,Magnanti T L,Monma C L,Nemhauser G L.Hand Books in Operations Research and Management Science,Network Models[M].Amsterdam Lausanne,New York:Elsevier,1995.
    [14]金晶,洪延姬.系统可靠性与可用性分析方法[M].国防工业出版社.2006
    [15]Sanso B,Soumis F,Gendreau M.On the evaluation of telecommunications network reliability using routing models[J].IEEE Transactions on Communications,1991,39(10):1494-1501
    [16]Sanso B,Soumis F.Communication and transportation network reliability using routing models[J].IEEE Transactions on Reliability,1991,40(1):29-38
    [17]Patra S,Misra B.Reliability evaluation of flow networks considering multistate modeling of network elements[J].Microelectronics and Reliability,1996,33(14):2161-2164
    [18]Satitsatian S,Kapur K C.An algorithm for lower reliability bounds of multistate two-terminal networks[J].IEEE Transactions on Reliability,2006,55(2):199-206
    [19]冯海林.网络系统中可靠性问题的研究[D].西安:西安电子科技大学,2004
    [20]刘会永.基于运行有效性的传送网可靠性评价方法及其应J{j的研究[D].北京:北京邮电大学,2006
    [21]Kuo S Y,Lu S K,Yeh F M.Determining terminal-pair reliability based on edge expansion diagrams using OBDD[J].IEEE Transactions on Reliability,1999,48(3):234-246
    [22]Yeh F M,Lu S K,Kuo S Y.OBDD-based evaluation of k-terminal network reliability[J].IEEE Transactions on Reliability,2002,51(4):443-451
    [23]Yeh F M,Kuo S Y.OBDD-based network reliability calculation[J].Electronics Letters,1997,33(9):759-760.
    [24]Kuo S Y,Yeh F M,Lin H Y.Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices[J].IEEE Transactions on Reliability,2007,56(2):198-211
    [25]AboEIFotoh H,Colbourn C J.Computing 2-terminal reliability for radio-broadcast networks[J].IEEE Transactions on Reliability,1989,38(5):538-555
    [26]Page L B,Perry J E.A model for system reliability with common-cause failures[J].IEEE Transactions on Reliability,1989,38(4):406-410.
    [27]Xing L D.Reliability evaluation of phased-mission systems with imperfect fault coverage and common-cause failures[J].IEEE Transactions on Reliability,2007,56(1):58-68.
    [28]Xing L D.An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis[J].IEEE Transactions on Systems,Man,and Cybernetics—Part A:Systems and Humans,2008,38(6):105-115
    [29]陈勇,胡爱群.通信网中链路重要性的评价方法[J].电子学报,2003,31(4):573-575
    [30]Rao V B.Most vital edge of a graph with respect to spanning trees[J].IEEE Transactions on Reliability,1998,47(1):6-7
    [31]Nardelli E,Proietti G,Widmayer P.Finding the detour critical edge of a shortest path between two nodes[J].Information Processing Letters,1998,67(1):51-54
    [1]Hoyland A,Rausand M.System Reliability Theory:Models and Statistical Methods,ser[M].Wiley Series in Probability and Mathematical Statistics.Hoboken,NJ:Wiley,1994.
    [2]Ball M O,Magnanti T L,Monma C L,Nemhauser G L.Hand Books in Operations Research and Management Science,Network Models[M].Amsterdam Lausanne,New York:Elsevier,1995
    [3]周炯槃.通信网理论基础[M].人民邮电出版社.1991
    [4]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报,1990,11(4):43-49
    [5]江光杰,李德毅.通信网络的可靠性评估[J].通信学报,1997,18(8):85-891
    [6]Ball M O.Computational complexity of network reliability analysis:an overview[J].IEEE Transactions on Reliability,1986,35(3):230-239
    [7]Colbourn C J.The combinatorics of network reliability[M].Oxford University Press,New York,1987
    [8]Li V,Silvester J.Performance Analysis of Networks with Unreliable Components[J].IEEE Transactions on Communications,1984,32(10):1105-1110
    [9]Sanso B,Soumis F,Gendreau M.IEEE Transactions on Communications[J].On the evaluation of telecommunications network reliability using routing models.1991,39(10):1494-1501
    [10]Sanso B,Soumis F.Communication and transportation network reliability using routing models[J].IEEE Transactions on Reliability,1991,40(1):29-38
    [11]陈勇,胡爱群.通信网中链路重要性的评价方法[J].电子学报,2003,31(4):573-575
    [12]陈勇,胡爱群.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134
    [13]Tsen F P,Sung T Y,Lin M Y.Finding the most vital edges with respect to the number of spanning trees[J].IEEE Transactions on Reliability,1994,43(4):600-602.
    [14]Rao V B.Most vital edge of a graph with respect to spanning trees[J].IEEE Transactions on Reliability,1998,47(1):6-7.
    [15]Nardelli E,Proietti G,Widmayer P.Finding the detour critical edge of a shortest path between two nodes[J].Information Processing Letters,1998,67(1):51-54.
    [16]Nardelli E,Proietti G,Widmayer P.A faster computation of the most vital edge of a shortest path[J].Information Processing Letters,2001,79(2):81-85.
    [17]Ou Y,Dugan J B.Sensitivity Analysis of Modular Dynamic Fault Trees[C].Proceeding of Computer Performance and Dependability Symposium,2000:35-43
    [18]Xing L D.An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis[J].IEEE Transactions on Systems,Man,and Cybernetics--Part A:Systems and Humans,2008,38(6):105-115
    [19]Chang Y R,Amari SV,Kuo S Y.Computing System Failure Frequencies and Reliability Importance Measure Using OBDD[J].IEEE Transactions on Computers,2004,53(1):54-68.
    [20]Kuo S Y,Yeh F M,Lin H Y.Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices.IEEE Transactions on Reliability.2007,56(2):198-211
    [21]Politof T,Satyanarayana A.Efficient Algorithms for Reliability Analysis of Planar Networks:A Survey[J].IEEE Transactions on Reliability,1986,35(3):252-258.
    [22]Chen Y G.,Hsu S J,Yuang M C.Terminal-pair reliability in ATM virtual path networks[C].Proceeding of IEEE GLOBECOM,1997:1408-1412
    [23]Liu H L,Shooman M L Reliability computation of an IP/ATM network with congestion[C].Proceeding of Reliability and Maintainability Symposium,2003:581-586
    [24]Feo T A,Johnson R.Partial factoring,an efficient algorithm for approximating two-terminal reliability on complete graphs[J].IEEE Transactions on Reliability,1990,39(3):290-295
    [25]Shanthikumar J G.Reliability of systems with consecutive minimal cutsets[J].IEEE Transactions on Reliability,1987,36(3):546-550
    [26]金星.大型网络系统可靠度计算新方法[J].系统仿真学报,2001,13(4):432-433
    [27]Wood R K.Factoring algorithms for computing K-terminal network[J].IEEE Transactions on Reliability,1986,35(4):269-278.
    [28]Page L B,Perry J E.Reliability of Directed Networks using:the Factoring Theorem[J].IEEE Transactions on Reliability,1989,38(5):556-562
    [29]Satyanarayana A,Chang M K.Network reliability and the factoring theorem[J].Networks,1983,20(3):107-120
    [30]冯海林,刘三阳,宋月.通信网全端可靠性界的一种计算方法[J].电子学报,2004,32(11):1868-1870
    [31]冯海林.网络系统中可靠性问题的研究[D].西交电子科技大学,2004
    [32]Timothy Benedict Brecht.Lower Bounds for Two-Terminal Network Reliability[D].University of Waterloo,1985
    [33]Ball M O,Provan J S.Calculating bounds on reachability and connectedness in stochastic networks [J].Networks,1983,13(2):253-278.
    [34]Brecht T B,Colbourn C J.Lower bounds on two-terminal network reliability[J].Discrete Applied Mathematics,1988,21(3):185-198.
    [35]Cancela H,Ei Khadiri M.Series-parallel reductions in Monte Carlo network-reliability evaluation[J].IEEE Transactions on Reliability,1998,47(2):159-164
    [36]Fishman G S.A comparison of four Monte-Carlo methods for estimating the probability of s-t connectedness[J].IEEE Transactions on Reliability,1986,35(2):145-155.
    [37]Suliman M,Goben C A.Markov availability models on neural networks[J].Microelectron Reliability,1992,32(5):687-6971
    [38]Nahman J.Fuzzy logic based network reliability evaluation[J].Microelctron Reliability,1997,37(3):1161-11641
    [39]Chowdhury S G,Misra K B.Evaluation of fuzzy reliability of a non2series parallel network[J].Microelectron Reliability,1992,32(12):1-41
    [40]Mahmoud A,Manzoul M S.Neural network for the reliability analysis of simplex systems[J].Microelectron Reliability,1990,30(1):795-801
    [41]Cheng C S,Hsu Y T,Wu C C.An improved neural network realization for reliability analysis[J].Microelectron Reliability,1998,38(7):345-3521
    [42]AboElFotoh H,Colbourn C J.Computing 2-terminal reliability for radio-broadcast networks[J].IEEE Transactions on Reliability,1989,38(5):538-555
    [43]Torrieri D.Calculation of node-pair reliability in large networks with unreliable nodes[J].IEEE Transactions on Reliability,1994,43(3):375-377
    [44]Victor A,Boris P.Consideration of node failures in network-reliability calculation[J].IEEE Transactions on Reliability,1996,45:127-128.
    [45]Lam Y,Li V.Reliability Modeling and Analysis of Communication Networks with Dependent Failures[J].IEEE Transactions on Communication,1986,34(1):82-84
    [46]Xing L D,Shrestha A.Reliability evaluation of distributed computer systems subject to imperfect coverage and dependent common cause failures[J].Journal of Computer Science,2006,2(6):473-479.
    [47]Xing L D.Reliability evaluation of phased-mission systems with imperfect fault coverage and common-cause failures[J].IEEE Transactions on Reliability,2007,56(1):58-68.
    [48]Page L B,Perry J E.A model for system reliability with common-cause failures[J].IEEE Transactions on Reliability,1989,38(4):406-410.
    [1]Ball M O,Magnanti T L,Monma C L,Nemhauser G L.Hand Books in Operations Research and Management Science,Network Models[M].Amsterdam,Lausanne,New York:Elsevier,1995.
    [2]Colbourn C J.The combinatorics of network reliability[M].Oxford University Press,New York,1987.
    [3]Kuo S Y,Yeh F M,Lin H Y.Efficient and exact reliability evaluation for networks with imperfect vertices[J].IEEE Transactions on Reliability,2007,56(2):198-211
    [4]Li V,Silvester J.Performance Analysis of Networks with Unreliable Components[J].IEEE Transactions on Communications,1984,32(10):1105-1110
    [5]Satyanarayana A,Chang M K.Network reliability and the factoring theorem[J].Networks,1983,13(3):107-120.
    [6]Ke W J,Wang S D.Reliability evaluation for distributed computing networks with imperfect nodes [J].IEEE Transactions on Reliability 1997,46(3):342-349
    [7]Olympia R.Theologou,Jacques G.Carlier.Factoring and reductions for networks with imperfect vertices[J].IEEE Transactions on Reliability,1991,40(2):210-217
    [8]Torrieri D.Calculation of node-pair reliability in large networks with unreliable nodes[J].IEEE Transactions on Reliability,1994,43(3):375-377
    [9]Victor A,Boris P.Consideration of node failures in network-reliability calculation[J].IEEE Transactions on Reliability,1996,45(3):127-128.
    [10]AboElFotoh H,Colbourn C J.Computing 2-terminal reliability for radio-broadcast networks[J].IEEE Transactions on Reliability,1989,38(5):538-555
    [11]孔繁甲.无线广播网络的可靠性分析[J].电子学报.1999,27(6):76-78
    [12]孙艳蕊.具有不可靠结点网络可靠度的计算[J].东北大学学报.1999,20(5):562-564
    [13]孙艳蕊.计算具有不可靠结点分布式网络可靠度的一个因子分解算法[J].计算机科学.2002,20(4):111-113
    [14]Hardy G,Lucet C,Limnios N.K-Terminal Network Reliability Measures With Binary Decision Diagrams[J].IEEE Transactions on Reliability,2007,56(3):506-515
    [15]Akers B.Binary decision diagrams[J].IEEE Transactions on Computers,1978,27(4):509-516.
    [16]Bryant R E.Symbolic Boolean manipulation with ordered binary-decision diagrams[J].ACM Computing Surveys,1992,24(3):293-318.
    [17]Andersen H.An introduction to binary decision diagrams[M].Amsterdam,Lausanne,New York:Elsevier,1997
    [18]Friedman S J,Supowit K J.Finding the optimal variable ordering for binary decision diagrams[C].Proceeding of 24th ACM/IEEE Conference on Design Automation,1987:348-356.
    [19]Bollig B,Wegener I.Improving the variable ordering of OBDDs is NP-complete.IEEE Transactions on Computers,1996,45(9):993-1002.
    [20]Hardy G,Lucet C,Limnios N.Computing all-terminal reliability of stochastic networks with binary decision diagrams[C].Proceeding of 11th International Symposium on Applied Stochastic Models and Data Analysis,2005:1011-1017.
    [21]Imai H,Sekine K,Imai K.Computational investigations of allterminal network reliability via BDDs.IEICE Transactions on Fundamentals,1999,E82-A(5):714-721.
    [22]Carlier J,Lucet C.A decomposition algorithm for network reliability evaluation.Discrete Applied Mathematics, 1996,65(1): 141-156.
    [23] Kuo S Y, Lu S K, Yeh F M. Determining terminal-pair reliability based on edge expansion diagrams using OBDD [J]. IEEE Transactions on Reliability, 1999,48(3):234-246
    [24] Yeh F M, Lu S K, Kuo S Y. OBDD-based evaluation of k-terminal network reliability. IEEE Transactions on Reliability, 2002,51(4): 443-451
    [25] Yeh F M, Kuo S Y. OBDD-based network reliability calculation. Electronics Letters, 1997,33(9):759-760.
    [26] Yeh F M, Lin H Y, Kuo S Y. Analyzing network reliability with imperfect nodes using OBDD [C].Proceedings of the 2002 Pacific Rim Int'l Symposium on Dependable Computing, 2002: 89-96.
    [27] Lin H Y, Kuo S Y, Yeh F M. Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD [C]. Proceedings of the 8th IEEE International Symposium on Computers and Communication, 2003:1341-1346.
    
    [28] Online BDD library [OL]. http://sourceforge.net/projects/buddy
    [29] AboElFotoh H M F, Iyengar S S, Chakrabarty K. Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures [J]. IEEE Transactions on Reliability, 2005,54(1): 145-155.
    [30] AboElFotoh HMF, ElMallah E S, Hassanein H S. On the reliability of wireless sensor networks [C].Proceedings of IEEE International Conference on Communications, Istanbul, TR: IEEE press, 2006:3455-3460.
    [31] Xiao Y F, Chen S Z, Li X, Li Y H. An enhanced factoring algorithm for reliability evaluation of wireless sensor networks [C]. Proceedings of 9th International Conference for Young Computer Scientists, Zhang Jia Jie, Hunan, China: IEEE Computer Society, 2008: 2175-2179
    [1]Lam Y,Li V.Reliability Modeling and Analysis of Communication Networks with Dependent Failures[J].IEEE Transactions on Communication,1986,34(1):82-84
    [2]Page L B,Perry J E.A model for system reliability with common-cause failures[J].IEEE Transactions on Reliability,1989,38(4):406-410.
    [3]Xing L D.An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis[J].IEEE Transactions on Systems,Man,and Cybernetics--Part A:Systems and Humans,2008,38(6):105-115
    [4]Xing L D,Shrestha A.Reliability evaluation of distributed computer systems subject to imperfect coverage and dependent common cause failures[J].Journal of Computer Science,2006,2(6):473-479.
    [5]Vaurio J K.An implicit method for incorporating common-cause failures in system analysis[J].IEEE Transactions on Reliability,1998,47(2):173-180
    [6]Fleming K N,Mosleh A.Common-cause data analysis and implications in system modeling[C].Proceeding of Internatinal Topical Meeting Probabilistic Safety Methods Application,1985:301-312.
    [7]Fleming K N,Mosleh N,Deremer R K.A systematic procedure for incorporation of common cause events into risk and reliability models[J].Nuclear Engineering and Design,1986,93(23):245-273.
    [8]Chae K C,Clark G M.System reliability in the presence of common-cause failures[J].IEEE Transactions on Reliability,1986,35(1):32-35.
    [9]Dugan J B,Trivedi K S.Coverage modeling for dependability analysis of fault-tolerant systems[J].IEEE Transactions on Reliability,1989,38(6):775-787
    [10]Xing L D.Reliability evaluation of phased-mission systems with imperfect fault coverage and common-cause failures[J].IEEE Transactions on Reliability,2007,56(1):58-68.
    [11]Xing L D.Reliability evaluation of distributed computer systems subject to imperfect coverage and dependent common-cause failures[J].Journal of Computer Science,2006,2(6):473-479
    [12]Chang Y R,Amari S V,Kuo S Y.Computing System Failure Frequencies and Reliability Importance Measure Using OBDD[J].IEEE Transactions on Computers,2004,53(1):54-68.
    [13]Cinque M,Cotroneo D.Reliability requirements of wireless sensor networks for dynamic structural monitoring[C].Proceedings of International Workshop on Applied Software Reliability,Los Alamitos,CA(USA):IEEE Computer Society Press,2006:8-13
    [14]Xiao Y F,Chen S Z,Li X,Li Y H.An enhanced factoring algorithm for reliability evaluation of wireless sensor networks[C].Proceedings of 9th International Conference for Young Computer Scientists,Zhang Jia Jie,Hunan,China:IEEE Computer Society,2008:2175-2179
    [15]Xiao Y F,Chen S Z,Li X,Li Y H.Evaluate reliability of wireless sensor networks with OBDD[C].Proceedings of the 2009 IEEE International Conference on Communications.(Accepted)
    [16]Purohit N,Varadwaj P,Tokekar S.Reliability analysis of Wireless Sensor Network[C].Proceedings of IEEE International Conference on Networks.New Delhi,IN:IEEE press,2008:231-236
    [17]Liu C,Zhang S Y,Feng H B,Zhang M.The research on Wireless Sensors Network reliability[C].Proceedings of International Conference on Wireless Communications,Networking and Mobile Computing.Dalian,Liaoning,CN:IEEE press,2008:1021-1024
    [18]AboElFotoh H,Colbourn C J.Computing 2-terminal reliability for radio-broadcast networks[J].IEEE Transactions on Reliability.1989,38(5):538-555
    [19]孔繁甲.无线广播网络的可靠性分析[J].电子学报,1999,27(6):76-78
    [20]孙艳蕊.具有不可靠结点网络可靠度的计算[J].东北大学学报,1999,20(5):562-564
    [21]AboElFotoh H M F,Iyengar S S,Chakrabarty K.Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures[J].IEEE Transactions on Reliability,2005,54(1):145-155.
    [22]AboElFotoh HMF,ElMallah E S,Hassanein H S.On the reliability of wireless sensor networks[C].Proceedings of IEEE International Conference on Communications,Istanbul,TR:IEEE press,2006:3455-3460.
    [23] Shrestha A, Xing L D, Liu H. Modeling and evaluating the reliability of wireless sensor networks [C].Proceedings of Annual Reliability and Maintainability Symposium, Orlando, Florida, USA: IEEE press, 2007:186-191.
    [24] Xing L D, Michel H E. Integrated modeling for wireless sensor networks reliability and security [C].Proceedings of Annual Reliability and Maintainability Symposium, Newport Beach, California,USA:IEEE press, 2006:594-600
    [1]Hoyland A,Rausand M.System Reliability Theory:Models and Statistical Methods[M].Hoboken,NJ:Wiley,1994.
    [2]Kumamoto H,Henley E J.Probabilistic Risk Assessment and Management for Engineers and Scientists,second ed.[M].IEEE Press,1996.
    [3]Singh C,Billinton R.System Reliability Modelling and Evaluation[M].Hutchinson & Co.,1977.
    [4]陈勇,胡爱群.通信网中链路重要性的评价方法[J].电子学报,2003,31(4):573-575
    [5]陈勇,胡爱群.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134
    [6]Page L B,Perry J E.Reliability polynomials and link importance in networks[J].IEEE Transactions on Reliability,1994,43(1):51-58.
    [7]Tsen F P,Sung T Y,LinM Y.Finding the most vital edges with respect to the number of spanning trees[J].IEEE Transactions on Reliability,1994,43(4):600-602.
    [8]Rao V B.Most vital edge of a graph with respect to spanning trees[J].IEEE Transactions on Reliability,1998,47(1):6-7.
    [9]Nardelli E,Proietti G,Widmayer P.Finding the detour critical edge of a shortest path between two nodes[J].Information Processing Letters,1998,67(1):51-54.
    [10]Nardelli E,Proietti G,Widmayer P.A faster computation of the most vital edge of a shortest path[J].Information Processing Letters,2001,79(2):81-85.
    [11]Ou Y,Dugan J B.Sensitivity Analysis of Modular Dynamic Fault Trees[C].Proceeding of Computer Performance and Dependability Symposium,2000:35-43.
    [12]Xing L D.An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis[J].IEEE Transactions on Systems,Man,and Cybernetics--Part A:Systems and Humans,2008,38(6):105-115
    [13]Chang Y R,Amari S V,Kuo S Y.Computing System Failure Frequencies and Reliability Importance Measure Using OBDD[J].IEEE Transactions on Computers,2004,53(1):54-68.
    [14]Kuo S Y,Yeh F M,Lin H Y.Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices[J].IEEE Transactions on Reliability,2007,56(2):198-211
    [15]肖宇峰,陈山枝,李昕,李玉宏.用OBDD算法评估无线传感网的可靠度和结点重要性[J].高技术通讯(已录用)
    [1]张学渊,梁雄健.基于运行统计的通信网可靠性的综合实用评价方法[J].电子学报,1999,27(4):43-46
    [2]Ali Z,Kaudel F J.Framework for network survivability performance[J].IEEE Journal on Selected Areas in Communications,1994,12(1):46-50.
    [3]刘会永.基于运行有效性的传送网可靠性评价方法及其应用的研究[D].北京邮电大学,2006
    [4]肖宇峰,陈山枝,李昕,李玉宏.自适应的LSP故障环回检测机制[J].北京邮电大学学报,2009,32(2):5-9
    [5]Vasseur J P,Pickavet M,Demeester P.Network Recovery Protection and Restoration of Optical,SONET-SDH,IP,and MPLS[M].San Francisco:Morgan Kaufmann Publishers Inc.,2004.
    [6]Sanso B,Soumis F,Gendreau M.IEEE Transactions on Communications[J].On the evaluation of telecommunications network reliability using routing models.1991,39(10):1494-1501
    [7]Sanso B,Soumis F.Communication and transportation network reliability using routing models[J].IEEE Transactions on Reliability.1991,40(1):29-38
    [8]Xiao Y F,Chen S Z,Li X,Li Y H.A new available bandwidth measurement method based on self-loading periodic streams[C].Proceedings of the International Conference on Wireless Communications,Networking and Mobile Computing,2007:1904-1907.
    [9]Jain M,Dovrolis C.End-to-end availablebandwidth:measurement methodology,dynamics,and relation with TCP throughput[J].IEEE/ACM Transactions on Networking,2003,11(3):537-549.
    [10]Jain M,Dovrolis C.Pathload:A measurement tool for end-to-end available bandwidth[C].Proceedings of Passive and Active Measurements,Fort Collins,2002:1201-1211.
    [11]Aggarwal R.OAM mechanisms in MPLS layer 2 transport networks[J].IEEE Communications Magazine,2004,4(2):124-130
    [12]Dini P,Hasan,M Z,Morrow M,et al.IP/MPLS OAM:challenges and directions[C].Proceedings of IEEE workshop on IP Operations and Management,Beijing,China,October 2004:1-8
    [13]Cavendish D,Ohta H,Rakotoranto H.Operation,Administration,and Maintenance in MPLS Networks[J].IEEE Communications Magazine,2004,4(3):91-99
    [14]Song H,Jung I,Choi J,et al.Implementation of Monitoring Mechanism for MPLS networks[C].Proceedings of the 6th International Conference on Advanced Communication Technology.Phoenix Park,Gangwon-Do,Korea,February 2004:868-872
    [15]O'Connor D.Packet Transport OAM-Service Provider Alternatives[C].Proceedings of Optical Fiber Communication and the National Fiber Optic Engineers,Anaheim,USA,March 2007:1-12
    [16]Ash J,Chung Li,D'Souza K,et al.AT&T's MPLS OAM architecture,experience,and evolution[J].IEEE Communications Magazine,2004,5(2):100-111
    [17]Chun K G,Song J,Lee S S.Review on the Operation,Administration and Maintenance(OAM) of BcN[C].Proceedings of Asia-Pacific Conference on Communications,Busan,Korea,August,2006:1-5
    [18]Nagarajan R,Wang,Y T,Oureshi,M.Reliable packet transport technologies for MPLS networks[C].Proceedings of the 11th International Telecommunications Network Strategy and Planning Symposium,Vienna,Austria,June,2004:351-357
    [19]Operation & Maintenance Mechanism for MPLS Network IS].ITU-T Rec Y.1711.February 2004.
    [20]Kompella K,Swallow G.Detecting Multi-Protocol Label Switched(MPLS) Data Plane Failures[S].IETF RFC 4379,February 2006.
    [21]MPLS OAM Tools for Troubleshooting MPLS Networks[EB].Cisco Systems.
    [22]Aggarwal R,Kompella K,Nadeau T.BFD for MPLS LSPs[S].IETF Internet draft draft-ieff-bfd-mpls-04.txt,March 2007.
    [23]Bonica R,Gan D,Tappan D.ICMP Extensions for Multiprotocol Label Switching[S].IETF RFC 4950,August 2007.
    [24]王胡成等.Linux平台下MPLS数据平面故障检测的实现[C].2007通信理论与技术新发展——第十二届全国青年通信学术会议论文集(下册).北京:电子工业出版社.2007:1907-1913

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700