Examples with Port nl.uva.cs.lobcder.catalogue.SDNSweep.Port used on opensource projects

Example 1 with Port

use of nl.uva.cs.lobcder.catalogue.SDNSweep.Port in project lobcder by skoulouzis.

the class SDNControllerClient method getShortestPath.

public List<DefaultWeightedEdge> getShortestPath(String dest, Set<String> sources) throws InterruptedException, IOException {
    if (graph == null) {
        graph = new SimpleWeightedGraph<>(DefaultWeightedEdge.class);
    }
    Collection<SDNSweep.Switch> switchesColl = SDNSweep.getSwitches().values();
    List<SDNSweep.Switch> switches;
    if (switchesColl instanceof List) {
        switches = (List) switchesColl;
    } else {
        switches = new ArrayList(switchesColl);
    }
    for (int i = 0; i < switches.size(); i++) {
        List<Port> ports = switches.get(i).ports;
        if (ports != null) {
            for (int j = 0; j < ports.size(); j++) {
                for (int k = 0; k < ports.size(); k++) {
                    if (ports.get(j).state == 0 && ports.get(k).state == 0 && j != k) {
                        String vertex1 = switches.get(i).dpid + "-" + ports.get(j).portNumber;
                        String vertex2 = switches.get(i).dpid + "-" + ports.get(k).portNumber;
                        // Logger.getLogger(SDNControllerClient.class.getName()).log(Level.INFO, "From: {0} to: {1}", new Object[]{vertex1, vertex2});
                        if (!graph.containsVertex(vertex1)) {
                            graph.addVertex(vertex1);
                        }
                        if (!graph.containsVertex(vertex2)) {
                            graph.addVertex(vertex2);
                        }
                        DefaultWeightedEdge e1;
                        if (!graph.containsEdge(vertex1, vertex2)) {
                            e1 = graph.addEdge(vertex1, vertex2);
                        } else {
                            e1 = graph.getEdge(vertex1, vertex2);
                        }
                        graph.setEdgeWeight(e1, 1);
                    }
                }
            }
        }
    }
    // Logger.getLogger(SDNControllerClient.class.getName()).log(Level.INFO, "Destination: {0}", new Object[]{dest});
    if (!graph.containsVertex(dest)) {
        graph.addVertex(dest);
    }
    NetworkEntity destinationEntityArray = SDNSweep.getNetworkEntity(dest);
    // for (SDNSweep.NetworkEntity ne : destinationEntityArray) {
    if (destinationEntityArray != null) {
        for (AttachmentPoint ap : destinationEntityArray.getAttachmentPoint()) {
            String vertex = ap.getSwitchDPID() + "-" + ap.getPort();
            // Logger.getLogger(SDNControllerClient.class.getName()).log(Level.INFO, "vertex: {0}", new Object[]{vertex});
            if (!graph.containsVertex(vertex)) {
                graph.addVertex(vertex);
            }
            DefaultWeightedEdge e1;
            if (!graph.containsEdge(dest, vertex)) {
                e1 = graph.addEdge(dest, vertex);
            } else {
                e1 = graph.getEdge(dest, vertex);
            }
            // Don't calculate the cost from the destination to the switch.
            // There is nothing we can do about it so why waste cycles ?
            // graph.setEdgeWeight(e1, 2);
            graph.setEdgeWeight(e1, getCost(dest, vertex));
        }
    }
    // List<NetworkEntity> sourceEntityArray = getNetworkEntity(sources);
    for (String s : sources) {
        NetworkEntity ne = SDNSweep.getNetworkEntity(s);
        if (ne != null) {
            for (String ip : ne.getIpv4()) {
                if (!graph.containsVertex(ip)) {
                    graph.addVertex(ip);
                }
                for (AttachmentPoint ap : ne.getAttachmentPoint()) {
                    String vertex = ap.getSwitchDPID() + "-" + ap.getPort();
                    if (!graph.containsVertex(vertex)) {
                        graph.addVertex(vertex);
                    }
                    DefaultWeightedEdge e2;
                    if (!graph.containsEdge(ip, vertex)) {
                        e2 = graph.addEdge(ip, vertex);
                    } else {
                        e2 = graph.getEdge(ip, vertex);
                    }
                    graph.setEdgeWeight(e2, getCost(ip, vertex));
                }
            }
        }
    }
    List<Link> links = SDNSweep.getSwitchLinks();
    for (Link l : links) {
        String srcVertex = l.srcSwitch + "-" + l.srcPort;
        if (!graph.containsVertex(srcVertex)) {
            graph.addVertex(srcVertex);
        }
        String dstVertex = l.dstSwitch + "-" + l.dstPort;
        if (!graph.containsVertex(dstVertex)) {
            graph.addVertex(dstVertex);
        }
        DefaultWeightedEdge e3;
        if (!graph.containsEdge(srcVertex, dstVertex)) {
            e3 = graph.addEdge(srcVertex, dstVertex);
        } else {
            e3 = graph.getEdge(srcVertex, dstVertex);
        }
        // Logger.getLogger(SDNControllerClient.class.getName()).log(Level.INFO, "dstVertex: {0}", new Object[]{dstVertex});
        graph.setEdgeWeight(e3, getCost(srcVertex, dstVertex));
    }
    double cost = Double.MAX_VALUE;
    List<DefaultWeightedEdge> shortestPath = null;
    // exportGraph();
    StringBuilder msg = new StringBuilder();
    msg.append("\n");
    for (String s : sources) {
        if (graph.containsVertex(dest) && graph.containsVertex(s)) {
            List<DefaultWeightedEdge> shorPath = null;
            shorPath = DijkstraShortestPath.findPathBetween(graph, s, dest);
            double w = 0;
            if (shorPath != null) {
                for (DefaultWeightedEdge e : shorPath) {
                    w += graph.getEdgeWeight(e);
                }
                DefaultWeightedEdge p = shorPath.get(0);
                String e = graph.getEdgeSource(p);
                msg.append("source: ").append(e).append(" cost: ").append(w).append("\n");
                if (w <= cost) {
                    cost = w;
                    shortestPath = shorPath;
                    if (cost <= sources.size() + 1) {
                        break;
                    }
                }
            }
        }
    }
    Logger.getLogger(SDNControllerClient.class.getName()).log(Level.INFO, msg.toString());
    return shortestPath;
}