[ndnSIM] ndnsim cache strategies

[Alex Afanasyev]

Hi,

You can take a look at model/cs/custom-policies/probability-policy.hpp.  The implementation is currently using UniformRandomVariable as a randomization factor to accept packet into the content store.


> On Oct 5, 2016, at 4:32 AM, Nour El Houda Ben Youssef <NourElHouda.BenYoussef at wevioo.com> wrote:
> 
> Dear ndnsim users
>  
> I would like to have further information on caching strategies implemented in ndnsim and especially about CS that probabilistically accepts data packets into CS
>  
> Which probabilistic distribution is used ? are we talking here about placement strategy?
>  
>  
> Content store realization that probabilistically accepts data packet into CS (placement policy)
> ns3::ndn::cs::Probability::Lru
> Least recently used (LRU)
> ns3::ndn::cs::Probability::Fifo
> Least frequently used (LFU)
> ns3::ndn::cs::Probability::Lfu
> Random
>  
> According to my understanding for the simple content store we use the LCE placement strategy and for probabilistic CS we probabilistically place the content. Am I right ? 

These actually a combined placement + replacement policies.   Probabilistic placement determines whether the packet should get accepted to the content store.  The corresponding replacement policy decides what should get evicted if after packet is accepted there is not enough space and something needs to get evicted.

---
Alex

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/ndnsim/attachments/20161005/d0bfa1f0/attachment.html>