[Ndn-interest] Implementation of new caching algorithm

[Ernest McCracken]

You can read the base class for cs policies @
https://github.com/named-data/NFD/blob/master/daemon/table/cs-policy.hpp
There are two implementations of it

(LRU)
https://github.com/named-data/NFD/blob/master/daemon/table/cs-policy-lru.hpp
(Priority FIFO)
https://github.com/named-data/NFD/blob/master/daemon/table/cs-policy-priority-fifo.hpp

These are configured in
https://github.com/named-data/NFD/blob/master/daemon/mgmt/tables-config-section.cpp#L69

Hope this helps.

-Ernest

On Mon, Oct 14, 2019 at 12:36 AM MOHIT RATHOR via Ndn-interest <
ndn-interest at lists.cs.ucla.edu> wrote:

> Sir/Ma'am,
> I am trying to implement my new caching algorithm for named data
> networking and I am finding it difficult to implement.
>
> So, I wanted your insights in implementing my new caching algorithm in
> ndn. Please guide me through the implementation steps of caching algorithms
> of ndn.
>
> I will be grateful if you can help me in this regard as soon as possible.
>
> Thanking you in anticipation
>
> Yours sincerely,
> Mohit Rathor
> Sikkim Manipal Institute of Technology
>
> _______________________________________________
> Ndn-interest mailing list
> Ndn-interest at lists.cs.ucla.edu
> http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/ndn-interest/attachments/20191014/93b9f924/attachment.html>