Examples with TopologyVertex org.onosproject.net.topology.TopologyVertex used on opensource projects

Example 1 with TopologyVertex

use of org.onosproject.net.topology.TopologyVertex in project onos by opennetworkinglab.

the class FlowAnalyzer method analyze.

/**
 * Analyzes and prints out a report on the status of every flow entry inside
 * the network. The possible states are: Cleared (implying that the entry leads to
 * a host), Cycle (implying that it is part of cycle), and Black Hole (implying
 * that the entry does not lead to a single host).
 *
 * @return result string
 */
public String analyze() {
    graph = topologyService.getGraph(topologyService.currentTopology());
    for (TopologyVertex v : graph.getVertexes()) {
        DeviceId srcDevice = v.deviceId();
        Iterable<FlowEntry> flowTable = flowRuleService.getFlowEntries(srcDevice);
        for (FlowEntry flow : flowTable) {
            dfs(flow);
        }
    }
    // analyze the cycles to look for "critical flows" that can be removed
    // to break the cycle
    Set<FlowEntry> critpts = new HashSet<>();
    for (FlowEntry flow : label.keySet()) {
        if ("Cycle".equals(label.get(flow))) {
            Map<FlowEntry, String> labelSaved = label;
            label = new HashMap<FlowEntry, String>();
            ignoredFlows.add(flow);
            for (TopologyVertex v : graph.getVertexes()) {
                DeviceId srcDevice = v.deviceId();
                Iterable<FlowEntry> flowTable = flowRuleService.getFlowEntries(srcDevice);
                for (FlowEntry flow1 : flowTable) {
                    dfs(flow1);
                }
            }
            boolean replacable = true;
            for (FlowEntry flow2 : label.keySet()) {
                if ("Cleared".equals(labelSaved.get(flow2)) && !("Cleared".equals(label.get(flow2)))) {
                    replacable = false;
                }
            }
            if (replacable) {
                critpts.add(flow);
            }
            label = labelSaved;
        }
    }
    for (FlowEntry flow : critpts) {
        label.put(flow, "Cycle Critical Point");
    }
    String s = "\n";
    for (FlowEntry flow : label.keySet()) {
        s += ("Flow Rule: " + flowEntryRepresentation(flow) + "\n");
        s += ("Analysis: " + label.get(flow) + "!\n\n");
    }
    s += ("Analyzed " + label.keySet().size() + " flows.");
    // log.info(s);
    return s;
}

Example 2 with TopologyVertex

use of org.onosproject.net.topology.TopologyVertex in project onos by opennetworkinglab.

the class DefaultTopology method disjointPaths.

/**
 * Computes on-demand the set of shortest disjoint risk groups path pairs
 * between source and destination devices.
 *
 * @param src         source device
 * @param dst         destination device
 * @param weigher     edge weight object
 * @param riskProfile map representing risk groups for each edge
 * @return set of shortest disjoint paths
 */
private Set<DisjointPath> disjointPaths(DeviceId src, DeviceId dst, LinkWeigher weigher, Map<TopologyEdge, Object> riskProfile) {
    DefaultTopologyVertex srcV = new DefaultTopologyVertex(src);
    DefaultTopologyVertex dstV = new DefaultTopologyVertex(dst);
    Set<TopologyVertex> vertices = graph.getVertexes();
    if (!vertices.contains(srcV) || !vertices.contains(dstV)) {
        // src or dst not part of the current graph
        return ImmutableSet.of();
    }
    SrlgGraphSearch<TopologyVertex, TopologyEdge> srlg = new SrlgGraphSearch<>(riskProfile);
    GraphPathSearch.Result<TopologyVertex, TopologyEdge> result = srlg.search(graph, srcV, dstV, weigher, defaultMaxPaths);
    ImmutableSet.Builder<DisjointPath> builder = ImmutableSet.builder();
    for (org.onlab.graph.Path<TopologyVertex, TopologyEdge> path : result.paths()) {
        DisjointPath disjointPath = networkDisjointPath((DisjointPathPair<TopologyVertex, TopologyEdge>) path);
        if (disjointPath.backup() != null) {
            builder.add(disjointPath);
        }
    }
    return builder.build();
}

Example 3 with TopologyVertex

use of org.onosproject.net.topology.TopologyVertex in project onos by opennetworkinglab.

the class DefaultTopology method buildTopologyClusters.

// Builds the topology clusters and returns the id-cluster bindings.
private ImmutableMap<ClusterId, TopologyCluster> buildTopologyClusters() {
    ImmutableMap.Builder<ClusterId, TopologyCluster> clusterBuilder = ImmutableMap.builder();
    SccResult<TopologyVertex, TopologyEdge> results = clusterResults.get();
    // Extract both vertexes and edges from the results; the lists form
    // pairs along the same index.
    List<Set<TopologyVertex>> clusterVertexes = results.clusterVertexes();
    List<Set<TopologyEdge>> clusterEdges = results.clusterEdges();
    // Scan over the lists and create a cluster from the results.
    for (int i = 0, n = results.clusterCount(); i < n; i++) {
        Set<TopologyVertex> vertexSet = clusterVertexes.get(i);
        Set<TopologyEdge> edgeSet = clusterEdges.get(i);
        ClusterId cid = ClusterId.clusterId(i);
        DefaultTopologyCluster cluster = new DefaultTopologyCluster(cid, vertexSet.size(), edgeSet.size(), findRoot(vertexSet));
        clusterBuilder.put(cid, cluster);
    }
    return clusterBuilder.build();
}

Example 4 with TopologyVertex

use of org.onosproject.net.topology.TopologyVertex in project onos by opennetworkinglab.

the class DefaultTopology method getDisjointPaths.

/**
 * Computes on-demand the set of shortest disjoint path pairs between
 * source and destination devices.
 *
 * @param src     source device
 * @param dst     destination device
 * @param weigher link weight function
 * @return set of disjoint shortest path pairs
 */
public Set<DisjointPath> getDisjointPaths(DeviceId src, DeviceId dst, LinkWeigher weigher) {
    DefaultTopologyVertex srcV = new DefaultTopologyVertex(src);
    DefaultTopologyVertex dstV = new DefaultTopologyVertex(dst);
    Set<TopologyVertex> vertices = graph.getVertexes();
    if (!vertices.contains(srcV) || !vertices.contains(dstV)) {
        // src or dst not part of the current graph
        return ImmutableSet.of();
    }
    GraphPathSearch.Result<TopologyVertex, TopologyEdge> result = SUURBALLE.search(graph, srcV, dstV, weigher, defaultMaxPaths);
    ImmutableSet.Builder<DisjointPath> builder = ImmutableSet.builder();
    for (org.onlab.graph.Path<TopologyVertex, TopologyEdge> path : result.paths()) {
        DisjointPath disjointPath = networkDisjointPath((DisjointPathPair<TopologyVertex, TopologyEdge>) path);
        if (disjointPath.backup() != null) {
            builder.add(disjointPath);
        }
    }
    return builder.build();
}

Example 5 with TopologyVertex

use of org.onosproject.net.topology.TopologyVertex in project onos by opennetworkinglab.

the class DefaultTopology method getKShortestPaths.

/**
 * Lazily computes on-demand the k-shortest paths between source and
 * destination devices.
 *
 * @param src     source device
 * @param dst     destination device
 * @param weigher link weight function
 * @return stream of k-shortest paths
 */
public Stream<Path> getKShortestPaths(DeviceId src, DeviceId dst, LinkWeigher weigher) {
    DefaultTopologyVertex srcV = new DefaultTopologyVertex(src);
    DefaultTopologyVertex dstV = new DefaultTopologyVertex(dst);
    Set<TopologyVertex> vertices = graph.getVertexes();
    if (!vertices.contains(srcV) || !vertices.contains(dstV)) {
        // src or dst not part of the current graph
        return Stream.empty();
    }
    return LAZY_KSHORTEST.lazyPathSearch(graph, srcV, dstV, weigher).map(this::networkPath);
}