| 引用本文: | 孟兆炜,苏金树,涂睿,等.分级Δ-关键链路最小干涉路由算法.[J].国防科技大学学报,2007,29(6):70-74.[点击复制] |
| MENG Zhaowei,SU Jinshu,TU Rui,et al.Level Based Δ-Critical Links Routing Algorithm for Interference Minimizing[J].Journal of National University of Defense Technology,2007,29(6):70-74[点击复制] |
|
| |
|
|
| 本文已被：浏览 6684次 下载 5724次 |
| 分级Δ-关键链路最小干涉路由算法 |
| 孟兆炜, 苏金树, 涂睿, 曹继军 |
|
(国防科技大学 计算机学院，湖南 长沙 410073)
|
| 摘要: |
| 基于关键链路思想的最小干涉算法在优化网络资源利用率方面取得了显著成效。但有些情况下它对关键路径的判断并不准确，并且对负载平衡考虑得较少。为此提出了一种新的基于分级Δ-关键链路的启发式最小干涉算法，该算法能够更好地识别某些特殊链路的关键程度，并同时考虑了链路负载平衡的优化目标。模拟结果证明该算法在网络资源利用效率和链路负载分散方面效率得到了提高。 |
| 关键词: Δ-关键链路 最小干涉 路由 流量工程 |
| DOI： |
| 投稿日期：2007-03-16 |
| 基金项目:国家自然科学基金重大研究计划资助项目(90604006) |
|
| Level Based Δ-Critical Links Routing Algorithm for Interference Minimizing |
| MENG Zhaowei, SU Jinshu, TU Rui, CAO Jijun |
|
(College of Computer, National Univ. of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| The critical link routing algorithm for interference minimizing has made a great success in optimizing the efficiency of network resources usage. Its method of critical links identification, however, is not very accurate in some circumstances, and it does not consider much about load balancing. This paper presents a new level based Δ-critical links routing algorithm for interference minimizing, of which the algorithm can identify critical links more precisely in some circumstances, and can perform load balancing better. Simulation results show that the algorithm proposed performs better in the resource utilization efficiency and load balancing. |
| Keywords: Δ-critical link interference minimizing routing traffic engineering |
|
|
|
|
|
