blob: d21fc6f3a7ce6f4cc97420311d80801585bf0492 [file] [log] [blame]
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2014-2021, 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,
* The University of Memphis.
*
* 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 "congestion-mark-strategy.hpp"
namespace nfd {
namespace fw {
NFD_REGISTER_STRATEGY(CongestionMarkStrategy);
CongestionMarkStrategy::CongestionMarkStrategy(Forwarder& forwarder, const Name& name)
// Specifying BestRouteStrategy's own name in its constructor prevents an exception from occuring
// when specifying parameters to CongestionMarkStrategy
: BestRouteStrategy(forwarder, BestRouteStrategy::getStrategyName())
{
ParsedInstanceName parsed = parseInstanceName(name);
switch (parsed.parameters.size()) {
case 2:
if (parsed.parameters.at(1).toUri() != "true" && parsed.parameters.at(1).toUri() != "false") {
NDN_THROW(std::invalid_argument(
"Second parameter to CongestionMarkStrategy must be either 'true' or 'false'"));
}
m_shouldPreserveMark = parsed.parameters.at(1).toUri() == "true";
NDN_CXX_FALLTHROUGH;
case 1:
try {
auto s = parsed.parameters.at(0).toUri();
if (!s.empty() && s[0] == '-')
NDN_THROW(boost::bad_lexical_cast());
m_congestionMark = boost::lexical_cast<uint64_t>(s);
}
catch (const boost::bad_lexical_cast&) {
NDN_THROW(std::invalid_argument(
"First parameter to CongestionMarkStrategy must be a non-negative integer"));
}
NDN_CXX_FALLTHROUGH;
case 0:
break;
default:
NDN_THROW(std::invalid_argument("CongestionMarkStrategy does not accept more than 2 parameters"));
}
if (parsed.version && *parsed.version != getStrategyName()[-1].toVersion()) {
NDN_THROW(std::invalid_argument(
"CongestionMarkStrategy does not support version " + to_string(*parsed.version)));
}
this->setInstanceName(makeInstanceName(name, getStrategyName()));
}
const Name&
CongestionMarkStrategy::getStrategyName()
{
static const auto strategyName = Name("/localhost/nfd/strategy/congestion-mark").appendVersion(1);
return strategyName;
}
void
CongestionMarkStrategy::afterReceiveInterest(const Interest& interest, const FaceEndpoint& ingress,
const shared_ptr<pit::Entry>& pitEntry)
{
auto mark = interest.getCongestionMark();
if (mark != m_congestionMark && (!m_shouldPreserveMark || mark == 0)) {
Interest markedInterest(interest);
markedInterest.setCongestionMark(m_congestionMark);
BestRouteStrategy::afterReceiveInterest(markedInterest, ingress, pitEntry);
}
else {
BestRouteStrategy::afterReceiveInterest(interest, ingress, pitEntry);
}
}
} // namespace fw
} // namespace nfd