Namespaces | |
| asf | |
Classes | |
| class | AccessStrategy |
| Access Router Strategy version 1. More... | |
| class | AdmitAllUnsolicitedDataPolicy |
| admits all unsolicited Data More... | |
| class | AdmitLocalUnsolicitedDataPolicy |
| admits unsolicited Data from local faces More... | |
| class | AdmitNetworkUnsolicitedDataPolicy |
| admits unsolicited Data from non-local faces More... | |
| class | BestRouteStrategy |
| Best Route strategy version 1. More... | |
| class | BestRouteStrategy2 |
| Best Route strategy version 4. More... | |
| class | BestRouteStrategyBase |
| class | ClientControlStrategy |
| identical to BestRouteStrategy v1, for backwards compatibility More... | |
| class | DropAllUnsolicitedDataPolicy |
| drops all unsolicited Data More... | |
| class | MulticastStrategy |
| a forwarding strategy that forwards Interest to all FIB nexthops More... | |
| class | NccStrategy |
| a forwarding strategy similar to CCNx 0.7.2 More... | |
| class | ProcessNackTraits |
| class | ProcessNackTraitsBase |
| provides a common procedure for processing Nacks More... | |
| class | RetxSuppressionExponential |
| a retransmission suppression decision algorithm that suppresses retransmissions using exponential backoff More... | |
| class | RetxSuppressionFixed |
| a retransmission suppression decision algorithm that suppresses retransmissions within a fixed duration More... | |
| class | Strategy |
| represents a forwarding strategy More... | |
| class | StrategyInfo |
| contains arbitrary information forwarding strategy places on table entries More... | |
| class | UnsolicitedDataPolicy |
| determines how to process an unsolicited Data More... | |
Typedefs | |
| typedef DropAllUnsolicitedDataPolicy | DefaultUnsolicitedDataPolicy |
| the default UnsolicitedDataPolicy More... | |
Enumerations | |
| enum | DuplicateNonceWhere { DUPLICATE_NONCE_NONE = 0, DUPLICATE_NONCE_IN_SAME = (1 << 0), DUPLICATE_NONCE_IN_OTHER = (1 << 1), DUPLICATE_NONCE_OUT_SAME = (1 << 2), DUPLICATE_NONCE_OUT_OTHER = (1 << 3) } |
| indicates where duplicate Nonces are found More... | |
| enum | RetxSuppressionResult { RetxSuppressionResult::NEW, RetxSuppressionResult::FORWARD, RetxSuppressionResult::SUPPRESS } |
| enum | UnsolicitedDataDecision { UnsolicitedDataDecision::DROP, UnsolicitedDataDecision::CACHE } |
| a decision made by UnsolicitedDataPolicy More... | |
Functions | |
| bool | canForwardToLegacy (const pit::Entry &pitEntry, const Face &face) |
| decide whether Interest can be forwarded to face More... | |
| int | findDuplicateNonce (const pit::Entry &pitEntry, uint32_t nonce, const Face &face) |
determine whether pitEntry has duplicate Nonce nonce More... | |
| static fib::NextHopList::const_iterator | findEligibleNextHopWithEarliestOutRecord (const Face &inFace, const Interest &interest, const fib::NextHopList &nexthops, const shared_ptr< pit::Entry > &pitEntry) |
| pick an eligible NextHop with earliest out-record More... | |
| time::steady_clock::TimePoint | getLastOutgoing (const pit::Entry &pitEntry) |
| bool | hasPendingOutRecords (const pit::Entry &pitEntry) |
determine whether pitEntry has any pending out-records More... | |
| static bool | isNextHopEligible (const Face &inFace, const Interest &interest, const fib::NextHop &nexthop, const shared_ptr< pit::Entry > &pitEntry, bool wantUnused=false, time::steady_clock::TimePoint now=time::steady_clock::TimePoint::min()) |
| determines whether a NextHop is eligible More... | |
| std::ostream & | operator<< (std::ostream &os, UnsolicitedDataDecision d) |
| bool | wouldViolateScope (const Face &inFace, const Interest &interest, const Face &outFace) |
determine whether forwarding the Interest in pitEntry to outFace would violate scope More... | |
Variables | |
| static class nfd::fw::NfdAutoAccessStrategyStrategyRegistrationClass | g_nfdAutoAccessStrategyStrategyRegistrationVariable |
| static class nfd::fw::NfdAutoAdmitAllUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationClass | g_nfdAutoAdmitAllUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationVariable |
| static class nfd::fw::NfdAutoAdmitLocalUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationClass | g_nfdAutoAdmitLocalUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationVariable |
| static class nfd::fw::NfdAutoAdmitNetworkUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationClass | g_nfdAutoAdmitNetworkUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationVariable |
| static class nfd::fw::NfdAutoBestRouteStrategy2StrategyRegistrationClass | g_nfdAutoBestRouteStrategy2StrategyRegistrationVariable |
| static class nfd::fw::NfdAutoBestRouteStrategyStrategyRegistrationClass | g_nfdAutoBestRouteStrategyStrategyRegistrationVariable |
| static class nfd::fw::NfdAutoClientControlStrategyStrategyRegistrationClass | g_nfdAutoClientControlStrategyStrategyRegistrationVariable |
| static class nfd::fw::NfdAutoDropAllUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationClass | g_nfdAutoDropAllUnsolicitedDataPolicyUnsolicitedDataPolicyRegistrationVariable |
| static class nfd::fw::NfdAutoMulticastStrategyStrategyRegistrationClass | g_nfdAutoMulticastStrategyStrategyRegistrationVariable |
| static class nfd::fw::NfdAutoNccStrategyStrategyRegistrationClass | g_nfdAutoNccStrategyStrategyRegistrationVariable |
the default UnsolicitedDataPolicy
Definition at line 138 of file unsolicited-data-policy.hpp.
indicates where duplicate Nonces are found
Definition at line 91 of file algorithm.hpp.
|
strong |
| Enumerator | |
|---|---|
| NEW |
Interest is new (not a retransmission) |
| FORWARD |
Interest is retransmission and should be forwarded. |
| SUPPRESS |
Interest is retransmission and should be suppressed. |
Definition at line 34 of file retx-suppression.hpp.
|
strong |
a decision made by UnsolicitedDataPolicy
| Enumerator | |
|---|---|
| DROP |
the Data should be dropped |
| CACHE |
the Data should be cached in the ContentStore |
Definition at line 36 of file unsolicited-data-policy.hpp.
| bool nfd::fw::canForwardToLegacy | ( | const pit::Entry & | pitEntry, |
| const Face & | face | ||
| ) |
decide whether Interest can be forwarded to face
Definition at line 59 of file algorithm.cpp.
| int nfd::fw::findDuplicateNonce | ( | const pit::Entry & | pitEntry, |
| uint32_t | nonce, | ||
| const Face & | face | ||
| ) |
determine whether pitEntry has duplicate Nonce nonce
Definition at line 83 of file algorithm.cpp.
|
static |
pick an eligible NextHop with earliest out-record
Definition at line 104 of file best-route-strategy2.cpp.
| time::steady_clock::TimePoint nfd::fw::getLastOutgoing | ( | const pit::Entry & | pitEntry | ) |
Definition at line 124 of file algorithm.cpp.
| bool nfd::fw::hasPendingOutRecords | ( | const pit::Entry & | pitEntry | ) |
determine whether pitEntry has any pending out-records
Definition at line 113 of file algorithm.cpp.
|
static |
determines whether a NextHop is eligible
| inFace | incoming face of current Interest |
| interest | incoming Interest |
| nexthop | next hop |
| pitEntry | PIT entry |
| wantUnused | if true, NextHop must not have unexpired out-record |
| now | time::steady_clock::now(), ignored if !wantUnused |
Definition at line 73 of file best-route-strategy2.cpp.
| std::ostream & nfd::fw::operator<< | ( | std::ostream & | os, |
| UnsolicitedDataDecision | d | ||
| ) |
Definition at line 34 of file unsolicited-data-policy.cpp.
| bool nfd::fw::wouldViolateScope | ( | const Face & | inFace, |
| const Interest & | interest, | ||
| const Face & | outFace | ||
| ) |
determine whether forwarding the Interest in pitEntry to outFace would violate scope
Definition at line 37 of file algorithm.cpp.
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
1.8.11 
