| 多协议标记交换网络实现流量工程的路由算法 |
| |
| 引用本文： | 王新红,刘富强. 多协议标记交换网络实现流量工程的路由算法[J]. 同济大学学报(自然科学版), 2005, 33(6): 820-824 |
| |
| 作者姓名： | 王新红 刘富强 |
| |
| 作者单位： | 同济大学,信息与通信工程系,上海,200092 |
| |
| 基金项目： | 上海市自然科学基金资助项目(02ZD14105) |
| |
| 摘 要： | 对多协议标记交换网络中实现流量工程的路由算法进行了研究，提出两种TE(流量工程)路由算法．一种是对Dijkstra算法进行改进的、最小化最大带宽利用率的TE路由算法；另一种是根据链路的使用情况赋权值、并综合考虑带宽和跳数限制的最小权值TE路由算法．最后，对两种算法进行了仿真．结果表明，两种算法能在一定程度上避免对部分链路的过度使用，起到均衡负载分布的作用．
|
| 关 键 词： | 多协议标记交换 流量工程 路由算法 负载均衡 |
| 文章编号： | 0253-374X(2005)06-0820-05 |
Routing Algorithms to Realize Traffic Engineering in Multiprotocol Label Switching |
| |
| WANG Xin-hong,LIU Fu-qiang. Routing Algorithms to Realize Traffic Engineering in Multiprotocol Label Switching[J]. Journal of Tongji University(Natural Science), 2005, 33(6): 820-824 |
| |
| Authors: | WANG Xin-hong LIU Fu-qiang |
| |
| Abstract: | In this paper,the routing algorithms are studied to realize traffic engineering in multiprotocol label switching(MPLS).Two traffic engineering(TE) routing algorithms are proposed.One is a minimized maximum link utilization algorithm,which modifies the Dijkstra algorithm.Another is a bandwidth-hops constrained least weight algorithm,in which the weight is given to the link according to the link usage,and at the same time,the bandwidth and hop counts are taken into consideration.Then,two algorithms are simulated.The result shows that both of them can avoid some links being over-utilizd and balance the loads. |
| |
| Keywords: | multiprotocol label swithching traffic engineering routing algorithm load balance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
