Fast and scalable optimization for segment routing.

Nowadays, the Internet delivers more than 1 zettabyte (or 1,000,000,000,000, 000,000,000 bytes) of data to more than 3.2 billions of users every year. As a consequence, network operators face difficult challenges due to the impressive (and continuously growing) quantity of data to handle. Upgrading a network infrastructure with better hardware, to accommodate such a growth, has a significant cost (in terms of money and time) that network operators are trying to reduce by improving the efficiency (and thus the lifespan) of their network infrastructures. Traffic Engineering is a domain of networking that specifically aims at providing network operators with tools to optimize their networks. This thesis focuses on the problem of increasing the efficiency of a network by controlling the paths on which the traffic is sent using a new network framework called Segment Routing. In particular, we present various algorithms based on Mixed Integer Programming, Local Search, and Constraint Programming techniques to solve this traffic engineering problem on large networks like the ones of major Internet service providers.