Optimizing IP networks in a hybrid IGP/MPLS environment

Mulyana, Eueung; Killat, Ulrich

doi:10.1007/bf03179726

Cited by 1 publication

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar observations are made in [8] with regards to an IGP Shortcut approach for MPLS tunnels. There, a heuristic approach is chosen instead.…”

Section: Policy Dependencies and Resulting Computational Problemssupporting

confidence: 79%

“…Besides their use as simple end-to-end tunnels, there are some approaches to incorporate them into the IGP routing (cf. [7], [8], [9]) and, thus, make them usable by more than one demand. A rather simplistic approach, often referred to as Basic IGP Shortcut, is to steer a packet into a tunnel starting at the current node if the tunnel endpoint corresponds to the packets destination.…”

Section: A Integration Of Mpls Tunnels Into Igp Routingmentioning

confidence: 99%

“…In [19], a simulated annealing heuristic using Basic IGP Shortcut is presented which is able to achieve near-optimal MLU with only a rather small number of tunnels. In [8], multiple heuristics for computing MPLS tunnel configurations for various hybrid IGP/MPLS routing schemes, such as IGP Shortcut and Basic IGP Shortcut, are proposed. In an exemplary evaluation, they come to the conclusion that IGP Shortcut tends to perform best regarding MLU minimization.…”

Section: A Midpoint Optimization-like Conceptsmentioning

confidence: 99%

“…It will not draw additional traffic from nearby paths. Third, a similar approach was found to perform best with regards to the integration of MPLS tunnels into the IGP [8]. And lastly, according to the respective documentations (e.g., [25]), the IGP Shortcut approach seems to be the standard MO approach that is supported in recent routing hard-and software by some of the large vendors.…”

Section: A Selecting An Mo Implementationmentioning

confidence: 99%

“…Hence, for the sake of readability, Figure 7c instead depicts the distributions of the MLUs across all instances for the respective algorithms. The dashed green line marks the theoretical optimal solution value of 0.9 obtained by MCF 8 . It can be seen that 2SR as well as SC2SR are able to obtain (near-)optimal MLUs close to 0.9 for nearly all instances, apart from a few outliers.…”

Section: A Maximum Link Utilizationmentioning

confidence: 99%

See 4 more Smart Citations

An Extended Look at Midpoint Optimization for Segment Routing

Brundiers,

Schüller,

Aschenbruck

2024

IEEE Open J. Commun. Soc.

View full text Add to dashboard Cite

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.

show abstract

“…Similar observations are made in [8] with regards to an IGP Shortcut approach for MPLS tunnels. There, a heuristic approach is chosen instead.…”

Section: Policy Dependencies and Resulting Computational Problemssupporting

confidence: 79%

Section: A Integration Of Mpls Tunnels Into Igp Routingmentioning

confidence: 99%