This is the implementation of S-BCR routing algorithm and related analysis on Python.
Copyright (C) 2025 Musab Ahmed, Institute of Communication Networks, Hamburg University of Technology, Hamburg, Germany
This program is free software: you are free to redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along with this program. If not, see GNU Licenses.
The S-BCR Routing Algorithm Simulator is a Python-based implementation for evaluating the S-BCR routing algorithm. It includes an example on betweenness centrality calculation and performs routing simulations with and without Slurm compatibility.
Run the simulation using the run.sh script:
cd code
chmod +x run.sh
./run.sh