scispace - formally typeset
Proceedings ArticleDOI

Optimized network traffic engineering using segment routing

TLDR
This paper develops a traffic matrix oblivious algorithm for robust segment routing in the offline case and a competitive algorithm for online segment routing and shows that both these algorithms work well in practice.
Abstract
Segment Routing is a proposed IETF protocol to improve traffic engineering and online route selection in IP networks. The key idea in segment routing is to break up the routing path into segments in order to enable better network utilization. Segment routing also enables finer control of the routing paths and can be used to route traffic through middle boxes. This paper considers the problem of determining the optimal parameters for segment routing in the offline and online cases. We develop a traffic matrix oblivious algorithm for robust segment routing in the offline case and a competitive algorithm for online segment routing. We also show that both these algorithms work well in practice.

read more

Citations
More filters
Proceedings ArticleDOI

The Segment Routing Architecture

TL;DR: Segment Routing is presented, a new network architecture aimed at filling this gap, driven by use-cases defined by network operators, and its related ongoing standardization efforts are described.
Journal ArticleDOI

Segment Routing: A Comprehensive Survey of Research Activities, Standardization Efforts, and Implementation Results

TL;DR: In this paper, the authors present a tutorial and a comprehensive survey on Segment Routing (SR) technology, analyzing standardization efforts, patents, research activities and implementation results.
Journal ArticleDOI

An efficient routing algorithm based on segment routing in software-defined networking

TL;DR: This paper proposes a routing algorithm for SDN with SR that can meet the bandwidth requirements of routing requests and considers the balance of traffic load and reduces the extra cost of packet header size in a network.
Journal ArticleDOI

Segment Routing in Software Defined Networks: A Survey

TL;DR: A comprehensive review of the novel SR technology by describing its architecture, operations, and key applications to date and identifying an interesting set of future research directions and open issues that can help realize the full potential of the emergent SR paradigm.
Proceedings ArticleDOI

Optimizing restoration with segment routing

TL;DR: This work formulation of the centralized determination of connections primary paths so as to enable the best sharing of restoration bandwidth over non-simultaneous network failures is developed and an efficient primal-dual algorithm for the solution is developed.
References
More filters

Analysis of an Equal-Cost Multi-Path Algorithm

C. Hopps
TL;DR: This document gives an analysis of one method for routing packets along multiple paths of equal cost and includes the performance of the algorithm and the disruption caused by changes to the set of next-hops.

A Path Computation Element (PCE)-Based Architecture

Jerry Ash, +1 more
TL;DR: This document describes a set of building blocks for the PCE architecture from which solutions may be constructed and specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space.
Proceedings ArticleDOI

Faster and simpler algorithms for multicommodity flow and other fractional packing problems

TL;DR: This paper provides a different approach to these problems which yields faster and much simpler algorithms and allows us to substitute shortest path computations for min- cost flow computations in computing maximum concurrent flow and min-cost multicommodity flow.

Overview and Principles of Internet Traffic Engineering

TL;DR: The principles, architectures, and methodologies for performance evaluation and performance optimization of operational IP networks are discussed throughout this document.
Proceedings ArticleDOI

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

TL;DR: It is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands, according to a diverse collection of ISP networks.
Related Papers (5)