期刊文献+

基于边收缩方法的网络化信息系统链路重要性评估 被引量:2

Evaluation for Link Importance of Networked Information System Based on Edge-Contraction Method
下载PDF
导出
摘要 链路重要性对于确定链路维修顺序、链路防护级别以及网络拓扑优化具有重要意义。从链路正常工作的角度出发,提出基于图论的边收缩方法,认为网络化信息系统网络拓扑模型的某条边收缩后,得到的图对应的生成树数目越多,则该边对应的链路对于网络化信息系统的重要程度越高。运用该方法评价了某网络化信息系统(局部)各链路的重要性,评价结果与实际吻合,证明了该方法的可行性。 Link importance has an important significance for confirming link servicing sequence, link defense level and network topology optimization. Edge-contraction method based on graph theory is proposed. This method supposed that the more the number of spanning trees, the higher importance level the corresponding link for networked information system after contraction one edge of networked information system network topology model. Link importance of one networked information system (partial) was evaluated by this method. The result is consistent with practice, and the feasibility of this method is proved.
出处 《电光与控制》 北大核心 2013年第4期27-30,共4页 Electronics Optics & Control
基金 国家自然科学基金项目(61174162)
关键词 网络化信息系统 复杂网络 链路重要性 边收缩 networked information system complex network link importance edge-contraction
  • 相关文献

参考文献14

  • 1BALL M OGOLDEN B LVOHRA R V.Finding the most vital arcs in a network[J].Operations Research Letters 19898:73-76.
  • 2PAGE L BPERRY J E.Reliability polynomials and link importance in networks[J].IEEE Transaction Reliability199443(1):51-58.
  • 3NARDELLI 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.
  • 4NARDELLI 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.
  • 5TRALDI L.Commentary on:Reliability polynomials and link importance in networks [J].IEEE Transaction Reliability200049(3):51-58.
  • 6HSU L HJAN R H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.
  • 7姜禹,胡爱群,何明.基于网络传输特性的链路重要性评价方法[J].中国工程科学,2009,11(9):64-67. 被引量:2
  • 8PAGE L BPERRY J E.Reliability polynomials and link importance in networks[J].IEEE Transaction Reliability 199443(1):51-58.
  • 9赵勃,肖宇峰,刘岩.基于OBDD的通信网链路重要性评估[J].系统工程与电子技术,2011,33(10):2348-2352. 被引量:11
  • 10曾宪钊.网络科学[M].北京:军事科学出版社,2007.

二级参考文献42

  • 1Tsen F P,Sung T Y,Lin M Y,et al.Finding the most vital edges with respect to the number of spanning trces[J].IEEE Trans Reliability,1994,43(4):600-602.
  • 2Rao V.Most-vital edge of a graph with respect to spanning trees[J].IEEE Trans Reliability,1998,47(1):6-7.
  • 3Page L B,Perry J E.Reliability polynomials and link importance in networks[J].IEEE Trans Reliability,1994,43(1):51-58.
  • 4Nardelli 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.
  • 5Traldi L.Commentary on:Reliability polynomials and link importance in Networks[J].IEEE Trans Reliability,2000,49(3):322.
  • 6Malik K, Mittal A K, Gupta S K. The k most vital arcs in the shortest path problem[ J]. Operations Research Letters, 1990,9(4) : 283.
  • 7Ball M O, Golden B L, Vohra R V. Finding the most vital arcs in a network[J]. Operations Research Letters, 1989,8(2) : 73 -76.
  • 8NardeUi 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.
  • 9Nardelli 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.
  • 10Page L B, Perry J E. Reliability polynomials and hnk importance in networks[J]. IEEE Trans Reliability,1994,43( 1 ) : 51 -58.

共引文献44

同被引文献13

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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