asf-strategy.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2014-2020, Regents of the University of California,
4  * 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-strategy.hpp"
27 #include "algorithm.hpp"
28 #include "common/global.hpp"
29 #include "common/logger.hpp"
30 
31 namespace nfd {
32 namespace fw {
33 namespace asf {
34 
35 NFD_LOG_INIT(AsfStrategy);
36 NFD_REGISTER_STRATEGY(AsfStrategy);
37 
38 const time::milliseconds AsfStrategy::RETX_SUPPRESSION_INITIAL(10);
39 const time::milliseconds AsfStrategy::RETX_SUPPRESSION_MAX(250);
40 
41 AsfStrategy::AsfStrategy(Forwarder& forwarder, const Name& name)
42  : Strategy(forwarder)
43  , m_measurements(getMeasurements())
44  , m_probing(m_measurements)
45  , m_retxSuppression(RETX_SUPPRESSION_INITIAL,
46  RetxSuppressionExponential::DEFAULT_MULTIPLIER,
47  RETX_SUPPRESSION_MAX)
48 {
50  if (!parsed.parameters.empty()) {
51  processParams(parsed.parameters);
52  }
53 
54  if (parsed.version && *parsed.version != getStrategyName()[-1].toVersion()) {
55  NDN_THROW(std::invalid_argument(
56  "AsfStrategy does not support version " + to_string(*parsed.version)));
57  }
59 
60  NFD_LOG_DEBUG("probing-interval=" << m_probing.getProbingInterval()
61  << " n-silent-timeouts=" << m_nMaxSilentTimeouts);
62 }
63 
64 const Name&
66 {
67  static Name strategyName("/localhost/nfd/strategy/asf/%FD%03");
68  return strategyName;
69 }
70 
71 static uint64_t
72 getParamValue(const std::string& param, const std::string& value)
73 {
74  try {
75  if (!value.empty() && value[0] == '-')
76  NDN_THROW(boost::bad_lexical_cast());
77 
78  return boost::lexical_cast<uint64_t>(value);
79  }
80  catch (const boost::bad_lexical_cast&) {
81  NDN_THROW(std::invalid_argument("Value of " + param + " must be a non-negative integer"));
82  }
83 }
84 
85 void
86 AsfStrategy::processParams(const PartialName& parsed)
87 {
88  for (const auto& component : parsed) {
89  std::string parsedStr(reinterpret_cast<const char*>(component.value()), component.value_size());
90  auto n = parsedStr.find("~");
91  if (n == std::string::npos) {
92  NDN_THROW(std::invalid_argument("Format is <parameter>~<value>"));
93  }
94 
95  auto f = parsedStr.substr(0, n);
96  auto s = parsedStr.substr(n + 1);
97  if (f == "probing-interval") {
98  m_probing.setProbingInterval(getParamValue(f, s));
99  }
100  else if (f == "n-silent-timeouts") {
101  m_nMaxSilentTimeouts = getParamValue(f, s);
102  }
103  else {
104  NDN_THROW(std::invalid_argument("Parameter should be probing-interval or n-silent-timeouts"));
105  }
106  }
107 }
108 
109 void
110 AsfStrategy::afterReceiveInterest(const FaceEndpoint& ingress, const Interest& interest,
111  const shared_ptr<pit::Entry>& pitEntry)
112 {
113  // Should the Interest be suppressed?
114  auto suppressResult = m_retxSuppression.decidePerPitEntry(*pitEntry);
115  if (suppressResult == RetxSuppressionResult::SUPPRESS) {
116  NFD_LOG_DEBUG(interest << " retx-interest from=" << ingress << " suppressed");
117  return;
118  }
119 
120  const fib::Entry& fibEntry = this->lookupFib(*pitEntry);
121  const fib::NextHopList& nexthops = fibEntry.getNextHops();
122 
123  if (suppressResult == RetxSuppressionResult::NEW) {
124  if (nexthops.size() == 0) {
125  NFD_LOG_DEBUG(interest << " new-interest from=" << ingress << " no-nexthop");
126  sendNoRouteNack(ingress.face, pitEntry);
127  return;
128  }
129 
130  Face* faceToUse = getBestFaceForForwarding(interest, ingress.face, fibEntry, pitEntry);
131  if (faceToUse != nullptr) {
132  NFD_LOG_DEBUG(interest << " new-interest from=" << ingress << " forward-to=" << faceToUse->getId());
133  forwardInterest(interest, *faceToUse, fibEntry, pitEntry);
134 
135  // If necessary, send probe
136  sendProbe(interest, ingress, *faceToUse, fibEntry, pitEntry);
137  }
138  else {
139  NFD_LOG_DEBUG(interest << " new-interest from=" << ingress << " no-nexthop");
140  sendNoRouteNack(ingress.face, pitEntry);
141  }
142  return;
143  }
144 
145  Face* faceToUse = getBestFaceForForwarding(interest, ingress.face, fibEntry, pitEntry, false);
146  // if unused face not found, select nexthop with earliest out record
147  if (faceToUse != nullptr) {
148  NFD_LOG_DEBUG(interest << " retx-interest from=" << ingress << " forward-to=" << faceToUse->getId());
149  forwardInterest(interest, *faceToUse, fibEntry, pitEntry);
150  // avoid probing in case of forwarding
151  return;
152  }
153 
154  // find an eligible upstream that is used earliest
155  auto it = nexthops.end();
156  it = findEligibleNextHopWithEarliestOutRecord(ingress.face, interest, nexthops, pitEntry);
157  if (it == nexthops.end()) {
158  NFD_LOG_DEBUG(interest << " retx-interest from=" << ingress << " no-nexthop");
159  }
160  else {
161  NFD_LOG_DEBUG(interest << " retx-interest from=" << ingress << " retry-to=" << it->getFace().getId());
162  this->sendInterest(pitEntry, it->getFace(), interest);
163  }
164 }
165 
166 void
167 AsfStrategy::beforeSatisfyInterest(const shared_ptr<pit::Entry>& pitEntry,
168  const FaceEndpoint& ingress, const Data& data)
169 {
170  NamespaceInfo* namespaceInfo = m_measurements.getNamespaceInfo(pitEntry->getName());
171  if (namespaceInfo == nullptr) {
172  NFD_LOG_DEBUG(pitEntry->getName() << " data from=" << ingress << " no-measurements");
173  return;
174  }
175 
176  // Record the RTT between the Interest out to Data in
177  FaceInfo* faceInfo = namespaceInfo->getFaceInfo(ingress.face.getId());
178  if (faceInfo == nullptr) {
179  NFD_LOG_DEBUG(pitEntry->getName() << " data from=" << ingress << " no-face-info");
180  return;
181  }
182 
183  auto outRecord = pitEntry->getOutRecord(ingress.face);
184  if (outRecord == pitEntry->out_end()) {
185  NFD_LOG_DEBUG(pitEntry->getName() << " data from=" << ingress << " no-out-record");
186  }
187  else {
188  faceInfo->recordRtt(time::steady_clock::now() - outRecord->getLastRenewed());
189  NFD_LOG_DEBUG(pitEntry->getName() << " data from=" << ingress
190  << " rtt=" << faceInfo->getLastRtt() << " srtt=" << faceInfo->getSrtt());
191  }
192 
193  // Extend lifetime for measurements associated with Face
194  namespaceInfo->extendFaceInfoLifetime(*faceInfo, ingress.face.getId());
195  // Extend PIT entry timer to allow slower probes to arrive
196  this->setExpiryTimer(pitEntry, 50_ms);
197  faceInfo->cancelTimeout(data.getName());
198 }
199 
200 void
201 AsfStrategy::afterReceiveNack(const FaceEndpoint& ingress, const lp::Nack& nack,
202  const shared_ptr<pit::Entry>& pitEntry)
203 {
204  NFD_LOG_DEBUG(nack.getInterest() << " nack from=" << ingress << " reason=" << nack.getReason());
205  onTimeoutOrNack(pitEntry->getName(), ingress.face.getId(), true);
206 }
207 
208 void
209 AsfStrategy::forwardInterest(const Interest& interest, Face& outFace, const fib::Entry& fibEntry,
210  const shared_ptr<pit::Entry>& pitEntry, bool wantNewNonce)
211 {
212  auto faceId = outFace.getId();
213 
214  if (wantNewNonce) {
215  // Send probe: interest with new Nonce
216  Interest probeInterest(interest);
217  probeInterest.refreshNonce();
218  NFD_LOG_TRACE("Sending probe for " << probeInterest << " to=" << faceId);
219  this->sendInterest(pitEntry, outFace, probeInterest);
220  }
221  else {
222  this->sendInterest(pitEntry, outFace, interest);
223  }
224 
225  FaceInfo& faceInfo = m_measurements.getOrCreateFaceInfo(fibEntry, interest, faceId);
226 
227  // Refresh measurements since Face is being used for forwarding
228  NamespaceInfo& namespaceInfo = m_measurements.getOrCreateNamespaceInfo(fibEntry, interest);
229  namespaceInfo.extendFaceInfoLifetime(faceInfo, faceId);
230 
231  if (!faceInfo.isTimeoutScheduled()) {
232  auto timeout = faceInfo.scheduleTimeout(interest.getName(),
233  [this, name = interest.getName(), faceId] {
234  onTimeoutOrNack(name, faceId, false);
235  });
236  NFD_LOG_TRACE("Scheduled timeout for " << fibEntry.getPrefix() << " to=" << faceId
237  << " in " << time::duration_cast<time::milliseconds>(timeout) << " ms");
238  }
239 }
240 
241 void
242 AsfStrategy::sendProbe(const Interest& interest, const FaceEndpoint& ingress, const Face& faceToUse,
243  const fib::Entry& fibEntry, const shared_ptr<pit::Entry>& pitEntry)
244 {
245  if (!m_probing.isProbingNeeded(fibEntry, interest))
246  return;
247 
248  Face* faceToProbe = m_probing.getFaceToProbe(ingress.face, interest, fibEntry, faceToUse);
249  if (faceToProbe == nullptr)
250  return;
251 
252  forwardInterest(interest, *faceToProbe, fibEntry, pitEntry, true);
253  m_probing.afterForwardingProbe(fibEntry, interest);
254 }
255 
256 struct FaceStats
257 {
258  Face* face;
259  time::nanoseconds rtt;
260  time::nanoseconds srtt;
261  uint64_t cost;
262 };
263 
264 struct FaceStatsCompare
265 {
266  bool
267  operator()(const FaceStats& lhs, const FaceStats& rhs) const
268  {
269  time::nanoseconds lhsValue = getValueForSorting(lhs);
270  time::nanoseconds rhsValue = getValueForSorting(rhs);
271 
272  // Sort by RTT and then by cost
273  return std::tie(lhsValue, lhs.cost) < std::tie(rhsValue, rhs.cost);
274  }
275 
276 private:
277  static time::nanoseconds
278  getValueForSorting(const FaceStats& stats)
279  {
280  // These values allow faces with no measurements to be ranked better than timeouts
281  // srtt < RTT_NO_MEASUREMENT < RTT_TIMEOUT
282  if (stats.rtt == FaceInfo::RTT_TIMEOUT) {
283  return time::nanoseconds::max();
284  }
285  else if (stats.rtt == FaceInfo::RTT_NO_MEASUREMENT) {
286  return time::nanoseconds::max() / 2;
287  }
288  else {
289  return stats.srtt;
290  }
291  }
292 };
293 
294 Face*
295 AsfStrategy::getBestFaceForForwarding(const Interest& interest, const Face& inFace,
296  const fib::Entry& fibEntry, const shared_ptr<pit::Entry>& pitEntry,
297  bool isInterestNew)
298 {
299  std::set<FaceStats, FaceStatsCompare> rankedFaces;
300 
301  auto now = time::steady_clock::now();
302  for (const auto& nh : fibEntry.getNextHops()) {
303  if (!isNextHopEligible(inFace, interest, nh, pitEntry, !isInterestNew, now)) {
304  continue;
305  }
306 
307  FaceInfo* info = m_measurements.getFaceInfo(fibEntry, interest, nh.getFace().getId());
308  if (info == nullptr) {
309  rankedFaces.insert({&nh.getFace(), FaceInfo::RTT_NO_MEASUREMENT,
310  FaceInfo::RTT_NO_MEASUREMENT, nh.getCost()});
311  }
312  else {
313  rankedFaces.insert({&nh.getFace(), info->getLastRtt(), info->getSrtt(), nh.getCost()});
314  }
315  }
316 
317  auto it = rankedFaces.begin();
318  return it != rankedFaces.end() ? it->face : nullptr;
319 }
320 
321 void
322 AsfStrategy::onTimeoutOrNack(const Name& interestName, FaceId faceId, bool isNack)
323 {
324  NamespaceInfo* namespaceInfo = m_measurements.getNamespaceInfo(interestName);
325  if (namespaceInfo == nullptr) {
326  NFD_LOG_TRACE(interestName << " FibEntry has been removed since timeout scheduling");
327  return;
328  }
329 
330  FaceInfo* fiPtr = namespaceInfo->getFaceInfo(faceId);
331  if (fiPtr == nullptr) {
332  NFD_LOG_TRACE(interestName << " FaceInfo id=" << faceId << " has been removed since timeout scheduling");
333  return;
334  }
335 
336  auto& faceInfo = *fiPtr;
337  size_t nTimeouts = faceInfo.getNSilentTimeouts() + 1;
338  faceInfo.setNSilentTimeouts(nTimeouts);
339 
340  if (nTimeouts <= m_nMaxSilentTimeouts && !isNack) {
341  NFD_LOG_TRACE(interestName << " face=" << faceId << " timeout-count=" << nTimeouts << " ignoring");
342  // Extend lifetime for measurements associated with Face
343  namespaceInfo->extendFaceInfoLifetime(faceInfo, faceId);
344  faceInfo.cancelTimeout(interestName);
345  }
346  else {
347  NFD_LOG_TRACE(interestName << " face=" << faceId << " timeout-count=" << nTimeouts);
348  faceInfo.recordTimeout(interestName);
349  }
350 }
351 
352 void
353 AsfStrategy::sendNoRouteNack(Face& face, const shared_ptr<pit::Entry>& pitEntry)
354 {
355  lp::NackHeader nackHeader;
356  nackHeader.setReason(lp::NackReason::NO_ROUTE);
357  this->sendNack(pitEntry, face, nackHeader);
358  this->rejectPendingInterest(pitEntry);
359 }
360 
361 } // namespace asf
362 } // namespace fw
363 } // namespace nfd
void cancelTimeout(const Name &prefix)
Main class of NFD&#39;s forwarding engine.
Definition: forwarder.hpp:51
void setInstanceName(const Name &name)
Set strategy instance name.
Definition: strategy.hpp:386
static const time::nanoseconds RTT_NO_MEASUREMENT
static const time::nanoseconds RTT_TIMEOUT
void afterForwardingProbe(const fib::Entry &fibEntry, const Interest &interest)
bool sendNack(const shared_ptr< pit::Entry > &pitEntry, Face &egress, const lp::NackHeader &header)
Send a Nack packet.
Definition: strategy.hpp:306
void extendFaceInfoLifetime(FaceInfo &info, FaceId faceId)
size_t getNSilentTimeouts() const
static const Name & getStrategyName()
NamespaceInfo * getNamespaceInfo(const Name &prefix)
represents a FIB entry
Definition: fib-entry.hpp:53
fib::NextHopList::const_iterator findEligibleNextHopWithEarliestOutRecord(const Face &inFace, const Interest &interest, const fib::NextHopList &nexthops, const shared_ptr< pit::Entry > &pitEntry)
pick an eligible NextHop with earliest out-record
Definition: algorithm.cpp:132
NFD_REGISTER_STRATEGY(AsfStrategy)
#define NFD_LOG_TRACE
Definition: logger.hpp:37
void beforeSatisfyInterest(const shared_ptr< pit::Entry > &pitEntry, const FaceEndpoint &ingress, const Data &data) override
Trigger before PIT entry is satisfied.
FaceInfo & getOrCreateFaceInfo(const fib::Entry &fibEntry, const Interest &interest, FaceId faceId)
Interest is retransmission and should be suppressed.
static uint64_t getParamValue(const std::string &param, const std::string &value)
static Name makeInstanceName(const Name &input, const Name &strategyName)
Construct a strategy instance name.
Definition: strategy.cpp:134
const fib::Entry & lookupFib(const pit::Entry &pitEntry) const
Performs a FIB lookup, considering Link object if present.
Definition: strategy.cpp:282
time::milliseconds getProbingInterval() const
void afterReceiveNack(const FaceEndpoint &ingress, const lp::Nack &nack, const shared_ptr< pit::Entry > &pitEntry) override
Trigger after Nack is received.
Represents a face-endpoint pair in the forwarder.
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
Definition: algorithm.hpp:32
time::nanoseconds getLastRtt() const
Interest is new (not a retransmission)
time::nanoseconds scheduleTimeout(const Name &interestName, scheduler::EventCallback cb)
bool isNextHopEligible(const Face &inFace, const Interest &interest, const fib::NextHop &nexthop, const shared_ptr< pit::Entry > &pitEntry, bool wantUnused, time::steady_clock::TimePoint now)
determines whether a NextHop is eligible i.e.
Definition: algorithm.cpp:154
const Name & getPrefix() const
Definition: fib-entry.hpp:60
a retransmission suppression decision algorithm that suppresses retransmissions using exponential bac...
NamespaceInfo & getOrCreateNamespaceInfo(const fib::Entry &fibEntry, const Interest &interest)
generalization of a network interface
Definition: face.hpp:54
void setExpiryTimer(const shared_ptr< pit::Entry > &pitEntry, time::milliseconds duration)
Schedule the PIT entry to be erased after duration.
Definition: strategy.hpp:325
bool isProbingNeeded(const fib::Entry &fibEntry, const Interest &interest)
Represents a collection of nexthops.
Definition: fib-entry.hpp:39
PartialName parameters
parameter components
Definition: strategy.hpp:359
FaceId getId() const
Definition: face.hpp:239
Stores strategy information about each face in this namespace.
RetxSuppressionResult decidePerPitEntry(pit::Entry &pitEntry)
determines whether Interest is a retransmission per pit entry and if so, whether it shall be forwarde...
Represents a forwarding strategy.
Definition: strategy.hpp:37
This file contains common algorithms used by forwarding strategies.
const NextHopList & getNextHops() const
Definition: fib-entry.hpp:66
#define NFD_LOG_DEBUG
Definition: logger.hpp:38
#define NFD_LOG_INIT(name)
Definition: logger.hpp:31
static ParsedInstanceName parseInstanceName(const Name &input)
Parse a strategy instance name.
Definition: strategy.cpp:123
void setProbingInterval(size_t probingInterval)
Face * getFaceToProbe(const Face &inFace, const Interest &interest, const fib::Entry &fibEntry, const Face &faceUsed)
void afterReceiveInterest(const FaceEndpoint &ingress, const Interest &interest, const shared_ptr< pit::Entry > &pitEntry) override
Trigger after Interest is received.
void recordRtt(time::nanoseconds rtt)
uint64_t FaceId
Identifies a face.
Definition: face-common.hpp:44
void rejectPendingInterest(const shared_ptr< pit::Entry > &pitEntry)
Schedule the PIT entry for immediate deletion.
Definition: strategy.hpp:291
Strategy information for each face in a namespace.
AsfStrategy(Forwarder &forwarder, const Name &name=getStrategyName())
pit::OutRecord * sendInterest(const shared_ptr< pit::Entry > &pitEntry, Face &egress, const Interest &interest)
Send an Interest packet.
Definition: strategy.cpp:197
optional< uint64_t > version
whether strategyName contains a version component
Definition: strategy.hpp:358
FaceInfo * getFaceInfo(FaceId faceId)
time::nanoseconds getSrtt() const