blob: a697e2eecda3d4b7c61aaa5b13d1ad3c4952dbff [file] [log] [blame]
Vince Lehman9a709032014-09-13 16:28:07 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Ashlesh Gawande0421bc62020-05-08 20:42:19 -07002/*
Saurab Dulal427e0122019-11-28 11:58:02 -06003 * Copyright (c) 2014-2020, The University of Memphis,
Vince Lehmanc2e51f62015-01-20 15:03:11 -06004 * Regents of the University of California,
5 * Arizona Board of Regents.
Vince Lehman9a709032014-09-13 16:28:07 -05006 *
7 * This file is part of NLSR (Named-data Link State Routing).
8 * See AUTHORS.md for complete list of NLSR authors and contributors.
9 *
10 * NLSR is free software: you can redistribute it and/or modify it under the terms
11 * of the GNU General Public License as published by the Free Software Foundation,
12 * either version 3 of the License, or (at your option) any later version.
13 *
14 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
15 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
16 * PURPOSE. See the GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License along with
19 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
Ashlesh Gawande0421bc62020-05-08 20:42:19 -070020 */
Vince Lehman9a709032014-09-13 16:28:07 -050021
Ashlesh Gawande0421bc62020-05-08 20:42:19 -070022#include "../test-common.hpp"
Vince Lehman9a709032014-09-13 16:28:07 -050023
24#include "route/routing-table-calculator.hpp"
25
26#include "adjacency-list.hpp"
Vince Lehman9a709032014-09-13 16:28:07 -050027#include "lsdb.hpp"
28#include "nlsr.hpp"
29#include "route/map.hpp"
30#include "route/routing-table.hpp"
31
Muktadir R Chowdhuryc69da0a2015-12-18 13:24:38 -060032#include <ndn-cxx/util/dummy-client-face.hpp>
33
Vince Lehman9a709032014-09-13 16:28:07 -050034namespace nlsr {
35namespace test {
36
dmcoomes9f936662017-03-02 10:33:09 -060037using std::shared_ptr;
Vince Lehman9a709032014-09-13 16:28:07 -050038using ndn::time::system_clock;
39static const system_clock::TimePoint MAX_TIME = system_clock::TimePoint::max();
40
41class HyperbolicCalculatorFixture : public BaseFixture
42{
43public:
44 HyperbolicCalculatorFixture()
Muktadir Chowdhuryf04f9892017-08-20 20:42:56 -050045 : face(m_ioService, m_keyChain)
Saurab Dulal427e0122019-11-28 11:58:02 -060046 , conf(face, m_keyChain)
Ashlesh Gawande85998a12017-12-07 22:22:13 -060047 , nlsr(face, m_keyChain, conf)
48 , routingTable(nlsr.m_routingTable)
49 , adjacencies(conf.getAdjacencyList())
50 , lsdb(nlsr.m_lsdb)
Vince Lehman9a709032014-09-13 16:28:07 -050051 {
Vince Lehman9a709032014-09-13 16:28:07 -050052 }
53
54 // Triangle topology with routers A, B, C connected
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -060055 void setUpTopology(std::vector<double> anglesA, std::vector<double> anglesB,
56 std::vector<double> anglesC)
Vince Lehman9a709032014-09-13 16:28:07 -050057 {
Muktadir Chowdhuryf04f9892017-08-20 20:42:56 -050058 Adjacent a(ROUTER_A_NAME, ndn::FaceUri(ROUTER_A_FACE), 0, Adjacent::STATUS_ACTIVE, 0, 0);
59 Adjacent b(ROUTER_B_NAME, ndn::FaceUri(ROUTER_B_FACE), 0, Adjacent::STATUS_ACTIVE, 0, 0);
60 Adjacent c(ROUTER_C_NAME, ndn::FaceUri(ROUTER_C_FACE), 0, Adjacent::STATUS_ACTIVE, 0, 0);
Vince Lehman9a709032014-09-13 16:28:07 -050061
62 // Router A
63 adjacencies.insert(b);
64 adjacencies.insert(c);
65
Ashlesh Gawanded02c3882015-12-29 16:02:51 -060066 AdjLsa adjA(a.getName(), 1, MAX_TIME, 2, adjacencies);
Vince Lehman9a709032014-09-13 16:28:07 -050067 lsdb.installAdjLsa(adjA);
68
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -060069
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080070 CoordinateLsa coordA(adjA.getOriginRouter(), 1, MAX_TIME, 16.23, anglesA);
Vince Lehman9a709032014-09-13 16:28:07 -050071 lsdb.installCoordinateLsa(coordA);
72
73 // Router B
74 a.setFaceId(1);
75 c.setFaceId(2);
76
77 AdjacencyList adjacencyListB;
78 adjacencyListB.insert(a);
79 adjacencyListB.insert(c);
80
Ashlesh Gawanded02c3882015-12-29 16:02:51 -060081 AdjLsa adjB(b.getName(), 1, MAX_TIME, 2, adjacencyListB);
Vince Lehman9a709032014-09-13 16:28:07 -050082 lsdb.installAdjLsa(adjB);
83
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080084 CoordinateLsa coordB(adjB.getOriginRouter(), 1, MAX_TIME, 16.59, anglesB);
Vince Lehman9a709032014-09-13 16:28:07 -050085 lsdb.installCoordinateLsa(coordB);
86
87 // Router C
88 a.setFaceId(1);
89 b.setFaceId(2);
90
91 AdjacencyList adjacencyListC;
92 adjacencyListC.insert(a);
93 adjacencyListC.insert(b);
94
Ashlesh Gawanded02c3882015-12-29 16:02:51 -060095 AdjLsa adjC(c.getName(), 1, MAX_TIME, 2, adjacencyListC);
Vince Lehman9a709032014-09-13 16:28:07 -050096 lsdb.installAdjLsa(adjC);
97
Ashlesh Gawande0db4d4d2020-02-05 20:30:02 -080098 CoordinateLsa coordC(adjC.getOriginRouter(), 1, MAX_TIME, 14.11, anglesC);
Vince Lehman9a709032014-09-13 16:28:07 -050099 lsdb.installCoordinateLsa(coordC);
100
Nick Gordon22b5c952017-08-10 17:48:15 -0500101 map.createFromAdjLsdb(lsdb.getAdjLsdb().begin(), lsdb.getAdjLsdb().end());
Vince Lehman9a709032014-09-13 16:28:07 -0500102 }
103
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600104 void runTest(const double& expectedCost)
105 {
106 HyperbolicRoutingCalculator calculator(map.getMapSize(), false, ROUTER_A_NAME);
Saurab Dulal72b2b252019-01-22 16:58:08 -0600107 calculator.calculatePath(map, routingTable, lsdb, adjacencies);
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600108
109 RoutingTableEntry* entryB = routingTable.findRoutingTableEntry(ROUTER_B_NAME);
110
111 // Router A should be able to get to B through B with cost 0 and to B through C
112 NexthopList& bHopList = entryB->getNexthopList();
113 BOOST_REQUIRE_EQUAL(bHopList.getNextHops().size(), 2);
114
115 for (std::set<NextHop, NextHopComparator>::iterator it = bHopList.begin(); it != bHopList.end(); ++it) {
116 std::string faceUri = it->getConnectingFaceUri();
117 uint64_t cost = it->getRouteCostAsAdjustedInteger();
118
119 BOOST_CHECK((faceUri == ROUTER_B_FACE && cost == 0) ||
120 (faceUri == ROUTER_C_FACE && cost == applyHyperbolicFactorAndRound(expectedCost)));
121 }
122
123 RoutingTableEntry* entryC = routingTable.findRoutingTableEntry(ROUTER_C_NAME);
124
125 // Router A should be able to get to C through C with cost 0 and to C through B
126 NexthopList& cHopList = entryC->getNexthopList();
127 BOOST_REQUIRE_EQUAL(cHopList.getNextHops().size(), 2);
128
129 for (std::set<NextHop, NextHopComparator>::iterator it = cHopList.begin(); it != cHopList.end(); ++it) {
130 std::string faceUri = it->getConnectingFaceUri();
131 uint64_t cost = it->getRouteCostAsAdjustedInteger();
132
133 BOOST_CHECK((faceUri == ROUTER_B_FACE && cost == applyHyperbolicFactorAndRound(expectedCost)) ||
134 (faceUri == ROUTER_C_FACE && cost == 0));
135 }
136 }
137
138 uint64_t
139 applyHyperbolicFactorAndRound(double d)
140 {
141 // Hyperbolic costs in the tests were calculated with 1*10^-9 precision.
142 // A factor larger than 1*10^9 will cause the tests to fail.
143 BOOST_REQUIRE(NextHop::HYPERBOLIC_COST_ADJUSTMENT_FACTOR <= 1000000000);
144 return round(NextHop::HYPERBOLIC_COST_ADJUSTMENT_FACTOR*d);
145 }
146
Vince Lehman9a709032014-09-13 16:28:07 -0500147public:
Muktadir Chowdhuryf04f9892017-08-20 20:42:56 -0500148 ndn::util::DummyClientFace face;
Ashlesh Gawande85998a12017-12-07 22:22:13 -0600149 ConfParameter conf;
Vince Lehman9a709032014-09-13 16:28:07 -0500150 Nlsr nlsr;
151 Map map;
152
153 RoutingTable& routingTable;
154 AdjacencyList& adjacencies;
155 Lsdb& lsdb;
156
157 static const ndn::Name ROUTER_A_NAME;
158 static const ndn::Name ROUTER_B_NAME;
159 static const ndn::Name ROUTER_C_NAME;
160
161 static const std::string ROUTER_A_FACE;
162 static const std::string ROUTER_B_FACE;
163 static const std::string ROUTER_C_FACE;
164};
165
166const ndn::Name HyperbolicCalculatorFixture::ROUTER_A_NAME = "/ndn/router/a";
167const ndn::Name HyperbolicCalculatorFixture::ROUTER_B_NAME = "/ndn/router/b";
168const ndn::Name HyperbolicCalculatorFixture::ROUTER_C_NAME = "/ndn/router/c";
169
Nick Gordone9733ed2017-04-26 10:48:39 -0500170const std::string HyperbolicCalculatorFixture::ROUTER_A_FACE = "udp4://10.0.0.1";
171const std::string HyperbolicCalculatorFixture::ROUTER_B_FACE = "udp4://10.0.0.2";
172const std::string HyperbolicCalculatorFixture::ROUTER_C_FACE = "udp4://10.0.0.3";
Vince Lehman9a709032014-09-13 16:28:07 -0500173
174BOOST_FIXTURE_TEST_SUITE(TestHyperbolicRoutingCalculator, HyperbolicCalculatorFixture)
175
176BOOST_AUTO_TEST_CASE(Basic)
177{
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600178 std::vector<double> anglesA = {2.97},
179 anglesB = {3.0},
180 anglesC = {2.99};
181 setUpTopology(anglesA, anglesB, anglesC);
Vince Lehman9a709032014-09-13 16:28:07 -0500182
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600183 runTest(20.103356956);
184}
Vince Lehman9a709032014-09-13 16:28:07 -0500185
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600186BOOST_AUTO_TEST_CASE(BasicMultipleAngles)
187{
188 std::vector<double> anglesA = {2.97,1.22},
189 anglesB = {3.0, 0.09},
190 anglesC = {321, 2.99};
191 setUpTopology(anglesA, anglesB, anglesC);
Vince Lehman9a709032014-09-13 16:28:07 -0500192
Muktadir R Chowdhuryb00dc2a2016-11-05 10:48:58 -0600193 runTest(30.655296361);
Vince Lehman9a709032014-09-13 16:28:07 -0500194}
195
196BOOST_AUTO_TEST_SUITE_END()
197
Nick Gordonfad8e252016-08-11 14:21:38 -0500198} // namespace test
199} // namespace nlsr