RELIABLE TELECOMMUNICATION NETWORK DESIGN PROBLEM UNDER NODE FAILURE
The design of telecommunication network with capacity constraints of links,routers and ports of routers is considered in this paper.Specially,we limit each demand flow traversed through within a pre-specifed number of links (called hops) under node failure scenarios in IP layer network.Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when any relay node of the network fails.We propose a reliable mixed-integer programming (MIP) model with multiscenario constraints to optimally design a minimum-cost survivable IP network that continues to support a good communication under any node failure scenario.Then transform the MIP model to many single scenario models containing simplified MIPs,nonlinear programming (NLP) models and MIP models under Benders decomposition.Three heuristic methods are proposed to solve these models including branch-and-bound algorithm,global algorithm for NLP,and heuristic algorithm based on benders decomposition.
Telecommunication Network, Mixed-integer Programming Benders Decomposition Network Design Node Failure
Tie Liu Wenguo Yang Ruguo Bu Jun Huang
College of Engineering, University of Chinese Academy of Sciences, Beijing, China,100049 School of Mathematics Sciences, University of Chinese Academy of Sciences, Beijing, 100049
国际会议
11th International Symposium on Operations Research and its Applications(第11届运筹学及其应用国际研讨会)
安徽黄山
英文
29-36
2013-08-23（万方平台首次上网日期，不代表论文的发表时间）