ABSTRACT
A multiobjective routing model for multiprotocol label switching networks with multiple service types and path protection is presented in this article. The routing problem is formulated as a biobjective integer program, where the considered objectives are formulated according to a network-wide optimization approach, i.e. the objective functions of the route optimization problem depend explicitly on all traffic flows in the network. A disjoint path pair is considered for each traffic trunk, which guarantees protection to the associated connection. A link-path formulation is proposed for the problem, in which a set of possible pairs of paths is devised in advance for each traffic trunk. An exact method (based on the classical constraint method for solving multiobjective problems) is developed for solving the formulated problem. An extensive experimental study, with results on network performance measures in various randomly generated networks, is also presented and discussed.
Acknowledgments
The authors acknowledge the support of José Salgado, Vitor Mirones and their team from Altice Labs (formerly PT Inovação).
Disclosure statement
No potential conflict of interest was reported by the authors.
ORCID
Rita Girão-Silva http://orcid.org/0000-0002-2331-8340
José Craveirinha http://orcid.org/0000-0001-8562-3730
Teresa Gomes http://orcid.org/0000-0002-3084-5608
Lúcia Martins http://orcid.org/0000-0002-6534-0159
João Clímaco http://orcid.org/0000-0001-6655-8590
Notes
1. Note that, in this context, ‘node’ refers to an element in the decision tree constructed by the branch-and-bound algorithm used to solve the optimization problem.