use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindPathOverDiamondWithOneActiveRouteByCostAndBandwidth.
@Test
public void shouldFindPathOverDiamondWithOneActiveRouteByCostAndBandwidth() throws UnroutableFlowException, RecoverableException {
createDiamond(IslStatus.INACTIVE, IslStatus.ACTIVE, 10, 20, "01:", 1);
Switch srcSwitch = getSwitchById("01:01");
Switch destSwitch = getSwitchById("01: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));
// ====> only difference is it should now have C as first hop .. since B is inactive
// chooses path C
assertEquals(new SwitchId("01:03"), path.getForward().getSegments().get(0).getDestSwitchId());
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostAndBandwidthPathComputationStrategyTest method shouldFindPathOverDiamondWithNoCostOnOneRoute.
@Test
public void shouldFindPathOverDiamondWithNoCostOnOneRoute() throws UnroutableFlowException, RecoverableException {
/*
* simple happy path test .. but pathB has no cost .. but still cheaper than pathC (test the default)
*/
createDiamond(IslStatus.ACTIVE, IslStatus.ACTIVE, -1, 2000, "03:", 1);
Switch srcSwitch = getSwitchById("03:01");
Switch destSwitch = getSwitchById("03: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));
// ====> Should choose B .. because default cost (700) cheaper than 2000
// chooses path B
assertEquals(new SwitchId("03:02"), path.getForward().getSegments().get(0).getDestSwitchId());
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class InMemoryPathComputerBaseTest method shouldFindAffinityPathOnDiamond.
void shouldFindAffinityPathOnDiamond(PathComputationStrategy pathComputationStrategy) throws Exception {
createDiamondWithAffinity();
Flow flow = Flow.builder().flowId("new-flow").affinityGroupId(TEST_FLOW_ID).bandwidth(10).srcSwitch(getSwitchById("00:0A")).destSwitch(getSwitchById("00:0D")).encapsulationType(FlowEncapsulationType.TRANSIT_VLAN).pathComputationStrategy(pathComputationStrategy).build();
PathComputer pathComputer = pathComputerFactory.getPathComputer();
GetPathsResult affinityPath = pathComputer.getPath(flow);
List<Segment> segments = affinityPath.getForward().getSegments();
assertEquals(new SwitchId("00:0B"), segments.get(1).getSrcSwitchId());
assertEquals(new SwitchId("00:0B"), segments.get(0).getDestSwitchId());
}
use of org.openkilda.pce.PathComputer in project open-kilda by telstra.
the class CostPathComputationStrategyTest 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 = new TestFlowBuilder().srcSwitch(srcSwitch).destSwitch(destSwitch).bandwidth(100).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 CostPathComputationStrategyTest method shouldFindPathOverDiamondWithOneActiveRouteByCost.
@Test
public void shouldFindPathOverDiamondWithOneActiveRouteByCost() throws UnroutableFlowException, RecoverableException {
createDiamond(IslStatus.INACTIVE, IslStatus.ACTIVE, 10, 20, "01:", 1);
Switch srcSwitch = getSwitchById("01:01");
Switch destSwitch = getSwitchById("01:04");
Flow f = new TestFlowBuilder().srcSwitch(srcSwitch).destSwitch(destSwitch).bandwidth(100).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("01:03"), path.getForward().getSegments().get(0).getDestSwitchId());
}
Aggregations