[ndnSIM] Implement new Replacement Policy on NFD

[Junxiao Shi]

Hi Adi

You do not need three queues. Learn how they store auxillary information
in m_entryInfoMap member. That's all.

Yours, Junxiao

On Mon, Feb 25, 2019, 04:27 <mdparamartha95 at students.itb.ac.id> wrote:

> Hi Junxiao,
>
> I had read the priority-fifo policy in NFD, theres 3 types of Queue.
>
> I'm little bit confuse, how to determine queue size of each types ?
>
> As detailed in this code
>
> "
> void
> PriorityFifoPolicy::moveToStaleQueue(iterator i)
> {
>   BOOST_ASSERT(m_entryInfoMap.find(i) != m_entryInfoMap.end());
>
>   EntryInfo* entryInfo = m_entryInfoMap[i];
>   BOOST_ASSERT(entryInfo->queueType == QUEUE_FIFO);
>
>   m_queues[QUEUE_FIFO].erase(entryInfo->queueIt);
>
>   entryInfo->queueType = QUEUE_STALE;
>   Queue& queue = m_queues[QUEUE_STALE];
>   entryInfo->queueIt = queue.insert(queue.end(), i);
>   m_entryInfoMap[i] = entryInfo;
> }
> "
>
> I had looked in nfd/file, but i could not find where to set the queue size
> of each types..
>
> Could you give me some suggestion about how to done that ? Thanks
>
> Best Regards,
> Adi Paramartha
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/ndnsim/attachments/20190225/76b85cb1/attachment.html>