Working on a small prototype for PCE Code for learning purposes.Right now it uses BGP-LS as an input and parses the topology.Then it allows to compute shortest path based on following constraints:
-
No Constraint ( Simple Heap based Dijkstra)
-
Avoid or Include a certain Link as a Constraint.
-
Available BW as a Constraint.
-
Available BW + (Avoid or Include a certain Link as constraint).
-
Avoid a Node