arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.09320cs.NI
收藏

大规模网络中采用分段路由的近优时延约束路径

Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks

Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser

摘要:

随着对实时视频流、云游戏和工业4.0应用等准即时通信服务的需求不断增长,多约束流量工程(TE)变得越来越重要。虽然传统TE管理平面的部署已被证明是费力的,但分段路由(SR)大大简化了TE路径的部署,因此越来越多地被互联网服务提供商(ISP)采用。有一个明确的需求,在计算和部署延迟约束的最小成本路径(DCLC)与SR的实时交互服务。然而,目前大多数DCLC解决方案并不是为SR量身定制的,它们也往往缺乏效率或保证。类似的近似方案,我们认为,面临的挑战是设计一个算法提供性能和保证。然而,与大多数这些计划相反,我们也考虑了操作限制,以提供实用的,高性能的实现。我们利用延迟测量的固有局限性,并考虑到SR增加的操作约束,设计一个新的算法,best2cop,在所有情况下提供保证和性能。Best2cop在多达1000个节点的随机和真实网络上的性能优于最先进的算法。依靠商品硬件与一个线程,我们的算法检索所有非多余的三维路由仅250毫秒和100毫秒分别。使用多线程可以进一步减少执行时间,因为best2cop的设计可以在核心数量上实现几乎线性的加速。最后,我们扩展best2cop处理大规模的ISP利用这些部署的多区域分区。由于我们的新的拓扑生成器专门设计用于模拟这样的大规模IP网络的现实模式,我们表明,best2cop解决DCLC-SR在大约1秒,即使ISP有超过10万个路由器。

英文摘要:

With a growing demand for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic Engineering (TE) becomes increasingly important. While legacy TE management planes have proven laborious to deploy, Segment Routing (SR) drastically eases the deployment of TE paths and is thus increasingly adopted by Internet Service Providers (ISP). There is a clear need in computing and deploying Delay-Constrained Least-Cost paths (DCLC) with SR for real-time interactive services. However, most current DCLC solutions are not tailored for SR. They also often lack efficiency or guarantees. Similarly to approximation schemes, we argue that the challenge is to design an algorithm providing both performances and guarantees. However, conversely to most of these schemes, we also consider operational constraints to provide a practical, high-performance implementation. We leverage the inherent limitations of delay measurements and account for the operational constraint added by SR to design a new algorithm, best2cop, providing guarantees and performance in all cases. Best2cop outperforms a state-of-the-art algorithm on both random and real networks of up to 1000 nodes. Relying on commodity hardware with a single thread, our algorithm retrieves all non-superfluous 3-dimensional routes in only 250ms and 100ms respectively. This execution time is further reduced using multiple threads, as the design of best2cop enables a speedup almost linear in the number of cores. Finally, we extend best2cop to deal with massive scale ISP by leveraging the multi-area partitioning of these deployments. Thanks to our new topology generator specifically designed to model the realistic patterns of such massive IP networks, we show that best2cop solves DCLC-SR in approximately 1 second even for ISP having more than 100000 routers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑