基于最小干扰路由的流量工程动态路由算法研究  

Dynamic Routing with Minimum Interference for Traffic Engineering

作　　者：刘红[1] 白栋[2] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网络实验室,北京100876 [2]北京大学卫星通信实验室,北京100871

出　　处：《电子与信息学报》2005年第1期127-130,共4页Journal of Electronics & Information Technology

基　　金：教育部学科点专项科研基金(20020013011)资助项目

摘　　要：分析目前流量工程动态路由算法研究现状,以提高网络吞吐量为目标,提出一种改进的流量工程动态路由算法,综合考虑了网络拓扑和流量分布状况,提出分级的链路关键度定义,将流量工程目标有效转化为路径约束。仿真结果表明所提算法性能比Kodialam算法及其它几种典型的动态路由算法好。Research work on dynamic routing for traffic engineering is investigated. And an improved routing algorithm for optimizing network throughput is proposed. It is characterized by taking into account both network topology and traffic distribution condition, and putting forward graded link criticality with traffic engineering objectives translated into path constraints. Simulation results show the given algorithm outperforms Kodialam's and the other several typical dynamic routing policies.

关 键 词：流量工程 多协议标签交换 最小干扰路由 最大网络流 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]