9bcbc7c130
Change-Id: I4082db67f2390482615a780d91a513f09d57a9a4 Refs: #1266
305 lines
10 KiB
C++
305 lines
10 KiB
C++
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
|
/**
|
|
* Copyright (c) 2014 Regents of the University of California,
|
|
* Arizona Board of Regents,
|
|
* Colorado State University,
|
|
* University Pierre & Marie Curie, Sorbonne University,
|
|
* Washington University in St. Louis,
|
|
* Beijing Institute of Technology
|
|
*
|
|
* This file is part of NFD (Named Data Networking Forwarding Daemon).
|
|
* See AUTHORS.md for complete list of NFD authors and contributors.
|
|
*
|
|
* NFD 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.
|
|
*
|
|
* NFD 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
|
|
* NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
|
|
**/
|
|
|
|
#include "ncc-strategy.hpp"
|
|
|
|
namespace nfd {
|
|
namespace fw {
|
|
|
|
const Name NccStrategy::STRATEGY_NAME("ndn:/localhost/nfd/strategy/ncc");
|
|
|
|
NccStrategy::NccStrategy(Forwarder& forwarder, const Name& name)
|
|
: Strategy(forwarder, name)
|
|
{
|
|
}
|
|
|
|
NccStrategy::~NccStrategy()
|
|
{
|
|
}
|
|
|
|
const time::microseconds NccStrategy::DEFER_FIRST_WITHOUT_BEST_FACE = time::microseconds(4000);
|
|
const time::microseconds NccStrategy::DEFER_RANGE_WITHOUT_BEST_FACE = time::microseconds(75000);
|
|
const time::nanoseconds NccStrategy::MEASUREMENTS_LIFETIME = time::seconds(16);
|
|
|
|
void
|
|
NccStrategy::afterReceiveInterest(const Face& inFace,
|
|
const Interest& interest,
|
|
shared_ptr<fib::Entry> fibEntry,
|
|
shared_ptr<pit::Entry> pitEntry)
|
|
{
|
|
const fib::NextHopList& nexthops = fibEntry->getNextHops();
|
|
if (nexthops.size() == 0) {
|
|
this->rejectPendingInterest(pitEntry);
|
|
return;
|
|
}
|
|
|
|
shared_ptr<PitEntryInfo> pitEntryInfo =
|
|
pitEntry->getOrCreateStrategyInfo<PitEntryInfo>();
|
|
bool isNewInterest = pitEntryInfo->isNewInterest;
|
|
if (!isNewInterest) {
|
|
return;
|
|
}
|
|
pitEntryInfo->isNewInterest = false;
|
|
|
|
shared_ptr<MeasurementsEntryInfo> measurementsEntryInfo =
|
|
this->getMeasurementsEntryInfo(pitEntry);
|
|
|
|
time::microseconds deferFirst = DEFER_FIRST_WITHOUT_BEST_FACE;
|
|
time::microseconds deferRange = DEFER_RANGE_WITHOUT_BEST_FACE;
|
|
size_t nUpstreams = nexthops.size();
|
|
|
|
shared_ptr<Face> bestFace = measurementsEntryInfo->getBestFace();
|
|
if (static_cast<bool>(bestFace) && fibEntry->hasNextHop(bestFace) &&
|
|
pitEntry->canForwardTo(*bestFace)) {
|
|
// TODO Should we use `randlow = 100 + nrand48(h->seed) % 4096U;` ?
|
|
deferFirst = measurementsEntryInfo->prediction;
|
|
deferRange = time::microseconds((deferFirst.count() + 1) / 2);
|
|
--nUpstreams;
|
|
this->sendInterest(pitEntry, bestFace);
|
|
pitEntryInfo->bestFaceTimeout = scheduler::schedule(
|
|
measurementsEntryInfo->prediction,
|
|
bind(&NccStrategy::timeoutOnBestFace, this, weak_ptr<pit::Entry>(pitEntry)));
|
|
}
|
|
else {
|
|
// use first nexthop
|
|
this->sendInterest(pitEntry, nexthops.begin()->getFace());
|
|
// TODO avoid sending to inFace
|
|
}
|
|
|
|
shared_ptr<Face> previousFace = measurementsEntryInfo->previousFace.lock();
|
|
if (static_cast<bool>(previousFace) && fibEntry->hasNextHop(previousFace) &&
|
|
pitEntry->canForwardTo(*previousFace)) {
|
|
--nUpstreams;
|
|
}
|
|
|
|
if (nUpstreams > 0) {
|
|
pitEntryInfo->maxInterval = std::max(time::microseconds(1),
|
|
time::microseconds((2 * deferRange.count() + nUpstreams - 1) / nUpstreams));
|
|
}
|
|
pitEntryInfo->propagateTimer = scheduler::schedule(deferFirst,
|
|
bind(&NccStrategy::doPropagate, this,
|
|
weak_ptr<pit::Entry>(pitEntry), weak_ptr<fib::Entry>(fibEntry)));
|
|
}
|
|
|
|
void
|
|
NccStrategy::doPropagate(weak_ptr<pit::Entry> pitEntryWeak, weak_ptr<fib::Entry> fibEntryWeak)
|
|
{
|
|
shared_ptr<pit::Entry> pitEntry = pitEntryWeak.lock();
|
|
if (!static_cast<bool>(pitEntry)) {
|
|
return;
|
|
}
|
|
shared_ptr<fib::Entry> fibEntry = fibEntryWeak.lock();
|
|
if (!static_cast<bool>(fibEntry)) {
|
|
return;
|
|
}
|
|
|
|
shared_ptr<PitEntryInfo> pitEntryInfo = pitEntry->getStrategyInfo<PitEntryInfo>();
|
|
// pitEntryInfo is guaranteed to exist here, because doPropagate is triggered
|
|
// from a timer set by NccStrategy.
|
|
BOOST_ASSERT(static_cast<bool>(pitEntryInfo));
|
|
|
|
shared_ptr<MeasurementsEntryInfo> measurementsEntryInfo =
|
|
this->getMeasurementsEntryInfo(pitEntry);
|
|
|
|
shared_ptr<Face> previousFace = measurementsEntryInfo->previousFace.lock();
|
|
if (static_cast<bool>(previousFace) && fibEntry->hasNextHop(previousFace) &&
|
|
pitEntry->canForwardTo(*previousFace)) {
|
|
this->sendInterest(pitEntry, previousFace);
|
|
}
|
|
|
|
const fib::NextHopList& nexthops = fibEntry->getNextHops();
|
|
bool isForwarded = false;
|
|
for (fib::NextHopList::const_iterator it = nexthops.begin(); it != nexthops.end(); ++it) {
|
|
shared_ptr<Face> face = it->getFace();
|
|
if (pitEntry->canForwardTo(*face)) {
|
|
isForwarded = true;
|
|
this->sendInterest(pitEntry, face);
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (isForwarded) {
|
|
static unsigned short seed[3];
|
|
time::nanoseconds deferNext = time::nanoseconds(nrand48(seed) % pitEntryInfo->maxInterval.count());
|
|
pitEntryInfo->propagateTimer = scheduler::schedule(deferNext,
|
|
bind(&NccStrategy::doPropagate, this,
|
|
weak_ptr<pit::Entry>(pitEntry), weak_ptr<fib::Entry>(fibEntry)));
|
|
}
|
|
}
|
|
|
|
void
|
|
NccStrategy::timeoutOnBestFace(weak_ptr<pit::Entry> pitEntryWeak)
|
|
{
|
|
shared_ptr<pit::Entry> pitEntry = pitEntryWeak.lock();
|
|
if (!static_cast<bool>(pitEntry)) {
|
|
return;
|
|
}
|
|
shared_ptr<measurements::Entry> measurementsEntry = this->getMeasurements().get(*pitEntry);
|
|
|
|
for (int i = 0; i < UPDATE_MEASUREMENTS_N_LEVELS; ++i) {
|
|
if (!static_cast<bool>(measurementsEntry)) {
|
|
// going out of this strategy's namespace
|
|
return;
|
|
}
|
|
this->getMeasurements().extendLifetime(*measurementsEntry, MEASUREMENTS_LIFETIME);
|
|
|
|
shared_ptr<MeasurementsEntryInfo> measurementsEntryInfo =
|
|
this->getMeasurementsEntryInfo(measurementsEntry);
|
|
measurementsEntryInfo->adjustPredictUp();
|
|
|
|
measurementsEntry = this->getMeasurements().getParent(measurementsEntry);
|
|
}
|
|
}
|
|
|
|
void
|
|
NccStrategy::beforeSatisfyPendingInterest(shared_ptr<pit::Entry> pitEntry,
|
|
const Face& inFace, const Data& data)
|
|
{
|
|
shared_ptr<measurements::Entry> measurementsEntry = this->getMeasurements().get(*pitEntry);
|
|
|
|
for (int i = 0; i < UPDATE_MEASUREMENTS_N_LEVELS; ++i) {
|
|
if (!static_cast<bool>(measurementsEntry)) {
|
|
// going out of this strategy's namespace
|
|
return;
|
|
}
|
|
this->getMeasurements().extendLifetime(*measurementsEntry, MEASUREMENTS_LIFETIME);
|
|
|
|
shared_ptr<MeasurementsEntryInfo> measurementsEntryInfo =
|
|
this->getMeasurementsEntryInfo(measurementsEntry);
|
|
measurementsEntryInfo->updateBestFace(inFace);
|
|
|
|
measurementsEntry = this->getMeasurements().getParent(measurementsEntry);
|
|
}
|
|
|
|
shared_ptr<PitEntryInfo> pitEntryInfo = pitEntry->getStrategyInfo<PitEntryInfo>();
|
|
if (static_cast<bool>(pitEntryInfo)) {
|
|
scheduler::cancel(pitEntryInfo->propagateTimer);
|
|
}
|
|
}
|
|
|
|
shared_ptr<NccStrategy::MeasurementsEntryInfo>
|
|
NccStrategy::getMeasurementsEntryInfo(shared_ptr<pit::Entry> entry)
|
|
{
|
|
shared_ptr<measurements::Entry> measurementsEntry = this->getMeasurements().get(*entry);
|
|
return this->getMeasurementsEntryInfo(measurementsEntry);
|
|
}
|
|
|
|
shared_ptr<NccStrategy::MeasurementsEntryInfo>
|
|
NccStrategy::getMeasurementsEntryInfo(shared_ptr<measurements::Entry> entry)
|
|
{
|
|
shared_ptr<MeasurementsEntryInfo> info = entry->getStrategyInfo<MeasurementsEntryInfo>();
|
|
if (static_cast<bool>(info)) {
|
|
return info;
|
|
}
|
|
|
|
info = make_shared<MeasurementsEntryInfo>();
|
|
entry->setStrategyInfo(info);
|
|
|
|
shared_ptr<measurements::Entry> parentEntry = this->getMeasurements().getParent(entry);
|
|
if (static_cast<bool>(parentEntry)) {
|
|
shared_ptr<MeasurementsEntryInfo> parentInfo = this->getMeasurementsEntryInfo(parentEntry);
|
|
BOOST_ASSERT(static_cast<bool>(parentInfo));
|
|
info->inheritFrom(*parentInfo);
|
|
}
|
|
|
|
return info;
|
|
}
|
|
|
|
|
|
const time::microseconds NccStrategy::MeasurementsEntryInfo::INITIAL_PREDICTION =
|
|
time::microseconds(8192);
|
|
const time::microseconds NccStrategy::MeasurementsEntryInfo::MIN_PREDICTION =
|
|
time::microseconds(127);
|
|
const time::microseconds NccStrategy::MeasurementsEntryInfo::MAX_PREDICTION =
|
|
time::microseconds(160000);
|
|
|
|
NccStrategy::MeasurementsEntryInfo::MeasurementsEntryInfo()
|
|
: prediction(INITIAL_PREDICTION)
|
|
{
|
|
}
|
|
|
|
void
|
|
NccStrategy::MeasurementsEntryInfo::inheritFrom(const MeasurementsEntryInfo& other)
|
|
{
|
|
this->operator=(other);
|
|
}
|
|
|
|
shared_ptr<Face>
|
|
NccStrategy::MeasurementsEntryInfo::getBestFace(void) {
|
|
shared_ptr<Face> best = this->bestFace.lock();
|
|
if (static_cast<bool>(best)) {
|
|
return best;
|
|
}
|
|
this->bestFace = best = this->previousFace.lock();
|
|
return best;
|
|
}
|
|
|
|
void
|
|
NccStrategy::MeasurementsEntryInfo::updateBestFace(const Face& face) {
|
|
if (this->bestFace.expired()) {
|
|
this->bestFace = const_cast<Face&>(face).shared_from_this();
|
|
return;
|
|
}
|
|
shared_ptr<Face> bestFace = this->bestFace.lock();
|
|
if (bestFace.get() == &face) {
|
|
this->adjustPredictDown();
|
|
}
|
|
else {
|
|
this->previousFace = this->bestFace;
|
|
this->bestFace = const_cast<Face&>(face).shared_from_this();
|
|
}
|
|
}
|
|
|
|
void
|
|
NccStrategy::MeasurementsEntryInfo::adjustPredictDown() {
|
|
prediction = std::max(MIN_PREDICTION,
|
|
time::microseconds(prediction.count() - (prediction.count() >> ADJUST_PREDICT_DOWN_SHIFT)));
|
|
}
|
|
|
|
void
|
|
NccStrategy::MeasurementsEntryInfo::adjustPredictUp() {
|
|
prediction = std::min(MAX_PREDICTION,
|
|
time::microseconds(prediction.count() + (prediction.count() >> ADJUST_PREDICT_UP_SHIFT)));
|
|
}
|
|
|
|
void
|
|
NccStrategy::MeasurementsEntryInfo::ageBestFace() {
|
|
this->previousFace = this->bestFace;
|
|
this->bestFace.reset();
|
|
}
|
|
|
|
NccStrategy::PitEntryInfo::PitEntryInfo()
|
|
: isNewInterest(true)
|
|
{
|
|
}
|
|
|
|
NccStrategy::PitEntryInfo::~PitEntryInfo()
|
|
{
|
|
scheduler::cancel(this->bestFaceTimeout);
|
|
scheduler::cancel(this->propagateTimer);
|
|
}
|
|
|
|
} // namespace fw
|
|
} // namespace nfd
|