Fast One-to-Many Multicriteria Shortest Path Search

Kurbanov, Temirlan; Cuchý, Marek; Vokřínek, Jiří

doi:10.1109/tits.2023.3282069

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in [34] describes an original algorithmic combination for a one node-to-many nodes MOSPP seeking to achieve a fast solution search. For this purpose, a modification of a multiobjective label-setting algorithm, operating on the cover graph and employing a dimensionality reduction procedure enabling swifter domination checks, is developed.…”

Section: Labeling Techniquesmentioning

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: Labeling Techniquesmentioning

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

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Xu,

Liu,

Qian

et al. 2023

IEEE Access

View full text Add to dashboard Cite

The convergence of networking and cloud computing leads to an increasing number of cloud based services and applications, which require to be processed by network nodes with enough resources. There are multiple available nodes in the network and network operators need to find paths to forward the traffic to these nodes for processing. In addition, services and application may have diversified requirements on the paths in terms of bandwidth, delay, jitter, etc. Therefore, network operators need to determine the optimal paths considering multiple criteria. However, single-criterion based shortest path algorithms are often used to compute paths from a source node to one target node, which may result in uneven traffic distribution and low resource utilization. Furthermore, the paths obtained are only optimal to this criterion and may not satisfy the Service Level Agreement (SLA) requirements. Therefore, in this paper, we propose a multi-criteria path finding method to obtain all the Pareto-optimal paths from a source node to multiple target nodes (destinations). We extend an existing effective multi-criteria routing algorithm (ParetoBFS), and integrate a multi-queues based bidirectional search mechanism. Additionally, we use a topology sampling technique to accelerate path computation. We evaluate the performance of these path finding methods using various topologies with multiple criteria including bottleneck and additive types. Experimental results demonstrate that our approach can reduce the running time by 54% -89% in different topologies compared to the ParetoBFS algorithm. By employing topology sampling, we further improve our algorithm's speed while still finding most of the Pareto-optimal paths.INDEX TERMS bidirectional search, multi-criteria, path finding, path selection, routing.

show abstract

Fast One-to-Many Multicriteria Shortest Path Search

Cited by 2 publications

References 16 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

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Contact Info

Product

Resources

About