Incremental Deployment of Segment Routing Into an ISP Network: a Traffic Engineering Perspective

Cianfrani, Antonio; Listanti, M.; Polverini, Marco

doi:10.1109/tnet.2017.2731419

Cited by 53 publications

(32 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Besides, with injected "lies", Fibbing could lead to debugging issues and incorrect operation. DEFO [40] leverages segment routing to control routing paths for carrier-grade traffic engineering but shares some similar limitations as in Fibbing. Besides, its constraint programming based middle-point selection largely focuses on static traffic matrices, while our proposed TE module can load balance dynamic traffic demands.…”

Section: Related Workmentioning

confidence: 99%

Optimizing Gradual SDN Upgrades in ISP Networks

Poularakis

Iosifidis

Smaragdakis

2019

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Nowadays, there is a fast-paced shift from legacy telecommunication systems to novel Software Defined Network (SDN) architectures that can support on-the-fly network reconfiguration, therefore, empowering advanced traffic engineering mechanisms. Despite this momentum, migration to SDN cannot be realized at once especially in high-end networks of Internet Service Providers (ISPs). It is expected that ISPs will gradually upgrade their networks to SDN over a period that spans several years. In this paper, we study the SDN upgrading problem in an ISP network: which nodes to upgrade and when. We consider a general model that captures different migration costs and network topologies, and two plausible ISP objectives: (1) the maximization of the traffic that traverses at least one SDN node, and (2) the maximization of the number of dynamically selectable routing paths enabled by SDN nodes. We leverage the theory of submodular and supermodular functions to devise algorithms with provable approximation ratios for each objective. Using real-world network topologies and traffic matrices, we evaluate the performance of our algorithms and show up to 54% gains over state-of-the-art methods. Moreover, we describe the interplay between the two objectives; maximizing one may cause a factor of 2 loss to the other. We also study the dual upgrading problem, i.e., minimizing the upgrading cost for the ISP while ensuring specific performance goals. Our analysis shows that our proposed algorithm can achieve up to 2.5 times lower cost to ensure performance goals over state-of-the-art methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimizing Gradual SDN Upgrades in ISP Networks

Poularakis

Iosifidis

Smaragdakis

2019

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Essa estratégia, no entanto, considera apenas caminhos mais curtos para solucionar um problema de fluxos com múltiplas commodities e, de forma independente, a utilização da capacidade de enlaces. Em [7]é proposta a definição de domínios com nós habilitados e não habilitados para o roteamento por segmentos com plano de encaminhamento de dados IPv6. No domínio com nós habilitados por roteamento por segmentosé aplicada a engenharia de tráfego através de um modelo MILP (Mixed Integer Linear Programming) para minimizar a utilização do enlace.…”

Section: Trabalhos Relacionadosunclassified

“…O roteamento por segmentos soluciona nativamente a configuração em grande escala de túneis através do reuso de segmentos e pela sua flexibilidade de automação através do SDN [9]. No entanto, nos roteadores de borda a configuração de muitos segmentos implica em bases de informação de encaminhamento extensas (SR-FIB -Segment Routing FIB), e empilhamento de muitos rótulos [7], comprometendo o desempenho destes roteadores e aumentando a unidade de transmissão (MTU -Maximum Transmission Unit). Assim, o idealé minimizar a quantidade de segmentos necessários.…”

Section: Descrição Do Problemaunclassified

“…Esses caminhos são calculados de forma a minimizar a carga nos enlaces da rede e minimizar métricas de engenharia de tráfego (TE). No presente trabalho, a métrica TE escolhidaé a latência, por ser importante na prestação de serviços críticos de telecomunicações [7]. Na segunda etapa, escolhem-se quais segmentos são utilizados nos caminhos calculados na etapa anterior.…”

Section: Modelo Proposto O Modelo Proposto Recebe Um Conjunto De Flu-unclassified

See 1 more Smart Citation

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

“…A further contribution of the paper is to propose the use of Segment Routing (SR) [12][13][14] to implement the data plane of our architecture. SR is a novel technology allowing the implementation of advanced TE features with a reduced complexity.…”

Section: Introductionmentioning

confidence: 99%

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

et al. 2019

Self Cite

View full text Add to dashboard Cite

Network Function Virtualization is a new technology allowing for a elastic cloud and bandwidth resource allocation. The technology requires an orchestrator whose role is the service and resource orchestration. It receives service requests, each one characterized by a Service Function Chain, which is a set of service functions to be executed according to a given order. It implements an algorithm for deciding where both to allocate the cloud and bandwidth resources and to route the SFCs. In a traditional orchestration algorithm, the orchestrator has a detailed knowledge of the cloud and network infrastructures and that can lead to high computational complexity of the SFC Routing and Cloud and Bandwidth resource Allocation (SRCBA) algorithm. In this paper, we propose and evaluate the effectiveness of a scalable orchestration architecture inherited by the one proposed within the European Telecommunications Standards Institute (ETSI) and based on the functional separation of an NFV orchestrator in Resource Orchestrator (RO) and Network Service Orchestrator (NSO). Each cloud domain is equipped with an RO whose task is to provide a simple and abstract representation of the cloud infrastructure. These representations are notified of the NSO that can apply a simplified and less complex SRCBA algorithm. In addition, we show how the segment routing technology can help to simplify the SFC routing by means of an effective addressing of the service functions. The scalable orchestration solution has been investigated and compared to the one of a traditional orchestrator in some network scenarios and varying the number of cloud domains. We have verified that the execution time of the SRCBA algorithm can be drastically reduced without degrading the performance in terms of cloud and bandwidth resource costs.

show abstract

Incremental Deployment of Segment Routing Into an ISP Network: a Traffic Engineering Perspective

Cited by 53 publications

References 17 publications

Optimizing Gradual SDN Upgrades in ISP Networks

Optimizing Gradual SDN Upgrades in ISP Networks

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

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

Contact Info

Product

Resources

About