|
NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.0: NDN, CCN, CCNx, content centric networks
|
API Documentation |
|
|
NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.0: NDN, CCN, CCNx, content centric networks
|
API Documentation |
Provides an in-memory storage with Least Frequently Used (LFU) replacement policy. More...
#include <in-memory-storage-lfu.hpp>
Public Member Functions | |
| InMemoryStorageLfu (size_t limit=10) | |
| InMemoryStorageLfu (boost::asio::io_service &ioService, size_t limit=10) | |
| virtual | ~InMemoryStorageLfu () |
| virtual void | afterAccess (InMemoryStorageEntry *entry) |
| Update the entry when the entry is returned by the find() function, increment the frequency according to LFU. More... | |
| virtual void | afterInsert (InMemoryStorageEntry *entry) |
| Update the entry after a entry is successfully inserted, add it to the cleanupIndex. More... | |
| virtual void | beforeErase (InMemoryStorageEntry *entry) |
| Update the entry or other data structures before a entry is successfully erased, erase it from the cleanupIndex. More... | |
 Public Member Functions inherited from ndn::util::InMemoryStorage | |
| InMemoryStorage (size_t limit=std::numeric_limits< size_t >::max()) | |
Create a InMemoryStorage with up to limit entries The InMemoryStorage created through this method will ignore MustBeFresh in interest processing. More... | |
| InMemoryStorage (boost::asio::io_service &ioService, size_t limit=std::numeric_limits< size_t >::max()) | |
Create a InMemoryStorage with up to limit entries The InMemoryStorage created through this method will handle MustBeFresh in interest processing. More... | |
| virtual | ~InMemoryStorage () |
| void | insert (const Data &data, const time::milliseconds &mustBeFreshProcessingWindow=INFINITE_WINDOW) |
| Inserts a Data packet. More... | |
| shared_ptr< const Data > | find (const Interest &interest) |
| Finds the best match Data for an Interest. More... | |
| shared_ptr< const Data > | find (const Name &name) |
| Finds the best match Data for a Name with or without the implicit digest. More... | |
| void | erase (const Name &prefix, const bool isPrefix=true) |
| Deletes in-memory storage entry by prefix by default. More... | |
| size_t | getLimit () const |
| size_t | size () const |
| InMemoryStorage::const_iterator | begin () const |
| Returns begin iterator of the in-memory storage ordering by name with digest. More... | |
| InMemoryStorage::const_iterator | end () const |
| Returns end iterator of the in-memory storage ordering by name with digest. More... | |
| virtual bool | evictItem ()=0 |
| Removes one Data packet from in-memory storage based on derived class implemented replacement policy. More... | |
| size_t | getCapacity () const |
| returns current capacity of in-memory storage (in packets) More... | |
| bool | isFull () const |
| returns true if the in-memory storage uses up the current capacity, false otherwise More... | |
| void | eraseImpl (const Name &name) |
| deletes in-memory storage entries by the Name with implicit digest. More... | |
| void | printCache (std::ostream &os) const |
| Prints contents of the in-memory storage. More... | |
| InMemoryStorageEntry * | selectChild (const Interest &interest, Cache::index< byFullName >::type::iterator startingPoint) const |
| Implements child selector (leftmost, rightmost, undeclared). More... | |
| Cache::index< byFullName >::type::iterator | findNextFresh (Cache::index< byFullName >::type::iterator startingPoint) const |
| Get the next iterator (include startingPoint) that satisfies MustBeFresh requirement. More... | |
Public Attributes | |
| NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PROTECTED | __pad0__: virtual bool evictItem() |
| Public Attributes inherited from ndn::util::InMemoryStorage | |
| NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PROTECTED | __pad0__: virtual void afterAccess(InMemoryStorageEntry* entry) |
| NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PROTECTED | __pad1__: void setCapacity(size_t nMaxPackets) |
| NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PRIVATE | __pad2__: Cache::iterator freeEntry(Cache::iterator it) |
Additional Inherited Members | |
| Public Types inherited from ndn::util::InMemoryStorage | |
| typedef boost::multi_index_container< InMemoryStorageEntry *, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< boost::multi_index::tag< byFullName >, boost::multi_index::const_mem_fun< InMemoryStorageEntry, const Name &, &InMemoryStorageEntry::getFullName >, std::less< Name > > > > | Cache |
| Static Public Attributes inherited from ndn::util::InMemoryStorage | |
| static const time::milliseconds | INFINITE_WINDOW |
Provides an in-memory storage with Least Frequently Used (LFU) replacement policy.
Definition at line 40 of file in-memory-storage-lfu.hpp.
|
explicit |
Definition at line 27 of file in-memory-storage-lfu.cpp.
|
explicit |
Definition at line 32 of file in-memory-storage-lfu.cpp.
|
virtual |
Definition at line 37 of file in-memory-storage-lfu.cpp.
|
virtual |
Update the entry when the entry is returned by the find() function, increment the frequency according to LFU.
Definition at line 73 of file in-memory-storage-lfu.cpp.
References ndn::util::InMemoryStorage::find().
|
virtual |
Update the entry after a entry is successfully inserted, add it to the cleanupIndex.
Reimplemented from ndn::util::InMemoryStorage.
Definition at line 42 of file in-memory-storage-lfu.cpp.
References ndn::util::InMemoryStorage::begin(), ndn::util::InMemoryStorage::erase(), ndn::util::InMemoryStorage::eraseImpl(), ndn::util::InMemoryStorage::evictItem(), and ndn::util::InMemoryStorage::size().
|
virtual |
Update the entry or other data structures before a entry is successfully erased, erase it from the cleanupIndex.
Reimplemented from ndn::util::InMemoryStorage.
Definition at line 65 of file in-memory-storage-lfu.cpp.
References ndn::util::InMemoryStorage::find().
| NDN_CXX_PUBLIC_WITH_TESTS_ELSE_PROTECTED ndn::util::InMemoryStorageLfu::__pad0__ |
Definition at line 58 of file in-memory-storage-lfu.hpp.
1.8.12