期刊文献+

应用于MPLS网络负载均衡的启发式自适应遗传算法研究 被引量:27

A heuristic adaptive genetic algorithm for load balancing in MPLS networks
下载PDF
导出
摘要 提出一种启发式自适应遗传优化算法,求解MPLS网络负载均衡问题。算法采用自然数编码,自适应的交叉变异算子,并融入启发式信息有效地提高了搜索效率。仿真结果证明算法是有效的,显著改善了传统SPF路由算法易于导致的网络流量分布不均衡的状况。 A heuristic adaptive genetic algorithm for load balancing in MPLS networks is proposed in this article. It introduces the natural number coding method, adaptive probabilities of crossover and mutation, and furthermore, makes use of heuristic information to improve search efficiency effectively. The simulation results show the given algorithm is effective, in which it dramatically improves the unbalanced traffic distribution condition brought about by traditional SPF routing policy.
出处 《通信学报》 EI CSCD 北大核心 2003年第10期39-45,共7页 Journal on Communications
基金 教育部学科点专项科研基金资助项目(20020013011)
关键词 流量工程 负载均衡 多协议标签交换 遗传算法 traffic engineering load balancing MPLS genetic algorithm
  • 相关文献

参考文献10

  • 1AWDUCHE D, MALCOLM J, JAGOGBUA J, et al. Requirements for Traffic Engineering over MPLS[S]. RFC 2702, 1999.
  • 2XIAO X P. Traffic enRineering with MPLS in the Internet[J]. IEEE Networking, 2000, 14(2): 28-33.
  • 3GIRISH M K, ZHOU B, HU J Q. Formulation of the traffic engineering problems in MPLS based IP networks[A]. The Fifth IEEE ISCC[C]. Antibes, France, 2000. 214-219.
  • 4WANG Y F, WANG Z. Explicit routing algorithms for Intemet Waffic engineering[A]. IEEE ICCCN'99[C]. Boston, MA, 1999.582-588.
  • 5LEE Y, SEOK Y, CHOI Y. A consu'ained multipath traffic engineering scheme for MPLS networks[A]. ICC'02[C]. New York, 2002.2431-2436.
  • 6BERTSEKAS D. GALAGER R. Data Networks[M]. NJ: Printice Hall, 1992.
  • 7ALOUANE A B, BEAN J C. A generic algorithm for the multiple-choice integer program[J]. Operations Research, 1997,45(1):92-101.
  • 8SRINIVAS M, PATNAINK L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Transactions on Systems, MAN and Cybernetics,1994,24(4): 656-667.
  • 9CHONG E I, SANJEEV S R, MADDILA R, et al. On finding single-source single-destination k shortest paths[A]. ICCI '95[C].Peterborogh, Canada, 1995.40-47.
  • 10WAXMAN B M. Routing of multipoint connections[J]. IEEE Jounlal on Selected Areas in Communications, 1988, 6(9): 1617-1622.

同被引文献159

引证文献27

二级引证文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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