[ndnSIM] Caching via aid of Bloom Filters

[george assaf]

Thanks, I'll check it out!

On Mon, Jul 23, 2018 at 9:15 AM John Baugh <jpbaugh at umich.edu> wrote:

> George,
>
> I made a custom caching strategy (even got some publications out of it,
> woohoo!) - and I had at one point considered trying something using Bloom
> filters also.
>
> You will of course need to create a *subclass *of *Policy *since that
> what makes the decision to keep something in the cache or not (
> https://ndnsim.net/2.4/doxygen/classnfd_1_1cs_1_1Policy.html).
> Specifically, the *afterInsert *method must decide whether to remove or
> leave the item just added to the cache.
>
> If you need statistics about incoming interests, you'll have to *modify
> the nfd Forwarder *class (
> https://ndnsim.net/2.0/doxygen/classnfd_1_1Forwarder.html).
> Unfortunately there isn't (to the best of my knowledge) a way to subclass
> the forwarder, so you have to actually dig into the ndnSIM code, modify it,
> recompile ndnSIM, and then compile/build your scenario (including Policy
> subclass, etc.)
>
> Hope this is a good start?
>
> Thanks,
>
> John
>
> *John P. Baugh, Ph.D.*
> *University of Michigan - Dearborn*
>
>
>
> On Mon, Jul 23, 2018 at 2:06 AM george assaf <engdotgeorge at gmail.com>
> wrote:
>
>> Dear Forks,
>> I want to study a caching strategy that makes use of Bloom filter concept
>> https://en.wikipedia.org/wiki/Bloom_filter
>> to track the state of neighbor caches of the current ndn Router in order
>> to enhance cache hit ratio in case of video streaming.
>> is there any basic ndn implementation for this idea , if not how can you
>> recommend me to start implement this idea?
>> thank you in advance
>> george
>> _______________________________________________
>> ndnSIM mailing list
>> ndnSIM at lists.cs.ucla.edu
>> http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/ndnsim/attachments/20180723/44a79d2c/attachment.html>