期刊文献+

浅谈边失效可靠性研究的主要内容及进展

Introduction of Edge Failure Reliability
下载PDF
导出
摘要 无论对于点失效、边失效还是点边混合失效网络模型,精确计算任意网络的可靠度都是NP-hard问题;随着现代网络规模的不断扩大,快速精确地计算可靠度是一个摆在我们面前的现实难题.因此,部分研究者关注于网络可靠度上下界的确定问题.采用相对简单的计算方法,通过网络可靠度上下界值评估网络可靠性,以此对网络可靠性分析和可靠性综合提供有价值的参考依据.针对网络可靠性分析和综合的研究十分活跃,内容也十分丰富,主要包括边失效情况下网络可靠性的分析与设计,点失效情况下网络可靠性的分析与设计和点边混合失效情况下网络可靠性的分析与设计,主要针对网络在规定的条件下和规定的时间内的生存能力和网络在规定的条件下和规定的时间内完成规定任务的能力. In reality ,because of the nodes of the network and link circuit failure ,some network function is reduced ,and even the whole network become invalid .So analyzing the reliability of network and desig‐ning a reliable network are of great significance .Either point invalidity ,edge invalidity or the mixed failure network model ,precise calculation of arbitrary network reliability is NP -hard problem .With the continu‐ous expansion of modern network ,quickly and accurately calculate reliability is a realistic problem in front of us .Therefore ,some researchers focus on upper and lower boundary of network reliability problems ,u‐sing relatively simple calculation method ,w hich provides a valuable reference basis for the analysis of net‐work reliability and network reliability integration .Research for network reliability analysis and integration is extremely active ,and the content is very rich ,including on the condition of edge invalidity ,network re‐liability analysis and integration ,compared the case of network reliability point of failure analysis and de‐sign with mixed -point edge network under failure conditions reliability analysis and design ,mainly for network’s ability to survive in specified condition and in limited time ,and within the stipulated time to complete the task .
作者 郭道军
出处 《青海师范大学学报(自然科学版)》 2015年第2期20-22,共3页 Journal of Qinghai Normal University(Natural Science Edition)
关键词 网络 边失效点 连通可靠性 上下界 network graph edge invalidity point on the connected reliability upper and lower bound-ary
  • 相关文献

参考文献12

  • 1A. T. Amin. K. T. Siegrist-P. J. Slater. On uniformly optimal reliable graphs for pair- connected reliability with vertex failures[J]. Networks.1993. 23: 791-794.
  • 2A. T. Amin. K. T. Siegrist-P, J. Slater. pair- connected reliability of a tree and its distance degree sequence[J]. Congress Numerantium , 1987.58:43-52.
  • 3A. T. Amin. K. T. Siegrist. P. J. Slater. The expected number of pairs of connected nodes pair- connected reliability[J]. Mathl comput Modelling. 1993 .17 ,1-11.
  • 4Boesch F T .? Li X.Suffel C. On the existence of uniformly optimally reliable networks[J]. Networksv l ps l , 21: 181-194.
  • 5Chang Yung- Ruei, Lin Hung- Yan, A Cut Based Algorithm for reliability analysis of terminal pair network using OBDD [C] Proceeding of the Annual international Computer Software and Application Conference. Washington: IEEE Computer Society.2003:368-373.
  • 6Charles .J. Colbourn. The combinatories of network reliability[M]. Oxord iDxford University Press. 1987.
  • 7Shier. D. R. Network Reliability and algebraic structures. Oxford: Clarendon Press .199l.
  • 8D. H. Smith. Optimally reliable graphs for both vertex and edge failures. Combine probab and comput[J]. 1993.2: 93 -100.
  • 9F. T. Boesch ,x, Ls Stivaros -C, Suffel. Reliable graphs with unreliable nodes. Graph Theory .Combinatorics and applications[M]. 1991.1: 159-177.
  • 10J. S. Provan. The complexity of reliability computation in planar and acyclic graphs[J]. University of North Carolina Technical Report. 1983.2:279-290.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部