X-Git-Url: https://git.opendaylight.org/gerrit/gitweb?a=blobdiff_plain;f=pce%2Fsrc%2Fmain%2Fjava%2Forg%2Fopendaylight%2Ftransportpce%2Fpce%2Fgraph%2FPceGraph.java;h=768a65d5600009775eb63b1428ebdfb826d229f0;hb=ef07061cf7c0b08dc2f29d640892049c2f8c30b4;hp=279d23ef7be7748b18ad3a1b918a644db99364b3;hpb=62fc6625966276207a38955eaf07988f77f6984f;p=transportpce.git diff --git a/pce/src/main/java/org/opendaylight/transportpce/pce/graph/PceGraph.java b/pce/src/main/java/org/opendaylight/transportpce/pce/graph/PceGraph.java index 279d23ef7..768a65d56 100644 --- a/pce/src/main/java/org/opendaylight/transportpce/pce/graph/PceGraph.java +++ b/pce/src/main/java/org/opendaylight/transportpce/pce/graph/PceGraph.java @@ -13,19 +13,27 @@ import java.util.HashMap; import java.util.Iterator; import java.util.List; import java.util.Map; - +import java.util.Map.Entry; +import java.util.function.Function; +import java.util.stream.Collectors; +import java.util.stream.IntStream; +import org.jgrapht.Graph; import org.jgrapht.GraphPath; -import org.jgrapht.alg.shortestpath.KShortestSimplePaths; import org.jgrapht.alg.shortestpath.PathValidator; +import org.jgrapht.alg.shortestpath.YenKShortestPath; import org.jgrapht.graph.DefaultDirectedWeightedGraph; import org.opendaylight.transportpce.common.ResponseCodes; +import org.opendaylight.transportpce.common.StringConstants; +import org.opendaylight.transportpce.common.network.NetworkTransactionService; import org.opendaylight.transportpce.pce.constraints.PceConstraints; import org.opendaylight.transportpce.pce.networkanalyzer.PceLink; import org.opendaylight.transportpce.pce.networkanalyzer.PceNode; import org.opendaylight.transportpce.pce.networkanalyzer.PceResult; import org.opendaylight.transportpce.pce.networkanalyzer.PceResult.LocalCause; +import org.opendaylight.yang.gen.v1.http.org.opendaylight.transportpce.pce.rev230925.PceConstraintMode; +import org.opendaylight.yang.gen.v1.http.org.openroadm.common.state.types.rev191129.State; import org.opendaylight.yang.gen.v1.urn.ietf.params.xml.ns.yang.ietf.network.rev180226.NodeId; - +import org.opendaylight.yang.gen.v1.urn.ietf.params.xml.ns.yang.ietf.network.topology.rev180226.LinkId; import org.slf4j.Logger; import org.slf4j.LoggerFactory; @@ -35,69 +43,77 @@ public class PceGraph { ////////////////////////// for Graph /////////////////////////// // how many paths to bring - private int kpathsToBring = 10; - - // max #hops - private int mhopsPerPath = 50; + private int kpathsToBring = 15; // input - private Map allPceNodes = new HashMap(); + private Map allPceNodes = new HashMap<>(); + private Map allPceLinks = new HashMap<>(); private PceNode apceNode = null; private PceNode zpceNode = null; private String serviceType = ""; - + private Double margin = null; PceConstraints pceHardConstraints; PceConstraints pceSoftConstraints; + private PceConstraintMode pceConstraintMode; // results private PceResult pceResult = null; private List shortestPathAtoZ = null; // for path calculation - List> allWPaths = null; + Map> allWPaths = null; + + private List pathAtoZ = new ArrayList<>(); - private List pathAtoZ = new ArrayList(); + private final NetworkTransactionService networkTransactionService; public PceGraph(PceNode aendNode, PceNode zendNode, Map allPceNodes, - PceConstraints pceHardConstraints, PceConstraints pceSoftConstraints, PceResult pceResult, - String serviceType) { + Map allPceLinks, PceConstraints pceHardConstraints, PceConstraints pceSoftConstraints, + PceResult pceResult, String serviceType, NetworkTransactionService networkTransactionService, + PceConstraintMode mode) { super(); this.apceNode = aendNode; this.zpceNode = zendNode; this.allPceNodes = allPceNodes; + this.allPceLinks = allPceLinks; this.pceResult = pceResult; this.pceHardConstraints = pceHardConstraints; this.pceSoftConstraints = pceSoftConstraints; this.serviceType = serviceType; + this.networkTransactionService = networkTransactionService; + this.pceConstraintMode = mode; - LOG.info("In GraphCalculator: A and Z = {} / {} ", aendNode.toString(), zendNode.toString()); - LOG.debug("In GraphCalculator: allPceNodes size {}, nodes {} ", allPceNodes.size(), allPceNodes.toString()); + LOG.info("In GraphCalculator: A and Z = {} / {} ", aendNode, zendNode); + LOG.debug("In GraphCalculator: allPceNodes size {}, nodes {} ", allPceNodes.size(), allPceNodes); } public boolean calcPath() { LOG.info(" In PCE GRAPH calcPath : K SHORT PATHS algorithm "); - DefaultDirectedWeightedGraph weightedGraph = - new DefaultDirectedWeightedGraph(PceGraphEdge.class); + Graph weightedGraph = + new DefaultDirectedWeightedGraph<>(PceGraphEdge.class); populateWithNodes(weightedGraph); populateWithLinks(weightedGraph); if (!runKgraphs(weightedGraph)) { - LOG.info("In calcPath : pceResult {}", pceResult.toString()); + LOG.error("In calcPath : pceResult {}", pceResult); return false; } - // validate found paths pceResult.setRC(ResponseCodes.RESPONSE_FAILED); - for (GraphPath path : allWPaths) { - PostAlgoPathValidator papv = new PostAlgoPathValidator(); - pceResult = papv.checkPath(path, allPceNodes, pceResult, pceHardConstraints, serviceType); - LOG.info("In calcPath after PostAlgoPathValidator {} {}", - pceResult.getResponseCode(), ResponseCodes.RESPONSE_OK); - - if (!pceResult.getResponseCode().equals(ResponseCodes.RESPONSE_OK)) { - LOG.info("In calcPath: post algo validations DROPPED the path {}", path.toString()); + for (Entry> entry : allWPaths.entrySet()) { + GraphPath path = entry.getValue(); + LOG.info("validating path n° {} - {}", entry.getKey(), path.getVertexList()); + PostAlgoPathValidator papv = new PostAlgoPathValidator(networkTransactionService); + pceResult = papv.checkPath( + path, allPceNodes, allPceLinks, pceResult, pceHardConstraints, serviceType, pceConstraintMode); + this.margin = papv.getTpceCalculatedMargin(); + if (ResponseCodes.RESPONSE_OK.equals(pceResult.getResponseCode())) { + LOG.info("Path is validated"); + } else { + LOG.warn("In calcPath: post algo validations DROPPED the path {}; for following cause: {}", + path, pceResult.getLocalCause()); continue; } @@ -108,38 +124,55 @@ public class PceGraph { } shortestPathAtoZ = new ArrayList<>(pathAtoZ); - if (("100GE".equals(serviceType)) || ("OTU4".equals(serviceType))) { - LOG.info("In calcPath Path FOUND path for wl [{}], hops {}, distance per metrics {}, path AtoZ {}", - pceResult.getResultWavelength(), pathAtoZ.size(), path.getWeight(), pathAtoZ.toString()); - break; - } else { - // Service is at OTN layer and is relying on a supporting wavelength service - LOG.info("In calcPath Path FOUND path for hops {}, distance per metrics {}, path AtoZ {}", - pathAtoZ.size(), path.getWeight(), pathAtoZ.toString()); - break; + switch (serviceType) { + + case StringConstants.SERVICE_TYPE_100GE_T: + case StringConstants.SERVICE_TYPE_OTUC2: + case StringConstants.SERVICE_TYPE_OTUC3: + case StringConstants.SERVICE_TYPE_OTUC4: + case StringConstants.SERVICE_TYPE_400GE: + case StringConstants.SERVICE_TYPE_OTU4: + LOG.debug( + "In calcPath Path FOUND path for wl [{}], min Freq assignment {}, max Freq assignment {}," + + " hops {}, distance per metrics {}, path AtoZ {}", + pceResult.getResultWavelength(), pceResult.getMinFreq(), pceResult.getMaxFreq(), + pathAtoZ.size(), path.getWeight(), pathAtoZ); + break; + + default: + LOG.debug( + "In calcPath Path FOUND path for hops {}, distance per metrics {}, path AtoZ {}", + pathAtoZ.size(), path.getWeight(), pathAtoZ); + break; } + break; } if (shortestPathAtoZ != null) { - LOG.info("In calcPath CHOOSEN PATH for wl [{}], hops {}, path AtoZ {}", - pceResult.getResultWavelength(), shortestPathAtoZ.size(), shortestPathAtoZ.toString()); + LOG.info("In calcPath CHOOSEN PATH for wl [{}], min freq {}, max freq {}, hops {}, path AtoZ {}", + pceResult.getResultWavelength(), pceResult.getMinFreq(), pceResult.getMaxFreq(), + shortestPathAtoZ.size(), shortestPathAtoZ); } - LOG.info("In calcPath : pceResult {}", pceResult.toString()); + LOG.info("In calcPath : pceResult {}", pceResult); return (pceResult.getStatus()); } - private boolean runKgraphs(DefaultDirectedWeightedGraph weightedGraph) { + private boolean runKgraphs(Graph weightedGraph) { if (weightedGraph.edgeSet().isEmpty() || weightedGraph.vertexSet().isEmpty()) { return false; } PathValidator wpv = new InAlgoPathValidator(); - // KShortestPaths on weightedGraph - KShortestSimplePaths swp = - new KShortestSimplePaths(weightedGraph, mhopsPerPath, wpv); - allWPaths = swp.getPaths(apceNode.getNodeId().getValue(), zpceNode.getNodeId().getValue(), kpathsToBring); + // YenShortestPath on weightedGraph + YenKShortestPath swp = new YenKShortestPath<>(weightedGraph, wpv); + List> weightedPathList = swp + .getPaths(apceNode.getNodeId().getValue(), zpceNode.getNodeId().getValue(), kpathsToBring); + allWPaths = IntStream + .range(0, weightedPathList.size()) + .boxed() + .collect(Collectors.toMap(Function.identity(), weightedPathList::get)); if (allWPaths.isEmpty()) { LOG.info(" In runKgraphs : algorithm didn't find any path"); @@ -149,10 +182,8 @@ public class PceGraph { } // debug print - for (GraphPath path : allWPaths) { - LOG.debug("path Weight: {} : {}", path.getWeight(), path.getVertexList().toString()); - } - + allWPaths + .forEach((k, v) -> LOG.info("path n° {} - weight: {} - path: {}", k, v.getWeight(), v.getVertexList())); return true; } @@ -162,27 +193,29 @@ public class PceGraph { PceNode dest = allPceNodes.get(pcelink.getDestId()); if (source == null) { - LOG.error("In addLinkToGraph link source node is null : {}", pcelink.toString()); + LOG.error("In addLinkToGraph link source node is null : {}", pcelink); return false; } if (dest == null) { - LOG.error("In addLinkToGraph link dest node is null : {}", pcelink.toString()); + LOG.error("In addLinkToGraph link dest node is null : {}", pcelink); return false; } - LOG.debug("In addLinkToGraph link to nodes : {}{} {}", pcelink.toString(), source.toString(), dest.toString()); + LOG.debug("In addLinkToGraph link to nodes : {}{} {}", pcelink, source, dest); return true; } - private void populateWithNodes(DefaultDirectedWeightedGraph weightedGraph) { + private void populateWithNodes(Graph weightedGraph) { Iterator> nodes = allPceNodes.entrySet().iterator(); while (nodes.hasNext()) { Map.Entry node = nodes.next(); - weightedGraph.addVertex(node.getValue().getNodeId().getValue()); - LOG.debug("In populateWithNodes in node : {}", node.getValue().toString()); + if (State.InService.equals(node.getValue().getState())) { + weightedGraph.addVertex(node.getValue().getNodeId().getValue()); + LOG.debug("In populateWithNodes in node : {}", node.getValue()); + } } } - private boolean populateWithLinks(DefaultDirectedWeightedGraph weightedGraph) { + private boolean populateWithLinks(Graph weightedGraph) { Iterator> nodes = allPceNodes.entrySet().iterator(); while (nodes.hasNext()) { @@ -192,19 +225,20 @@ public class PceGraph { PceNode pcenode = node.getValue(); List links = pcenode.getOutgoingLinks(); - LOG.debug("In populateGraph: use node for graph {}", pcenode.toString()); + LOG.debug("In populateGraph: use node for graph {}", pcenode); for (PceLink link : links) { - LOG.debug("In populateGraph node {} : add edge to graph {}", pcenode.toString(), link.toString()); + LOG.debug("In populateGraph node {} : add edge to graph {}", pcenode, link); if (!validateLinkforGraph(link)) { continue; } + if (State.InService.equals(link.getState())) { + PceGraphEdge graphLink = new PceGraphEdge(link); + weightedGraph.addEdge(link.getSourceId().getValue(), link.getDestId().getValue(), graphLink); - PceGraphEdge graphLink = new PceGraphEdge(link); - weightedGraph.addEdge(link.getSourceId().getValue(), link.getDestId().getValue(), graphLink); - - weightedGraph.setEdgeWeight(graphLink, chooseWeight(link)); + weightedGraph.setEdgeWeight(graphLink, chooseWeight(link)); + } } } return true; @@ -216,15 +250,15 @@ public class PceGraph { switch (pceHardConstraints.getPceMetrics()) { case HopCount : weight = 1; - LOG.debug("In PceGraph HopCount is used as a metrics. {}", link.toString()); + LOG.debug("In PceGraph HopCount is used as a metrics. {}", link); break; case PropagationDelay : weight = link.getLatency(); - LOG.debug("In PceGraph PropagationDelay is used as a metrics. {}", link.toString()); - if ((("1GE".equals(serviceType)) || ("10GE".equals(serviceType)) || ("ODU4".equals(serviceType))) - && (weight == 0)) { + LOG.debug("In PceGraph PropagationDelay is used as a metrics. {}", link); + if ((weight == 0) + && ("1GE".equals(serviceType) || "10GE".equals(serviceType) || "ODU4".equals(serviceType))) { LOG.warn("PropagationDelay set as metric, but latency is null: is latency set for OTN link {}?", - link.toString()); + link); } break; // TODO implement IGPMetric and TEMetric - low priority. @@ -246,10 +280,6 @@ public class PceGraph { this.kpathsToBring = kpathsToBring; } - public void setMhopsPerPath(int mhopsPerPath) { - this.mhopsPerPath = mhopsPerPath; - } - public List getPathAtoZ() { return shortestPathAtoZ; } @@ -258,6 +288,10 @@ public class PceGraph { return pceResult; } + public Double getmargin() { + return margin; + } + public void setConstrains(PceConstraints pceHardConstraintsInput, PceConstraints pceSoftConstraintsInput) { this.pceHardConstraints = pceHardConstraintsInput; this.pceSoftConstraints = pceSoftConstraintsInput;