This repository contains the code of our RedPath BMv2 implementation.
If you use any portion of our work, please cite our paper:
@inproceedings{2026_fink_redpath,
author = {Fink, Ina Berenice and Weinhold, Aurel and Wehrle, Klaus},
title = {{Advancing Resilient Communication in Industrial Networks with P4-Programmable Data Planes and Multipath Transport Protocols}},
booktitle = {2026 IEEE 51st Conference on Local Computer Networks Companion Proceedings (LCN-C), Oct 7-9, 2026, Coimbra, Portugal},
year = {2026},
publisher = {IEEE},
}This project is licensed under the GNU General Public License v3.0.
The file controller/main.py contains code derived from the
P4 tutorials project and is licensed under the Apache License 2.0.
Copyright 2018 Nate Foster.
The original source is available at: https://github.com/p4lang/tutorials/blob/master/exercises/p4runtime/mycontroller.py
See LICENSES/Apache-2.0.txt for the Apache License 2.0.
The implementation of the diverse near-shortest-path algorithm in
Graph.py is an independent implementation based on:
C. Häcker, P. Bouros, T. Chondrogiannis, and E. Althaus, “Most Diverse Near-Shortest Paths,” Proceedings of the 29th International Conference on Advances in Geographic Information Systems (SIGSPATIAL ’21), pp. 229–239, 2021. DOI: 10.1145/3474717.3483955.