Optimized Network Traffic Engineering using Segment Routing

Traditional routing in IP networks is along shortest paths using link weight as the metric. It has been observed that under some traffic conditions, shortest path routing can lead to congestion on some links in the network while capacity is available elsewhere in the network. Segment Routing is new IETF protocol to address this problem. The key idea in segment routing is to break up the routing path into segments in order to enable better network utilization. Segment routing can also enables finer control of the routing paths. It can be also 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 offine case and a competitive algorithm for online segment routing.