期刊文献+

基于可靠性指标的通信网链路重要性评估方法 被引量:11

Evaluation Method of the Link Significance of Communication Network Based on Reliability Index
下载PDF
导出
摘要 为了全面和客观地评估通信网各链路的重要性,引入了归一化容量加权可靠性指标概念,并从通信网络总体及局部两个考察角度均定义了指标,其一是研究涵盖网络所有节点之间可靠性的总容量归一化加权可靠性指标,另一是只研究指定两节点间可靠性的最大容量归一化加权可靠性指标。研究出一套自成体系的可靠性指标计算方法,由于算法将所有运算环节均转化为代数或逻辑代数化计算,所以易于用计算机编程运算,解决了人工计算繁琐问题,论证了算法的正确性与合理性。以链路失效对可靠性指标影响程度作为评价标准,介绍了评估链路重要性的方法。通过算例详细计算一种典型拓扑结构通信网络的可靠性指标,并从不同角度评估了各链路的重要性。 In order to evaluate the significance of each link of a communication network comprehensively and objectively, this paper introduced the normalized reliability index weighted by capacity, which is defined totally and locally respectively. One definition is the normalized reliability index weighted by the total capacity between all the network nodes and the other definition is the normalized reliability index weighted by the maximum capacity between two appointed nodes. This paper studied a systematical algorithm of reliability index, for which all the calculations are transformed to be algebraic and logic, so it is easy to design program and the complex manual calculations are avoided. The correctness and rationality are validated. By taking the effect degree of link invalidation on the reliability index as the evaluation criterion, the evaluation method of the link significance is introduced. As an example, the reliability index of a communication network with typical topology is calculated in detail, which evaluated the link significance from different aspects.
出处 《南京邮电大学学报(自然科学版)》 EI 2007年第1期11-19,共9页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
关键词 通信网 性能预测 路由算法 通信链路 通信容量 Communication network Performance prediction Route algorithm Communication link Communication capacity
  • 相关文献

参考文献22

  • 1陈勇,胡爱群,蔡天佑,钟子果.通信网中链路重要性的评价方法[J].电子学报,2003,31(4):573-575. 被引量:26
  • 2RAO V B.Most-vital edge of a graph with respect to spanning trees[J].IEEE Trans on Reliability,1998,47(1):6-7.
  • 3TSEN F P,SUNG T Y,YLIN M,et al.Finding the most vital edges with respect to the number of spanning trees[J].IEEE Trans on Reliability,1994,43(4):600-602.
  • 4PAGE L B,PERRY J E.Reliability polynomials and link importance in networks[J].IEEE Trans on Reliability,1994,43(1):51-58.
  • 5NARDELLI 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.
  • 6NARDELLI 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.
  • 7TRALDI L.Commentary on:Reliability polynomials and link importance in networks[J].IEEE Trans on Reliability,2000,49(3):322.
  • 8HSU L H,HJAN R,LEE Y C,et al.Finding the most vital edge with respect to minimum spanning tree in weighted graphs[J].Information Processing Letters,1991,39:277-281.
  • 9熊庆旭,刘有恒.基于网络状态之间关系的网络的可靠性分析[J].通信学报,1998,19(3):55-61. 被引量:12
  • 10陈坚,孙小菡,张明德.一种基于最小路径的通信网络可靠性分析[J].电子器件,2003,26(4):447-450. 被引量:20

二级参考文献49

  • 1周炯磐.通信网理论基础[M].北京:人民邮电出版社,1991..
  • 2[1]WILKOV R S.Analysis and design of reliable conputer networks[J].IEEE Trans Communication, 1972,20(6) :660-678.
  • 3[2]ABRAHAM J A.An improved algoritlun for network reliability[J]. IEEETrans Reliability, 1979,28(1): 58-61,
  • 4[3]YU Y G,YUANG M C.A cut-based method for terminal-pair reliability [J]. IEEE Trans Reliability, 1996,43 (3) :413-416.
  • 5[4]FORD L R, FULKERSON D R. Flowss in networks [M]. Priuceton. New Jersey: Princeton University Press, 1962.1-35.
  • 6[5]EDMONDS J, KARP R M.Theoretical improvements in algorithmic efficiency for network flow problem[J] .J ACM, 1972,19(2) :248-264.
  • 7[6]DIN1C E A. Algorithm for solution of a problem of maximal flow in a network with power estimation[J]. Soviet Math Dokl, 1970, 11: 1277-1280.
  • 8[7]KARZANOV A V. Determining the maximal flow in a metwork by the method of preflows[J].Soviet Math Dokl,1974,15:434-437.
  • 9[9]VARSHNEY P K. JOSHI A R,CHANG P L. Reliability modeling und performance evaluation of variable link capacity networks[J]. IEEE Trans Reliability, 1994,43(3) :378-382.
  • 10[10]STRAYER H J,COLBOURN C J.Bounding flow-performance in probabilistic weightod networks[J]. IEEE: Trans Reliability, 1997,46 (1) :3-10

共引文献90

同被引文献88

引证文献11

二级引证文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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