期刊文献+

用于评价通信网节点重要性的多参数优化算法 被引量:3

Multi-parameter Optimization Algorithm for Communication Network Node Importance Evaluation
下载PDF
导出
摘要 为更有效地评价通信网节点间的重要性,以节点删除算法为基础,提出一种多参数优化算法。定义节点重要性参数,通过比较该参数的大小评价节点重要性,进而反映删除节点后对整个通信网的影响程度。实验结果表明,相比于节点删除算法,多参数优化算法对各节点重要性的评估更为精确。 In order to judge the importance of nodes in communication networks more effectively, a multi-parameter optimization algorithm based on node deletion algorithm for communication network nodes importance evaluation is proposed in this paper. This algorithm gives the Node Importance Index(NII), and can evaluate the importance of a node by comparing this index, as well as reflects the extent of the effect to the whole communications network after deleting it. Experimental results show that this proposed algorithm evaluates the importance of each node more precisely than node deletion algorithm.
出处 《计算机工程》 CAS CSCD 2013年第6期95-98,共4页 Computer Engineering
基金 浙江省自然科学基金青年人才专项基金资助项目(R105473)
关键词 通信网 节点重要性 生成树 最短距离 communication network node importance spanning tree minimum distance degree
  • 相关文献

参考文献12

二级参考文献65

  • 1戴伏生,宋立众.通信网络路由新算法[J].南京邮电学院学报(自然科学版),2005,25(2):7-11. 被引量:3
  • 2任智,郭伟,苏静,刘军.基于跨层协同设计的高效AODV改进路由算法[J].计算机学报,2007,30(5):838-844. 被引量:12
  • 3[3] Newport K T,et al.Network survivability through connectivity optimization.In:proc ICC,1987
  • 4[4] Newport K T,et al.Techniques for evaluating the nodal survivability of large networks.In:proc Milcom,1990
  • 5[5] Newport K T,et al.Design of survivable communication networks under performance constraints.IEEE Trans on Reliability,1991,40(4):433~440
  • 6Tsen F P,T Y Sung,M Y Lin,et al.Finding the most vital edges with respect to the number of spanning trees[J].IEEETrans Reliability,1994,43(4):600-602.
  • 7马振华.离散数学引导[M].北京:清华大学出版社,1993.249-258.
  • 8RAO V B.Most-vital edge of a graph with respect to spanning trees[J].IEEE Trans on Reliability,1998,47(1):6-7.
  • 9TSEN 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.
  • 10PAGE L B,PERRY J E.Reliability polynomials and link importance in networks[J].IEEE Trans on Reliability,1994,43(1):51-58.

共引文献139

同被引文献33

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:89
  • 2张冬艳,胡铭曾,张宏莉.基于测量的网络性能评价方法研究[J].通信学报,2006,27(10):74-79. 被引量:53
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 4AKYILDIZ I F,LEE A, WANG P,et al. A roadmap for traffic en- gineering in SDN-OpenFlow networks [J]. Computer Networks, 2014(71): 1-30.
  • 5SETHI D, NARAYANA S, MALIK S. Abstractions for model checking SDN controllers[C]. Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2013: 145-148.
  • 6JAIN S, KUMAR A, MANDAL S, et al. B4: experience with a globally-deployed software defined WAN[C]. ACM SIGCOMM Computer Communication Review. ACM, 2013: 8-14.
  • 7LARA A, KOLASANI A, RAMAMURTHY B. Network innova- tion using openflow: a survey[J]. Communications Surveys I Tu- torials, IEEE, 2014, 16(1): 493-512.
  • 8ONG 1, LIM H. Dynamic load balancing and network adaptive vir- tual storage service for mobile appliances[J]. JIPS, 2011, 7 (1): 53-62.
  • 9YIN S, EPIMAKHOV I, MORVAN F, et al. Resource allocation for query optimization in data grid systems: static load balancing strategies[C]. Advances in Databases and Information Systems. Springer Berlin Heidelberg, 2013 : 316-329.
  • 10AGARWAL S, KODIALAM M, LAKSHMAN T V. Traffic en- gineering in software defined networks[C]. INFOCOM, IEEE, 2013: 2211-2219.

引证文献3

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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