| 禁忌搜索在MPLS离线型规划设计中的应用研究 |
| |
| 引用本文： | 胡永良.禁忌搜索在MPLS离线型规划设计中的应用研究[J].计算机工程与设计,2006,27(3):387-389. |
| |
| 作者姓名： | 胡永良 |
| |
| 作者单位： | 台州学院,信息与电子工程学院,浙江,临海,317000 |
| |
| 摘 要： | MPLS离线型规划的主要优点是可以实现全局的优化设计，其主要目标是在满足业务QOS要求的前提下，最小化所需要的跳数，并进行合理流量分配以均衡系统负栽。最小路径集和流量分配问题（MPSFAP）是NP完全问题。提出了基于禁忌搜索的启发式算法求解MPSFAP问题，仿真结果表明此近似算法能很好地逼近精确解。
|
| 关 键 词： | 多协议标记交换(MPLS) 流量工程 离线型规划设计 NP完全问题 多商品流问题 禁忌搜索 |
| 文章编号： | 1000-7024（2006）03-0387-03 |
| 收稿时间： | 2005-03-23 |
| 修稿时间： | 2005-03-23 |
Research on tabu search applied in off-line MPLS layout design |
| |
| HU Yong-liang.Research on tabu search applied in off-line MPLS layout design[J].Computer Engineering and Design,2006,27(3):387-389. |
| |
| Authors: | HU Yong-liang |
| |
| Affiliation: | College of Information and Electronic Engineering, Taizhou University, Linhai 317000, China |
| |
| Abstract: | Main advantage of off-line MPLS layout design was to allow a globally optimal network design.Meeting quality of service(QOS),its main objectives that number of required hops were minimized and flow reasonably were assigned.Minimum path set and flow allcation problem(MPSFAP) were NP complete problems.A heuristic algorithm based on tabu search was proposed to solve it.Simulation result showed that approximate solutions of our algorithm were close to exact ones. |
| |
| Keywords: | multi-protocol label switch(MPLS) traffic engineering off-line lay-out design NP complete problem multi-commodity flow problem tabu search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
