| 摘要: |
| 基于流量需求的BGP最优路径选择是域间流量工程研究的一个问题.其中瓶颈区域的判定可为域间流量工程的决策过程提供重要的启发信息.然而,瓶颈区域的判定是NP难问题.在同时考虑域内链路和域间链路的前提下,提出多项式时间的基于流量需求的瓶颈区域的预测算法.在此基础上,系统地研究了流量、拓扑结构与瓶颈区域间的关系.模拟实验表明,预测算法的准确性超过90%,研究结果表明,拓扑结构是决定瓶颈区域的重要因素. |
| 关键词: 域间流量工程 BGP路径选择 线性规划 负载平衡 瓶颈 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314802(国家重点基础究发展规划(973));the National Natural Science Foundation of China under Grant No.90204005(国家自然科学基金) |
|
| Research on the Bottleneck Area of Optimal BGP Route Selection |
|
LIU Ya-Ping,GONG Zheng-Hu,ZHU Pei-Dong
|
| Abstract: |
| Optimal BGP route selection on traffic demand is one of the problems in interdomain traffic engineering. Determining bottleneck area will give important heuristic information to the problem. As the problem of determining bottleneck area is NP-hard, a bottleneck area predicting algorithm on traffic demand in polynomial time is proposed, which deals with interdomain peering links and intradomian links simultaneously. Moreover, this paper also analysis the relationships between the traffic and the bottleneck area, as well as the relationships between the topology and the bottleneck area. Simulation results show the accuracy of the algorithm is more than 90%. In addition, a conclusion is drawn from the simulation that the topology is a very important factor in determining the bottleneck area. |
| Key words: interdomain traffic engineering BGP route selection linear programming load balance bottleneck |
