SRG contains Best2cop as presented in Computer Network & NCA. This version of Best2cop relies on the SR Graph to compute DCLC-SR paths. The conversion to the SRG is done beforehand, before the algorithm itself is run. In this version, Best2cop explores the SR Graph itself.
LCA contains a version of best2cop which does not explore the SR Graph itself, but rather relies on it to convert the paths it explores in their respective segment lists.
Finally, 2D contains a version of best2cop which does not consider Segment Routing at all. Thus, there is no SR Graph, nor any conversions. The goal of this version is to evaluation the performance of Best2cop as a constrained-path computation algorithm in a non-SR context.
make
This will compile the whole main program. You are now able to use it !
./best2cop [option] [mandadory parameters]
For each of these parameters you will need to choose one of them
Adding
--file [path_to_file]
To choose the topology file to load
--topo or --sr
Use --topo if the file represents the initial topology and --sr if the file represents the SR graph
--id or --labels
Use --id if the node are identified by a number, and --labels if the node are identified by a label
--all-nodes or --src [src_id]
Use --all-nodes option if you want to run best2cop with each node as source node, or --src if you want to run it using a specific source node
--accu [accuracy]
Set the delay accuracy to 10^(-accuracy)
--output [output_file]
Write the results in the given output file (created if not exists)
--cstr1 [c1]
Modify the first constraint (--cstr2 to modify the second)
--full
Remove the SEGMAX limit
Jean-Romain Luttringer ([email protected]) Pascal Merindol ([email protected]) Bramas Quentin ([email protected]) Cristel Pelsser ([email protected]) Francois Clad ([email protected]) Thomas Alfroy ([email protected])