/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ /** * Copyright (c) 2014-2017, 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 . */ #include "multicast-strategy.hpp" #include "algorithm.hpp" #include "core/logger.hpp" namespace nfd { namespace fw { NFD_REGISTER_STRATEGY(MulticastStrategy); NFD_LOG_INIT("MulticastStrategy"); const time::milliseconds MulticastStrategy::RETX_SUPPRESSION_INITIAL(10); const time::milliseconds MulticastStrategy::RETX_SUPPRESSION_MAX(250); MulticastStrategy::MulticastStrategy(Forwarder& forwarder, const Name& name) : Strategy(forwarder) , ProcessNackTraits(this) , m_retxSuppression(RETX_SUPPRESSION_INITIAL, RetxSuppressionExponential::DEFAULT_MULTIPLIER, RETX_SUPPRESSION_MAX) { ParsedInstanceName parsed = parseInstanceName(name); if (!parsed.parameters.empty()) { BOOST_THROW_EXCEPTION(std::invalid_argument("MulticastStrategy does not accept parameters")); } if (parsed.version && *parsed.version != getStrategyName()[-1].toVersion()) { BOOST_THROW_EXCEPTION(std::invalid_argument( "MulticastStrategy does not support version " + std::to_string(*parsed.version))); } this->setInstanceName(makeInstanceName(name, getStrategyName())); } const Name& MulticastStrategy::getStrategyName() { static Name strategyName("/localhost/nfd/strategy/multicast/%FD%02"); return strategyName; } void MulticastStrategy::afterReceiveInterest(const Face& inFace, const Interest& interest, const shared_ptr& pitEntry) { // Should the Interest be suppressed? RetxSuppression::Result suppressResult = m_retxSuppression.decide(inFace, interest, *pitEntry); switch (suppressResult) { case RetxSuppression::NEW: case RetxSuppression::FORWARD: break; case RetxSuppression::SUPPRESS: NFD_LOG_DEBUG(interest << " from=" << inFace.getId() << " suppressed"); return; } const fib::Entry& fibEntry = this->lookupFib(*pitEntry); const fib::NextHopList& nexthops = fibEntry.getNextHops(); int nEligibleNextHops = 0; for (const auto& nexthop : nexthops) { Face& outFace = nexthop.getFace(); if (&outFace != &inFace && !wouldViolateScope(inFace, interest, outFace)) { this->sendInterest(pitEntry, outFace, interest); NFD_LOG_DEBUG(interest << " from=" << inFace.getId() << " pitEntry-to=" << outFace.getId()); ++nEligibleNextHops; } } if (nEligibleNextHops == 0) { NFD_LOG_DEBUG(interest << " from=" << inFace.getId() << " noNextHop"); lp::NackHeader nackHeader; nackHeader.setReason(lp::NackReason::NO_ROUTE); this->sendNack(pitEntry, inFace, nackHeader); this->rejectPendingInterest(pitEntry); } } void MulticastStrategy::afterReceiveNack(const Face& inFace, const lp::Nack& nack, const shared_ptr& pitEntry) { this->processNack(inFace, nack, pitEntry); } } // namespace fw } // namespace nfd