Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks

Cheng-Shong WU; Shi-Wei LEE

Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks

Cheng-Shong WU, Shi-Wei LEE

Full Text Views

0

Cite this

Summary :

In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By proper transformation of the objective function and applying cutting plane method, the original formulation is transformed into an integer linear programing formulation which is suitable for applying Lagrangian relaxation techniques. After Lagrangian relaxation, the problem is further decomposed into several tractable subproblems. Unlike others' work, the candidate path set does not need to be prepared in advance and the best paths are generated while solving subproblems in our approach. Heuristic algorithms based on the solving procedure of the Lagrangian relaxation are developed. Closely examining the gap between the heuristic upper bounds and the Lagrangian lower bounds reveals that the proposed algorithm can efficiently provide a nearly optimal solution for the survivable VP layout design in ATM networks.

Publication: IEICE TRANSACTIONS on Communications Vol.E82-B No.4 pp.591-599

Publication Date: 1999/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Networks and Services

Cite this

Copy

Cheng-Shong WU, Shi-Wei LEE, "Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E82-B, no. 4, pp. 591-599, April 1999, doi: .
Abstract: In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By proper transformation of the objective function and applying cutting plane method, the original formulation is transformed into an integer linear programing formulation which is suitable for applying Lagrangian relaxation techniques. After Lagrangian relaxation, the problem is further decomposed into several tractable subproblems. Unlike others' work, the candidate path set does not need to be prepared in advance and the best paths are generated while solving subproblems in our approach. Heuristic algorithms based on the solving procedure of the Lagrangian relaxation are developed. Closely examining the gap between the heuristic upper bounds and the Lagrangian lower bounds reveals that the proposed algorithm can efficiently provide a nearly optimal solution for the survivable VP layout design in ATM networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_4_591/_p

Copy

@ARTICLE{e82-b_4_591,
author={Cheng-Shong WU, Shi-Wei LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks},
year={1999},
volume={E82-B},
number={4},
pages={591-599},
abstract={In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By proper transformation of the objective function and applying cutting plane method, the original formulation is transformed into an integer linear programing formulation which is suitable for applying Lagrangian relaxation techniques. After Lagrangian relaxation, the problem is further decomposed into several tractable subproblems. Unlike others' work, the candidate path set does not need to be prepared in advance and the best paths are generated while solving subproblems in our approach. Heuristic algorithms based on the solving procedure of the Lagrangian relaxation are developed. Closely examining the gap between the heuristic upper bounds and the Lagrangian lower bounds reveals that the proposed algorithm can efficiently provide a nearly optimal solution for the survivable VP layout design in ATM networks.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 591
EP - 599
AU - Cheng-Shong WU
AU - Shi-Wei LEE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 1999
AB - In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By proper transformation of the objective function and applying cutting plane method, the original formulation is transformed into an integer linear programing formulation which is suitable for applying Lagrangian relaxation techniques. After Lagrangian relaxation, the problem is further decomposed into several tractable subproblems. Unlike others' work, the candidate path set does not need to be prepared in advance and the best paths are generated while solving subproblems in our approach. Heuristic algorithms based on the solving procedure of the Lagrangian relaxation are developed. Closely examining the gap between the heuristic upper bounds and the Lagrangian lower bounds reveals that the proposed algorithm can efficiently provide a nearly optimal solution for the survivable VP layout design in ATM networks.
ER -