Parameterized Complexity of Segment Routing

TL;DR

This paper studies the computational complexity of segment routing, showing NP-hardness even in restricted cases and providing polynomial-time solutions for certain special cases, advancing understanding of routing optimization challenges.

Contribution

It establishes NP-hardness results for segment routing on graphs with constant treewidth and rules out certain parameterized algorithms, while also identifying polynomial-time solvable cases.

Findings

NP-hardness on graphs with constant treewidth

Exclusion of fixed-parameter algorithms with certain runtime forms

Identification of polynomial-time solvable special cases

Abstract

Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints. Between consecutive waypoints, the packets are routed according to traditional shortest path routing protocols. Bottlenecks in the network can be avoided by such rerouting, preventing overloading parts of the network. The associated NP-hard computational problem is Segment Routing: Given a network on $n$ vertices, $d$ traffic demands (vertex pairs), and a (small) number $k$, the task is to find for each demand pair at most $k$ waypoints such that with shortest path routing along these waypoints, all demands are fulfilled without exceeding the capacities of the network. We investigate if special structures of real-world communication networks could be exploited algorithmically. Our results comprise NP-hardness on graphs with constant treewidth even if only one waypoint per demand is allowed. We further exclude (under standard complexity assumptions) algorithms with running time $f(d) n^{g(k)}$ for any functions $f$ and $g$. We complement these lower bounds with polynomial-time solvable special cases.