段路由的参数化复杂性
Parameterized Complexity of Segment Routing
AI总结:
本文研究 Segment Routing 的参数化复杂性,证明其在常数树宽图上仍 NP 难并排除 $f(d)n^{g(k)}$ 类算法,同时给出多项式可解特例。
摘要:
Segment Routing(段路由)是一种较新的网络技术,通过对路由路径提供更精细的控制来帮助优化网络吞吐量。数据包并非直接从源端路由到目标端,而是经由中间航点进行路由。在连续航点之间,数据包按照传统的最短路径路由协议进行路由。通过这种重新路由,可以避开网络中的瓶颈,防止网络部分区域过载。与之相关的 NP 难计算问题即为 Segment Routing:给定一个包含 $n$ 个顶点、$d$ 个流量需求(顶点对)的网络,以及一个(较小的)数 $k$,任务是为每个需求对找到至多 $k$ 个航点,使得沿这些航点进行最短路径路由时,在不超过网络容量的情况下满足所有需求。我们研究了现实通信网络的特殊结构是否能够在算法上加以利用。我们的结果包括:即使每个需求只允许一个航点,该问题在常数树宽图上仍然是 NP 难的。在标准复杂性假设下,我们还排除了运行时间为 $f(d) n^{g(k)}$ 的算法,其中 $f$ 和 $g$ 为任意函数。作为这些下界的补充,我们给出了若干可在多项式时间内求解的特殊情形。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。