13 January 2025 in IEEE Journal on Selected Areas in Communications
Recent advancements in the context of Segment Routing (SR) have shown that the Midpoint Optimization (MO) concept enables a substantial reduction in the number of SR policies required to implement Traffic Engineering (TE) configurations. In this paper, we demonstrate that this concept can also be applied to the use case of tactical TE to considerably reduce the number of network changes required to react to critical events, thereby facilitating lower provisioning times and a generally improved time-to-repair. For this, we develop MOLS, a Local Search-based optimization routine that is able to provide close to optimal solutions within just a couple of seconds. The latter is shown based on extensive evaluations featuring various real-world topologies, including data from the backbone of a Tier-1 Internet Service Provider. Compared to state-of-the-art approaches relying on conventional SR, MOLS achieves similar or better solution quality while requiring substantially fewer configuration changes to implement the respective solutions. Furthermore, MOLS is able to resolve over 99% of overutilization scenarios resulting from different failure types, mostly within sub-second fashion and with an exceptionally small number of changes. Lastly, we also extend MOLS to adhere to specified latency bounds while even fixing initially violated ones.
26 February 2024 in IEEE Open Journal of the Communications Society
In this paper, we discuss and examine the concept of Midpoint Optimization (MO) for Segment Routing (SR). It is based on the idea of integrating SR policies into the Interior Gateway Protocol (IGP) to allow various demands to be steered into them. We discuss the benefits of this approach when compared to end-to-end SR and potential challenges that might arise in deployment. We further develop a Linear Program-based optimization algorithm to assess the Traffic Engineering capabilities of MO for SR. Based on traffic and topology data from a Tier-1 Internet Service Provider as well as other, publicly available data, we show that, for most problem instances, this algorithm is able to achieve (close to) optimal results with regards to the maximum link utilization, that are on par with state-of-the-art end-to-end SR approaches. However, our MO approach requires substantially less policies to do so. For some instances, the achieved reduction ranges up to more than 99%. Furthermore, we show that latency bounds for individual demands can be incorporated into our algorithm without significantly worsening the quality of solutions. This is a crucial finding as the inclusion of latency bounds is a basically mandatory requirement for traffic engineering algorithms to be used in many real-world networks.
11 April 2025 in Computer Communications