期刊文献+

基于网络性能变化梯度的通信网络节点重要程度评价方法 被引量:30

Node importance evaluation based on communication network performance grads
原文传递
导出
摘要 针对已有的通信网络节点重要程度评价方法基于网络中可替换路由数目,不能评估网络被分割时网络中节点的重要性的不足,提出了一种利用网络性能变化梯度的通信网络节点重要性评价方法。该方法通过计算网络中的节点被移除时网络直径和网络连通度变化梯度来评估网络中节点的重要性。利用该算法对美国ARPA网络的节点重要程度进行了分析,并与基于可替换路由数目的算法进行了比较。实验结果表明,该文提出的节点重要程度评价指标准确地反映了节点对网络性能影响的大小,并且适用于网络被分割或网络没有被分割2种情况。 Node importance evaluation based on the number of alternative routes in a communication network cannot accurately reflect the importance of the nodes when the network is split into several disconnected parts. An improved node importance evaluation method was developed based on performance decreasing grads. In this method, the node importance is evaluated by calculating the diameter variation and the connection ratio decrease of the network when the node is disconnected. The algorithm is compared with the alternative route-based algorithm for the ARPA net topology. The results show that this method accurately represents the node importance, both when the network is split into several unconnected parts and when the network is connected as one part.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第4期541-544,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学重点基金资助项目(60572006) 国家自然科学重大国际合作基金资助项目(6052130298)
关键词 通信网络 节点重要性 网络直径 连通度 communication network node importance diameter of network connection ratio
  • 相关文献

参考文献8

二级参考文献25

  • 1PAGE L, PERRY J. Reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 1994,43(1):51-58.
  • 2TRALDI L. Commentary on: reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 2000,49(3):322.
  • 3RAO V. Most-vital edge of a graph with respect to spanning trees[J]. IEEE Transactions on Reliability, 1998, 47(1):6-7.
  • 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.
  • 5CORLEY H, SHAD. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
  • 6NARDELLI E, PROIETTI G. WIDMAYER P. Finding the most vital node of a shortest path[A]. COCOON 2001, LNCS 2108[C].Springer-Verlag, 2001.278-287.
  • 7SWAMY M, THULASIRAMAN K. Graphs, Networks, and Algorithms[M]. New York: John Wiley & Sons Inc,1981.
  • 8[3] Newport K T,et al.Network survivability through connectivity optimization.In:proc ICC,1987
  • 9[4] Newport K T,et al.Techniques for evaluating the nodal survivability of large networks.In:proc Milcom,1990
  • 10[5] Newport K T,et al.Design of survivable communication networks under performance constraints.IEEE Trans on Reliability,1991,40(4):433~440

共引文献253

同被引文献189

引证文献30

二级引证文献177

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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