route: Allow 0 cost in hyperbolic calculation
refs: #1982
Change-Id: I6ffe677d59dcb559f344b7d648600e9537d9c4f5
diff --git a/tests/test-hyperbolic-calculator.cpp b/tests/test-hyperbolic-calculator.cpp
new file mode 100644
index 0000000..eaf1f1a
--- /dev/null
+++ b/tests/test-hyperbolic-calculator.cpp
@@ -0,0 +1,175 @@
+/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
+/**
+ * Copyright (c) 2014 University of Memphis,
+ * Regents of the University of California
+ *
+ * This file is part of NLSR (Named-data Link State Routing).
+ * See AUTHORS.md for complete list of NLSR authors and contributors.
+ *
+ * NLSR is free software: you can redistribute it and/or modify it under the terms
+ * of the GNU General Public License as published by the Free Software Foundation,
+ * either version 3 of the License, or (at your option) any later version.
+ *
+ * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
+ * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+ * PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with
+ * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
+ *
+ *
+ **/
+
+#include "test-common.hpp"
+#include "dummy-face.hpp"
+
+#include "route/routing-table-calculator.hpp"
+
+#include "adjacency-list.hpp"
+#include "lsa.hpp"
+#include "lsdb.hpp"
+#include "nlsr.hpp"
+#include "route/map.hpp"
+#include "route/routing-table.hpp"
+
+#include <boost/test/unit_test.hpp>
+
+namespace nlsr {
+namespace test {
+
+using ndn::DummyFace;
+using ndn::shared_ptr;
+using ndn::time::system_clock;
+static const system_clock::TimePoint MAX_TIME = system_clock::TimePoint::max();
+
+class HyperbolicCalculatorFixture : public BaseFixture
+{
+public:
+ HyperbolicCalculatorFixture()
+ : face(ndn::makeDummyFace())
+ , nlsr(g_ioService, g_scheduler, ndn::ref(*face))
+ , routingTable(nlsr.getRoutingTable())
+ , adjacencies(nlsr.getAdjacencyList())
+ , lsdb(nlsr.getLsdb())
+ {
+ setUpTopology();
+ }
+
+ // Triangle topology with routers A, B, C connected
+ void setUpTopology()
+ {
+ INIT_LOGGERS("/tmp", "TRACE");
+
+ Adjacent a(ROUTER_A_NAME, ROUTER_A_FACE, 0, Adjacent::STATUS_ACTIVE, 0, 0);
+ Adjacent b(ROUTER_B_NAME, ROUTER_B_FACE, 0, Adjacent::STATUS_ACTIVE, 0, 0);
+ Adjacent c(ROUTER_C_NAME, ROUTER_C_FACE, 0, Adjacent::STATUS_ACTIVE, 0, 0);
+
+ // Router A
+ adjacencies.insert(b);
+ adjacencies.insert(c);
+
+ AdjLsa adjA(a.getName(), "adjacency", 1, MAX_TIME, 2, adjacencies);
+ lsdb.installAdjLsa(adjA);
+
+ CoordinateLsa coordA(adjA.getOrigRouter(), "coordinate", 1, MAX_TIME, 16.23, 2.97);
+ lsdb.installCoordinateLsa(coordA);
+
+ // Router B
+ a.setFaceId(1);
+ c.setFaceId(2);
+
+ AdjacencyList adjacencyListB;
+ adjacencyListB.insert(a);
+ adjacencyListB.insert(c);
+
+ AdjLsa adjB(b.getName(), "adjacency", 1, MAX_TIME, 2, adjacencyListB);
+ lsdb.installAdjLsa(adjB);
+
+ CoordinateLsa coordB(adjB.getOrigRouter(), "coordinate", 1, MAX_TIME, 16.59, 3.0);
+ lsdb.installCoordinateLsa(coordB);
+
+ // Router C
+ a.setFaceId(1);
+ b.setFaceId(2);
+
+ AdjacencyList adjacencyListC;
+ adjacencyListC.insert(a);
+ adjacencyListC.insert(b);
+
+ AdjLsa adjC(c.getName(), "adjacency", 1, MAX_TIME, 2, adjacencyListC);
+ lsdb.installAdjLsa(adjC);
+
+ CoordinateLsa coordC(adjC.getOrigRouter(), "coordinate", 1, MAX_TIME, 14.11, 2.99);
+ lsdb.installCoordinateLsa(coordC);
+
+ map.createFromAdjLsdb(nlsr);
+ }
+
+public:
+ shared_ptr<DummyFace> face;
+ Nlsr nlsr;
+ Map map;
+
+ RoutingTable& routingTable;
+ AdjacencyList& adjacencies;
+ Lsdb& lsdb;
+
+ static const ndn::Name ROUTER_A_NAME;
+ static const ndn::Name ROUTER_B_NAME;
+ static const ndn::Name ROUTER_C_NAME;
+
+ static const std::string ROUTER_A_FACE;
+ static const std::string ROUTER_B_FACE;
+ static const std::string ROUTER_C_FACE;
+};
+
+const ndn::Name HyperbolicCalculatorFixture::ROUTER_A_NAME = "/ndn/router/a";
+const ndn::Name HyperbolicCalculatorFixture::ROUTER_B_NAME = "/ndn/router/b";
+const ndn::Name HyperbolicCalculatorFixture::ROUTER_C_NAME = "/ndn/router/c";
+
+const std::string HyperbolicCalculatorFixture::ROUTER_A_FACE = "face-a";
+const std::string HyperbolicCalculatorFixture::ROUTER_B_FACE = "face-b";
+const std::string HyperbolicCalculatorFixture::ROUTER_C_FACE = "face-c";
+
+BOOST_FIXTURE_TEST_SUITE(TestHyperbolicRoutingCalculator, HyperbolicCalculatorFixture)
+
+BOOST_AUTO_TEST_CASE(Basic)
+{
+ HyperbolicRoutingCalculator calculator(map.getMapSize(), false, ROUTER_A_NAME);
+ calculator.calculatePaths(map, routingTable, lsdb, adjacencies);
+
+ RoutingTableEntry* entryB = routingTable.findRoutingTableEntry(ROUTER_B_NAME);
+
+ // Router A should be able to get to B through B with cost 0 and to B through
+ // C with cost 2010
+ NexthopList& bHopList = entryB->getNexthopList();
+ BOOST_REQUIRE_EQUAL(bHopList.getNextHops().size(), 2);
+
+ for (std::list<NextHop>::iterator it = bHopList.begin(); it != bHopList.end(); ++it) {
+ std::string faceUri = it->getConnectingFaceUri();
+ uint64_t cost = it->getRouteCostAsAdjustedInteger();
+
+ BOOST_CHECK((faceUri == ROUTER_B_FACE && cost == 0) ||
+ (faceUri == ROUTER_C_FACE && cost == 2010));
+ }
+
+ RoutingTableEntry* entryC = routingTable.findRoutingTableEntry(ROUTER_C_NAME);
+
+ // Router A should be able to get to C through C with cost 0 and to C through
+ // B with cost 2010
+ NexthopList& cHopList = entryC->getNexthopList();
+ BOOST_REQUIRE_EQUAL(cHopList.getNextHops().size(), 2);
+
+ for (std::list<NextHop>::iterator it = cHopList.begin(); it != cHopList.end(); ++it) {
+ std::string faceUri = it->getConnectingFaceUri();
+ uint64_t cost = it->getRouteCostAsAdjustedInteger();
+
+ BOOST_CHECK((faceUri == ROUTER_B_FACE && cost == 2010) ||
+ (faceUri == ROUTER_C_FACE && cost == 0));
+ }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
+
+} //namespace test
+} //namespace nlsr