예제 #1
0
  /** Simple shortest path implementation. */
  public final void testShortestPathComputation3() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_1);
    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);
    networkGraph.addNode(NODE_4);

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    networkGraph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);

    networkGraph.addLink(NODE_3, NODE_4, CONNECTION_ID_1);

    NetworkRoute route = networkGraph.getShortestPath(NODE_1, NODE_4);

    assertEquals(3, route.getNodes().size());
    assertEquals(NODE_2, route.getNodes().get(0));
    assertEquals(NODE_3, route.getNodes().get(1));
    assertEquals(NODE_4, route.getNodes().get(2));

    networkGraph.addLink(NODE_2, NODE_4, CONNECTION_ID_1);

    route = networkGraph.getShortestPath(NODE_1, NODE_4);

    assertEquals(2, route.getNodes().size());
    assertEquals(NODE_2, route.getNodes().get(0));
    assertEquals(NODE_4, route.getNodes().get(1));
    assertEquals(route.getPath().size(), route.getNodes().size());

    route = networkGraph.getShortestPath(NODE_1, NODE_5);
  }
예제 #2
0
  /** Test for {@link TopologyMap#getAllLinks()}. */
  public final void testGetChannels() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_1);
    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    networkGraph.addLink(NODE_2, NODE_1, CONNECTION_ID_1);
    networkGraph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);

    assertEquals(3, networkGraph.getAllLinks().size());

    assertNotNull(networkGraph.getLinkForConnection(CONNECTION_ID_1));
    assertEquals(
        networkGraph.getLinkForConnection(CONNECTION_ID_1),
        new TopologyLink(NODE_1, NODE_2, CONNECTION_ID_1));

    networkGraph.removeLink(null);
    networkGraph.removeLink(networkGraph.getLinkForConnection(CONNECTION_ID_1));

    assertEquals(2, networkGraph.getAllLinks().size());
    assertFalse(networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertFalse(networkGraph.containsLink(NODE_1, NODE_2, CONNECTION_ID_1));
  }
예제 #3
0
  public final void testLinkStateAdvertisementProduction() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);
    networkGraph.addNode(NODE_4);

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    networkGraph.addLink(NODE_1, NODE_3, CONNECTION_ID_1);

    networkGraph.addLink(NODE_1, NODE_4, CONNECTION_ID_1);

    LinkStateAdvertisement lsa = networkGraph.generateNewLocalLSA();

    assertTrue(lsa.getOwner().equals(networkGraph.getLocalNodeId()));
    assertEquals(
        "Collection sizes are expected to be the same.",
        lsa.getLinks().size(),
        networkGraph.getSuccessors(NODE_1).size());

    for (TopologyLink channel : lsa.getLinks()) {
      assertTrue(
          networkGraph
              .getPredecessors(networkGraph.getNode(channel.getDestination()))
              .contains(networkGraph.getNode(networkGraph.getLocalNodeId())));
    }
  }
예제 #4
0
  /** Test graph updates with different {@link LinkStateAdvertisement}s. */
  public final void testLsaIntegration1() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_2);

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));

    LinkStateAdvertisement linkStateAdvertisement =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_2,
            NODE_2_NAME,
            true,
            ARBITRARY_INT,
            networkGraph.hashCode(),
            true,
            Arrays.asList(
                new TopologyLink[] {
                  new TopologyLink(NODE_2, NODE_1, CONNECTION_ID_1),
                  new TopologyLink(NODE_2, NODE_3, CONNECTION_ID_1)
                }));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(linkStateAdvertisement));

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_1));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
  }
예제 #5
0
 /** Test for {@link TopologyMap#removeNode()}. */
 public final void testRemoveNode() {
   TopologyMap graph = new TopologyMap(NODE_2);
   graph.addNode(NODE_1);
   graph.removeNode(NODE_2);
   graph.removeNode((TopologyNode) null);
   assertTrue(graph.containsNode(NODE_1));
   graph.removeNode(NODE_1);
   assertFalse(graph.containsNode(NODE_1));
 }
예제 #6
0
  /** Test for {@link NetworkGraph#getSuccessors())}. */
  public final void testGetSuccessors() {
    TopologyMap graph1 = new TopologyMap(NODE_1);

    graph1.addNode(NODE_2);
    graph1.addNode(NODE_3);
    graph1.addNode(NODE_4);

    assertEquals(0, graph1.getSuccessors().size());

    graph1.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    assertEquals(1, graph1.getSuccessors().size());
    assertTrue(TopologyMap.toNodeIdentifiers(graph1.getSuccessors()).contains(NODE_2));
    assertFalse(TopologyMap.toNodeIdentifiers(graph1.getSuccessors()).contains(NODE_1));

    graph1.addLink(NODE_3, NODE_1, CONNECTION_ID_1);

    assertFalse(TopologyMap.toNodeIdentifiers(graph1.getSuccessors()).contains(NODE_3));
    assertTrue(TopologyMap.toNodeIdentifiers(graph1.getSuccessors()).contains(NODE_2));
  }
예제 #7
0
  public final void testEquals() {
    TopologyMap graph1 = new TopologyMap(NODE_1);
    TopologyMap graph2 = new TopologyMap(NODE_2);

    assertFalse(graph1.equals(graph2));

    graph1.addNode(NODE_2);

    assertFalse(graph1.equals(graph2));

    graph2.addNode(NODE_1);

    assertTrue(graph1.equals(graph2));

    graph1.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    assertFalse(graph1.equals(graph2));

    graph2.addLink(NODE_1, NODE_2, CONNECTION_ID_1);

    assertTrue(graph1.equals(graph2));
  }
예제 #8
0
  /** Simple test for graph setup: NODE_1 - NODE_2 - NODE_3. */
  public final void testGraphSetUp() {
    networkGraph = new TopologyMap(NODE_1);

    networkGraph.addNode(NODE_1);
    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);

    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_1));
    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_2));
    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_3));
    assertFalse(GRAPH_DOES_NOT_CONTAIN_NODE, networkGraph.containsNode(NODE_4));
    assertFalse(GRAPH_DOES_NOT_CONTAIN_NODE, networkGraph.containsNode(NODE_5));

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    networkGraph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_4, NODE_5));
    assertEquals(DIFFERENT_NUMBER_OF_EDGES_IN_GRAPH_EXPECTED, 2, networkGraph.getLinkCount());
    assertEquals(DIFFERENT_NUMBER_OF_VERTICES_IN_GRAPH_EXPECTED, 3, networkGraph.getNodeCount());
  }
예제 #9
0
  /** Test for {@link TopologyMap#removeLink()}. */
  public final void testRemoveChannel() {
    TopologyMap graph = new TopologyMap(NODE_2);
    graph.addNode(NODE_1);

    assertFalse(graph.containsLink(NODE_1, NODE_2, CONNECTION_ID_1));

    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_2);
    assertTrue(graph.containsLink(NODE_1, NODE_2, CONNECTION_ID_1));
    assertFalse(graph.containsLink(NODE_1, NODE_2, CONNECTION_ID_3));

    assertTrue(graph.removeLink(NODE_1, NODE_2, CONNECTION_ID_1));
    assertFalse(graph.removeLink(NODE_1, NODE_2, CONNECTION_ID_1));
    assertFalse(graph.containsLink(NODE_1, NODE_2, CONNECTION_ID_1));
    assertTrue(graph.containsLink(NODE_1, NODE_2, CONNECTION_ID_2));
  }
예제 #10
0
  /** Test for {@link TopologyMap#removeNode()}. */
  public final void testRemoveNode2() {
    TopologyMap graph = new TopologyMap(NODE_2);
    graph.addNode(NODE_1);
    graph.addNode(NODE_3);

    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    graph.addLink(NODE_2, NODE_1, CONNECTION_ID_1);

    graph.addLink(NODE_2, NODE_3, CONNECTION_ID_1);
    graph.addLink(NODE_3, NODE_2, CONNECTION_ID_1);

    assertEquals(4, graph.getLinkCount());
    graph.removeNode(NODE_1);
    graph.removeNode(new TopologyNode(NODE_1));
    assertEquals(2, graph.getNodeCount());
    assertEquals(2, graph.getLinkCount());
  }
예제 #11
0
 /** TODO @krol_ph: Test description. */
 public final void testUpdateGraphEdges() {
   networkGraph = new TopologyMap(NODE_1);
   networkGraph.addNode(NODE_2);
   networkGraph.addNode(NODE_2);
   // should succeed
   networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
   // note: changed to assertFalse() after switch from NCP to connection ids
   try {
     networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
     fail("Exception expected");
   } catch (IllegalStateException e) {
     assertTrue(true);
   }
   // note: changed to assertFalse() after switch from NCP to connection ids
   assertFalse(networkGraph.addLink(new TopologyLink(NODE_1, NODE_2, CONNECTION_ID_1)));
   networkGraph.getLinkForConnection(CONNECTION_ID_1).incReliability();
   networkGraph.getLinkForConnection(CONNECTION_ID_1).setWeight(7);
   assertEquals(1, networkGraph.getLinkForConnection(CONNECTION_ID_1).getReliability());
   assertEquals(7, networkGraph.getLinkForConnection(CONNECTION_ID_1).getWeight());
 }
예제 #12
0
  /**
   * Tests for {@link NetworkGraph#containsAnyChannel(NodeIdentifier, NodeIdentifier).
   */
  public final void testContainsAnyChannel() {
    networkGraph = new TopologyMap(NODE_5);

    // TODO review this test; some of it seem redundant

    assertFalse(networkGraph.containsLinkBetween(null, null));
    assertFalse(networkGraph.containsLinkBetween(NODE_5, null));
    assertFalse(networkGraph.containsLinkBetween(NODE_1, null));
    assertFalse(networkGraph.containsLinkBetween(null, NODE_5));
    assertFalse(networkGraph.containsLinkBetween(null, NODE_1));

    networkGraph.addLink(NODE_1, NODE_5, CONNECTION_ID_1);
    // TODO review: changed to assertTrue() after switch to connection ids; why was this
    // assertFalse() before? -- misc_ro
    assertTrue(networkGraph.containsLinkBetween(NODE_1, NODE_5));

    networkGraph.addNode(NODE_1);

    assertTrue(networkGraph.containsLink(NODE_1, NODE_5, CONNECTION_ID_1));
    assertFalse(networkGraph.containsLink(NODE_1, NODE_5, CONNECTION_ID_2));
  }
예제 #13
0
  /** Test for {@link TopologyMap#getAllLinksBetween(TopologyNode, TopologyNode)}. */
  public final void testAvailableChannels() {
    TopologyMap graph = new TopologyMap(NODE_2);
    graph.addNode(NODE_1);
    assertEquals(0, graph.getAllLinksBetween(graph.getNode(NODE_2), graph.getNode(NODE_1)).size());

    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    assertEquals(0, graph.getAllLinksBetween(graph.getNode(NODE_2), graph.getNode(NODE_1)).size());
    assertEquals(1, graph.getAllLinksBetween(graph.getNode(NODE_1), graph.getNode(NODE_2)).size());

    graph.addLink(NODE_1, NODE_2, CONNECTION_ID_2);
    assertEquals(0, graph.getAllLinksBetween(graph.getNode(NODE_2), graph.getNode(NODE_1)).size());
    assertEquals(2, graph.getAllLinksBetween(graph.getNode(NODE_1), graph.getNode(NODE_2)).size());

    graph.addLink(NODE_2, NODE_1, CONNECTION_ID_1);
    assertEquals(1, graph.getAllLinksBetween(graph.getNode(NODE_2), graph.getNode(NODE_1)).size());
    assertEquals(2, graph.getAllLinksBetween(graph.getNode(NODE_1), graph.getNode(NODE_2)).size());

    graph.addLink(NODE_2, NODE_1, CONNECTION_ID_2);
    assertEquals(2, graph.getAllLinksBetween(graph.getNode(NODE_2), graph.getNode(NODE_1)).size());
    assertEquals(2, graph.getAllLinksBetween(graph.getNode(NODE_1), graph.getNode(NODE_2)).size());
  }
예제 #14
0
  /** @throws InterruptedException on interruption */
  public final void testLinkStateUpdate() throws InterruptedException {
    TopologyMap graph1 = new TopologyMap(NODE_1);
    // cause timestamp-based sequence numbers to be different
    Thread.sleep(SHORT_TIMESTAMP_CHANGING_DELAY);
    TopologyMap graph2 = new TopologyMap(NODE_2);
    // crude approach to ensure different timestamps; it would be better to inject an artificial
    // time source for testing -- misc_ro, June 2013
    while (graph2.getSequenceNumberOfNode(NODE_2) == graph1.getSequenceNumberOfNode(NODE_1)) {
      Thread.sleep(SHORT_TIMESTAMP_CHANGING_DELAY);
      graph2 = new TopologyMap(NODE_2);
    }

    // get the highest current sequence number (assuming node 3 was assigned the highest one)
    long node1OriginalSeqNo = graph1.getSequenceNumberOfNode(NODE_1);
    long node2OriginalSeqNo = graph2.getSequenceNumberOfNode(NODE_2);

    assertFalse(node1OriginalSeqNo == node2OriginalSeqNo);
    assertFalse(graph1.equals(graph2));

    LinkStateAdvertisement lsa = graph1.generateNewLocalLSA();

    // LSA generation should have increased the node 1 sequence number in graph 1
    long node1NewSeqNo = graph1.getSequenceNumberOfNode(NODE_1);
    assertEquals(node1NewSeqNo, lsa.getSequenceNumber());
    assertTrue(node1NewSeqNo > node1OriginalSeqNo);

    // verify graph update
    assertTrue(graph2.update(lsa));
    assertEquals(node1NewSeqNo, graph2.getSequenceNumberOfNode(NODE_1));

    lsa = graph2.generateNewLocalLSA();

    // LSA generation should have increased the node 2 sequence number in graph 2
    long node2NewSeqNo = graph2.getSequenceNumberOfNode(NODE_2);
    assertEquals(node2NewSeqNo, lsa.getSequenceNumber());
    assertTrue(node2NewSeqNo > node2OriginalSeqNo);

    // verify graph update
    assertTrue(graph1.update(lsa));
    assertEquals(node2NewSeqNo, graph1.getSequenceNumberOfNode(NODE_2));

    assertTrue(graph1.equals(graph2));

    graph1.addNode(NODE_3);
    graph1.addLink(NODE_1, NODE_3, CONNECTION_ID_1);

    assertFalse(graph1.equals(graph2));

    lsa = graph1.generateNewLocalLSA();
    assertTrue(lsa.getSequenceNumber() > node1NewSeqNo);
    node1NewSeqNo = graph1.getSequenceNumberOfNode(NODE_1);
    assertEquals(node1NewSeqNo, lsa.getSequenceNumber());

    assertTrue(graph2.update(lsa));
    assertEquals(node1NewSeqNo, graph2.getSequenceNumberOfNode(NODE_1));
    assertTrue(graph1.equals(graph2));

    graph2.addLink(NODE_2, NODE_1, CONNECTION_ID_1);

    assertFalse(graph2.equals(graph1));

    lsa = graph2.generateNewLocalLSA();
    graph1.update(lsa);

    node2NewSeqNo = graph2.getSequenceNumberOfNode(NODE_2);
    assertEquals(node2NewSeqNo, lsa.getSequenceNumber());

    assertTrue(graph2.equals(graph1));
    assertEquals(node1NewSeqNo, graph2.getSequenceNumberOfNode(NODE_1));
    assertEquals(node2NewSeqNo, graph2.getSequenceNumberOfNode(NODE_2));
    assertEquals(graph1.getSequenceNumberOfNode(NODE_3), graph2.getSequenceNumberOfNode(NODE_3));

    // log.info(NetworkFormatter.summary(graph2));
    // log.info(NetworkFormatter.summary(graph1));
  }
예제 #15
0
  /** Build graph and do manipulations with some {@link LinkStateAdvertisement}s. */
  public final void testUpdateGraph() {
    // IMPORTANT: the test graph must be "owned" by a node that is not used in the test,
    // as TopologyMap was made to ignore external updates for its local node
    networkGraph = new TopologyMap(NODE_3);

    networkGraph.addNode(NODE_1);
    networkGraph.addNode(NODE_2);
    networkGraph.addNode(NODE_3);

    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));

    networkGraph.addLink(NODE_1, NODE_2, CONNECTION_ID_1);
    networkGraph.addLink(NODE_2, NODE_3, CONNECTION_ID_2);

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));
    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));

    LinkStateAdvertisement lsa =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_1,
            NODE_1_NAME,
            true,
            networkGraph.getSequenceNumberOfNode(NODE_1) + 1,
            networkGraph.hashCode(),
            true,
            Arrays.asList(
                new TopologyLink[] {
                  new TopologyLink(NODE_1, NODE_2, CONNECTION_ID_1),
                  new TopologyLink(NODE_1, NODE_3, CONNECTION_ID_3)
                }));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(lsa));

    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_2, NODE_3));

    lsa =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_1,
            NODE_1_NAME,
            true,
            networkGraph.getSequenceNumberOfNode(NODE_1) + 1,
            networkGraph.hashCode(),
            true,
            Arrays.asList(new TopologyLink[] {new TopologyLink(NODE_1, NODE_3, CONNECTION_ID_1)}));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(lsa));

    assertFalse(GRAPH_CONTAINS_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_2));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_1, NODE_3));

    // inject a new node (NODE_4) via LSA
    lsa =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_4,
            NODE_4_NAME,
            true,
            1,
            networkGraph.hashCode(),
            true,
            Arrays.asList(
                new TopologyLink[] {
                  new TopologyLink(NODE_4, NODE_3, CONNECTION_ID_1),
                  new TopologyLink(NODE_4, NODE_2, CONNECTION_ID_1)
                }));

    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(lsa));

    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_4));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_4, NODE_3));

    lsa =
        LinkStateAdvertisement.createUpdateLsa(
            NODE_4,
            NODE_4_NAME,
            true,
            networkGraph.getSequenceNumberOfNode(NODE_4) + 1,
            networkGraph.hashCode(),
            true,
            Arrays.asList(new TopologyLink[] {new TopologyLink(NODE_4, NODE_5, CONNECTION_ID_1)}));

    assertFalse(GRAPH_DOES_NOT_CONTAIN_NODE, networkGraph.containsNode(NODE_5));

    // log.info(NetworkFormatter.summary(networkGraph));
    assertTrue(LSA_CAUSED_NO_UPDATE, networkGraph.update(lsa));

    assertTrue(GRAPH_CONTAINS_NODE, networkGraph.containsNode(NODE_5));
    assertTrue(GRAPH_SHOULD_CONTAIN_CHANNEL, networkGraph.containsLinkBetween(NODE_4, NODE_5));
  }