By Topic

Research on Tabu Search applied in off-line MPLS layout design problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong-liang Hu ; Sch. of Math. & Inf. Eng., Taizhou Univ., Linhai ; Rong-Qin Chen

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 search 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 difficult 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.

Published in:

Image Analysis and Signal Processing, 2009. IASP 2009. International Conference on

Date of Conference:

11-12 April 2009