{"title":"Research on Tabu Search applied in off-line MPLS layout design problem","authors":"Yong-liang Hu, Rong-qin Chen","doi":"10.1109/IASP.2009.5054577","DOIUrl":null,"url":null,"abstract":"There are two kinds of layout designs in Multi-Protocol Label Switch network:on-line and off-line. To perform traffic engineering based on a given topological structure and Qos requirement of the network, the layout design must be carried out to serach an optimal link set and to make the flow distribution. One advantage of off-line MPLS layout design is to allow a globally optimal network design. To obtain the optimal MPLS layout, namely, to minimize the link set of LSP and to allocate flow hereinafter is designated as MPSFAP (Minimum Path Set and Flow Allocation Problem). It is diffcult to get an exact solution to MPSFAP because it is a mixed-integer nonlinear multi-depot problem. Here, we propose a heuristic algorithm based on tabu search to solve the problem. The simulation result shows that the approximate solutions of our algorithm are close to the exact ones.","PeriodicalId":143959,"journal":{"name":"2009 International Conference on Image Analysis and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Image Analysis and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IASP.2009.5054577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
There are two kinds of layout designs in Multi-Protocol Label Switch network:on-line and off-line. To perform traffic engineering based on a given topological structure and Qos requirement of the network, the layout design must be carried out to serach an optimal link set and to make the flow distribution. One advantage of off-line MPLS layout design is to allow a globally optimal network design. To obtain the optimal MPLS layout, namely, to minimize the link set of LSP and to allocate flow hereinafter is designated as MPSFAP (Minimum Path Set and Flow Allocation Problem). It is diffcult to get an exact solution to MPSFAP because it is a mixed-integer nonlinear multi-depot problem. Here, we propose a heuristic algorithm based on tabu search to solve the problem. The simulation result shows that the approximate solutions of our algorithm are close to the exact ones.
多协议标签交换网络有在线和离线两种布局设计。在给定网络拓扑结构和Qos要求下进行流量工程,必须进行布局设计,以搜索最优的链路集并进行流量分配。脱机MPLS布局设计的一个优点是允许全局最优的网络设计。为了获得MPLS的最优布局,即使LSP的链路集最小并分配流量,下文将其称为MPSFAP (Minimum Path set and flow Allocation Problem)。由于MPSFAP是一个混合整数非线性多库问题,很难得到精确解。本文提出了一种基于禁忌搜索的启发式算法来解决这一问题。仿真结果表明,该算法的近似解与精确解较为接近。