REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a pragmatic approach to improve reproducibility of experimental analyses of traffic engineering (TE) algorithms, whose implementation, evaluation and comparison are currently hard to replicate. Our envisioned goal is to enable universally-checkable experiments of existing and future TE algorithms. We describe the design and implementation of REPETITA, a software framework that implements common TE functions, automates experimental setup, and eases comparisons (in terms of solution quality, execution time, etc.) of TE algorithms. In its current version, REPETITA includes (i) a dataset for repeatable experiments, consisting of more than 250 real network topologies with complete bandwidth and delay information as well as associated traffic matrices; and (ii) the implementation of state-of-the-art algorithms for intra-domain TE with IGP weight tweaking and Segment Routing optimization. We showcase how our framework can successfully reproduce results described in the literature, and ease new analyses of qualitatively-diverse TE algorithms. We publicly release our REPETITA implementation, hoping that the community will consider it as a demonstration of feasibility, an incentive and an initial code basis for improving experiment reproducibility: Its plugin-oriented architecture indeed makes REPETITA easy to extend with new datasets, algorithms, TE primitives and analyses. We therefore invite the research community to use and contribute to our released code and dataset.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 1.
7 papers.
- 2023MAGNNETO: A Graph Neural Network-based Multi-Agent system for Traffic Engineeringcited by 10
- 2021Is Machine Learning Ready for Traffic Engineering Optimization?cited by 8
- 2021ENERO: Efficient Real-Time WAN Routing Optimization with Deep Reinforcement Learningcited by 4
- 2022Graph Neural Modeling of Network Flowscited by 2
- 2024Learning Sub-Second Routing Optimization in Computer Networks requires Packet-Level Dynamicscited by 2
- 2025Optimizing Resource Allocation for Geographically-Distributed Inference by Large Language Modelscited by 0
- 2026Towards Near-Real-Time Telemetry-Aware Routing with Neural Routing Algorithmscited by 0
- 2026Towards Near-Real-Time Telemetry-Aware Routing with Neural Routing Algorithms3 Apr 2026
- 2025Optimizing Resource Allocation for Geographically-Distributed Inference by Large Language Models26 Dec 2025
- 2024Learning Sub-Second Routing Optimization in Computer Networks requires Packet-Level Dynamics14 Oct 2024
- 2023MAGNNETO: A Graph Neural Network-based Multi-Agent system for Traffic Engineering31 Mar 2023
- 2022Graph Neural Modeling of Network Flows12 Sep 2022
- 2021ENERO: Efficient Real-Time WAN Routing Optimization with Deep Reinforcement Learning22 Sep 2021
- 2021Is Machine Learning Ready for Traffic Engineering Optimization?3 Sep 2021