Models and Algorithms for Network Optimization with Segment Routing

Mon, 05/25/2020 - 13:09 by Olivier Bonaventure


Optimizing the way traffic is routed over networks has been of interest since we first started using computer networks to communicate and exchange infor- mation. Network technologies are constantly evolving and so do the underlying problems that need to be solved.
This thesis focus on studying the recently proposed segment routing tech- nology. In a traditional IP network, packets are routed using shorted paths according to weights that are configured on the network links. Segment rout- ing offers a new way of routing traffic by allowing packets to do some detours on their way. Between these detours, traditional shortest path routing is used, making this technology have almost no usage overhead.
We aim at providing a mathematical formalization of segment routing and showcase several of its use cases. We believe that such a formalization is going to help advance the research of the algorithmic aspects of segment routing by providing a solid mathematical foundation and notations which can serve as a starting point for others to research this topic.
We leverage segment routing to solve traffic engineering problems, perform network monitoring and provide traffic duplication services that are robust to link failures.

François Aubry
PhD thesis
UCLouvain, 2020.
Full text
pdf   (1.63 MB)
Cite it
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.