<html><body><div style="font-family: arial, helvetica, sans-serif; font-size: 12pt; color: #000000">Hi Junxiao, <br><br>Thank you for the answer,<br><br>the cs-policy is using map container to store the data, <br><br>if I want to use a multiset container, what should I do?<br><br>Since there are some data will have the same value.<br><br>Thank You<br><br>Best Regards,<br>Adi Paramartha<br><br><hr id="zwchr" data-marker=""><div data-marker=""><b>From: </b>"Junxiao Shi" <shijunxiao@email.arizona.edu><br><b>To: </b>mdparamartha95@students.itb.ac.id<br><b>Cc: </b>"ndnsim" <ndnsim@lists.cs.ucla.edu><br><b>Sent: </b>Monday, February 25, 2019 5:46:50 PM<br><b>Subject: </b>Re: [ndnSIM] Implement new Replacement Policy on NFD<br></div><br><div data-marker=""><div dir="auto">Hi Adi<div dir="auto"><br></div><div dir="auto">You do not need three queues. Learn how they store auxillary information in m_entryInfoMap member. That's all.</div><div dir="auto"><br></div><div dir="auto">Yours, Junxiao<br><br><div class="gmail_quote" dir="auto"><div dir="ltr" class="gmail_attr">On Mon, Feb 25, 2019, 04:27 <<a href="mailto:mdparamartha95@students.itb.ac.id" target="_blank">mdparamartha95@students.itb.ac.id</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div style="font-family:arial,helvetica,sans-serif;font-size:12pt;color:#000000" dir="auto">Hi Junxiao,<br><br>I had read the priority-fifo policy in NFD, theres 3 types of Queue.<br><br>I'm little bit confuse, how to determine queue size of each types ?<br><br>As detailed in this code <br><br>"<br>void<br>PriorityFifoPolicy::moveToStaleQueue(iterator i)<br>{<br> BOOST_ASSERT(m_entryInfoMap.find(i) != m_entryInfoMap.end());<br><br> EntryInfo* entryInfo = m_entryInfoMap[i];<br> BOOST_ASSERT(entryInfo->queueType == QUEUE_FIFO);<br><br> m_queues[QUEUE_FIFO].erase(entryInfo->queueIt);<br><br> entryInfo->queueType = QUEUE_STALE;<br> Queue& queue = m_queues[QUEUE_STALE];<br> entryInfo->queueIt = queue.insert(queue.end(), i);<br> m_entryInfoMap[i] = entryInfo;<br>} <br>"<br><br>I had looked in nfd/file, but i could not find where to set the queue size of each types..<br><br>Could you give me some suggestion about how to done that ? Thanks<br><br>Best Regards,<br>Adi Paramartha</div></blockquote></div></div></div><br></div></div></body></html>