2 * Copyright © 2017 AT&T, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
9 package org.opendaylight.transportpce.pce.graph;
11 import java.util.ArrayList;
12 import java.util.HashMap;
13 import java.util.Iterator;
14 import java.util.List;
16 import org.jgrapht.GraphPath;
17 import org.jgrapht.alg.shortestpath.KShortestSimplePaths;
18 import org.jgrapht.alg.shortestpath.PathValidator;
19 import org.jgrapht.graph.DefaultDirectedWeightedGraph;
20 import org.opendaylight.transportpce.common.ResponseCodes;
21 import org.opendaylight.transportpce.common.StringConstants;
22 import org.opendaylight.transportpce.pce.constraints.PceConstraints;
23 import org.opendaylight.transportpce.pce.networkanalyzer.PceLink;
24 import org.opendaylight.transportpce.pce.networkanalyzer.PceNode;
25 import org.opendaylight.transportpce.pce.networkanalyzer.PceResult;
26 import org.opendaylight.transportpce.pce.networkanalyzer.PceResult.LocalCause;
27 import org.opendaylight.yang.gen.v1.http.org.openroadm.common.state.types.rev191129.State;
28 import org.opendaylight.yang.gen.v1.urn.ietf.params.xml.ns.yang.ietf.network.rev180226.NodeId;
29 import org.slf4j.Logger;
30 import org.slf4j.LoggerFactory;
32 public class PceGraph {
34 private static final Logger LOG = LoggerFactory.getLogger(PceGraph.class);
36 ////////////////////////// for Graph ///////////////////////////
37 // how many paths to bring
38 private int kpathsToBring = 10;
41 private int mhopsPerPath = 50;
44 private Map<NodeId, PceNode> allPceNodes = new HashMap<>();
45 private PceNode apceNode = null;
46 private PceNode zpceNode = null;
47 private String serviceType = "";
49 PceConstraints pceHardConstraints;
50 PceConstraints pceSoftConstraints;
53 private PceResult pceResult = null;
54 private List<PceLink> shortestPathAtoZ = null;
56 // for path calculation
57 List<GraphPath<String, PceGraphEdge>> allWPaths = null;
59 private List<PceLink> pathAtoZ = new ArrayList<>();
61 public PceGraph(PceNode aendNode, PceNode zendNode, Map<NodeId, PceNode> allPceNodes,
62 PceConstraints pceHardConstraints, PceConstraints pceSoftConstraints, PceResult pceResult,
65 this.apceNode = aendNode;
66 this.zpceNode = zendNode;
67 this.allPceNodes = allPceNodes;
68 this.pceResult = pceResult;
69 this.pceHardConstraints = pceHardConstraints;
70 this.pceSoftConstraints = pceSoftConstraints;
71 this.serviceType = serviceType;
73 LOG.info("In GraphCalculator: A and Z = {} / {} ", aendNode, zendNode);
74 LOG.debug("In GraphCalculator: allPceNodes size {}, nodes {} ", allPceNodes.size(), allPceNodes);
77 public boolean calcPath() {
79 LOG.info(" In PCE GRAPH calcPath : K SHORT PATHS algorithm ");
81 DefaultDirectedWeightedGraph<String, PceGraphEdge> weightedGraph =
82 new DefaultDirectedWeightedGraph<>(PceGraphEdge.class);
83 populateWithNodes(weightedGraph);
84 populateWithLinks(weightedGraph);
86 if (!runKgraphs(weightedGraph)) {
87 LOG.info("In calcPath : pceResult {}", pceResult);
91 // validate found paths
92 pceResult.setRC(ResponseCodes.RESPONSE_FAILED);
93 for (GraphPath<String, PceGraphEdge> path : allWPaths) {
94 PostAlgoPathValidator papv = new PostAlgoPathValidator();
95 pceResult = papv.checkPath(path, allPceNodes, pceResult, pceHardConstraints, serviceType);
96 LOG.info("In calcPath after PostAlgoPathValidator {} {}",
97 pceResult.getResponseCode(), ResponseCodes.RESPONSE_OK);
99 if (!pceResult.getResponseCode().equals(ResponseCodes.RESPONSE_OK)) {
100 LOG.warn("In calcPath: post algo validations DROPPED the path {}", path);
106 for (PceGraphEdge edge : path.getEdgeList()) {
107 pathAtoZ.add(edge.link());
110 shortestPathAtoZ = new ArrayList<>(pathAtoZ);
111 switch (serviceType) {
113 case StringConstants.SERVICE_TYPE_100GE_T:
114 case StringConstants.SERVICE_TYPE_OTUC4:
115 case StringConstants.SERVICE_TYPE_400GE:
116 case StringConstants.SERVICE_TYPE_OTU4:
118 "In calcPath Path FOUND path for wl [{}], min Freq assignment {}, max Freq assignment {},"
119 + " hops {}, distance per metrics {}, path AtoZ {}",
120 pceResult.getResultWavelength(), pceResult.getMinFreq(), pceResult.getMaxFreq(),
121 pathAtoZ.size(), path.getWeight(), pathAtoZ);
126 "In calcPath Path FOUND path for hops {}, distance per metrics {}, path AtoZ {}",
127 pathAtoZ.size(), path.getWeight(), pathAtoZ);
134 if (shortestPathAtoZ != null) {
135 LOG.info("In calcPath CHOOSEN PATH for wl [{}], min freq {}, max freq {}, hops {}, path AtoZ {}",
136 pceResult.getResultWavelength(), pceResult.getMinFreq(), pceResult.getMaxFreq(),
137 shortestPathAtoZ.size(), shortestPathAtoZ);
139 LOG.info("In calcPath : pceResult {}", pceResult);
140 return (pceResult.getStatus());
143 private boolean runKgraphs(DefaultDirectedWeightedGraph<String, PceGraphEdge> weightedGraph) {
145 if (weightedGraph.edgeSet().isEmpty() || weightedGraph.vertexSet().isEmpty()) {
148 PathValidator<String, PceGraphEdge> wpv = new InAlgoPathValidator();
150 // KShortestPaths on weightedGraph
151 KShortestSimplePaths<String, PceGraphEdge> swp =
152 new KShortestSimplePaths<>(weightedGraph, mhopsPerPath, wpv);
153 allWPaths = swp.getPaths(apceNode.getNodeId().getValue(), zpceNode.getNodeId().getValue(), kpathsToBring);
155 if (allWPaths.isEmpty()) {
156 LOG.info(" In runKgraphs : algorithm didn't find any path");
157 pceResult.setLocalCause(LocalCause.NO_PATH_EXISTS);
158 pceResult.setRC(ResponseCodes.RESPONSE_FAILED);
163 for (GraphPath<String, PceGraphEdge> path : allWPaths) {
164 LOG.debug("path Weight: {} : {}", path.getWeight(), path.getVertexList());
170 private boolean validateLinkforGraph(PceLink pcelink) {
172 PceNode source = allPceNodes.get(pcelink.getSourceId());
173 PceNode dest = allPceNodes.get(pcelink.getDestId());
175 if (source == null) {
176 LOG.error("In addLinkToGraph link source node is null : {}", pcelink);
180 LOG.error("In addLinkToGraph link dest node is null : {}", pcelink);
183 LOG.debug("In addLinkToGraph link to nodes : {}{} {}", pcelink, source, dest);
187 private void populateWithNodes(DefaultDirectedWeightedGraph<String, PceGraphEdge> weightedGraph) {
188 Iterator<Map.Entry<NodeId, PceNode>> nodes = allPceNodes.entrySet().iterator();
189 while (nodes.hasNext()) {
190 Map.Entry<NodeId, PceNode> node = nodes.next();
191 if (State.InService.equals(node.getValue().getState())) {
192 weightedGraph.addVertex(node.getValue().getNodeId().getValue());
193 LOG.debug("In populateWithNodes in node : {}", node.getValue());
198 private boolean populateWithLinks(DefaultDirectedWeightedGraph<String, PceGraphEdge> weightedGraph) {
200 Iterator<Map.Entry<NodeId, PceNode>> nodes = allPceNodes.entrySet().iterator();
201 while (nodes.hasNext()) {
203 Map.Entry<NodeId, PceNode> node = nodes.next();
205 PceNode pcenode = node.getValue();
206 List<PceLink> links = pcenode.getOutgoingLinks();
208 LOG.debug("In populateGraph: use node for graph {}", pcenode);
210 for (PceLink link : links) {
211 LOG.debug("In populateGraph node {} : add edge to graph {}", pcenode, link);
213 if (!validateLinkforGraph(link)) {
216 if (State.InService.equals(link.getState())) {
217 PceGraphEdge graphLink = new PceGraphEdge(link);
218 weightedGraph.addEdge(link.getSourceId().getValue(), link.getDestId().getValue(), graphLink);
220 weightedGraph.setEdgeWeight(graphLink, chooseWeight(link));
227 private double chooseWeight(PceLink link) {
228 // HopCount is default
230 switch (pceHardConstraints.getPceMetrics()) {
233 LOG.debug("In PceGraph HopCount is used as a metrics. {}", link);
235 case PropagationDelay :
236 weight = link.getLatency();
237 LOG.debug("In PceGraph PropagationDelay is used as a metrics. {}", link);
239 && ("1GE".equals(serviceType) || "10GE".equals(serviceType) || "ODU4".equals(serviceType))) {
240 LOG.warn("PropagationDelay set as metric, but latency is null: is latency set for OTN link {}?",
244 // TODO implement IGPMetric and TEMetric - low priority.
248 LOG.warn("In PceGraph {} not implemented. HopCount works as a default",
249 pceHardConstraints.getPceMetrics());
255 public int getKpathsToBring() {
256 return kpathsToBring;
259 public void setKpathsToBring(int kpathsToBring) {
260 this.kpathsToBring = kpathsToBring;
263 public void setMhopsPerPath(int mhopsPerPath) {
264 this.mhopsPerPath = mhopsPerPath;
267 public List<PceLink> getPathAtoZ() {
268 return shortestPathAtoZ;
271 public PceResult getReturnStructure() {
275 public void setConstrains(PceConstraints pceHardConstraintsInput, PceConstraints pceSoftConstraintsInput) {
276 this.pceHardConstraints = pceHardConstraintsInput;
277 this.pceSoftConstraints = pceSoftConstraintsInput;