use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindPathOverDiamondWithAllActiveLinksAndIgnoreBandwidth.
@Test
public void shouldFindPathOverDiamondWithAllActiveLinksAndIgnoreBandwidth() throws RecoverableException, UnroutableFlowException {
createDiamond(IslStatus.ACTIVE, IslStatus.ACTIVE, 10, 20, "05:", 1);
Switch srcSwitch1 = getSwitchById("05:01");
Switch destSwitch1 = getSwitchById("05:03");
Flow f1 = getTestFlowBuilder(srcSwitch1, destSwitch1).bandwidth(0).ignoreBandwidth(false).build();
PathComputer pathComputer = pathComputerFactory.getPathComputer();
GetPathsResult path = pathComputer.getPath(f1);
assertNotNull(path);
assertThat(path.getForward().getSegments(), Matchers.hasSize(1));
Switch srcSwitch2 = getSwitchById("05:01");
Switch destSwitch2 = getSwitchById("05:04");
Flow f2 = getTestFlowBuilder(srcSwitch2, destSwitch2).bandwidth(0).ignoreBandwidth(false).build();
path = pathComputer.getPath(f2);
assertNotNull(path);
assertThat(path.getForward().getSegments(), Matchers.hasSize(2));
assertEquals(new SwitchId("05:02"), path.getForward().getSegments().get(0).getDestSwitchId());
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFailToFindOverDiamondWithNoActiveRoutes.
@Test
public void shouldFailToFindOverDiamondWithNoActiveRoutes() throws UnroutableFlowException, RecoverableException {
createDiamond(IslStatus.INACTIVE, IslStatus.INACTIVE, 10, 30, "04:", 1);
Switch srcSwitch = getSwitchById("04:01");
Switch destSwitch = getSwitchById("04:04");
Flow f = getTestFlowBuilder(srcSwitch, destSwitch).build();
thrown.expect(UnroutableFlowException.class);
PathComputer pathComputer = pathComputerFactory.getPathComputer();
pathComputer.getPath(f);
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindPathOverTriangleWithOneActiveRouteByCostAndBandwidth.
@Test
public void shouldFindPathOverTriangleWithOneActiveRouteByCostAndBandwidth() throws UnroutableFlowException, RecoverableException {
/*
* simple happy path test .. but lowest path is inactive
*/
createTriangleTopo(IslStatus.INACTIVE, 5, 20, "02:", 1);
Switch srcSwitch = getSwitchById("02:01");
Switch destSwitch = getSwitchById("02:02");
Flow f = getTestFlowBuilder(srcSwitch, destSwitch).build();
PathComputer pathComputer = pathComputerFactory.getPathComputer();
GetPathsResult path = pathComputer.getPath(f);
assertNotNull(path);
assertThat(path.getForward().getSegments(), Matchers.hasSize(2));
// ====> only difference is it should now have C as first hop .. since B is inactive
// chooses path C
assertEquals(new SwitchId("02:03"), path.getForward().getSegments().get(0).getDestSwitchId());
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindTheSameDiversePath.
@Test
public void shouldFindTheSameDiversePath() throws RecoverableException, UnroutableFlowException {
createDiamondWithDiversity();
Flow flow = Flow.builder().flowId("new-flow").diverseGroupId("diverse").bandwidth(10).srcSwitch(getSwitchById("00:0A")).srcPort(10).destSwitch(getSwitchById("00:0D")).destPort(10).encapsulationType(FlowEncapsulationType.TRANSIT_VLAN).pathComputationStrategy(PathComputationStrategy.COST).build();
PathComputer pathComputer = pathComputerFactory.getPathComputer();
GetPathsResult diversePath = pathComputer.getPath(flow);
FlowPath forwardPath = FlowPath.builder().pathId(new PathId(UUID.randomUUID().toString())).srcSwitch(flow.getSrcSwitch()).destSwitch(flow.getDestSwitch()).bandwidth(flow.getBandwidth()).segments(new ArrayList<>()).build();
addPathSegments(forwardPath, diversePath.getForward());
flow.setForwardPath(forwardPath);
FlowPath reversePath = FlowPath.builder().pathId(new PathId(UUID.randomUUID().toString())).srcSwitch(flow.getDestSwitch()).destSwitch(flow.getSrcSwitch()).bandwidth(flow.getBandwidth()).segments(new ArrayList<>()).build();
addPathSegments(reversePath, diversePath.getReverse());
flow.setReversePath(reversePath);
flowRepository.add(flow);
GetPathsResult path2 = pathComputer.getPath(flow, flow.getPathIds());
assertEquals(diversePath, path2);
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindPathOverDiamondWithAllActiveLinksByCostAndBandwidth.
@Test
public void shouldFindPathOverDiamondWithAllActiveLinksByCostAndBandwidth() throws UnroutableFlowException, RecoverableException {
/*
* simple happy path test .. everything has cost
*/
createDiamond(IslStatus.ACTIVE, IslStatus.ACTIVE, 10, 20, "00:", 1);
Switch srcSwitch = getSwitchById("00:01");
Switch destSwitch = getSwitchById("00:04");
Flow f = getTestFlowBuilder(srcSwitch, destSwitch).build();
PathComputer pathComputer = pathComputerFactory.getPathComputer();
GetPathsResult path = pathComputer.getPath(f);
assertNotNull(path);
assertThat(path.getForward().getSegments(), Matchers.hasSize(2));
// chooses path B
assertEquals(new SwitchId("00:02"), path.getForward().getSegments().get(0).getDestSwitchId());
}
Aggregations