[ndnSIM] cache mechanism
alexander.afanasyev at ucla.edu
Tue Jul 23 10:36:38 PDT 2013
In the current implementations, when Data packet is cached, it loses all memory on where this Data packet came from. So, you may need to do some extensions to retain such memory. After this part is done, the rest could be relatively easy: you need to create a policy, similar to utils/trie/lru-policy.h that implements the right logic in "insert" method.
On Jul 23, 2013, at 12:58 AM, chen dqing <kele86838437 at gmail.com> wrote:
> Dear all,
> I want to implement a cache mechanism like this.
> There are two nodes A<---->B.
> When B's content store is full,continuing to add, it will pop content object named 'b'.
> How can B push 'b' back to A(Assuming that A has enough space)? Anyone can give me a hint?
> My Regards
> ndnSIM mailing list
> ndnSIM at lists.cs.ucla.edu
More information about the ndnSIM