Teng Liang | 39465c2 | 2018-11-12 19:43:04 -0700 | [diff] [blame] | 1 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /* |
| 3 | * Copyright (c) 2014-2019, 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 | #ifndef NFD_DAEMON_FW_SELF_LEARNING_STRATEGY_HPP |
| 27 | #define NFD_DAEMON_FW_SELF_LEARNING_STRATEGY_HPP |
| 28 | |
| 29 | #include "fw/strategy.hpp" |
| 30 | |
| 31 | #include <ndn-cxx/lp/prefix-announcement-header.hpp> |
| 32 | |
| 33 | namespace nfd { |
| 34 | namespace fw { |
| 35 | |
| 36 | /** \brief Self-learning strategy |
| 37 | * |
| 38 | * This strategy first broadcasts Interest to learn a single path towards data, |
| 39 | * then unicasts subsequent Interests along the learned path |
| 40 | * |
| 41 | * \see https://redmine.named-data.net/attachments/864/Self-learning-strategy-v1.pdf |
| 42 | */ |
| 43 | class SelfLearningStrategy : public Strategy |
| 44 | { |
| 45 | public: |
| 46 | explicit |
| 47 | SelfLearningStrategy(Forwarder& forwarder, const Name& name = getStrategyName()); |
| 48 | |
| 49 | static const Name& |
| 50 | getStrategyName(); |
| 51 | |
| 52 | /// StrategyInfo on pit::InRecord |
| 53 | class InRecordInfo : public StrategyInfo |
| 54 | { |
| 55 | public: |
| 56 | static constexpr int |
| 57 | getTypeId() |
| 58 | { |
| 59 | return 1040; |
| 60 | } |
| 61 | |
| 62 | public: |
| 63 | bool isNonDiscoveryInterest = false; |
| 64 | }; |
| 65 | |
| 66 | /// StrategyInfo on pit::OutRecord |
| 67 | class OutRecordInfo : public StrategyInfo |
| 68 | { |
| 69 | public: |
| 70 | static constexpr int |
| 71 | getTypeId() |
| 72 | { |
| 73 | return 1041; |
| 74 | } |
| 75 | |
| 76 | public: |
| 77 | bool isNonDiscoveryInterest = false; |
| 78 | }; |
| 79 | |
| 80 | public: // triggers |
| 81 | void |
| 82 | afterReceiveInterest(const Face& inFace, const Interest& interest, |
| 83 | const shared_ptr<pit::Entry>& pitEntry) override; |
| 84 | |
| 85 | void |
| 86 | afterReceiveData(const shared_ptr<pit::Entry>& pitEntry, |
| 87 | const Face& inFace, const Data& data) override; |
| 88 | |
| 89 | void |
| 90 | afterReceiveNack(const Face& inFace, const lp::Nack& nack, |
| 91 | const shared_ptr<pit::Entry>& pitEntry) override; |
| 92 | |
| 93 | private: // operations |
| 94 | |
| 95 | /** \brief Send an Interest to all possible faces |
| 96 | * |
| 97 | * This function is invoked when the forwarder has no matching FIB entries for |
| 98 | * an incoming discovery Interest, which will be forwarded to faces that |
| 99 | * - do not violate the Interest scope |
| 100 | * - are non-local |
| 101 | * - are not the face from which the Interest arrived, unless the face is ad-hoc |
| 102 | */ |
| 103 | void |
| 104 | broadcastInterest(const Interest& interest, const Face& inFace, |
| 105 | const shared_ptr<pit::Entry>& pitEntry); |
| 106 | |
| 107 | /** \brief Send an Interest to \p nexthops |
| 108 | */ |
| 109 | void |
| 110 | multicastInterest(const Interest& interest, const Face& inFace, |
| 111 | const shared_ptr<pit::Entry>& pitEntry, |
| 112 | const fib::NextHopList& nexthops); |
| 113 | |
| 114 | /** \brief Find a Prefix Announcement for the Data on the RIB thread, and forward |
| 115 | * the Data with the Prefix Announcement on the main thread |
| 116 | */ |
| 117 | void |
| 118 | asyncProcessData(const shared_ptr<pit::Entry>& pitEntry, const Face& inFace, const Data& data); |
| 119 | |
| 120 | /** \brief Check whether a PrefixAnnouncement needs to be attached to an incoming Data |
| 121 | * |
| 122 | * The conditions that a Data packet requires a PrefixAnnouncement are |
| 123 | * - the incoming Interest was discovery and |
| 124 | * - the outgoing Interest was non-discovery and |
| 125 | * - this forwarder does not directly connect to the consumer |
| 126 | */ |
| 127 | static bool |
| 128 | needPrefixAnn(const shared_ptr<pit::Entry>& pitEntry); |
| 129 | |
| 130 | /** \brief Add a route using RibManager::slAnnounce on the RIB thread |
| 131 | */ |
| 132 | void |
| 133 | addRoute(const shared_ptr<pit::Entry>& pitEntry, const Face& inFace, |
| 134 | const Data& data, const ndn::PrefixAnnouncement& pa); |
| 135 | |
| 136 | /** \brief renew a route using RibManager::slRenew on the RIB thread |
| 137 | */ |
| 138 | void |
| 139 | renewRoute(const Name& name, FaceId inFaceId, time::milliseconds maxLifetime); |
| 140 | |
| 141 | private: |
| 142 | static const time::milliseconds ROUTE_RENEW_LIFETIME; |
| 143 | }; |
| 144 | |
| 145 | } // namespace fw |
| 146 | } // namespace nfd |
| 147 | |
| 148 | #endif // NFD_DAEMON_FW_SELF_LEARNING_STRATEGY_HPP |