Finding non-dominated bicriteria shortest pairs of disjoint simple paths

http://www.sciencedirect.com/science/article/B6VC5-4VBDKNX-1/2/b7e59602a9fb4eb885f498b0d8c779c

Traffic splitting in MPLS networks – a hierarchical multicriteria approach, Journal of Telecommunications and Information Technology, 2007, nr 4

In this paper we address a new hierarchical multicriteria routing model associated with a two-path traffic splitting routing method in MPLS networks whereby the bandwidth required by a given node-to-node traffic flow is divided by two disjoint paths. The model has two levels of objective functions and several constraints. An algorithmic approach is presented for calculating non-dominated solutions and selecting good compromise solutions to this problem. Also a number of computational experiments are presented

Global and regional ecological boundaries explain abrupt spatial discontinuities in avian frugivory interactions

Species interactions can propagate disturbances across space via direct and indirect effects, potentially connecting species at a global scale. However, ecological and biogeographic boundaries may mitigate this spread by demarcating the limits of ecological networks. We tested whether large-scale ecological boundaries (ecoregions and biomes) and human disturbance gradients increase dissimilarity among plant-frugivore networks, while accounting for background spatial and elevational gradients and differences in network sampling. We assessed network dissimilarity patterns over a broad spatial scale, using 196 quantitative avian frugivory networks (encompassing 1496 plant and 1004 bird species) distributed across 67 ecoregions, 11 biomes, and 6 continents. We show that dissimilarities in species and interaction composition, but not network structure, are greater across ecoregion and biome boundaries and along different levels of human disturbance. Our findings indicate that biogeographic boundaries delineate the world’s biodiversity of interactions and likely contribute to mitigating the propagation of disturbances at large spatial scales.The authors acknowledge the following funding: University of Canterbury Doctoral Scholarship (L.P.M.); The Marsden Fund grant UOC1705 (J.M.T., L.P.M.); The São Paulo Research Foundation - FAPESP 2014/01986-0 (M.G., C.E.), 2015/15172-7 and 2016/18355-8 (C.E.), 2004/00810-3 and 2008/10154-7 (C.I.D., M.G., M.A.P.); Earthwatch Institute and Conservation International for financial support (C.I.D., M.G., M.A.P.); Carlos Chagas Filho Foundation for Supporting Research in the Rio de Janeiro State – FAPERJ grant E-26/200.610/2022 (C.E.); Brazilian Research Council grants 540481/01-7 and 304742/2019-8 (M.A.P.) and 300970/2015-3 (M.G.); Rufford Small Grants for Nature Conservation No. 22426–1 (J.C.M., I.M.), No. 9163-1 (G.B.J.) and No. 11042-1 (MCM); Universidade Estadual de Santa Cruz (Propp-UESC; No. 00220.1100.1644/10-2018) (J.C.M., I.M.); Fundação de Amparo à Pesquisa do Estado da Bahia - FAPESB (No. 0525/2016) (J.C.M., I.M.); European Research Council under the European Union’s Horizon 2020 research and innovation program (grant 787638) and The Swiss National Science Foundation (grant 173342), both awarded to C. Graham (D.M.D.); ARC SRIEAS grant SR200100005 Securing Antarctica’s Environmental Future (D.M.D.); German Science Foundation—Deutsche Forschungsgemeinschaft PAK 825/1 and FOR 2730 (K.B.G., E.L.N., M.Q., V.S., M.S.), FOR 1246 (K.B.G., M.S., M.G.R.V.) and HE2041/20-1 (F.S., M.S.); Portuguese Foundation for Science and Technology - FCT/MCTES contract CEECIND/00135/2017 and grant UID/BIA/04004/2020 (S.T.) and contract CEECIND/02064/2017 (L.P.S.); National Scientific and Technical Research Council, PIP 592 (P.G.B.); Instituto Venezolano de Investigaciones Científicas - Project 898 (V.S.D.)

A new implementation of Yen’s ranking loopless paths algorithm

Yen’s algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen’s algorithm is presented. Both the original algorithm and this implementation present ${\cal O}(Kn(m + n\log n))$ computational complexity order when considering a worst-case analysis. However, computational experiments are reported, which allow to conclude that in practice this new implementation outperforms two other, Perko’s implementation and a straightforward one

Internet packet routing: Application of a K-quickest path algorithm

This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely its self-similar stochastic nature. Results concerning the average CPU times of the algorithm for the different sets of experiments will be presented and discussed.http://www.sciencedirect.com/science/article/B6VCT-4JW124S-B/1/595ef677356cef2b2c795e3eeabee5e

An automated reference point-like approach for multicriteria shortest path problems

Abstract In this paper we introduce a method of analysis for the automated ordering and selection of solutions of a multicriteria shortest path model. The method is based on a reference point approach, where the paths in a specific priority region are ranked by non-decreasing order of a Chebyshev metric. In order to list paths according with this objective function a labelling algorithm is proposed. The developed method is applied in a video-traffic routing context. Computational results are presented and analysed, for randomly generated networks of significant dimension