期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于网络传输特性的链路重要性评价方法 被引量：2

An evaluation method for link importance based on the characteristic of network communication
下载PDF
导出
摘要 提出了一种基于网络传输特性的链路重要性评价方法,根据链路在网络所有节点相互通信的最短路径中的使用频度来评价链路重要性,最重要链路的使用频度最高。该方法不需要像目前的链路重要性评价方法那样进行链路收缩和删除,直接反映了链路对整个网络通信的贡献大小,可以判断通信网中任意两条链路的相对重要性。算法分析和实验仿真表明,文章算法克服了目前的评价方法存在的问题,给出了更直观合理的通信网链路重要性评价准则。 A method for finding the most vital edge based on the characteristic of network communication is proposed. The link importance is determined by its using frequency in all-pairs shortest paths and the most vital edge results in the highest frequency. Without the commonly used edge-deletion and edge-contraction methods, the proposed algorithm directly reflects the edge＇ s contribution to the network communication and the relative importance of the two edges in the network can be evaluated. The algorithm analyses and the experimental results show that this algorithm overcomes the currently existent problems and provides a more reasonable principle for ranking edges which is consistent with our intuitive judgments.
作者 姜禹 胡爱群 何明
机构地区 东南大学信息科学与工程学院
出处 《中国工程科学》 2009年第9期64-67,73,共5页 Strategic Study of CAE
基金 国家242信息安全计划资助课题(2006A07) 国家高技术研究发展计划"八六三"项目(2007AA01Z432 2007AA01Z433)
关键词 通信网 链路重要性 最短路径 串联链路 communication networks link importance shortest paths serial links
分类号 TN913.21 [电子电信—通信与信息系统]
  • 相关文献

参考文献14

  • 1Malik 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.
  • 2Ball 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.
  • 3NardeUi 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.
  • 5Page L B, Perry J E. Reliability polynomials and hnk importance in networks[J]. IEEE Trans Reliability,1994,43( 1 ) : 51 -58.
  • 6Liang Weifa. Finding the k most vital edges with respect to minimum spanning trees for fixed k [ J ]. Discrete Applied Mathematics, 2001,113(2 -3) : 319 -327.
  • 7Liang Weifa, Shen Xiaojun. Finding the k most vital edges in the minimum spanning tree problem [ J ]. Parallel Computing, 1997, (23 -13) : 1889 -1907.
  • 8Tsen F P, Sung T Y, Lin M Y, et al. Finding the most vital edges with respect to the number of spanning trees[J]. IEEE Trans Reliability, 1994,43 (4) :600 - 602.
  • 9Rao V V B. Most - vital edge of a graph with respect to spanning trees[ J]. IEEE Trans Reliability, 1998,47 ( 1 ) :6 - 7.
  • 10陈勇,胡爱群,蔡天佑,钟子果.通信网中链路重要性的评价方法[J].电子学报,2003,31(4):573-575. 被引量：26

二级参考文献9

  • 1F P Tsen, T Y Sung, M Y Lin, et al. Finding the most vital edges with respect to the number of spanning trees [ J ]. IEEE Trans Reliability,1994,43(4) :600 - 602.
  • 2M O Ball, B L Golden, R V Vohra. Finding the most vital arcs in a network [J]. Operations Research Letters, 1989,8:73 - 76.
  • 3L B Page, J E Perry. Reliability polynomials and link importance in networks[J]. IEEE Trans. Reliability, 1994,43( 1 ):51 - 58.
  • 4E Nardelli, G Proietti, P Widmayer. Finding the detour-critical edge of a shortest path between two nodes [ J ]. Information Processing Letters,1998,67(1):51 -54.
  • 5E Nardelli, G Proietti, P Widmayer. A faster computation of the most vital edge of a shortest path [J]. Information Processing Letters,2001,79(2) :81 - 85.
  • 6L Traldi. Commentary on: Reliability polynomials and link importance in Networks [J]. IEEE Tmns Reliability,2000,49(3) :322.
  • 7L H Hsu,R H Jan,Y C Lee,et al. Finding the most vital edge with respect to minimum spanning tree in weighted graphs [J]. Information Processing Letters, 1991,39:277 - 281.
  • 8V V B Rao. Most-vital edge of a graph with respect to spanning trees[ J ]. IEEE Trans. Reliability, 1998,47 ( 1 ) :6 - 7.
  • 9M N S Swamy, K Thulasiraman. Graphs, Networks, and Algorithms[ M ]. New York : John Wiley & Sons Inc, 1981.

共引文献25

同被引文献17

  • 1曾宪钊.网络科学[M].北京:军事科学出版社,2007.
  • 2BALL M OGOLDEN B LVOHRA R V.Finding the most vital arcs in a network[J].Operations Research Letters 19898:73-76.
  • 3PAGE L BPERRY J E.Reliability polynomials and link importance in networks[J].IEEE Transaction Reliability199443(1):51-58.
  • 4NARDELLI 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.
  • 5NARDELLI 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.
  • 6TRALDI L.Commentary on:Reliability polynomials and link importance in networks [J].IEEE Transaction Reliability200049(3):51-58.
  • 7HSU 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.
  • 8PAGE L BPERRY J E.Reliability polynomials and link importance in networks[J].IEEE Transaction Reliability 199443(1):51-58.
  • 9SWAMY M N STHULASIRAMAN K.Graphsnetworks and algorithms[M].New York: John Wiley & Sons Inc1981.
  • 10TSEN F PSUNG T YLIN M Yet al.Finding the most vital edges with respect to the number of spanning trees [J].IEEE Transaction Reliability199443(4):600-602.

引证文献2

二级引证文献2

中国工程科学
2009年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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