Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

Gouveia, Luís; Patrício, Pedro; Sousa, Amaro de

doi:10.1007/s11067-007-9038-3

Cited by 33 publications

(33 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The largest network used in [18] has 17 nodes/26 edges. In [13] instances based on NSFNET and on EON, a network having 19 nodes/39 edges are presented. It is not possible to directly compare the results of the above papers with the ones presented in this paper, since different versions of the problem are solved.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Solving survivable two-layer network design problems by metric inequalities

Mattia

2010

Comput Optim Appl

View full text Add to dashboard Cite

We address the problem of designing a multi-layer network with survivability requirements. We are given a two-layer network: the lower layer represents the potential physical connections that can be activated, the upper layer is made of logical connections that can be set up using physical links. We are given origin-destination demands (commodities) to be routed at the upper layer. We are also given a set of failure scenarios and, for every scenarios, an associated subset of commodities. The goal is to install minimum cost integer capacities on the links of both layers in order to ensure that the commodities can be routed simultaneously on the network. In addition, in every failure scenario the routing of the associated commodities must be guaranteed. We consider two variants of the problem and develop a branch-and-cut scheme based on the capacity formulation. Computational results on instances derived from the SNDLib for single node failure scenarios are discussed.keywords: optical network design, branch-and-cut

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…In [8], valid inequalities and a branch-and-cut approach are presented for the uncapacitated case with survivability requirements. In [13] multi-layer hop-constrained node-survivable networks are addressed and two different survivability mechanisms (path diversity and path protection) are considered.…”

Section: Introductionmentioning

confidence: 99%

Solving survivable two-layer network design problems by metric inequalities

Mattia

2010

Comput Optim Appl

View full text Add to dashboard Cite

show abstract

“…Clímaco and Pascoal (2009) introduce a method to compute bi-objective shortest pairs, each including two disjoint simple paths. Gouveia et al (2008) guarantee survivability of a network by determining D node-disjoint paths. Soni and Pirkul (2002) design a communication network, where at least one communication route remains present between all pairs of nodes.…”

Section: Literature Reviewmentioning

confidence: 99%

Risk approaches for delivering disaster relief supplies

2011

View full text Add to dashboard Cite

We consider the problem of designing the logistic system to assure adequate distribution of relief aid in a post-natural-disaster situation, when damages to infrastructure may disrupt the delivery of relief aid. The problem is formulated as a multi-objective optimization problem, encompassing three objective functions of central interest in such problems. The first objective function is a measure of risk (various forms of such risk are analyzed). The second objective function measures the coverage provided by the logistic system in the distribution of relief aid to disaster victims. The third objective function represents total travel time. We focus on the risk of delivery tours for relief supplies, where risk here captures the threat that potential tours become impassable after the natural hazard event. In order to cope with a range of different natural disasters and policy objectives, we develop five approaches emphasizing different measures of tour-dependent risk. To cover both earthquake and flood risks, we consider correlated as well as uncorrelated risk measures. We develop a two-phase solution approach to reflect the dictates of real-world disaster relief motivating this analysis. The first phase generates potentially Pareto-optimal solutions to the overall multi-objective logistic design problem with respect to three objectives. For any given risk measure, the first-phase design problem is formulated as a multi-objective integer program and a memetic algorithm is proposed as the solution approach. The second phase is an enrichment procedure to generate a broader range of potentially Pareto-optimal alternatives. The suggested approach is tested on real-world data from the province of Manabí in Ecuador and the results associated with the different risk measures are analyzed to illustrate the value of the proposed approach for the design of disaster relief networks.

show abstract

“…As a consequence, he obtained some valid inequalities for the underlying survivable network design problem. Gouveia et al [71] considered an MPLS (Multi-Protocol Label Switching) network design model with hop constraints. They gave mixed-integer programming formulations and discussed computational results.…”

Section: Related Hop-constrained Problemsmentioning

confidence: 99%

Design of Survivable Networks: A survey

2005

View full text Add to dashboard Cite

For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them.

show abstract

Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

Abstract: MPLS over WDM network design, Survivability, Hop constraints,

Cited by 33 publications

References 16 publications

Solving survivable two-layer network design problems by metric inequalities

Solving survivable two-layer network design problems by metric inequalities

Risk approaches for delivering disaster relief supplies

Design of Survivable Networks: A survey

Contact Info

Product

Resources

About