José CraveirinhaJoão ClímacoLúcia MartinsSilva, Carlos Gomes daNuno Ferreira2026-03-242026-03-242013-07-30Craveirinha, J., Clímaco, J., Martins, L. et al. A bi-criteria minimum spanning tree routing model for MPLS/overlay networks. Telecommun Syst 52, 203–215 (2013). https://doi.org/10.1007/s11235-011-9553-x1018-48641572-9451http://hdl.handle.net/10400.8/15979The MPLS platform enables the implementation of advanced multipath and multicast routing schemes. This work develops and analyses the performance of a new bicriteria minimum spanning tree model intended for routing broadcast messages in MPLS networks or constructing treebased overlay networks. The aim of the model is to obtain spanning trees which are compromise solutions with respect to two important traffic engineering metrics: load balancing cost and average delay bound. An exact solution to the formulated bi-criteria optimization problem is presented, which is based on an algorithm that enables the computation of the set of supported non-dominated spanning trees. An application model and a set of experiments on randomly generated Internet type topologies will also be presented. Finally a network performance analysis of the model considering three network performance metrics will be shown.engQoS routingBroadcastingSpanning treesMulticriteria optimizationMPLS/Internetjournal article10.1007/s11235-011-9553-x