计算机网络可靠性分析与设计
|
摘要
随着计算机网络的广泛应用,为了向用户提供满意的服务,需要保障网络的服务质量,由于可靠性是一项反映服务质量的重要指标,网络可靠性相关研究获得了学者的广泛关注。网络可靠性评估是网络可靠性相关研究的基础,而基于可靠度的网络设计则能针对网络可靠度、网络构建费用等网络设计目标,提供各种优化方案供网络管理者参考,是目前网络可靠性研究领域的一大热点。在网络设计方面,由于网络可能会发生故障,故障容错技术能保证网络在故障条件下的正常工作,因此,网络容错设计具有重要的研究意义。本文主要围绕计算机网络可靠性分析与设计进行研究,本文的主要研究内容如下：
1.简单介绍了网络可靠性的重要性,发展及其研究现状。
2.对数据通过相交路径进行传输的可靠性的评估进行了初步探索。通过比较各数据到达共用链路的时刻,来判断各数据是否存在链路使用权竞争。探讨了数据产生的时间间隔和数据量对可靠度的影响。
3.考虑了基于网络可靠度的传输线优化设计问题。针对拓扑结构固定的多源多宿多态计算机网络,提出了一种可靠度最大化的网络传输线配置方法,在满足费用约束的情况下,极大化网络数据传输的可靠度。首先,针对一种给定的传输线配置,在网络构建费用限制条件下,提出了一种可靠度评估算法来计算多态网络各源点到各宿点的可靠度；其次,将可靠度评估算法和非支配排序遗传算法相结合,提出了基于可靠度的传输线路寻优算法来寻找原问题的最优Pareto解集。
4.考虑了工作路径给定情况下,基于备用路径的容错设计问题。本文采用两条不相交的路径作为工作路径来同时传输数据,并采用与工作路径不相交的一条最小路集作为备用路径,提出了一个基于最小路集的单条备用路径算法来评估单条工作路径失效情况下的网络可靠度。相对于以往学者采用两条不相交的路径作为工作路径,并采用另外两条不相交的最小路集作为备用路径的研究,在单条工作路径失效情况下,本文提出的算法能大幅度地提高网络可靠度,且所需的备用路径数目更少。
5.考虑了工作路径非给定情况下,基于备用路径的容错设计问题。本文具体研究了多协议标签交换网络的路由优化设计问题,在满足网络可靠度限制条件下,通过选择最优的工作和备用路径,并对其进行带宽分配,使得网络总构建费用最小。由于网络总构建费用和网络可靠度存在耦合关系,我们将原问题对等地解耦成两个子问题：费用和可靠度相关子问题。费用相关子问题已被学者研究解决。针对可靠度相关子问题,通过理论推导,降低了解的搜索空间。最后,由于费用和可靠度相关子问题的解是基于相同的搜索准则得到的,原问题的最优工作和备用路径解集可以通过比较两个子问题的解来求出。原问题是一个NP难题,本文提出了一种有效解决该NP难题的思路,具有重要的参考价值。
最后对全文进行了总结,并提出了进一步的研究方向。
With the rapid development of the computer network, provide satisfied services to user, we need to guarantee the quality of network service. As reliability is an important factor for the quality of service, network reliability related researches have received a lot of attentions from many researchers. Network reliability evaluation is the basis of the reliability related researches. The network reliability design, which can provide different options for network managers, is a hot topic in the field of network reliability related researches. As a network may contain faults, the fault tolerance is crucial because it can ensure the normal working of the network under the ill conditions. This paper mainly considers the computer network reliability analysis and design problems. The contents of this paper are as follows:
1. A brief literature review on the background, development of network reliability and the re-lated work is provided.
2. The reliability of the data transmitted through the shared link is investigated. By comparing the arriving time at the shared link of each data, we can determine whether there exists a prior conflict among the data or not. The influences of the time interval to generate the data and the amount of data on the reliability are also discussed.
3. The optimal transmission line design based on the network reliability is studied. For the multi-state multi-source multi-sink computer network with fixed topology, we proposed a network transmission line assignment algorithm to maximize the network reliability under the cost constraints. First, for a certain transmission line configuration, we have proposed a reliability evaluation algorithm to calculate the reliability of each source node to each sink node under the cost constraints. Second, by combing the reliability evaluation algorithm and the non-dominated sorting genetic algorithm, we have proposed a reliability-based transmis-sion line optimization algorithm to find the optimal solutions of the problem.
4. The reliability-based backup path fault tolerance design with fixed working paths is consid-ered. This paper uses two link disjoint path as the working paths to transmit data simultane-ously, and uses another link disjoint path as the backup path. An algorithm to calculate the network reliability in the single working path failure case is proposed. Compared with the existing work which used two link disjoint paths as the working paths and used another two link disjoint paths as the backup paths, the proposed algorithm can greatly improve the net-work reliability in the single working path failure case. Also, the proposed algorithm needs few backup paths than the previous work.
5. The reliability-based backup path fault tolerance design with non-fixed working paths is considered. This paper considered the optimal working and backup paths selection and the optimal bandwidth allocation problem. The aim is to minimize the network total construct-ing costs under the network reliability constraint in the multi-protocol label switching net-work. As the network total constructing costs and the network reliability possess a coupling relationship, we decoupled the original problem into two sub-problems equivalently:cost and reliability related sub-problems. The cost related sub-problem has been solved by other scholars. For reliability related sub-problem, we reduced the searching space for the solution through theoretical analysis. As the solutions to the two sub-problems are based on the same searching criteria, the optimal selection of the working and backup paths to original problem can be determined by combing the solutions to the two sub-problems. The original problem is an NP-hard problem, the proposed idea of this work has provided an alternative way to solve such NP-hard problems.
The conclusions and future work are depicted at the end of the dissertation.
1.简单介绍了网络可靠性的重要性,发展及其研究现状。
2.对数据通过相交路径进行传输的可靠性的评估进行了初步探索。通过比较各数据到达共用链路的时刻,来判断各数据是否存在链路使用权竞争。探讨了数据产生的时间间隔和数据量对可靠度的影响。
3.考虑了基于网络可靠度的传输线优化设计问题。针对拓扑结构固定的多源多宿多态计算机网络,提出了一种可靠度最大化的网络传输线配置方法,在满足费用约束的情况下,极大化网络数据传输的可靠度。首先,针对一种给定的传输线配置,在网络构建费用限制条件下,提出了一种可靠度评估算法来计算多态网络各源点到各宿点的可靠度；其次,将可靠度评估算法和非支配排序遗传算法相结合,提出了基于可靠度的传输线路寻优算法来寻找原问题的最优Pareto解集。
4.考虑了工作路径给定情况下,基于备用路径的容错设计问题。本文采用两条不相交的路径作为工作路径来同时传输数据,并采用与工作路径不相交的一条最小路集作为备用路径,提出了一个基于最小路集的单条备用路径算法来评估单条工作路径失效情况下的网络可靠度。相对于以往学者采用两条不相交的路径作为工作路径,并采用另外两条不相交的最小路集作为备用路径的研究,在单条工作路径失效情况下,本文提出的算法能大幅度地提高网络可靠度,且所需的备用路径数目更少。
5.考虑了工作路径非给定情况下,基于备用路径的容错设计问题。本文具体研究了多协议标签交换网络的路由优化设计问题,在满足网络可靠度限制条件下,通过选择最优的工作和备用路径,并对其进行带宽分配,使得网络总构建费用最小。由于网络总构建费用和网络可靠度存在耦合关系,我们将原问题对等地解耦成两个子问题：费用和可靠度相关子问题。费用相关子问题已被学者研究解决。针对可靠度相关子问题,通过理论推导,降低了解的搜索空间。最后,由于费用和可靠度相关子问题的解是基于相同的搜索准则得到的,原问题的最优工作和备用路径解集可以通过比较两个子问题的解来求出。原问题是一个NP难题,本文提出了一种有效解决该NP难题的思路,具有重要的参考价值。
最后对全文进行了总结,并提出了进一步的研究方向。
With the rapid development of the computer network, provide satisfied services to user, we need to guarantee the quality of network service. As reliability is an important factor for the quality of service, network reliability related researches have received a lot of attentions from many researchers. Network reliability evaluation is the basis of the reliability related researches. The network reliability design, which can provide different options for network managers, is a hot topic in the field of network reliability related researches. As a network may contain faults, the fault tolerance is crucial because it can ensure the normal working of the network under the ill conditions. This paper mainly considers the computer network reliability analysis and design problems. The contents of this paper are as follows:
1. A brief literature review on the background, development of network reliability and the re-lated work is provided.
2. The reliability of the data transmitted through the shared link is investigated. By comparing the arriving time at the shared link of each data, we can determine whether there exists a prior conflict among the data or not. The influences of the time interval to generate the data and the amount of data on the reliability are also discussed.
3. The optimal transmission line design based on the network reliability is studied. For the multi-state multi-source multi-sink computer network with fixed topology, we proposed a network transmission line assignment algorithm to maximize the network reliability under the cost constraints. First, for a certain transmission line configuration, we have proposed a reliability evaluation algorithm to calculate the reliability of each source node to each sink node under the cost constraints. Second, by combing the reliability evaluation algorithm and the non-dominated sorting genetic algorithm, we have proposed a reliability-based transmis-sion line optimization algorithm to find the optimal solutions of the problem.
4. The reliability-based backup path fault tolerance design with fixed working paths is consid-ered. This paper uses two link disjoint path as the working paths to transmit data simultane-ously, and uses another link disjoint path as the backup path. An algorithm to calculate the network reliability in the single working path failure case is proposed. Compared with the existing work which used two link disjoint paths as the working paths and used another two link disjoint paths as the backup paths, the proposed algorithm can greatly improve the net-work reliability in the single working path failure case. Also, the proposed algorithm needs few backup paths than the previous work.
5. The reliability-based backup path fault tolerance design with non-fixed working paths is considered. This paper considered the optimal working and backup paths selection and the optimal bandwidth allocation problem. The aim is to minimize the network total construct-ing costs under the network reliability constraint in the multi-protocol label switching net-work. As the network total constructing costs and the network reliability possess a coupling relationship, we decoupled the original problem into two sub-problems equivalently:cost and reliability related sub-problems. The cost related sub-problem has been solved by other scholars. For reliability related sub-problem, we reduced the searching space for the solution through theoretical analysis. As the solutions to the two sub-problems are based on the same searching criteria, the optimal selection of the working and backup paths to original problem can be determined by combing the solutions to the two sub-problems. The original problem is an NP-hard problem, the proposed idea of this work has provided an alternative way to solve such NP-hard problems.
The conclusions and future work are depicted at the end of the dissertation.
引文
[1]肖宇峰.网络可靠性研究[J]. http://wenku.baidu.com/view/7900397f168884868762d61a.html.
[2]C.C. Jane, W.H. Shen, Y.W. Laih. Practical sequential bounds for approximating two-terminal reliabili-ty [J]. European Journal of Operational Research,2009,195(2):427-441.
[3]Y.K. Lin. Spare routing reliability for a stochastic flow network through two minimal paths under budget constraint[J]. IEEE Transactions on reliability,2010,59(1):2-10.
[4]Y. K. Lin, C. T. Yeh. Multi-objective optimization for stochastic computer networks using nsga-ii and topsis[J]. European Journal of Operational Research,2012,218(3):735-746.
[5]夏长义.浅谈计算机网络的重要性[J].计算机光盘软件与应用,2000,5.
[6]滕云微.网络可靠性分析系统的设计与实现[J].计算机信息,2008,24(6)：129-131.
[7]苗亮.计算机网络可靠性的研究[J].机械工程与自动化,2010,3.
[8]赖彩凤.计算机网络可靠性的研究[J].计算机光盘软件与应用,2010,15.
[9]卢民.保证通信网可靠性的路由研究[D].[硕士学位论文],济南,山东师范大学,2009.
[10]赵娟,郭平,吴俊,邓宏钟,谭跃进.复杂网络可靠性研究进展[J].后勤工程学院学报,2010,26(5).
[11]张永富.保证通信网可靠性的路由研究[D].[硕士学位论文],南京,南京邮电大学,2008.
[12]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报,1990,11(4)：4449.
[13]郭伟.野战地域通信网可靠性的评价方法[J].电子学报,2000,28(1)：3-6.
[14]刘君.计算机网络可靠性优化设计问题的研究[D].[硕士学位论文],沈阳,沈阳工业大学,2006.
[15]龚波,张文,杨红霞.网络基础[M].北京：电子工业出版社,2003.
[16]A. Behr, L. Camarinopoulos, G. Pampoukis. Domination of k-out-of-n systems[J]. IEEE Transactions on Reliability,1995,44(4):705-707.
[17]冯海林.网络系统中可靠性问题的研究[D].[博士学位论文],西安,西安电子科技大学,2004.
[18]K.D. Reed.网络设计[M].北京：电子工业出版社,2003.
[19]C.J. Colbourn. The combinatorics of network reliability[M]. New York:Oxford University Press,1987.
[20]H. Frank, I.T. Frisch. Analysis and design of survivable networks[J]. IEEE Transactions on Communica-tion Technology,1970,18(5):501-519.
[21]D.R. Shier. Network reliability and algebraic structures[M]. Oxford:Clarendon Press,1991.
[22]M.O.Ball. Complexity of network reliability computations[J]. Networks,1980,10:153-165.
[23]肖宇峰.基于离散概率模型的二端网络可靠性分析[D].[硕士学位论文],北京,北京邮电大学,2009.
[24]D. Cavendish, H. Ohta, H. Rakotoranto. Operation, administration, and maintenance in mpls networks[J]. IEEE Communications Magazine,2004,4(3):91-99.
[25]D. Medhi. A unified approach to network reliability for teletrafic networks:Models, algorithms and analysis[J]. IEEE Transactions on Communications,2004,42:534-548.
[26]孔繁甲,王光兴.无线广播网络的可靠性分析[J].电子学报,1999,27(6)：76-78.
[27]周联红,伍翔,王一超,冯重熙.一种光纤通信系统可用性的算法及分析[J].电子学报,2001,29(12)：1713-1716.
[28]R. Doverspike. Trends in layered network management of atm, sonet, and wdm technologies for network reliability and fault management[J]. Journal of Network and Systems Management,1997,5(2):215-220.
[29]A. Hac. Improving reliability through architecture partitioning in telecommunication networks[J]. IEEE Journal on Selected Areas in Communications,1994,12(1):193-204.
[30]S.B. Liu, K.H. Cheng, X.P. Liu. Network reliability with mode failures[J]. Networks,2000,35(2):109-117.
[31]D.T.O. Patrick.实用可靠度工程,第四版[M].北京：电子工业出版社,2004.
[32]M.O. Ball. Computational complexity of network reliability analysis:An overview[J]. IEEE Transactions on Reliability,1986,35(3):230-239.
[33]陈育斌,李建东,陈家模.计算通信网络整体概率连通性的一种新算法[J].通信学报,2000,21(9)：91-96.
[34]A. Satyanarayana, A. Prabhakar. New topological formula and rapid algorithm for reliability analysis of complex networks[J]. IEEE Transactions on Reliability,1978,27(2):82-100.
[35]A. Satyanarayana, J.N. Hagstrom. A new algorithm for reliability analysis of multi-terminal networks[J]. IEEE Transactions on Reliability,1981,30(4):325-334.
[36]A. Satyanarayana. A unified formula for analysis of some network reliability problems[J]. IEEE Trans-actions on Reliability,1982,31(1):23-32.
[37]J.A. Buzacott. Node partition formula for directed graph reliability[J]. Networks,1987,17:227-240.
[38]J.A. Buzacott. An implementation of the buzacott algorithm for network global-reliabilty[J]. IEEE Trans-actions on Reliability,1993,42(1):46-49.
[39]L.C. Zhao, F.J. Kong. A new formula and an algorithm for reliability analysis of network[J]. Microelec-tronics Reliability,1997,37(3):511-518.
[40]K. Dohmen. Inclusion-exclusion and network reliability [J]. The Electronic Journal of Combinatorics, 1998,5:1-8.
[41]李瑞莹,康锐.网络可靠性评价研究综述[J].可靠性工程,2008.
[42]J.G. Shathikumar. Reliability of systems with consective minimal cutsets[J]. IEEE transactions on Relia-bility,1987,36(3):546-550.
[43]金星.大型网络系统可靠度计算新方法[J].系统仿真学报,2001,13(4)：432-433.
[44]W.C. Yeh. A simple minimal path method for estimating the weighted multi-commodity multistate unre-liable networks reliability[J]. Reliability Engineering and System Safety,2008,93(1):125-136.
[45]J.C. Hudson, K.C. Kapur. Reliability bounds for multistate systems with multistate components[J]. Oper-ations Research,1985,33(1):153-160.
[46]J. Xue. On multistate system analysis[J]. IEEE Transactions on Reliability,1985,34(4):329-337.
[47]P.M. Lin, B.J. Leon, T.C. Huang. A new algorithm for symbolic reliability analysis[J]. IEEE Transactions on Reliability,1976,25:2-15.
[48]孙艳蕊,赵连昌,张祥德.计算网络可靠度的容斥原理算法[J].小型微型计算机系统,2007,28(5)：830-833.
[49]吴俊,段东立,赵娟,李俊,邓宏钟,谭跃进.网络系统可靠性研究现状与展望[J].复杂系统与复杂性科学,2011,8(2)：77-86.
[50]S. Rai, M. Veeraraghavan, K.S. Trivedi. A survey of efficient reliability computation using disjoint prod-ucts approach[J]. Networks,1995,25:147-163.
[51]C.C. Jane, J. Yuan. A-sum-of-disjoint-products-algorithm-for-reliability-evaluation-of-flow-networks[J]. European Journal of Operational Research,2001,131(3):664-675.
[52]J.M. Wilson. An improved minimizing algorithm for sum of disjoint products[J]. IEEE Transactions on Reliability,1990,39(1):42-45.
[53]L. Fratta, U. Montanari. A boolean algebra method for computing the terminal reliability in a communi-cation network[J]. IEEE Transactions on Circuit Theory,1973,20(3):203-211.
[54]D. Torrieri. Calculation of node-pair reliability in large networks with unreliable nodes[J]. IEEE Trans-actions on Reliability,1994,43(3):375-377.
[55]J.A. Abraham. An improved algorithm for network reliability[J]. IEEE Transactions on Reliability,1979, 28(1):58-61.
[56]F. Beichelt, L. Spross. An improved abraham-method for generating disjoint sums[J]. IEEE Transactions on Reliability,1987,36(1):70-74.
[57]W.C. Yeh. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths[J]. Reliability Engineering and System Safety,2007,92:260-268.
[58]K.D. Heidtmanr. Smaller sums of disjoint products by subproduct inversion[J]. IEEE Transactions on Reliability,1989,38(3):305-311.
[59]M. Veeraraghavan, K.S. Trivedi. An improved algorithm for the symbolic reliability analysis of network-s[J]. IEEE Transactions on Reliability,1991,40:347-358.
[60]L.C. Zhao, J.C. Xu. An efficient minimizing algorithm for sum of disjoint products[J]. Microelectronics Reliability,1995,35(8):1157-1162.
[61]L. Fratta, U. Montanari. A recursive method based on case analysis for computing network terminal reliability[J]. IEEE Transactions on Communications,1978,26(8):1166-1177.
[62]M.O. Locks, J.M. Wilson. Note on disjoint product algorithm[J]. IEEE Transactions on Reliability,1992, 41(1):81-84.
[63]T. Luo, K.S. Trivedi. An improved algorithm for coherent-system reliability[J]. IEEE Transactions on Reliability,1998,47(l):73-78.
[64]M.J. Zuo, Z. Tian, H.Z. Huang. An efficient method for reliability evaluation of multistatc networks given all minimal path vectors[J]. IEEE Transactions on Reliability,2007,39(8):811-817.
[65]Y. K. Lin, C. T. Yeh. Maximal network reliability with optimal transmission line assignment for stochastic electric power networks via genetic algorithms[J]. Applied Soft Computing,2011,11(2):2714-2724.
[66]Y. K. Lin, L. C-L. Yeng. Evaluation of network reliability for computer networks with multiple sources[J]. Mathematical Problems in Engineering,2012,2012:18 pages.
[67]F. Moskowitz. The analysis of redundancy networks[J]. IEEE Transactions on Communications and Electronic,1958,39:627-632.
[68]H.Mine. Reliability of physical systems[J]. IEEE Transactions on Circuit Theory,1958, CT-6:138-151.
[69]A. Satyanarayana, M.K. Chang. Network reliability and factoring theory[J]. Networks,1983,20:107-120.
[70]R.K. Wood. A factoring algorithm using polygon-to-chain reductions for computing k-terminal network reliability[J]. Networks,1985,15:173-190.
[71]L.B. Page, J.E. Perry. Combining vertex decompositions with factoring in an all terminal network relia-bility algorithm[J]. Microelectronics Reliability,1990,30(2):249-262.
[72]O. Theologou, J. Carlier. Factoring and reductions for networks interests with imperfect vcrtices[J]. IEEE Transactions on Reliability,1991,40(2):210-217.
[73]R.K. Wood. Factoring algorithm for computing k-terminal reliability[J]. IEEE Transactions on Reliability, 1986,35(4):269-278.
[74]L.B. Page, J.E. Perry. Reliability of directed networks using the factoring theorem[J]. IEEE Transactions on Reliability,1989,38(5):556-562.
[75]E.S. Elmallah. Algorithm for k-terminal reliability problems with node failures[J]. Networks,1992, 22:369-384.
[76]P. Doulliez, E. Jamoulle. Transportation networks with random arc capacities[J]. RAIRO,1972,3:45-60.
[77]Y. K. Lin, C. T. Yeh. Evaluation of optimal network reliability under components-assignments subject to a transmission budget[J]. IEEE Transactions on Reliability,2010,59(3):539-550.
[78]J. S. Lin, C. C. Jane, J. Yuan. On reliability evaluation of capacitated flow network in terms of minimal pathsets[J]. Networks,1995,25(3):131-138.
[79]T. Aven. Reliability evaluation of multistate systems with multistate components[J]. IEEE Transactions on Reliability,1985,34(5):473-479.
[80]C. Alcxopoulos. Note on state-space decomposition methods for analyzing stochastic flow networks[J]. IEEE Transactions on Reliability,1995,44:354-357.
[81]C.C. Jane, Y.W. Laih. A practical algorithm for computing multi-state two-terminal reliability [J]. IEEE Transactions on Reliability,2008,57:295-302.
[82]C.C. Jane, Y.W. Laih. Computing multi-state two-terminal reliability through critical arc states that inter-rupt demand[J]. IEEE Transactions on Reliability,2010,59(2):338-345.
[83]Y. K. Lin, C. T. Yeh. Optimal resource assignment to maximize multistate network reliability for a com-puter network[J]. Computers and Operations Research,2010,37(12):2229-2238.
[84]Y.K. Lin. On transmission time through k minimal paths of a capacitated-flow network[J]. Applied Mathematical Modelling,2010,34(2):245-253.
[85]Y.K. Lin. Spare routing problem with p minimal paths for time-based stochastic flow networks[J]. Applied Mathematical Modelling,2011,35(3):1427-1438.
[86]X.Z. Xu, Y.F. Niu. A hybrid algorithm for reliability evaluation of a multi-state system[J]. Journal of the Chinese Institute of Engineers,2002,1-7.
[87]Y.K. Lin, C.T. Yeh. Multistate components assignment problem with optimal network reliability subject to assignment budget[J]. Applied Mathematics and Computation,2011,217(24):10074-10086.
[88]Y.K. Lin. A method to evaluate routing policy through p minimal paths for stochastic case[J]. Information Sciences,2010,180(23):4595-4605.
[89]C.C. Jane, Y.W. Laih. Evaluating cost and reliability integrated performance of stochastic logistics sys-tems[J]. Naval Research Logistics,2012,59(7):577-586.
[90]S.G. Chen, Y.K. Lin. An approximate algorithm for the robust design in a stochastic-flow network[J]. Communications in Statistics-Theory and Methods,2010,39(13):2440-2454.
[91]S.G. Chen, Y.K. Lin. Search for all minimal paths in a general large flow network[J]. IEEE Transactions on Reliability,2012,61(4):949-956.
[92]T. Zhang, B. Guo. Capacitated stochastic coloured petri net-based approach for computing two-terminal reliability of multi-state network[J]. Journal of Systems Engineering and Electronics,2012,23(2):304-313.
[93]K. Schneider, C. Rainwater, E. Pohl, I. Hernandez, J.E. Ramirez-Marquez. Social network analysis via multi-state reliability and conditional influence models[J]. Reliability Engineering and System Safety, 2013,109:99-109.
[94]J.D. Esary,F. Proschan. Coherent structures of non-identical components[J]. AD报告0237968,1962, 1-38.
[95]C.C. Jane, Y.W. Laih. A dynamic bounding algorithm for approximating multi-state two-terminal relia-bility[J]. European Journal of Operational Research,2010,205(3):625-637.
[96]S. Satitsatian, K.C. Kapur. An algorithm for lower reliability bounds of multistate two-terminal network-s[J]. IEEE Transactions on Reliability,2006,55(2):199-206.
[97]M.O. Ball, J.S. Provan. Calculating bounds on reachability and connectedness in stochastic networks[J]. Networks,1983,13(2):253-278.
[98]T.B. Brecht, C.J. Colbourn. Lower bounds on two-terminal network reliability[J]. Discrete Applied Mathematics,1988,21(3):185-198.
[99]M. Djerdjour, K. Rekab. A branch and bound algorithm for designing reliable systems at a minimum cost[J]. Applied Mathematics and Computation,2001,118:247-259.
[100]I. Gunawan. Redundant paths and reliability bounds in gamma networks[J]. Applied Mathematical Mod-elling,2008,32(4):588-594.
[101]Y. Niu, F.M. Shao. A practical bounding algorithm for computing two-terminal reliability based on de-composition technique[J]. Computers and Mathematics with Applications,2011,61(8):2241-2246.
[102]A.M. Shooman. Algorithms for network reliability and connection availability analysis[J]. IEEE Trans-actions on Reliability,1995,44(10):309-333.
[103]R. Arnon. Series-parallel reduction for difficult measures of network reliability[J]. Networks,1981, 11(4):323-334.
[104]L.P. Resnde. Implementation of a factoring algorithm for reliability evaluation of undirected networks[J]. IEEE Transactions on Reliability,1988,37(5):462-468.
[105]S.J. Hsu, M. Yuang. Efficient computation of terminal-pair reliability using triangle reduction in network management[J]. IEEE International Conference on Communications,1988,281-285.
[106]H. Cancela, M. Khadiri. Series-parallel reductions in monte carlo network-reliability evaluation[J]. IEEE Transactions on Reliability,1998,47(2):159-164.
[107]G.S. Fishman. A comparison of four monte-carlo methods for estimating the probability of s-t connected-ness[J]. IEEE Transactions on Reliability,1996,35(2):144-155.
[108]G.S. Fishman. Estimation the s-t reliability function using importance and stratified samping[J]. Comput-ers and Operations Research,1989,37(4):462-473.
[109]K.P. Hui. Monte carlo networks reliability ranking estimation[J]. IEEE Transactions on Reliability,2007, 56(1):50-57.
[110]J.Y. Lin. A monte carlo simulation to determine minimal cut sets and system reliability. In IEEE Proceed-ings Annual Reliability and Maintainability Symposium.1993,246-249.
[111]E. Zio, L. Podofillini. Monte carlo simulation analysis of the effects of different system performance levels on the importance of multi-state components [J]. Reliability Engineering and System Safety,2003, 82(1):63-67.
[112]E. Zio, L. Podofillini, G. Levitin. Estimation of the importance measures of multi-state elements by monte carlo simulation[J]. Reliability Engineering and System Safety,2004,86(3):191-204.
[113]E. Zio, M. Marella, L. Podofillini. A monte carlo simulation approach to the availability assessment of multi-state systems with operational dependencies[J]. Reliability Engineering and System Safety,2007, 92(7):871-882.
[114]J. E. Ramirez-Marquez, D.W. Coit. A monte-carlo simulation approach for approximating multi-state two-terminal reliability [J]. Reliability Engineering and System Safety,2005,87(2):253-264.
[115]W.C. Yeh. An improved monte-carlo method for estimating the continuous-state network one-to-one reliability[J]. WSEAS Transaction on Systems,2007,6(5):959-966.
[116]W.C. Yeh, Y.C. Lin, Y.K. Chung. Performance analysis of cellular automata monte carlo simulation for estimating network reliability [J]. Expert Systems with Applications,2010,37(5):3537-3544.
[117]H.F. Ge, S. Asgarpoor. Parallel monte carlo simulation for reliability and cost evaluation of equipment and systems[J]. Electric Power Systems Research,2011,81(2):347-356.
[118]H. Haroonabadia, M.R. Haghifam. Generation reliability assessment in power markets using monte carlo simulation and soft computing[J]. Applied Soft Computing,2011,11(8):5292-5298.
[119]叶剑,席裕庚,曲润涛.基于遗传算法的可靠性网络规划设计[J].通信技术,1999.
[120]刘强,李积源.基于遗传算法的通信网络可靠性优化设计[J].海军工程大学学报,2001,13(6)：102-106.
[121]郭丹城,慕春隶.并行遗传算法在一类计算机网络可靠性优化问题中的应用[J].系统工程理论与实践,2003,23(1)：31-36.
[122]高尚,杨静宇,吴小俊.可靠性优化的蚁群算法[J].计算机应用与软件,2004,21(12)：94-96.
[123]W.C. Yeh, Y.C. Lin, Y.Y. Chung, M.C. Chih. A particle swarm optimization approach based on monte carlo simulation for solving the complex network reliability problem[J]. IEEE Transactions on Reliability, 2010,59(1):212.
[124]李扬.基于智能计算的计算机网络可靠性分析研究[J].计算机技术与发展,2006,16(8)：77-82.
[125]A. Baca. Examples of monte carlo methods in reliability estimation based on reduction of prior informa- tion[J]. IEEE Transactions on Reliability,1993,42(4):645-649.
[126]M. Al-Kuwaiti, N. Kyriakopoulos, S. Hussein. A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability[J]. IEEE Communications Surveys and Tutorials,2009, 11(2):106-124.
[127]陆陆.列控系统及其计算机网络的故障诊断与故障容错研究[D].[硕士学位论文],杭州,浙江大学,2012.
[128]W.J. Zhuang, M. Xie. Design and analysis of some fault-tolcrancc configurations based on a multipath principle[J]. Journal of Systems and Software,1994,25(1):101-108.
[129]J.L. Marzo, E. Calle, C. Scoglio, T. Anjali. Qos online routing and mpls multilevel protection:A survey[J]. IEEE Communications Magazine,2003,41(10):126-132.
[130]J. Tapolcai, P.H. Ho, A. Haque. Trop:A novel approximate link-state dissemination framework for dynamic survivable routing in mpls networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2008,19(3):311-322.
[131]L. Li, M.M. Buddhikot, C. Chekuri, K. Guo. Routing bandwidth guaranteed paths with local restoration in label switched networks[J]. IEEE Journal on Selected Areas in Communications,2005,23(2):437-449.
[132]P.J. Chuang. Cgin:a fault tolerant modified gamma interconnection network[J]. IEEE Transactions on Parallel and Distributed Systems,1996,7(12):1301-1306.
[133]Y.J. Suh, B.V. Dao, J. Duato, S. Yalamanchili. Software-based rerouting for fault-tolerant pipelined com-munication[J]. IEEE Transactions on Parallel and Distributed Systems,2000,11(3):193-211.
[134]I. Theiss, O. Lysne. Froots:A fault tolerant and topology-flexible routing tcchnique[J]. IEEE Transactions on Parallel and Distributed Systems,2006,17(10):1136-1150.
[135]Y. Li, Z. Lan, P. Gujrati, X.H. Sun. Fault-aware runtime strategies for high-performance computing[J]. IEEE Transactions on Parallel and Distributed Systems,2009,20(4):460-473.
1136] G. Song, O. Yang, S. Yantai. Improving source routing reliability in mobile ad hoc networks[J]. IEEE Transactions on Parallel and Distributed Systems,2005,16(4):362-373.
[137]M.M.A. Azim, X. Jiang, P.H. Ho, S. Horiguchi, M. Guo. Restoration probability modelling for active restoration-based optical networks with correlation among backup routes[J]. IEEE Transactions on Paral-lel and Distributed Systems,2007,18(11):1592-1606.
[138]S. Ramasubramanian, A. Chandak. Dual-link failure resiliency through backup link mutual exclusion[J]. IEEE/ACM Transactions on Networking,2008,16(1):157-169.
[139]S. Nelakuditi, S. Lee, Y. Yu, Z. Zhang, C. Chuah. Fast local rerouting for handling transient link failures[J]. IEEE/ACM Transactions on Networking,2007,15(2):359-372.
[140]G. Zarza, D. Lugones, D. Franco, E. Luque. A multipath faulttolerant routing method for high-speed interconnection networks[J]. Lecture Notes in Computer Science,2009,5704/2009:1078-1088.
[141]S. Kini, S. Ramasubramanian, A. Kvalbein, A.F. Hansen. Fast recovery from dual-link or single-node failures in ip networks using tunneling[J]. IEEE Transactions on Networking,2010,18(6):1988-1999.
[142]P. Francois. An evaluation of ip-based fast reroute techniques. In Proceedings of the 2005 ACM Confer-ence on Emerging Network Experiment and Technology. New York, USA,2005,244-245.
[143]J.P. Vasseur, M. Pickavet, P. Demeester. Network Recovery:Protection and Restoration of Optical, SONET-SDH, and MPLS[M]. Morgan Kaufmann,2004.
[144]K.-S. Sohn, S.Y. Nam, D.K. Sung. A spare bandwidth sharing scheme based on network reliability[J]. IEEE Transactions on reliability,2005,54(1):123-132.
[145]K.-S. Sohn, S.Y. Nam, D.K. Sung. A distributed lsp scheme to reduce spare bandwidth demand in mpls networks[J]. IEEE Transactions on Communications,2006,54(7):1277-1288.
[146]Y.K. Lin. Network reliability of a time-based multistate network under spare routing with p minimal paths[J]. IEEE Transactions on reliability,2011,60(1):61-69.
[147]B. Brody, J. Doucette. Fast efficient design of shared backup path protected networks using a multi-flow optimization model[J]. IEEE Transactions on Reliability,2011,60(4):788-800.
[148]Q. Guo, P.H. Ho, H.F. Yu, J. Tapolcai, H.T. Mouftah. Spare capacity reprovisioning for high availability shared backup path protection connections[J]. Computer Communications,2010,33(5):603-611.
[149]W.J. Jia, W. Zhao, D. Xuan, G.C. Xu. Efficient fault-tolerant multicast routing protocol with core-based tree techniques[J]. IEEE Transactions on Parallel and Distributed Systems,1999,10(10):984-1000.
[150]N. Ayari, D. Barbron, L. Lefevre, P. Primet. Fault tolerance for highly available internet services:concepts, approaches, and issues[J]. IEEE Communications Surveys & Tutorials,2008,10(2):34-46.
[151]Q. Zheng, B. Veeravalli. On the design of communication-aware fault-tolerant scheduling algorithms for precedence constrained tasks in grid computing systems with dedicated communication devices[J]. Journal of Parallel and Distributed Computing,2009,69(3):282-294.
[152]L. Guo, J. Cao, X. Wang, C. Yu, W. Hou. A new protection algorithm with consideration of lightpath load in fault-tolerant gmpls optical networks[J]. Optik,2010,121 (21):1919-1924.
[153]T.H. Szymanski, D. Gilbert. Provisioning mission-critical telerobotic control systems over internet back-bone networks with essentially-perfect qos[J]. IEEE Journal on Selected Areas in Communications,2010, 28(5):630-643.
[154]K. Valarmathi, N. Malmurugan. Multi path routing protocol for improving reliability in ieee 802.16 wire-less mesh networks. In 3rd International Conference on Trendz in Information Sciences and Computing (TISC 2011).2011,116-121.
[155]R. Cohen, G. Nakibly. Maximizing restorable throughput in mpls networks[J]. IEEE/ACM Transactions on Networking,2010,18(2):568-581.
[156]S. Kwong, D.W.F. Lam, K.S. Tang. Optimization of spare capacity in self-healing multicast atm network using genetic algorithm[J]. IEEE Transactions on Industrial Electronics,2000,47(6):1334-1343.
[157]Q. Zheng, M. Gurusamy. Lsp partial spatial-protection in mpls over wdm optical networks[J]. IEEE Transactions on Communications,2009,57(4):1109-1118.
[158]V.Y. Liu, D. Tipper. Spare capacity allocation using shared backup path protection for dual link failures. In 8th International Workshop on the Design of Reliable Communication Networks (DRCN 2011).2011, 118-125.
[159]Y. Liu, D. Tipper, P. Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing[J]. IEEE/ACM Transactions on Networking,2005,13(1):198-211.
[160]A. Chakrabarti. Reliability constrained routing in qos networks[J]. IEEE/ACM Transactions on Network-ing,2005,13(3):662-675.
[161]J. Li, K.L. Yeung. A novel two-step approach to restorable dynamic qos routing[J]. Journal of Lightwave Technology,2005,23(11):3663-3670.
[162]K.K. Aggarwa, J.S. Kupta, K.B. Misra. A simple method for reliability evaluation of a communication system[J], IEEE Transactions on Communications,1975,23(5):563-565.
[163]S.H. Lee. Reliability evaluation of a How nelwork[J]. IEEE Transactions on Reliability,1980,29(1):24-26.
[1641 K.K. Aggarwal, S. Rai. Reliability evaluation in computer-communication[J]. IEEE Transactions on Reliability,1981,30(1):32-35.
[165]M. Aggarwal, V.K. Sharma. Ant colony approach to constrained redundancy optimization in binary sys-tems[J]. Applied Mathematical Modelling,2010,34(4):992-1003.
[166]C. Jackson, A. Mosleh. Downwards inference:Bayesian analysis of overlapping higher-level data sets of complex binary-state on-demand systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(2):182-193.
[167]J.S. Lin. Reliability evaluation of capacitated-flow networks with budget constraints[J]. IIE Transactions, 1998,30:1175-1180.
[168]C.C. Hsieh, Y.T. Chen. Reliable and economic resource allocation in an unreliable flow nelwork[J]. Computers and Operations Research,2005,32(12):613-628.
[169]A. Habib, R.O. Al-Seedy, T. Radwan. Reliability evaluation of multi-stale consecutive k-out-of-r-from-n: G system[J]. Applied Mathematical Modelling,2007,31(11):2412-2423.
[170]E. Zio. Reliability engineering:Old problems and new challenges[J]. Reliability Engineering and System Safety,2009,94(2):125-141.
[171]A. Lisnianski, G. Levitin. Multi state system reliability:assessment, optimization, and applications[M]. Word Scientific Publishing,2003.
[172]A. Carrigy, J.E. Ramirez-Marquez, C.M. Rocco. Multistate stochastic network interdiction via reliability modelling and evolutionary optimization[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2010,224(4):27-42.
[173]K. Hausken, G. Levitin. Defence of homogeneous parallel multi-state systems subject to two sequential attacks[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability, 2010,224(3):171-183.
[174]C. Jackson, A. Mosleh. Bayesian inference with overlapping data:methodology for reliability estimation of multi-state on-demand systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(3):283-294.
[175]C.C. Jane, J.S. Lin, J. Yuan. Reliability evaluation of a limited-flow network in terms of minimal cutsets[J]. IEEE Transactions on Reliability,1993,42(3):354-361,368.
[176]W.C. Yeh. Multistate-node acyclic networks reliability evaluation based on mc[J]. Reliability Engineering and System Safety,2003,81(2):225-231.
[177]W. Ych. A simple mc-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes[J]. Reliability Engineering and System Safety,2004,83(1):47-55.
[178]J.C. Hudson, K.C. Kapur. Reliability analysis for multistate systems with multistate components[J]. HE Transactions,1983,15(2):127-134.
[179]J. E. Ramirez-Marquez, D. Coit. Alternative approach for analyzing multistate network reliability. In Proceedings of the Industrial Engineering Research Centre. Portland, Oregon,2003.
[180]S.K. Chaturvedi, S.H. Basha, S.V. Amari, M.J. Zuo. Reliability analysis of generalized multi-state k-out-of-n systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(3):327-336.
[181]M. Marseguerra, E. Zio, L. Podofillini, D.W. Coit. Optimal design of reliable network systems in presence of uncertainty[J]. IEEE Transactions on Reliability,2005,54(2):243-253.
[182]C.M. Rocco S., M. Muselli. Approximate multi-state reliability expressions using a new machine learning technique[J]. Reliability Engineering and System Safety,2005,89(3):261-270.
[183]J.F. Castet, J.H. Saleh. Beyond reliability, multi-state failure analysis of satellite subsystems:A statistical approach[J]. Reliability Engineering and System Safety,2010,95(4):311-322.
[184]J. E. Ramirez-Marquez, B. Gebre. A classification tree based approach for the development of minimal cut and path vectors of a network[J]. IEEE Transactions on Reliability,2007,56(3):474-487.
[185]Y.K. Lin. Reliability of k separate minimal paths under both time and budget constraints[J]. IEEE Trans-actions on Reliability,2010,59(1):183-190.
[186]Y.K. Lin. Calculation of minimal capacity vectors through k minimal paths under budget and time con-straints[J]. European Journal of Operational Research,2010,200(1):160-169.
[187]C. C. Hsien, M. H. Lin. Reliability-oriented multi-resource allocation in a stochastic-flow network[J]. Reliability Engineering and System Safety,2003,81(2):155-161.
[188]C. C. Hsien, Y. T. Chen. Simple algorithms for updating multi-resource allocations in an unreliable flow network[J]. Computers and Industrial Engineering,2006,50(1-2):120-129.
[189]L.R. Ford, D.R. Fulkerson. Flows in networks[M]. New Jersey, USA:Princeton University Press,1962.
[190]G. Levitin, A. Lisnianski. A new approach to solving problems of multi-state system reliability optimiza-tion[J]. Quality and Reliability Engineering International,2001,17(2):93-104.
[191]W. T. Xu, S. W. He, R. Song, J. Li. Reliability based assignment in stochastic flow freight nelwork[J]. Applied Mathematics and Computation,2009,211(1):85-94.
[192]K. Deb, A. Pratap, S. Agarwal, T. Meyarivan. A fast and elitist multiobjective genetic algorithm:Nsga-ii[J]. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[193]H. Li, Q. F. Zhang. Multiobjective optimization problems with complicated pareto sets, moea/d and nsga-ii[J], IEEE Transactions on Evolutionary Computation,2009,13(2):284-302.
[194]S. Kannan, S. Baskar, J. D. Mccalley, P. Murugan. Application of nsga-ii algorithm to generation expan-sion planning[J]. IEEE Transactions on Power Systems,2009,24(1):454-461.
[195]Y. Yusoff, M. S. Ngadiman, A. M. Zain. Overview of nsga-ii for optimizing machining process parame-ters[J]. Procedia Engineering,2011,15:3978-3983.
[196]W. You, M. X. Kong, L. N. Sun, Z. J. Du. Optimal design of dynamic and control performance for planar manipulator[J]. Journal of Central South University,2012,19(1):108-116.
[197]G. H. Hu, Z. Z. Mao, D. K. He. Multi-objective optimization for leaching process using improved two-stage guide pso algorithm[J]. Journal of Central South University,2011,18(4):1200-1210.
[198]R. Yarlagadda, J. Hershey. Fast algorithm for computing the reliability of communication network[J]. International Journal of Electronics,1991,70:549-564.
[199]S. Misra, S.K. Dhurandher, M.S. Obaidat, K. Verma, P. Gupta. A low-overhead fault-tolerant routing algorithm for mobile ad hoc networks:A scheme and its simulation analysis[J]. Simulation Modelling Practice and Theory,2010,18(5):637-649.
[200]J.W. Lin, H.Y. Liu. Redirection based recovery for mpls network systems[J]. Journal of Systems and Software,2010,83(4):609-620.
[201]E. Rosen, A. Viswanathan, R. Callon. Multiprotocol label switching architecture[J]. IETF RFC 3031, 2001.
[202]D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus. Requirement for traffic engineering over mpls[J]. IETF RFC 2702,1999.
[203]A. Urra, E. Calle, J.L. Marzo. Reliable services with fast protection in ip/mpls over optical networks[J]. Journal of Optical Networking,2006,5(11):870-880.
[204]N. Ogino, H. Tanaka. Optimum arrangement of reliable label-switched paths in mpls over optical net-works[J]. Telecommunication Systems,2006,31(1):29-41.
[205]W.K. Lai, Z.C. Zheng, C.-D. Tsai. Fast reroute with pre-established bypass tunnel in mpls[J]. Computer Communications,2008,31 (9):1660-1671.
[206]P.H. Ho, J. Tapolcai, A. Haque. Spare capacity reprovisioning for shared backup path protection in dy-namic generalized multi-protocol label switched networks[J]. IEEE Transactions on Reliability,2008, 57(4):551-563.
[207]A. Mereu, D. Cherubini, A. Fanni, A. Frangioni. Primary and backup paths optimal design for traffic engineering in hybrid igp/mpls networks. In 7th International Workshop on Design of Reliable Commu-nication Networks (DRCN 2009).2009,273-280.
[208]C.C. Huang, V. Sharma, K. Owens, S. Makam. Building reliable mpls networks using a path protection mechanism[J]. IEEE Communications Magazine,2002,40(3):156-162.
[209]F. Palmieri. Exploiting enhanced reliability features in mpls traffic engineered optical speed networks[J]. Advances in Communications and Software Technologies,2002,29-34.
[210]M. Golash. Reliability in ethernet networks:A survey of various approaches [J]. Bell Labs Technical Journal,2006,11(3):161-171.
[211]A. Sprintson, M. Yannuzzi, A. Orda, X. Masip-Bruin. Reliable routing with qos guarantees for multi-domain ip/mpls networks. In 26th IEEE International Conference on Computer Communications (IEEE INFOCOM 2007).2007,1820-1828.
[212]D. Coudert, F. Huc, F. Peix, M. E. Voge. Reliability of connections in multilayer networks under shared risk groups and costs constraints. In IEEE International Conference on Communications (ICC 2008). 2008,5170-5174.
[2]C.C. Jane, W.H. Shen, Y.W. Laih. Practical sequential bounds for approximating two-terminal reliabili-ty [J]. European Journal of Operational Research,2009,195(2):427-441.
[3]Y.K. Lin. Spare routing reliability for a stochastic flow network through two minimal paths under budget constraint[J]. IEEE Transactions on reliability,2010,59(1):2-10.
[4]Y. K. Lin, C. T. Yeh. Multi-objective optimization for stochastic computer networks using nsga-ii and topsis[J]. European Journal of Operational Research,2012,218(3):735-746.
[5]夏长义.浅谈计算机网络的重要性[J].计算机光盘软件与应用,2000,5.
[6]滕云微.网络可靠性分析系统的设计与实现[J].计算机信息,2008,24(6)：129-131.
[7]苗亮.计算机网络可靠性的研究[J].机械工程与自动化,2010,3.
[8]赖彩凤.计算机网络可靠性的研究[J].计算机光盘软件与应用,2010,15.
[9]卢民.保证通信网可靠性的路由研究[D].[硕士学位论文],济南,山东师范大学,2009.
[10]赵娟,郭平,吴俊,邓宏钟,谭跃进.复杂网络可靠性研究进展[J].后勤工程学院学报,2010,26(5).
[11]张永富.保证通信网可靠性的路由研究[D].[硕士学位论文],南京,南京邮电大学,2008.
[12]熊蔚明,刘有恒.关于通信网可靠性的研究进展[J].通信学报,1990,11(4)：4449.
[13]郭伟.野战地域通信网可靠性的评价方法[J].电子学报,2000,28(1)：3-6.
[14]刘君.计算机网络可靠性优化设计问题的研究[D].[硕士学位论文],沈阳,沈阳工业大学,2006.
[15]龚波,张文,杨红霞.网络基础[M].北京：电子工业出版社,2003.
[16]A. Behr, L. Camarinopoulos, G. Pampoukis. Domination of k-out-of-n systems[J]. IEEE Transactions on Reliability,1995,44(4):705-707.
[17]冯海林.网络系统中可靠性问题的研究[D].[博士学位论文],西安,西安电子科技大学,2004.
[18]K.D. Reed.网络设计[M].北京：电子工业出版社,2003.
[19]C.J. Colbourn. The combinatorics of network reliability[M]. New York:Oxford University Press,1987.
[20]H. Frank, I.T. Frisch. Analysis and design of survivable networks[J]. IEEE Transactions on Communica-tion Technology,1970,18(5):501-519.
[21]D.R. Shier. Network reliability and algebraic structures[M]. Oxford:Clarendon Press,1991.
[22]M.O.Ball. Complexity of network reliability computations[J]. Networks,1980,10:153-165.
[23]肖宇峰.基于离散概率模型的二端网络可靠性分析[D].[硕士学位论文],北京,北京邮电大学,2009.
[24]D. Cavendish, H. Ohta, H. Rakotoranto. Operation, administration, and maintenance in mpls networks[J]. IEEE Communications Magazine,2004,4(3):91-99.
[25]D. Medhi. A unified approach to network reliability for teletrafic networks:Models, algorithms and analysis[J]. IEEE Transactions on Communications,2004,42:534-548.
[26]孔繁甲,王光兴.无线广播网络的可靠性分析[J].电子学报,1999,27(6)：76-78.
[27]周联红,伍翔,王一超,冯重熙.一种光纤通信系统可用性的算法及分析[J].电子学报,2001,29(12)：1713-1716.
[28]R. Doverspike. Trends in layered network management of atm, sonet, and wdm technologies for network reliability and fault management[J]. Journal of Network and Systems Management,1997,5(2):215-220.
[29]A. Hac. Improving reliability through architecture partitioning in telecommunication networks[J]. IEEE Journal on Selected Areas in Communications,1994,12(1):193-204.
[30]S.B. Liu, K.H. Cheng, X.P. Liu. Network reliability with mode failures[J]. Networks,2000,35(2):109-117.
[31]D.T.O. Patrick.实用可靠度工程,第四版[M].北京：电子工业出版社,2004.
[32]M.O. Ball. Computational complexity of network reliability analysis:An overview[J]. IEEE Transactions on Reliability,1986,35(3):230-239.
[33]陈育斌,李建东,陈家模.计算通信网络整体概率连通性的一种新算法[J].通信学报,2000,21(9)：91-96.
[34]A. Satyanarayana, A. Prabhakar. New topological formula and rapid algorithm for reliability analysis of complex networks[J]. IEEE Transactions on Reliability,1978,27(2):82-100.
[35]A. Satyanarayana, J.N. Hagstrom. A new algorithm for reliability analysis of multi-terminal networks[J]. IEEE Transactions on Reliability,1981,30(4):325-334.
[36]A. Satyanarayana. A unified formula for analysis of some network reliability problems[J]. IEEE Trans-actions on Reliability,1982,31(1):23-32.
[37]J.A. Buzacott. Node partition formula for directed graph reliability[J]. Networks,1987,17:227-240.
[38]J.A. Buzacott. An implementation of the buzacott algorithm for network global-reliabilty[J]. IEEE Trans-actions on Reliability,1993,42(1):46-49.
[39]L.C. Zhao, F.J. Kong. A new formula and an algorithm for reliability analysis of network[J]. Microelec-tronics Reliability,1997,37(3):511-518.
[40]K. Dohmen. Inclusion-exclusion and network reliability [J]. The Electronic Journal of Combinatorics, 1998,5:1-8.
[41]李瑞莹,康锐.网络可靠性评价研究综述[J].可靠性工程,2008.
[42]J.G. Shathikumar. Reliability of systems with consective minimal cutsets[J]. IEEE transactions on Relia-bility,1987,36(3):546-550.
[43]金星.大型网络系统可靠度计算新方法[J].系统仿真学报,2001,13(4)：432-433.
[44]W.C. Yeh. A simple minimal path method for estimating the weighted multi-commodity multistate unre-liable networks reliability[J]. Reliability Engineering and System Safety,2008,93(1):125-136.
[45]J.C. Hudson, K.C. Kapur. Reliability bounds for multistate systems with multistate components[J]. Oper-ations Research,1985,33(1):153-160.
[46]J. Xue. On multistate system analysis[J]. IEEE Transactions on Reliability,1985,34(4):329-337.
[47]P.M. Lin, B.J. Leon, T.C. Huang. A new algorithm for symbolic reliability analysis[J]. IEEE Transactions on Reliability,1976,25:2-15.
[48]孙艳蕊,赵连昌,张祥德.计算网络可靠度的容斥原理算法[J].小型微型计算机系统,2007,28(5)：830-833.
[49]吴俊,段东立,赵娟,李俊,邓宏钟,谭跃进.网络系统可靠性研究现状与展望[J].复杂系统与复杂性科学,2011,8(2)：77-86.
[50]S. Rai, M. Veeraraghavan, K.S. Trivedi. A survey of efficient reliability computation using disjoint prod-ucts approach[J]. Networks,1995,25:147-163.
[51]C.C. Jane, J. Yuan. A-sum-of-disjoint-products-algorithm-for-reliability-evaluation-of-flow-networks[J]. European Journal of Operational Research,2001,131(3):664-675.
[52]J.M. Wilson. An improved minimizing algorithm for sum of disjoint products[J]. IEEE Transactions on Reliability,1990,39(1):42-45.
[53]L. Fratta, U. Montanari. A boolean algebra method for computing the terminal reliability in a communi-cation network[J]. IEEE Transactions on Circuit Theory,1973,20(3):203-211.
[54]D. Torrieri. Calculation of node-pair reliability in large networks with unreliable nodes[J]. IEEE Trans-actions on Reliability,1994,43(3):375-377.
[55]J.A. Abraham. An improved algorithm for network reliability[J]. IEEE Transactions on Reliability,1979, 28(1):58-61.
[56]F. Beichelt, L. Spross. An improved abraham-method for generating disjoint sums[J]. IEEE Transactions on Reliability,1987,36(1):70-74.
[57]W.C. Yeh. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths[J]. Reliability Engineering and System Safety,2007,92:260-268.
[58]K.D. Heidtmanr. Smaller sums of disjoint products by subproduct inversion[J]. IEEE Transactions on Reliability,1989,38(3):305-311.
[59]M. Veeraraghavan, K.S. Trivedi. An improved algorithm for the symbolic reliability analysis of network-s[J]. IEEE Transactions on Reliability,1991,40:347-358.
[60]L.C. Zhao, J.C. Xu. An efficient minimizing algorithm for sum of disjoint products[J]. Microelectronics Reliability,1995,35(8):1157-1162.
[61]L. Fratta, U. Montanari. A recursive method based on case analysis for computing network terminal reliability[J]. IEEE Transactions on Communications,1978,26(8):1166-1177.
[62]M.O. Locks, J.M. Wilson. Note on disjoint product algorithm[J]. IEEE Transactions on Reliability,1992, 41(1):81-84.
[63]T. Luo, K.S. Trivedi. An improved algorithm for coherent-system reliability[J]. IEEE Transactions on Reliability,1998,47(l):73-78.
[64]M.J. Zuo, Z. Tian, H.Z. Huang. An efficient method for reliability evaluation of multistatc networks given all minimal path vectors[J]. IEEE Transactions on Reliability,2007,39(8):811-817.
[65]Y. K. Lin, C. T. Yeh. Maximal network reliability with optimal transmission line assignment for stochastic electric power networks via genetic algorithms[J]. Applied Soft Computing,2011,11(2):2714-2724.
[66]Y. K. Lin, L. C-L. Yeng. Evaluation of network reliability for computer networks with multiple sources[J]. Mathematical Problems in Engineering,2012,2012:18 pages.
[67]F. Moskowitz. The analysis of redundancy networks[J]. IEEE Transactions on Communications and Electronic,1958,39:627-632.
[68]H.Mine. Reliability of physical systems[J]. IEEE Transactions on Circuit Theory,1958, CT-6:138-151.
[69]A. Satyanarayana, M.K. Chang. Network reliability and factoring theory[J]. Networks,1983,20:107-120.
[70]R.K. Wood. A factoring algorithm using polygon-to-chain reductions for computing k-terminal network reliability[J]. Networks,1985,15:173-190.
[71]L.B. Page, J.E. Perry. Combining vertex decompositions with factoring in an all terminal network relia-bility algorithm[J]. Microelectronics Reliability,1990,30(2):249-262.
[72]O. Theologou, J. Carlier. Factoring and reductions for networks interests with imperfect vcrtices[J]. IEEE Transactions on Reliability,1991,40(2):210-217.
[73]R.K. Wood. Factoring algorithm for computing k-terminal reliability[J]. IEEE Transactions on Reliability, 1986,35(4):269-278.
[74]L.B. Page, J.E. Perry. Reliability of directed networks using the factoring theorem[J]. IEEE Transactions on Reliability,1989,38(5):556-562.
[75]E.S. Elmallah. Algorithm for k-terminal reliability problems with node failures[J]. Networks,1992, 22:369-384.
[76]P. Doulliez, E. Jamoulle. Transportation networks with random arc capacities[J]. RAIRO,1972,3:45-60.
[77]Y. K. Lin, C. T. Yeh. Evaluation of optimal network reliability under components-assignments subject to a transmission budget[J]. IEEE Transactions on Reliability,2010,59(3):539-550.
[78]J. S. Lin, C. C. Jane, J. Yuan. On reliability evaluation of capacitated flow network in terms of minimal pathsets[J]. Networks,1995,25(3):131-138.
[79]T. Aven. Reliability evaluation of multistate systems with multistate components[J]. IEEE Transactions on Reliability,1985,34(5):473-479.
[80]C. Alcxopoulos. Note on state-space decomposition methods for analyzing stochastic flow networks[J]. IEEE Transactions on Reliability,1995,44:354-357.
[81]C.C. Jane, Y.W. Laih. A practical algorithm for computing multi-state two-terminal reliability [J]. IEEE Transactions on Reliability,2008,57:295-302.
[82]C.C. Jane, Y.W. Laih. Computing multi-state two-terminal reliability through critical arc states that inter-rupt demand[J]. IEEE Transactions on Reliability,2010,59(2):338-345.
[83]Y. K. Lin, C. T. Yeh. Optimal resource assignment to maximize multistate network reliability for a com-puter network[J]. Computers and Operations Research,2010,37(12):2229-2238.
[84]Y.K. Lin. On transmission time through k minimal paths of a capacitated-flow network[J]. Applied Mathematical Modelling,2010,34(2):245-253.
[85]Y.K. Lin. Spare routing problem with p minimal paths for time-based stochastic flow networks[J]. Applied Mathematical Modelling,2011,35(3):1427-1438.
[86]X.Z. Xu, Y.F. Niu. A hybrid algorithm for reliability evaluation of a multi-state system[J]. Journal of the Chinese Institute of Engineers,2002,1-7.
[87]Y.K. Lin, C.T. Yeh. Multistate components assignment problem with optimal network reliability subject to assignment budget[J]. Applied Mathematics and Computation,2011,217(24):10074-10086.
[88]Y.K. Lin. A method to evaluate routing policy through p minimal paths for stochastic case[J]. Information Sciences,2010,180(23):4595-4605.
[89]C.C. Jane, Y.W. Laih. Evaluating cost and reliability integrated performance of stochastic logistics sys-tems[J]. Naval Research Logistics,2012,59(7):577-586.
[90]S.G. Chen, Y.K. Lin. An approximate algorithm for the robust design in a stochastic-flow network[J]. Communications in Statistics-Theory and Methods,2010,39(13):2440-2454.
[91]S.G. Chen, Y.K. Lin. Search for all minimal paths in a general large flow network[J]. IEEE Transactions on Reliability,2012,61(4):949-956.
[92]T. Zhang, B. Guo. Capacitated stochastic coloured petri net-based approach for computing two-terminal reliability of multi-state network[J]. Journal of Systems Engineering and Electronics,2012,23(2):304-313.
[93]K. Schneider, C. Rainwater, E. Pohl, I. Hernandez, J.E. Ramirez-Marquez. Social network analysis via multi-state reliability and conditional influence models[J]. Reliability Engineering and System Safety, 2013,109:99-109.
[94]J.D. Esary,F. Proschan. Coherent structures of non-identical components[J]. AD报告0237968,1962, 1-38.
[95]C.C. Jane, Y.W. Laih. A dynamic bounding algorithm for approximating multi-state two-terminal relia-bility[J]. European Journal of Operational Research,2010,205(3):625-637.
[96]S. Satitsatian, K.C. Kapur. An algorithm for lower reliability bounds of multistate two-terminal network-s[J]. IEEE Transactions on Reliability,2006,55(2):199-206.
[97]M.O. Ball, J.S. Provan. Calculating bounds on reachability and connectedness in stochastic networks[J]. Networks,1983,13(2):253-278.
[98]T.B. Brecht, C.J. Colbourn. Lower bounds on two-terminal network reliability[J]. Discrete Applied Mathematics,1988,21(3):185-198.
[99]M. Djerdjour, K. Rekab. A branch and bound algorithm for designing reliable systems at a minimum cost[J]. Applied Mathematics and Computation,2001,118:247-259.
[100]I. Gunawan. Redundant paths and reliability bounds in gamma networks[J]. Applied Mathematical Mod-elling,2008,32(4):588-594.
[101]Y. Niu, F.M. Shao. A practical bounding algorithm for computing two-terminal reliability based on de-composition technique[J]. Computers and Mathematics with Applications,2011,61(8):2241-2246.
[102]A.M. Shooman. Algorithms for network reliability and connection availability analysis[J]. IEEE Trans-actions on Reliability,1995,44(10):309-333.
[103]R. Arnon. Series-parallel reduction for difficult measures of network reliability[J]. Networks,1981, 11(4):323-334.
[104]L.P. Resnde. Implementation of a factoring algorithm for reliability evaluation of undirected networks[J]. IEEE Transactions on Reliability,1988,37(5):462-468.
[105]S.J. Hsu, M. Yuang. Efficient computation of terminal-pair reliability using triangle reduction in network management[J]. IEEE International Conference on Communications,1988,281-285.
[106]H. Cancela, M. Khadiri. Series-parallel reductions in monte carlo network-reliability evaluation[J]. IEEE Transactions on Reliability,1998,47(2):159-164.
[107]G.S. Fishman. A comparison of four monte-carlo methods for estimating the probability of s-t connected-ness[J]. IEEE Transactions on Reliability,1996,35(2):144-155.
[108]G.S. Fishman. Estimation the s-t reliability function using importance and stratified samping[J]. Comput-ers and Operations Research,1989,37(4):462-473.
[109]K.P. Hui. Monte carlo networks reliability ranking estimation[J]. IEEE Transactions on Reliability,2007, 56(1):50-57.
[110]J.Y. Lin. A monte carlo simulation to determine minimal cut sets and system reliability. In IEEE Proceed-ings Annual Reliability and Maintainability Symposium.1993,246-249.
[111]E. Zio, L. Podofillini. Monte carlo simulation analysis of the effects of different system performance levels on the importance of multi-state components [J]. Reliability Engineering and System Safety,2003, 82(1):63-67.
[112]E. Zio, L. Podofillini, G. Levitin. Estimation of the importance measures of multi-state elements by monte carlo simulation[J]. Reliability Engineering and System Safety,2004,86(3):191-204.
[113]E. Zio, M. Marella, L. Podofillini. A monte carlo simulation approach to the availability assessment of multi-state systems with operational dependencies[J]. Reliability Engineering and System Safety,2007, 92(7):871-882.
[114]J. E. Ramirez-Marquez, D.W. Coit. A monte-carlo simulation approach for approximating multi-state two-terminal reliability [J]. Reliability Engineering and System Safety,2005,87(2):253-264.
[115]W.C. Yeh. An improved monte-carlo method for estimating the continuous-state network one-to-one reliability[J]. WSEAS Transaction on Systems,2007,6(5):959-966.
[116]W.C. Yeh, Y.C. Lin, Y.K. Chung. Performance analysis of cellular automata monte carlo simulation for estimating network reliability [J]. Expert Systems with Applications,2010,37(5):3537-3544.
[117]H.F. Ge, S. Asgarpoor. Parallel monte carlo simulation for reliability and cost evaluation of equipment and systems[J]. Electric Power Systems Research,2011,81(2):347-356.
[118]H. Haroonabadia, M.R. Haghifam. Generation reliability assessment in power markets using monte carlo simulation and soft computing[J]. Applied Soft Computing,2011,11(8):5292-5298.
[119]叶剑,席裕庚,曲润涛.基于遗传算法的可靠性网络规划设计[J].通信技术,1999.
[120]刘强,李积源.基于遗传算法的通信网络可靠性优化设计[J].海军工程大学学报,2001,13(6)：102-106.
[121]郭丹城,慕春隶.并行遗传算法在一类计算机网络可靠性优化问题中的应用[J].系统工程理论与实践,2003,23(1)：31-36.
[122]高尚,杨静宇,吴小俊.可靠性优化的蚁群算法[J].计算机应用与软件,2004,21(12)：94-96.
[123]W.C. Yeh, Y.C. Lin, Y.Y. Chung, M.C. Chih. A particle swarm optimization approach based on monte carlo simulation for solving the complex network reliability problem[J]. IEEE Transactions on Reliability, 2010,59(1):212.
[124]李扬.基于智能计算的计算机网络可靠性分析研究[J].计算机技术与发展,2006,16(8)：77-82.
[125]A. Baca. Examples of monte carlo methods in reliability estimation based on reduction of prior informa- tion[J]. IEEE Transactions on Reliability,1993,42(4):645-649.
[126]M. Al-Kuwaiti, N. Kyriakopoulos, S. Hussein. A comparative analysis of network dependability, fault-tolerance, reliability, security, and survivability[J]. IEEE Communications Surveys and Tutorials,2009, 11(2):106-124.
[127]陆陆.列控系统及其计算机网络的故障诊断与故障容错研究[D].[硕士学位论文],杭州,浙江大学,2012.
[128]W.J. Zhuang, M. Xie. Design and analysis of some fault-tolcrancc configurations based on a multipath principle[J]. Journal of Systems and Software,1994,25(1):101-108.
[129]J.L. Marzo, E. Calle, C. Scoglio, T. Anjali. Qos online routing and mpls multilevel protection:A survey[J]. IEEE Communications Magazine,2003,41(10):126-132.
[130]J. Tapolcai, P.H. Ho, A. Haque. Trop:A novel approximate link-state dissemination framework for dynamic survivable routing in mpls networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2008,19(3):311-322.
[131]L. Li, M.M. Buddhikot, C. Chekuri, K. Guo. Routing bandwidth guaranteed paths with local restoration in label switched networks[J]. IEEE Journal on Selected Areas in Communications,2005,23(2):437-449.
[132]P.J. Chuang. Cgin:a fault tolerant modified gamma interconnection network[J]. IEEE Transactions on Parallel and Distributed Systems,1996,7(12):1301-1306.
[133]Y.J. Suh, B.V. Dao, J. Duato, S. Yalamanchili. Software-based rerouting for fault-tolerant pipelined com-munication[J]. IEEE Transactions on Parallel and Distributed Systems,2000,11(3):193-211.
[134]I. Theiss, O. Lysne. Froots:A fault tolerant and topology-flexible routing tcchnique[J]. IEEE Transactions on Parallel and Distributed Systems,2006,17(10):1136-1150.
[135]Y. Li, Z. Lan, P. Gujrati, X.H. Sun. Fault-aware runtime strategies for high-performance computing[J]. IEEE Transactions on Parallel and Distributed Systems,2009,20(4):460-473.
1136] G. Song, O. Yang, S. Yantai. Improving source routing reliability in mobile ad hoc networks[J]. IEEE Transactions on Parallel and Distributed Systems,2005,16(4):362-373.
[137]M.M.A. Azim, X. Jiang, P.H. Ho, S. Horiguchi, M. Guo. Restoration probability modelling for active restoration-based optical networks with correlation among backup routes[J]. IEEE Transactions on Paral-lel and Distributed Systems,2007,18(11):1592-1606.
[138]S. Ramasubramanian, A. Chandak. Dual-link failure resiliency through backup link mutual exclusion[J]. IEEE/ACM Transactions on Networking,2008,16(1):157-169.
[139]S. Nelakuditi, S. Lee, Y. Yu, Z. Zhang, C. Chuah. Fast local rerouting for handling transient link failures[J]. IEEE/ACM Transactions on Networking,2007,15(2):359-372.
[140]G. Zarza, D. Lugones, D. Franco, E. Luque. A multipath faulttolerant routing method for high-speed interconnection networks[J]. Lecture Notes in Computer Science,2009,5704/2009:1078-1088.
[141]S. Kini, S. Ramasubramanian, A. Kvalbein, A.F. Hansen. Fast recovery from dual-link or single-node failures in ip networks using tunneling[J]. IEEE Transactions on Networking,2010,18(6):1988-1999.
[142]P. Francois. An evaluation of ip-based fast reroute techniques. In Proceedings of the 2005 ACM Confer-ence on Emerging Network Experiment and Technology. New York, USA,2005,244-245.
[143]J.P. Vasseur, M. Pickavet, P. Demeester. Network Recovery:Protection and Restoration of Optical, SONET-SDH, and MPLS[M]. Morgan Kaufmann,2004.
[144]K.-S. Sohn, S.Y. Nam, D.K. Sung. A spare bandwidth sharing scheme based on network reliability[J]. IEEE Transactions on reliability,2005,54(1):123-132.
[145]K.-S. Sohn, S.Y. Nam, D.K. Sung. A distributed lsp scheme to reduce spare bandwidth demand in mpls networks[J]. IEEE Transactions on Communications,2006,54(7):1277-1288.
[146]Y.K. Lin. Network reliability of a time-based multistate network under spare routing with p minimal paths[J]. IEEE Transactions on reliability,2011,60(1):61-69.
[147]B. Brody, J. Doucette. Fast efficient design of shared backup path protected networks using a multi-flow optimization model[J]. IEEE Transactions on Reliability,2011,60(4):788-800.
[148]Q. Guo, P.H. Ho, H.F. Yu, J. Tapolcai, H.T. Mouftah. Spare capacity reprovisioning for high availability shared backup path protection connections[J]. Computer Communications,2010,33(5):603-611.
[149]W.J. Jia, W. Zhao, D. Xuan, G.C. Xu. Efficient fault-tolerant multicast routing protocol with core-based tree techniques[J]. IEEE Transactions on Parallel and Distributed Systems,1999,10(10):984-1000.
[150]N. Ayari, D. Barbron, L. Lefevre, P. Primet. Fault tolerance for highly available internet services:concepts, approaches, and issues[J]. IEEE Communications Surveys & Tutorials,2008,10(2):34-46.
[151]Q. Zheng, B. Veeravalli. On the design of communication-aware fault-tolerant scheduling algorithms for precedence constrained tasks in grid computing systems with dedicated communication devices[J]. Journal of Parallel and Distributed Computing,2009,69(3):282-294.
[152]L. Guo, J. Cao, X. Wang, C. Yu, W. Hou. A new protection algorithm with consideration of lightpath load in fault-tolerant gmpls optical networks[J]. Optik,2010,121 (21):1919-1924.
[153]T.H. Szymanski, D. Gilbert. Provisioning mission-critical telerobotic control systems over internet back-bone networks with essentially-perfect qos[J]. IEEE Journal on Selected Areas in Communications,2010, 28(5):630-643.
[154]K. Valarmathi, N. Malmurugan. Multi path routing protocol for improving reliability in ieee 802.16 wire-less mesh networks. In 3rd International Conference on Trendz in Information Sciences and Computing (TISC 2011).2011,116-121.
[155]R. Cohen, G. Nakibly. Maximizing restorable throughput in mpls networks[J]. IEEE/ACM Transactions on Networking,2010,18(2):568-581.
[156]S. Kwong, D.W.F. Lam, K.S. Tang. Optimization of spare capacity in self-healing multicast atm network using genetic algorithm[J]. IEEE Transactions on Industrial Electronics,2000,47(6):1334-1343.
[157]Q. Zheng, M. Gurusamy. Lsp partial spatial-protection in mpls over wdm optical networks[J]. IEEE Transactions on Communications,2009,57(4):1109-1118.
[158]V.Y. Liu, D. Tipper. Spare capacity allocation using shared backup path protection for dual link failures. In 8th International Workshop on the Design of Reliable Communication Networks (DRCN 2011).2011, 118-125.
[159]Y. Liu, D. Tipper, P. Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing[J]. IEEE/ACM Transactions on Networking,2005,13(1):198-211.
[160]A. Chakrabarti. Reliability constrained routing in qos networks[J]. IEEE/ACM Transactions on Network-ing,2005,13(3):662-675.
[161]J. Li, K.L. Yeung. A novel two-step approach to restorable dynamic qos routing[J]. Journal of Lightwave Technology,2005,23(11):3663-3670.
[162]K.K. Aggarwa, J.S. Kupta, K.B. Misra. A simple method for reliability evaluation of a communication system[J], IEEE Transactions on Communications,1975,23(5):563-565.
[163]S.H. Lee. Reliability evaluation of a How nelwork[J]. IEEE Transactions on Reliability,1980,29(1):24-26.
[1641 K.K. Aggarwal, S. Rai. Reliability evaluation in computer-communication[J]. IEEE Transactions on Reliability,1981,30(1):32-35.
[165]M. Aggarwal, V.K. Sharma. Ant colony approach to constrained redundancy optimization in binary sys-tems[J]. Applied Mathematical Modelling,2010,34(4):992-1003.
[166]C. Jackson, A. Mosleh. Downwards inference:Bayesian analysis of overlapping higher-level data sets of complex binary-state on-demand systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(2):182-193.
[167]J.S. Lin. Reliability evaluation of capacitated-flow networks with budget constraints[J]. IIE Transactions, 1998,30:1175-1180.
[168]C.C. Hsieh, Y.T. Chen. Reliable and economic resource allocation in an unreliable flow nelwork[J]. Computers and Operations Research,2005,32(12):613-628.
[169]A. Habib, R.O. Al-Seedy, T. Radwan. Reliability evaluation of multi-stale consecutive k-out-of-r-from-n: G system[J]. Applied Mathematical Modelling,2007,31(11):2412-2423.
[170]E. Zio. Reliability engineering:Old problems and new challenges[J]. Reliability Engineering and System Safety,2009,94(2):125-141.
[171]A. Lisnianski, G. Levitin. Multi state system reliability:assessment, optimization, and applications[M]. Word Scientific Publishing,2003.
[172]A. Carrigy, J.E. Ramirez-Marquez, C.M. Rocco. Multistate stochastic network interdiction via reliability modelling and evolutionary optimization[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2010,224(4):27-42.
[173]K. Hausken, G. Levitin. Defence of homogeneous parallel multi-state systems subject to two sequential attacks[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability, 2010,224(3):171-183.
[174]C. Jackson, A. Mosleh. Bayesian inference with overlapping data:methodology for reliability estimation of multi-state on-demand systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(3):283-294.
[175]C.C. Jane, J.S. Lin, J. Yuan. Reliability evaluation of a limited-flow network in terms of minimal cutsets[J]. IEEE Transactions on Reliability,1993,42(3):354-361,368.
[176]W.C. Yeh. Multistate-node acyclic networks reliability evaluation based on mc[J]. Reliability Engineering and System Safety,2003,81(2):225-231.
[177]W. Ych. A simple mc-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes[J]. Reliability Engineering and System Safety,2004,83(1):47-55.
[178]J.C. Hudson, K.C. Kapur. Reliability analysis for multistate systems with multistate components[J]. HE Transactions,1983,15(2):127-134.
[179]J. E. Ramirez-Marquez, D. Coit. Alternative approach for analyzing multistate network reliability. In Proceedings of the Industrial Engineering Research Centre. Portland, Oregon,2003.
[180]S.K. Chaturvedi, S.H. Basha, S.V. Amari, M.J. Zuo. Reliability analysis of generalized multi-state k-out-of-n systems[J]. Proceedings of the Institution of Mechanical Engineers Part O-Journal of Risk and Reliability,2012,226(3):327-336.
[181]M. Marseguerra, E. Zio, L. Podofillini, D.W. Coit. Optimal design of reliable network systems in presence of uncertainty[J]. IEEE Transactions on Reliability,2005,54(2):243-253.
[182]C.M. Rocco S., M. Muselli. Approximate multi-state reliability expressions using a new machine learning technique[J]. Reliability Engineering and System Safety,2005,89(3):261-270.
[183]J.F. Castet, J.H. Saleh. Beyond reliability, multi-state failure analysis of satellite subsystems:A statistical approach[J]. Reliability Engineering and System Safety,2010,95(4):311-322.
[184]J. E. Ramirez-Marquez, B. Gebre. A classification tree based approach for the development of minimal cut and path vectors of a network[J]. IEEE Transactions on Reliability,2007,56(3):474-487.
[185]Y.K. Lin. Reliability of k separate minimal paths under both time and budget constraints[J]. IEEE Trans-actions on Reliability,2010,59(1):183-190.
[186]Y.K. Lin. Calculation of minimal capacity vectors through k minimal paths under budget and time con-straints[J]. European Journal of Operational Research,2010,200(1):160-169.
[187]C. C. Hsien, M. H. Lin. Reliability-oriented multi-resource allocation in a stochastic-flow network[J]. Reliability Engineering and System Safety,2003,81(2):155-161.
[188]C. C. Hsien, Y. T. Chen. Simple algorithms for updating multi-resource allocations in an unreliable flow network[J]. Computers and Industrial Engineering,2006,50(1-2):120-129.
[189]L.R. Ford, D.R. Fulkerson. Flows in networks[M]. New Jersey, USA:Princeton University Press,1962.
[190]G. Levitin, A. Lisnianski. A new approach to solving problems of multi-state system reliability optimiza-tion[J]. Quality and Reliability Engineering International,2001,17(2):93-104.
[191]W. T. Xu, S. W. He, R. Song, J. Li. Reliability based assignment in stochastic flow freight nelwork[J]. Applied Mathematics and Computation,2009,211(1):85-94.
[192]K. Deb, A. Pratap, S. Agarwal, T. Meyarivan. A fast and elitist multiobjective genetic algorithm:Nsga-ii[J]. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[193]H. Li, Q. F. Zhang. Multiobjective optimization problems with complicated pareto sets, moea/d and nsga-ii[J], IEEE Transactions on Evolutionary Computation,2009,13(2):284-302.
[194]S. Kannan, S. Baskar, J. D. Mccalley, P. Murugan. Application of nsga-ii algorithm to generation expan-sion planning[J]. IEEE Transactions on Power Systems,2009,24(1):454-461.
[195]Y. Yusoff, M. S. Ngadiman, A. M. Zain. Overview of nsga-ii for optimizing machining process parame-ters[J]. Procedia Engineering,2011,15:3978-3983.
[196]W. You, M. X. Kong, L. N. Sun, Z. J. Du. Optimal design of dynamic and control performance for planar manipulator[J]. Journal of Central South University,2012,19(1):108-116.
[197]G. H. Hu, Z. Z. Mao, D. K. He. Multi-objective optimization for leaching process using improved two-stage guide pso algorithm[J]. Journal of Central South University,2011,18(4):1200-1210.
[198]R. Yarlagadda, J. Hershey. Fast algorithm for computing the reliability of communication network[J]. International Journal of Electronics,1991,70:549-564.
[199]S. Misra, S.K. Dhurandher, M.S. Obaidat, K. Verma, P. Gupta. A low-overhead fault-tolerant routing algorithm for mobile ad hoc networks:A scheme and its simulation analysis[J]. Simulation Modelling Practice and Theory,2010,18(5):637-649.
[200]J.W. Lin, H.Y. Liu. Redirection based recovery for mpls network systems[J]. Journal of Systems and Software,2010,83(4):609-620.
[201]E. Rosen, A. Viswanathan, R. Callon. Multiprotocol label switching architecture[J]. IETF RFC 3031, 2001.
[202]D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus. Requirement for traffic engineering over mpls[J]. IETF RFC 2702,1999.
[203]A. Urra, E. Calle, J.L. Marzo. Reliable services with fast protection in ip/mpls over optical networks[J]. Journal of Optical Networking,2006,5(11):870-880.
[204]N. Ogino, H. Tanaka. Optimum arrangement of reliable label-switched paths in mpls over optical net-works[J]. Telecommunication Systems,2006,31(1):29-41.
[205]W.K. Lai, Z.C. Zheng, C.-D. Tsai. Fast reroute with pre-established bypass tunnel in mpls[J]. Computer Communications,2008,31 (9):1660-1671.
[206]P.H. Ho, J. Tapolcai, A. Haque. Spare capacity reprovisioning for shared backup path protection in dy-namic generalized multi-protocol label switched networks[J]. IEEE Transactions on Reliability,2008, 57(4):551-563.
[207]A. Mereu, D. Cherubini, A. Fanni, A. Frangioni. Primary and backup paths optimal design for traffic engineering in hybrid igp/mpls networks. In 7th International Workshop on Design of Reliable Commu-nication Networks (DRCN 2009).2009,273-280.
[208]C.C. Huang, V. Sharma, K. Owens, S. Makam. Building reliable mpls networks using a path protection mechanism[J]. IEEE Communications Magazine,2002,40(3):156-162.
[209]F. Palmieri. Exploiting enhanced reliability features in mpls traffic engineered optical speed networks[J]. Advances in Communications and Software Technologies,2002,29-34.
[210]M. Golash. Reliability in ethernet networks:A survey of various approaches [J]. Bell Labs Technical Journal,2006,11(3):161-171.
[211]A. Sprintson, M. Yannuzzi, A. Orda, X. Masip-Bruin. Reliable routing with qos guarantees for multi-domain ip/mpls networks. In 26th IEEE International Conference on Computer Communications (IEEE INFOCOM 2007).2007,1820-1828.
[212]D. Coudert, F. Huc, F. Peix, M. E. Voge. Reliability of connections in multilayer networks under shared risk groups and costs constraints. In IEEE International Conference on Communications (ICC 2008). 2008,5170-5174.