Abstract
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 a pre-specified maximal 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 multi-scenario constraints to optimally design a minimum-cost survivable IP network that continues to support a good communication under any node failure scenario. Then we transform the MIP model into many single scenario models, that is, simplified MIPs, nonlinear programming (NLP) models and MIP models under Benders decomposition Then we transform the MIP model into many single scenario models, that is, 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. We mainly study the application of Benders decomposition method, where dual model and bounding procedures are given for each MIP model under Benders decomposition at each scenario. The results of our computational experiments validate the effectiveness of the proposed models and algorithms.
Highlights
Network design problems [1,2,3] involve a number of applications including logistics, power systems, transportation, telecommunication and military scenarios
We propose three methods to solve three transformations of the same model of our problem in telecommunication background, and they are the branch-and-bound algorithm provided by Lingo9.0 used in the mixed-integer programming (MIP) model (BBMIP), global algorithm provided by Lingo9.0 used in the nonlinear programming (NLP) model (GNLP) and the heuristic algorithm based on benders decomposition applied in the MIP model (BDMIP)
Our models are to obtain a minimum cost network with some flow constraints, capacity constraints and especially hop constraints under uncertain node failure scenario. This is a network design problem in telecommunication background which can be formulated as mixed integer programming models and can be transformed to other mathematical models
Summary
Network design problems [1,2,3] involve a number of applications including logistics, power systems, transportation, telecommunication and military scenarios. Network survivability is defined as the ability of a network to maintain its communication capabilities in the face of equipment failure [6] In most cases, it means that a network is still functional after the failure of certain network components like node failure. Many measures have been taken like installing redundant communication lines and connecting equipment, design node-disjoint (and edge-disjoint) path [8] or enough link capacity [9]. We provide a reliable mixed-integer programming model for telecommunication network design problem from a more practical point of view. We present various model-specific algorithms including branch-and-bound algorithm, global algorithm for NLP, and heuristic algorithm based on benders decomposition, and compare them by looking at the results and computing time.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
