ROUTOURNE 即将登场
La ROUTOURNE va tourner
AI总结：
针对段路由中段列表长度受硬件限制、现有计算方案通用性不足且非最优高效的问题，提出ROUTOURNE方法，直接计算硬件可部署的最优段列表，兼具准确性、最优性与高效性，助力高级流量工程策略部署。
摘要：
段路由（Segment Routing，SR）可对流量所走路径实现精确控制：它在IP数据包中指定一系列被称为段（segment）的绕行路径。然而，可指定的绕行路径数量受硬件限制。因此，在计算段列表时，必须限制其长度。尽管已有研究提出了计算这类列表的方案，但这些方案缺乏通用性，且并非总能达到最优或高效。我们提出了ROUTOURNE，这是一种对路由算法进行改造的方法：它不再先计算最优物理路径，再事后将其转换为段列表（且无法保证列表长度符合要求），而是直接计算底层硬件可部署的最优段列表。由此，ROUTOURNE为高级流量工程策略与政策的部署提供了便利，尤其是针对源端负载均衡的场景。尽管研究过程中遇到了诸多出人意料的挑战——特别是SR导致的等otonicity（等距性）丧失——ROUTOURNE仍表现出高效性，最坏情况下仅带来线性开销。其准确性与最优性已得到证明，且我们通过将其推广到多种复杂度各异的路径计算算法，评估了它的有效性。
英文摘要：
Segment routing (SR) offers precise control over the paths taken: it specifies a list of detours, called segments, in IP packets. However, the number of detours that can be specified is limited by the hardware. When calculating segment lists, it is therefore necessary to limit their size. Although solutions have been proposed for calculating these lists, they lack generality and are not always optimal or efficient. We present ROUTOURNE, a method for diverting routing algorithms so that they calculate, not simply an optimal physical path to be translated into a list of segments a posteriori (with no guarantee of its size), but directly the optimal lists of segments deployable by the underlying hardware. ROUTOURNE thus facilitates the deployment of advanced traffic engineering strategies and policies, notably for load balancing from sources. Despite a route fraught with surprising challenges - in particular, the loss of isotonicity induced by SR - ROUTOURNE proves efficient, inducing at worst a linear overhead. Its accuracy and optimality have been proven, and its effectiveness evaluated by generalizing it to several more or less complex path calculation algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
