NDRA: An Efficient Multi-Objective Optimal Routing Algorithm Using Pareto Domination

Rapid advancements in the Internet have presented new demands for next-generation communication networks. Despite promising techniques such as APN6 and SRV6 have been proposed, research on multi-objective optimal routing, which serves as the fundamental basis for differentiated service delivery, remains limited. Consequently, this paper aims to bridge this research gap by introducing an efficient routing algorithm, NDRA, for multi-objective optimization. The proposed algorithm utilizes the Dijkstra algorithm as the backbone. Besides, a pruning process referring to the term of Pareto domination is introduced to avoid unnecessary path exploration. Evaluations demonstrate that compared to existing methods, our algorithm guarantees that a set of optimal solutions will be found and the computational overhead is affordable across different network scenarios.