blob: 0b77b86c8e62a4511cfd9f8a8b8a109d22983322 [file] [log] [blame]
Vince Lehman8a4c29e2016-07-11 08:49:35 +00001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Ashlesh Gawande92e4ea52017-07-19 11:38:12 -05002/*
Davide Pesaventob8bd5ee2019-02-03 22:53:40 -05003 * Copyright (c) 2014-2019, Regents of the University of California,
Vince Lehman8a4c29e2016-07-11 08:49:35 +00004 * Arizona Board of Regents,
5 * Colorado State University,
6 * University Pierre & Marie Curie, Sorbonne University,
7 * Washington University in St. Louis,
8 * Beijing Institute of Technology,
9 * The University of Memphis.
10 *
11 * This file is part of NFD (Named Data Networking Forwarding Daemon).
12 * See AUTHORS.md for complete list of NFD authors and contributors.
13 *
14 * NFD is free software: you can redistribute it and/or modify it under the terms
15 * of the GNU General Public License as published by the Free Software Foundation,
16 * either version 3 of the License, or (at your option) any later version.
17 *
18 * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
19 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
20 * PURPOSE. See the GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License along with
23 * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
24 */
25
26#include "asf-probing-module.hpp"
Ashlesh Gawande2a73f352016-12-01 15:37:03 +000027#include "algorithm.hpp"
Davide Pesavento2cae8ca2019-04-18 20:48:05 -040028#include "common/global.hpp"
Vince Lehman8a4c29e2016-07-11 08:49:35 +000029
Davide Pesaventob8bd5ee2019-02-03 22:53:40 -050030#include <ndn-cxx/util/random.hpp>
31
Vince Lehman8a4c29e2016-07-11 08:49:35 +000032namespace nfd {
33namespace fw {
34namespace asf {
35
Ashlesh Gawande92e4ea52017-07-19 11:38:12 -050036constexpr time::milliseconds ProbingModule::DEFAULT_PROBING_INTERVAL;
37constexpr time::milliseconds ProbingModule::MIN_PROBING_INTERVAL;
Vince Lehman8a4c29e2016-07-11 08:49:35 +000038
39static_assert(ProbingModule::DEFAULT_PROBING_INTERVAL < AsfMeasurements::MEASUREMENTS_LIFETIME,
40 "ProbingModule::DEFAULT_PROBING_INTERVAL must be less than AsfMeasurements::MEASUREMENTS_LIFETIME");
41
42ProbingModule::ProbingModule(AsfMeasurements& measurements)
43 : m_probingInterval(DEFAULT_PROBING_INTERVAL)
44 , m_measurements(measurements)
45{
46}
47
48void
Davide Pesaventoa6f637a2019-08-28 23:23:20 -040049ProbingModule::scheduleProbe(const fib::Entry& fibEntry, time::milliseconds interval)
Vince Lehman8a4c29e2016-07-11 08:49:35 +000050{
Junxiao Shifc021862016-08-25 21:51:18 +000051 Name prefix = fibEntry.getPrefix();
Vince Lehman8a4c29e2016-07-11 08:49:35 +000052
53 // Set the probing flag for the namespace to true after passed interval of time
Davide Pesavento3dade002019-03-19 11:29:56 -060054 getScheduler().schedule(interval, [this, prefix] {
Junxiao Shifc021862016-08-25 21:51:18 +000055 NamespaceInfo* info = m_measurements.getNamespaceInfo(prefix);
Vince Lehman8a4c29e2016-07-11 08:49:35 +000056 if (info == nullptr) {
Davide Pesaventoa6f637a2019-08-28 23:23:20 -040057 // FIB entry with the passed prefix has been removed or
58 // it has a name that is not controlled by the AsfStrategy
Vince Lehman8a4c29e2016-07-11 08:49:35 +000059 }
60 else {
61 info->setIsProbingDue(true);
62 }
63 });
64}
65
Junxiao Shia6de4292016-07-12 02:08:10 +000066Face*
Davide Pesavento3dade002019-03-19 11:29:56 -060067ProbingModule::getFaceToProbe(const Face& inFace, const Interest& interest,
68 const fib::Entry& fibEntry, const Face& faceUsed)
Vince Lehman8a4c29e2016-07-11 08:49:35 +000069{
Davide Pesaventoa6f637a2019-08-28 23:23:20 -040070 FaceInfoFacePairSet rankedFaces;
Vince Lehman8a4c29e2016-07-11 08:49:35 +000071
72 // Put eligible faces into rankedFaces. If a face does not have an RTT measurement,
73 // immediately pick the face for probing
Davide Pesavento3dade002019-03-19 11:29:56 -060074 for (const auto& hop : fibEntry.getNextHops()) {
Junxiao Shia6de4292016-07-12 02:08:10 +000075 Face& hopFace = hop.getFace();
Vince Lehman8a4c29e2016-07-11 08:49:35 +000076
77 // Don't send probe Interest back to the incoming face or use the same face
Ashlesh Gawande2a73f352016-12-01 15:37:03 +000078 // as the forwarded Interest or use a face that violates scope
79 if (hopFace.getId() == inFace.getId() || hopFace.getId() == faceUsed.getId() ||
80 wouldViolateScope(inFace, interest, hopFace)) {
Vince Lehman8a4c29e2016-07-11 08:49:35 +000081 continue;
82 }
83
Ashlesh Gawande92e4ea52017-07-19 11:38:12 -050084 FaceInfo* info = m_measurements.getFaceInfo(fibEntry, interest, hopFace.getId());
Vince Lehman8a4c29e2016-07-11 08:49:35 +000085 // If no RTT has been recorded, probe this face
Davide Pesaventoa6f637a2019-08-28 23:23:20 -040086 if (info == nullptr || info->getLastRtt() == FaceInfo::RTT_NO_MEASUREMENT) {
Junxiao Shia6de4292016-07-12 02:08:10 +000087 return &hopFace;
Vince Lehman8a4c29e2016-07-11 08:49:35 +000088 }
89
90 // Add FaceInfo to container sorted by RTT
Davide Pesaventoe4b22382018-06-10 14:37:24 -040091 rankedFaces.insert({info, &hopFace});
Vince Lehman8a4c29e2016-07-11 08:49:35 +000092 }
93
94 if (rankedFaces.empty()) {
95 // No Face to probe
96 return nullptr;
97 }
98
Davide Pesaventoa6f637a2019-08-28 23:23:20 -040099 return chooseFace(rankedFaces);
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000100}
101
102bool
Junxiao Shifc021862016-08-25 21:51:18 +0000103ProbingModule::isProbingNeeded(const fib::Entry& fibEntry, const Interest& interest)
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000104{
105 // Return the probing status flag for a namespace
Junxiao Shi8d843142016-07-11 22:42:42 +0000106 NamespaceInfo& info = m_measurements.getOrCreateNamespaceInfo(fibEntry, interest);
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000107
108 // If a first probe has not been scheduled for a namespace
109 if (!info.isFirstProbeScheduled()) {
110 // Schedule first probe between 0 and 5 seconds
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400111 static std::uniform_int_distribution<> randDist(0, 5000);
112 auto interval = randDist(ndn::random::getRandomNumberEngine());
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000113 scheduleProbe(fibEntry, time::milliseconds(interval));
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400114 info.setIsFirstProbeScheduled(true);
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000115 }
116
117 return info.isProbingDue();
118}
119
120void
Junxiao Shifc021862016-08-25 21:51:18 +0000121ProbingModule::afterForwardingProbe(const fib::Entry& fibEntry, const Interest& interest)
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000122{
123 // After probing is done, need to set probing flag to false and
124 // schedule another future probe
Junxiao Shi8d843142016-07-11 22:42:42 +0000125 NamespaceInfo& info = m_measurements.getOrCreateNamespaceInfo(fibEntry, interest);
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000126 info.setIsProbingDue(false);
127
128 scheduleProbe(fibEntry, m_probingInterval);
129}
130
Junxiao Shia6de4292016-07-12 02:08:10 +0000131Face*
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400132ProbingModule::chooseFace(const FaceInfoFacePairSet& rankedFaces)
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000133{
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400134 static std::uniform_real_distribution<> randDist;
135 double randomNumber = randDist(ndn::random::getRandomNumberEngine());
136 uint64_t rankSum = (rankedFaces.size() + 1) * rankedFaces.size() / 2;
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000137
138 uint64_t rank = 1;
139 double offset = 0.0;
140
Davide Pesaventoe4b22382018-06-10 14:37:24 -0400141 for (const auto& pair : rankedFaces) {
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000142 double probability = getProbingProbability(rank++, rankSum, rankedFaces.size());
143
144 // Is the random number within the bounds of this face's probability + the previous faces'
145 // probability?
146 //
147 // e.g. (FaceId: 1, p=0.5), (FaceId: 2, p=0.33), (FaceId: 3, p=0.17)
148 // randomNumber = 0.92
149 //
150 // The face with FaceId: 3 should be picked
151 // (0.68 < 0.5 + 0.33 + 0.17) == true
152 //
153 if (randomNumber <= offset + probability) {
154 // Found face to probe
155 return pair.second;
156 }
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000157 offset += probability;
158 }
159
160 // Given a set of Faces, this method should always select a Face to probe
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400161 NDN_CXX_UNREACHABLE;
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000162}
163
164double
165ProbingModule::getProbingProbability(uint64_t rank, uint64_t rankSum, uint64_t nFaces)
166{
167 // p = n + 1 - j ; n: # faces
168 // ---------
169 // sum(ranks)
170 return static_cast<double>(nFaces + 1 - rank) / rankSum;
171}
172
Ashlesh Gawande92e4ea52017-07-19 11:38:12 -0500173void
174ProbingModule::setProbingInterval(size_t probingInterval)
175{
176 if (time::milliseconds(probingInterval) >= MIN_PROBING_INTERVAL) {
177 m_probingInterval = time::milliseconds(probingInterval);
178 }
179 else {
Davide Pesaventoa6f637a2019-08-28 23:23:20 -0400180 NDN_THROW(std::invalid_argument("Probing interval must be >= " +
Davide Pesavento19779d82019-02-14 13:40:04 -0500181 to_string(MIN_PROBING_INTERVAL.count()) + " milliseconds"));
Ashlesh Gawande92e4ea52017-07-19 11:38:12 -0500182 }
183}
184
Vince Lehman8a4c29e2016-07-11 08:49:35 +0000185} // namespace asf
186} // namespace fw
187} // namespace nfd