NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.3: NDN, CCN, CCNx, content centric networks
API Documentation
algorithm.hpp File Reference

Copyright (c) 2014-2016, Regents of the University of California, Arizona Board of Regents, Colorado State University, University Pierre & Marie Curie, Sorbonne University, Washington University in St. More...

Include dependency graph for algorithm.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 nfd
 Copyright (c) 2011-2015 Regents of the University of California.
 
 nfd::scope_prefix
 contain name prefixes that affect namespace-based scope control
 
 nfd::fw
 

Enumerations

enum  nfd::fw::DuplicateNonceWhere {
  nfd::fw::DUPLICATE_NONCE_NONE = 0, nfd::fw::DUPLICATE_NONCE_IN_SAME = (1 << 0), nfd::fw::DUPLICATE_NONCE_IN_OTHER = (1 << 1), nfd::fw::DUPLICATE_NONCE_OUT_SAME = (1 << 2),
  nfd::fw::DUPLICATE_NONCE_OUT_OTHER = (1 << 3)
}
 indicates where duplicate Nonces are found More...
 

Functions

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 More...
 
 nfd::fw::DEPRECATED (bool violatesScope(const pit::Entry &pitEntry, const Face &outFace))
 determine whether forwarding the Interest in pitEntry to outFace would violate scope More...
 
bool nfd::fw::canForwardToLegacy (const pit::Entry &pitEntry, const Face &face)
 decide whether Interest can be forwarded to face More...
 
int nfd::fw::findDuplicateNonce (const pit::Entry &pitEntry, uint32_t nonce, const Face &face)
 determine whether pitEntry has duplicate Nonce nonce More...
 
bool nfd::fw::hasPendingOutRecords (const pit::Entry &pitEntry)
 determine whether pitEntry has any pending out-records More...
 

Detailed Description

Copyright (c) 2014-2016, 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 http://www.gnu.org/licenses/. This file contains common algorithms used by forwarding strategies.

Definition in file algorithm.hpp.