北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2005, Vol. 28 ›› Issue (2): 63-67.doi: 10.13190/jbupt.200502.63.226

• 论文 • 上一篇    下一篇

基于LSP时延和拥塞的分布式自适应流量工程算法

冯春燕,张晨,曾志民,丁炜   

  1. 北京邮电大学通信网络综合技术研究所,北京 100876
  • 出版日期:2005-04-28 发布日期:2005-04-28

LSP's Delay and Congestion Based Distributed Adaptive

FENG Chunyan,ZHANG Chen,ZENG Zhimin,DING Wei   

  1. Institute of Communication Networks Integrated Technique, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Online:2005-04-28 Published:2005-04-28

摘要: 研究多协议标签交换(MPLS)网络中的流量工程,提出了基于标签交换路径(LSP)时延和拥塞 来优化网络流量的算法。给出全网流量优化的数学模型,并根据该模型内在的层次性,设计 了分布式自适应流量工程算法。为了使算法具有实时性强、收敛速度快、稳定性较好、运算 和网络开销小等特点,在设计中,采用了禁忌搜索和算法参数的非线性调整来提高算法的性 能。仿真分析表明,该算法能够实现对网络性能的全面优化,适合应用于骨干网的流量优化.

关键词: 流量工程, 启发式, 多协议标签交换, 数学模型

Abstract: A distributed adaptive traffic engineering algorithm HDCA(heuristic delay and congestion based algorithm of traffic engineering)for the MPLS(multiprotocol label switching)network is proposed in this paper. This algorithm is based on the LSP's (label switching path) delay and congestion. A mathematical model of the whole network traffic optimization was established,and HDCA algorithm was designed in terms of the mathematical model's hierarchie s. In this algorithm, tabu search and nonlinear changes of parameters were adopted to achieve excellent realtime performance, fast convergence speed, high stability, little running time and little network overhead. The simulation analysis shows that the HDCA algorithm fits to the traffic optimizing in the bone network.

Key words: traffic engineering, heuristic, multiprotocol labelswitching, math model

中图分类号: