Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network

Schüller, Timmy; Aschenbruck, Nils; Chimani, Markus; Horneffer, Martin; Schnitter, Stefan

doi:10.1109/tnet.2018.2854610

Cited by 41 publications

(45 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The maximum link utilization performance of 2-seg is identical to ∞-seg. Moreover, the effectiveness of the 2-segment setting has been asserted by [10], [25], [26], therefore we restrict our focus to the 2-segment setting in the following.…”

Section: B Segment Routingmentioning

confidence: 99%

A Computation-Efficient Approach for Segment Routing Traffic Engineering

et al. 2019

View full text Add to dashboard Cite

The unprecedented growth of network traffic has brought excessive challenges to network operators. To prevent network congestion, network operators conduct traffic engineering (TE) for their routing optimization. In recent years, segment routing traffic engineering (SRTE) has emerged as one of the promising approaches for its high scalability and low control overheads. However, conventional SRTE approaches in large-scale networks are computationally prohibitive, which may lead to delayed system operations and unsatisfactory service qualities. In this paper, we formulate a bi-objective mixed-integer nonlinear program (BOMINLP) to investigate the trade-off between link utilization and computation time in SRTE. Due to the difficulty in solving the original problem directly, we decompose it into two sequential sub-problems. The first sub-problem is to minimize computation time through node selection, and the second one is to minimize maximum link utilization via flow assignment. To this end, we first employ randomized sampling based on stretch bounding to obtain a reduced solution space and then solve a linear program (LP) using existing software tools for the sub-problems. To evaluate our proposed solution, we employ network topologies and traffic matrices from publicly available datasets. Our simulation results show that our proposed solution can effectively reduce computation time while retaining comparable maximum link utilization as compared with several comparison approaches. INDEX TERMS Segment routing, traffic engineering, bi-objective mixed-integer nonlinear program.

show abstract

Section: B Segment Routingmentioning

confidence: 99%

A Computation-Efficient Approach for Segment Routing Traffic Engineering

et al. 2019

View full text Add to dashboard Cite

show abstract

“…De forma geral, os trabalhos relacionados a otimização em roteamento por segmentos propõem uma quantidade arbitrária de segmentos para um caminho (k-segmentos) [4]- [6] através da solução de um problema de fluxos com múltiplas commodities (Multi Commoditity Flows) fixando-se um valor inteiro k, com caminhos que permitem balanceamento do tráfego ou não. Em [5]é sugerido um modelo em duas fases onde a primeira busca distribuir a carga e cujos resultados são utilizados no modelo da segunda fase para minimização da quantidade de segmentos e de túneis SR-TE (Segment Routing -Traffic Engineering), limitado ou não por demanda.…”

Section: Trabalhos Relacionadosunclassified

“…Entretanto, ainda existe uma quantidade significativa de caminhos que empregam três ou quatro segmentos para cumprir as exigências de engenharia de tráfego. Isso está de acordo com o trabalho em [5], que mostra que limitações de carga nos enlaces podem aumentar a quantidade de segmentos necessários.…”

Section: B Segunda Etapa De Otimizaçãounclassified

Modelo de Otimização para Engenharia de Tráfego Usando Roteamento por Segmentos

Silverio¹,

Campista²,

Couto³

et al. 2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

Resumo-Neste artigo formula-se um problema de otimização combinatória biobjetivo em duas etapas, aplicável a redes de roteadores de núcleo de operadoras de telecomunicações, considerando uma rede de backbone com roteamento por segmentos e engenharia de tráfego. O modelo tem a finalidade de distribuir os fluxos considerando condições de gargalos de capacidade e métricas de rede estabelecidas pela operadora de Telecomunicações. Resultados baseados em exemplos reais são apresentados, demonstrando-se os benefícios do modelo em relação ao estado da arte das propostas de modelagem de roteamento por segmentos, como o tratamento de múltiplos objetivos de rede minimizando a quantidade de túneis de roteamento por segmentos. Palavras-Chave-Engenharia de tráfego, roteamento por segmentos, gerenciamento de redes.

show abstract

“…There already are propositions for traffic engineering optimization models using SR. But when trying to translate them from theory into a real deployment, many practical constraints arise [24]. One important and non-trivial requirement is to make the network resilient against failures.…”

Section: Introductionmentioning

confidence: 99%

“…with an extension that limits the number of tunnels deployed: The Tunnel Limit Extension (TLE) (introduced in [24]). By doing so, we make sure our approaches can be deployed in real networks.…”

Section: Introductionmentioning

confidence: 99%

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Schüller

Aschenbruck

Chimani

et al. 2021

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Traffic engineering is an important concept that allows Internet Service Providers (ISPs) to utilize their existing routing hardware more efficiently. One technology that can be used is Segment Routing (SR). In this paper, we address the use of SR to increase the resilience against failure scenarios. In addition, we develop solutions that are manageable and, thus, deployable in a tier 1 ISP network. We propose a post-convergence aware SR based optimization model. With it, we can proactively find a single SR configuration that is beneficial in all predefined failure scenarios, including single link failures, shared risk link group failures, and node failures. In addition to this usecase, we also extend the optimization model to include other important practical requirements such as keeping the number of SR tunnels to a minimum, avoiding arbitrary traffic splitting, or meeting latency bounds. We evaluate our approaches with recently measured data from a tier 1 ISP and show that we can improve over state of the art routing approaches.

show abstract

Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network

Cited by 41 publications

References 19 publications

A Computation-Efficient Approach for Segment Routing Traffic Engineering

A Computation-Efficient Approach for Segment Routing Traffic Engineering

Modelo de Otimização para Engenharia de Tráfego Usando Roteamento por Segmentos

Failure Resiliency With Only a Few Tunnels – Enabling Segment Routing for Traffic Engineering

Contact Info

Product

Resources

About