<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body dir="auto">
Hi Nick,
<div><br>
</div>
<div>The ASF strategy in NFD does something similar to what you said. It was first introduced in this paper:</div>
<div><br>
</div>
<div><span style="background-color: rgba(255, 255, 255, 0);">V. Lehman, A. Gawande, R. Aldecoa, D. Krioukov, B. Zhang, L. Zhang, <b>L. Wang</b>, "<a href="http://web0.cs.memphis.edu/~lanwang/paper/hr-iwqos-camera-ready.pdf">An Experimental Investigation of
Hyperbolic Routing with a Smart Forwarding Plane in NDN</a>," in <i>Proceedings of the IEEE IWQoS Symposium</i>, June 2016</span></div>
<div><br>
</div>
<div>And the following technical report has an expanded description of the ASF strategy in the appendix.</div>
<div><span style="background-color: rgba(255, 255, 255, 0);"><br>
</span></div>
<div><span style="background-color: rgba(255, 255, 255, 0);">V. Lehman, A. Gawande, R. Aldecoa, D. Krioukov, B. Zhang, L. Zhang, </span><b style="background-color: rgba(255, 255, 255, 0);">L. Wang</b><span style="background-color: rgba(255, 255, 255, 0);">,
"</span><a href="http://web0.cs.memphis.edu/~lanwang/paper/ndn-0042-1-asf.pdf" style="background-color: rgba(255, 255, 255, 0);">An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN</a><span style="background-color: rgba(255, 255, 255, 0);">,"
NDN Technical Report NDN-0042, July 2016</span></div>
<div><span style="background-color: rgba(255, 255, 255, 0);"><br>
</span></div>
<div><span style="background-color: rgba(255, 255, 255, 0);">It is the default strategy in the current NDN testbed.</span></div>
<div><br>
<div id="AppleMailSignature" dir="ltr">Lan</div>
<div dir="ltr"><br>
On Apr 30, 2019, at 1:42 AM, Nick Briggs via Ndn-interest <<a href="mailto:ndn-interest@lists.cs.ucla.edu">ndn-interest@lists.cs.ucla.edu</a>> wrote:<br>
<br>
</div>
<blockquote type="cite">
<div dir="ltr"><span>In the original CCNx (0.8.x) the "best route" strategy would, with a small probability, send a duplicate interest to a potential face other than the one currently selected as best, the first responding face would then be selected as the
best.</span><br>
<span></span><br>
<span>I don't know if the current NDN implementation has retained that feature.</span><br>
<span></span><br>
<span>-- Nick</span><br>
<span></span><br>
<blockquote type="cite"><span>On Apr 29, 2019, at 4:16 PM, Klaus Schneider <<a href="mailto:klaus@cs.arizona.edu">klaus@cs.arizona.edu</a>> wrote:</span><br>
</blockquote>
<blockquote type="cite"><span></span><br>
</blockquote>
<blockquote type="cite"><span>Yeah, if costs are equal it uses some tie-breaker, I think the face-id.</span><br>
</blockquote>
<blockquote type="cite"><span></span><br>
</blockquote>
<blockquote type="cite"><span>The best-route strategy will never split up traffic between multiple faces. If you want that, you should look into the multicast-strategy (<a href="https://github.com/named-data/NFD/blob/master/daemon/fw/multicast-strategy.hpp">https://github.com/named-data/NFD/blob/master/daemon/fw/multicast-strategy.hpp</a>)
or write your own.</span><br>
</blockquote>
<blockquote type="cite"><span></span><br>
</blockquote>
<blockquote type="cite"><span>Best regards,</span><br>
</blockquote>
<blockquote type="cite"><span>Klaus</span><br>
</blockquote>
<blockquote type="cite"><span></span><br>
</blockquote>
<blockquote type="cite"><span></span><br>
</blockquote>
<blockquote type="cite"><span>On 4/29/19 3:22 PM, Yasmine Belaguid wrote:</span><br>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span>Hello,</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span>Thank you for your reply Sir.</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span>For the grid topology all costs are apparently equal, so why is it using only one path? is it relying on the interface in this case (it takes the lowest one which is 0)?</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span>Best regards.</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span>Le lun. 29 avr. 2019 à 03:35, Klaus Schneider <<a href="mailto:klaus@cs.arizona.edu">klaus@cs.arizona.edu</a> <<a href="mailto:klaus@cs.arizona.edu">mailto:klaus@cs.arizona.edu</a>>> a écrit :</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> Hello,</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> I think you can find the answers to your questions in the NFD Developer</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> Guide:</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> <a href="https://named-data.net/publications/techreports/ndn-0021-10-nfd-developer-guide/">https://named-data.net/publications/techreports/ndn-0021-10-nfd-developer-guide/</a></span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> On 4/27/19 4:19 AM, Yasmine Belaguid via Ndn-interest wrote:</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Hello,</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>I am a student at INTTIC (Algeria), I am working on QoS-based</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> routing. I</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>have some questions about the best-route forwarding strategy.</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Since I tried the grid topology with 4 nodes using the best-route</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>strategy I observed that the consumer sends Interests to the</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> producer</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>choosing only one route, so my questions are :</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span> * For the first time, does the consumer flood Interests to discover</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span> the network? or what are the metrics that he uses to choose and</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span> calculate this route?</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> No, the consumer does not flood the first Interest but sends it on the</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> shortest path (= lowest cost face).</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> You can set the link metric in your simulation file (search for</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> "metric"</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> here <a href="http://ndnsim.net/current/examples.html">
http://ndnsim.net/current/examples.html</a>), and the default will</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> be 1.</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span> * The cost used by this strategy is it hop-count?</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> Yes, if you didn't set any other link metrics.</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> Best regards,</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> Klaus</span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Thank you!</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Best regards.</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Belaguid Milouda Yasmine</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Student at INTTIC</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>M +213 699 90 73 25 <<a href="tel:+213(0)+699+90+73+25">tel:+213(0)+699+90+73+25</a>></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>E <a href="mailto:yasmine.belaguid@gmail.com">yasmine.belaguid@gmail.com</a> <<a href="mailto:yasmine.belaguid@gmail.com">mailto:yasmine.belaguid@gmail.com</a>></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> <<a href="mailto:yasmine.belaguid@gmail.com">mailto:yasmine.belaguid@gmail.com</a> <<a href="mailto:yasmine.belaguid@gmail.com">mailto:yasmine.belaguid@gmail.com</a>>></span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span><<a href="http://github.com/yasminebelaguid">http://github.com/yasminebelaguid</a>></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span><<a href="http://www.linkedin.com/in/milouda-yasmine-belaguid/">http://www.linkedin.com/in/milouda-yasmine-belaguid/</a>></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>_______________________________________________</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span>Ndn-interest mailing list</span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span><a href="mailto:Ndn-interest@lists.cs.ucla.edu">Ndn-interest@lists.cs.ucla.edu</a></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> <<a href="mailto:Ndn-interest@lists.cs.ucla.edu">mailto:Ndn-interest@lists.cs.ucla.edu</a>></span><br>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite">
<blockquote type="cite"><span><a href="http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest">http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest</a></span><br>
</blockquote>
</blockquote>
</blockquote>
<blockquote type="cite">
<blockquote type="cite"><span> </span><br>
</blockquote>
</blockquote>
<blockquote type="cite"><span>_______________________________________________</span><br>
</blockquote>
<blockquote type="cite"><span>Ndn-interest mailing list</span><br>
</blockquote>
<blockquote type="cite"><span><a href="mailto:Ndn-interest@lists.cs.ucla.edu">Ndn-interest@lists.cs.ucla.edu</a></span><br>
</blockquote>
<blockquote type="cite"><span><a href="http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest">http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest</a></span><br>
</blockquote>
<span></span><br>
<span>_______________________________________________</span><br>
<span>Ndn-interest mailing list</span><br>
<span><a href="mailto:Ndn-interest@lists.cs.ucla.edu">Ndn-interest@lists.cs.ucla.edu</a></span><br>
<span><a href="http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest">http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest</a></span><br>
</div>
</blockquote>
</div>
</body>
</html>