Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 9 min ago
PreprintarXiv licencearXiv

On the T-Adaptive Segment Routing Problem

  • Amal Benhamiche
  • Kaoutar Bouaachra
  • Yannick Carlinet
  • Morgan Chopin
  • Eric Gourdin
  • Nancy Perrot
Open at sourcePDFDOICite

Abstract

In this paper, we present a multi-period optimization problem arising from the traffic engineering of core IP/MPLS networks, called T-ASR. This problem aims at computing a sequence of segment routing paths that adapt to a multi-period scheduled maintenance, while allowing limited number of path reconfigurations between successive time steps. Rather than focusing solely on minimizing the classical Maximum Link Utilization (MLU) criteria, we introduce a more refined lexicographic objective that minimizes the entire sorted vector of link loads providing a more efficient resource utilization for all the links. We propose a generic approach that decomposes this problem into a sequence of subproblems. To model each subproblem, we introduce two Mixed Integer Linear Programming (MILP) formulations, ALEXA and STELA, resulting in two variants of our approach. Finally, we evaluate and compare the efficiency of both variants on small to medium-sized network instances.

Related

  1. Lexicographic Minimax Load Balancing for T-Adaptive Segment Routing
    Kaoutar Bouaachra
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. On the Segment-Based Remove-and-Reinsert Heuristic for the Generalized Traveling Salesman Problem
    Aljaž Krpan, Janez Žerovnik
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  3. PEAR: Permutation-Equivariant Adaptive Routing Multi-Agent Debate
    Yang Feng, Ziwei Xu, Xia Hu +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. RELAGRAM: Recursive Latent Graph Model for the Capacitated Vehicle Routing Problem
    Vladimir Kirill Bickov, Neil Yorke-Smith
    arXivPreprintCC BY-NC-SA 4.0Full textOptimisation & controlarXiv
  5. Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes
    Emanuele Casciaro, Mario De Simone, Stefano Martina +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{benhamiche2026tadaptive,
  title = {{On the T-Adaptive Segment Routing Problem}},
  author = {Amal Benhamiche and Kaoutar Bouaachra and Yannick Carlinet and Morgan Chopin and Eric Gourdin and Nancy Perrot},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32896},
  eprint = {2609.32896},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32896},
}
RIS
TY  - UNPB
TI  - On the T-Adaptive Segment Routing Problem
AU  - Amal Benhamiche
AU  - Kaoutar Bouaachra
AU  - Yannick Carlinet
AU  - Morgan Chopin
AU  - Eric Gourdin
AU  - Nancy Perrot
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32896
UR  - https://arxiv.org/abs/2609.32896
AB  - In this paper, we present a multi-period optimization problem arising from the traffic engineering of core IP/MPLS networks, called T-ASR. This problem aims at computing a sequence of segment routing paths that adapt to a multi-period scheduled maintenance, while allowing limited number of path reconfigurations between successive time steps. Rather than focusing solely on minimizing the classical Maximum Link Utilization (MLU) criteria, we introduce a more refined lexicographic objective that minimizes the entire sorted vector of link loads providing a more efficient resource utilization for all the links. We propose a generic approach that decomposes this problem into a sequence of subproblems. To model each subproblem, we introduce two Mixed Integer Linear Programming (MILP) formulations, ALEXA and STELA, resulting in two variants of our approach. Finally, we evaluate and compare the efficiency of both variants on small to medium-sized network instances.
ER  -