Lexicographical minimization of routing hops in hop-constrained node survivable networks

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

doi:10.1007/s11235-015-0083-9

Cited by 5 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A very particular constrained multipath lexicographic path problem is addressed in [190], aiming at minimizing the number of active paths with the maximal number of arcs in a resilient routing model where active and backup paths (to be used in the event of failure of service path(s)) have to be calculated simultaneously, all with a bounded number of arcs; ILP formulations are used for obtaining exact solutions.…”

Section: Models That Use Straightforwardly Algorithm(s) Dedicated To ...mentioning

confidence: 99%

Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends

Craveirinha,

Clímaco,

Girão-Silva

et al. 2024

Algorithms

View full text Add to dashboard Cite

A major area of application of multiobjective path problems and resolution algorithms is telecommunication network routing design, taking into account the extremely rapid technological and service evolutions. The need for explicit consideration of heterogeneous Quality of Service metrics makes it advantageous for the development of routing models where various technical–economic aspects, often conflicting, should be tackled. Our work is focused on multiobjective path problem formulations and resolution methods and their applications to routing methods. We review basic concepts and present main formulations of multiobjective path problems, considering different types of objective functions. We outline the different types of resolution methods for these problems, including a classification and overview of relevant algorithms concerning different types of problems. Afterwards, we outline background concepts on routing models and present an overview of selected papers considered as representative of different types of applications of multiobjective path problem formulations and algorithms. A broad characterization of major types of path problems relevant in this context is shown regarding the overview of contributions in different technological and architectural network environments. Finally, we outline research trends in this area, in relation to recent technological evolutions in communication networks.

show abstract

Section: Models That Use Straightforwardly Algorithm(s) Dedicated To ...mentioning

confidence: 99%

Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends

Craveirinha,

Clímaco,

Girão-Silva

et al. 2024

Algorithms

View full text Add to dashboard Cite

show abstract

“…A bi-criteria resilient routing model (MCSP) for transport networks is described in seeking the calculating of a bi-criteria active path (in terms of minimal load cost and hop count) with a maximally disjoint protection path; an exact resolution method is described, which is based on a k-shortest path algorithm, applied to the convex combination of the two objective functions, hence enabling to obtain all supported and unsupported non-dominated solutions. [Gouveia et al, 2016] (MILP) present a multipath problem, in the context a general resilient point-to-point routing model, by considering a lexicographic optimization formulation; the aim of the formulation is to minimize the number of service (or active) paths with the worst number of hops, such that each connection demand is routed through a set of node disjoint service and backup paths, all with a bound on the number of arcs; integer linear programming formulations are specified and tested for obtaining exact solutions.…”

Section: Routing Modelsmentioning

confidence: 99%

MCDA/M in Telecommunication Networks

Clímaco¹,

Craveirinha²

2019

Advanced Studies in Multi-Criteria Decision Making

View full text Add to dashboard Cite

The extremely rapid evolution of new telecommunication technologies and services and its interaction with a complex socio-economic environment, justifies the increasing interest in applying multi-criteria evaluation approaches in a wide variety of decision making processes involved in network planning and design. After a brief overview of critical evolutions in telecommunication network technologies and services, an outline analysis of issues and difficulties concerning the applications of multi-criteria decision aiding/making (MCDA/M) in telecommunication network planning and design, is described. Also highlights on more relevant or recent contributions of this type, in network design and planning models, including strategical and policy issues, will be presented. Finally, an analysis and outline discussion of current and future research trends and challenges concerning the use of multi-criteria approaches in these areas, is put forward.

show abstract

“…In fact, it is also with such an aggregated model that the good results reported in Botton et al [3] are obtained. However, in many other situations the models are not equivalent (see, for instance Gouveia et al [7]) due to extra constraints, although in most of such cases the aggregated model is more efficient for computing the optimal solutions. In fact, here we are in a similar situation as we see next.…”

Section: -(20) This Formulation Uses Integer Variableszmentioning

confidence: 99%

Design of survivable networks with vulnerability constraints

Gouveia

Leitner

2017

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

We consider the Network Design Problem with Vulnerability Constraints (NDPVC) which simultaneously addresses resilience against failures (network survivability) and bounds on the lengths of each communication path (hop constraints). Solutions to the NDPVC are subgraphs containing a path of length at most Hst for each commodity {s, t} and a path of length at most H ′ st between s and t after at most k − 1 edge failures. We first show that a related and well known problem from the literature, the Hop-Constrained Survivable Network Design Problem (kHSNDP), that addresses the same two measures produces solutions that are too conservative in the sense that they might be too expensive in practice or may even fail to provide feasible solutions. We also explain that the reason for this difference is that Mengerian-like theorems not hold in general when considering hop-constraints. Three graph theoretical characterizations of feasible solutions to the NDPVC are derived and used to propose integer linear programming formulations. In a computational study we compare these alternatives with respect to the lower bounds obtained from the corresponding linear programming relaxations and their capability of solving instances to proven optimality. In addition, we show that in many cases, the solutions produced by solving the NDPVC are cheaper than those obtained by the related kHSNDP.

show abstract

Lexicographical minimization of routing hops in hop-constrained node survivable networks

Cited by 5 publications

References 29 publications

Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends

Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends

MCDA/M in Telecommunication Networks

Design of survivable networks with vulnerability constraints

Contact Info

Product

Resources

About