Create a PCE module that takes a resolved path and widens the possible STP satisfying the path by converting the resolved STP into under specified STP if these STP can still satisfy the path request. The goal is to provide the widest possible set of feasible STPs along the viable path to give each NSA a larger set of STP from which to chose a solution.
We must not violate an ERO provided when performing this operation.
This PCE module is only used for sequential pathfinding requests where an NSA will create the reservation in sequence from A to Z one segment at a time.
A new PCE request algorithm called "SEQUENTIAL" will be added to invoke a flow containing this new PCE model after DijkstraPCE has been run.
Create a PCE module that takes a resolved path and widens the possible STP satisfying the path by converting the resolved STP into under specified STP if these STP can still satisfy the path request. The goal is to provide the widest possible set of feasible STPs along the viable path to give each NSA a larger set of STP from which to chose a solution.
We must not violate an ERO provided when performing this operation.
This PCE module is only used for sequential pathfinding requests where an NSA will create the reservation in sequence from A to Z one segment at a time.
A new PCE request algorithm called "SEQUENTIAL" will be added to invoke a flow containing this new PCE model after DijkstraPCE has been run.