NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.5: NDN, CCN, CCNx, content centric networks
API Documentation
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2014-2018, 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  */
29 #include "core/scope-prefix.hpp"
30 #include "table/pit-entry.hpp"
36 namespace nfd {
37 namespace fw {
42 bool
43 wouldViolateScope(const Face& inFace, const Interest& interest, const Face& outFace);
55 bool
56 canForwardToLegacy(const pit::Entry& pitEntry, const Face& face);
66 };
71 int
72 findDuplicateNonce(const pit::Entry& pitEntry, uint32_t nonce, const Face& face);
77 bool
78 hasPendingOutRecords(const pit::Entry& pitEntry);
84 getLastOutgoing(const pit::Entry& pitEntry);
86 } // namespace fw
87 } // namespace nfd
bool canForwardToLegacy(const pit::Entry &pitEntry, const Face &face)
decide whether Interest can be forwarded to face
Definition: algorithm.cpp:54
time_point TimePoint
Definition: time.hpp:225
generalization of a network interface
Definition: face.hpp:67
in-record of same face
Definition: algorithm.hpp:62
ndn Face
Definition: face-impl.hpp:42
Copyright (c) 2011-2015 Regents of the University of California.
Definition: ndn-common.hpp:40
an Interest table entry
Definition: pit-entry.hpp:59
bool hasPendingOutRecords(const pit::Entry &pitEntry)
determine whether pitEntry has any pending out-records
Definition: algorithm.cpp:108
no duplicate Nonce is found
Definition: algorithm.hpp:61
time::steady_clock::TimePoint getLastOutgoing(const pit::Entry &pitEntry)
Definition: algorithm.cpp:119
int findDuplicateNonce(const pit::Entry &pitEntry, uint32_t nonce, const Face &face)
determine whether pitEntry has duplicate Nonce nonce
Definition: algorithm.cpp:78
in-record of other face
Definition: algorithm.hpp:63
indicates where duplicate Nonces are found
Definition: algorithm.hpp:60
out-record of other face
Definition: algorithm.hpp:65
bool wouldViolateScope(const Face &inFace, const Interest &interest, const Face &outFace)
determine whether forwarding the Interest in pitEntry to outFace would violate scope
Definition: algorithm.cpp:32
out-record of same face
Definition: algorithm.hpp:64