NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.3: NDN, CCN, CCNx, content centric networks
API Documentation
algorithm.hpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
26 #ifndef NFD_DAEMON_FW_PIT_ALGORITHM_HPP
27 #define NFD_DAEMON_FW_PIT_ALGORITHM_HPP
28 
29 #include "table/pit-entry.hpp"
30 
35 namespace nfd {
36 
40 namespace scope_prefix {
41 
50 extern const Name LOCALHOST;
51 
64 extern const Name LOCALHOP;
65 
66 } // namespace scope_prefix
67 
68 namespace fw {
69 
73 bool
74 wouldViolateScope(const Face& inFace, const Interest& interest, const Face& outFace);
75 
81 bool
82 violatesScope(const pit::Entry& pitEntry, const Face& outFace));
83 
94 bool
95 canForwardToLegacy(const pit::Entry& pitEntry, const Face& face);
96 
105 };
106 
110 int
111 findDuplicateNonce(const pit::Entry& pitEntry, uint32_t nonce, const Face& face);
112 
116 bool
117 hasPendingOutRecords(const pit::Entry& pitEntry);
118 
119 } // namespace fw
120 } // namespace nfd
121 
122 #endif // NFD_DAEMON_FW_PIT_ALGORITHM_HPP
bool canForwardToLegacy(const pit::Entry &pitEntry, const Face &face)
decide whether Interest can be forwarded to face
Definition: algorithm.cpp:82
const Name LOCALHOST("ndn:/localhost")
ndn:/localhost
Definition: algorithm.hpp:50
generalization of a network interface
Definition: face.hpp:67
represents an Interest packet
Definition: interest.hpp:42
in-record of same face
Definition: algorithm.hpp:101
bool violatesScope(const pit::Entry &pitEntry, const Face &outFace)
Definition: algorithm.cpp:59
Copyright (c) 2011-2015 Regents of the University of California.
Definition: ndn-common.hpp:40
an Interest table entry
Definition: pit-entry.hpp:57
Name abstraction to represent an absolute name.
Definition: name.hpp:46
const Name LOCALHOP("ndn:/localhop")
ndn:/localhop
Definition: algorithm.hpp:64
bool hasPendingOutRecords(const pit::Entry &pitEntry)
determine whether pitEntry has any pending out-records
Definition: algorithm.cpp:136
no duplicate Nonce is found
Definition: algorithm.hpp:100
int findDuplicateNonce(const pit::Entry &pitEntry, uint32_t nonce, const Face &face)
determine whether pitEntry has duplicate Nonce nonce
Definition: algorithm.cpp:106
in-record of other face
Definition: algorithm.hpp:102
DuplicateNonceWhere
indicates where duplicate Nonces are found
Definition: algorithm.hpp:99
#define DEPRECATED(func)
Definition: common.hpp:71
out-record of other face
Definition: algorithm.hpp:104
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:37
out-record of same face
Definition: algorithm.hpp:103