Affiliation:
1. MPI Saarland, Germany
2. Aalborg University, Denmark
3. IT University of Copenhagen, Denmark
4. University of Vienna, Austria
Abstract
Modern computer networks support interesting new routing models in which traffic flows from a source sto a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes or (virtualized) network functions (VNFs), to create innovative network services like service chains or segment routing. While the benefits and technological challenges of providing such routing models have been articulated and studied intensively over the last years, less is known about the underlying algorithmic traffic routing problems.
The goal of this paper is to provide the network community with an overview of algorithmic techniques for waypoint routing and also inform about limitations due to computational hardness. In particular, we put the waypoint routing problem into perspective with respect to classic graph theoretical problems. For example, we find that while computing a shortest path from a source s to a destination t is simple (e.g., using Dijkstra's algorithm), the problem of finding a shortest route from s to t via a single waypoint already features a deep combinatorial structure.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. LASER: Learning Enhanced Segment Routing Using Link Telemetry;2024 IEEE 25th International Conference on High Performance Switching and Routing (HPSR);2024-07-22
2. SAFE-ME: Scalable and Flexible Policy Enforcement in Middlebox Networks;IEEE/ACM Transactions on Networking;2022-10
3. Waypoint routing on bounded treewidth graphs;Information Processing Letters;2022-01
4. P4Update;Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies;2021-12-02
5. On the Implications of Routing Models on Network Optimization;IEEE Transactions on Network and Service Management;2021-12