<div dir="ltr"><div><div><div><div><div><div><div><div>Hi Aliaar,<br><br></div>I think
you are tackling the right problem and I believe your research has good
scope in improving the state of the art. You should surely read the
papers you have mentioned and the ones suggested by Haowei.<br><br></div>I see two directions in which you can proceed with your research:<br><br></div>1.
Tackle the fundamental problem of efficient name lookup especially
longest prefix matching on which NDN is based on, by coming up with a
novel data structure or algorithm<br><br></div>or<br><br></div>2. Take some of the existing proposed solutions and do a comparison study of them with data using a real life application<br><br></div>I think more research is needed in both areas.<br><br></div>wishing you the best,<br></div>arun</div><div class="gmail_extra"><br><div class="gmail_quote">On Sat, Jul 4, 2015 at 8:21 PM, mana alliar <span dir="ltr"><<a href="mailto:alrrrr.mmmm@gmail.com" target="_blank">alrrrr.mmmm@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr"><div><div><div><div><div><div><div><div><div><div><div><div>Hello,<br>My name is Mana Aliaar and I'm a student at shahid beheshti university of Tehran, Iran. <br>i would appreciate it if you could help me. <br></div>I'm currently working on "proposing an efficient routing in NDN" as my master thesis subject.<br>following are some of the papers that i've read so far. <br><a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6258041" target="_blank">Scalable Name Lookup in NDN Using Effective Name Component Encoding</a><br><a href="http://dl.acm.org/citation.cfm?id=2482647" target="_blank">Wire Speed Name Lookup: A GPU-based Approach</a><br><a href="http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6566742&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel7%2F6556116%2F6566708%2F06566742.pdf%3Farnumber%3D6566742" target="_blank">NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters</a><br><br>and the main challenges that these papers express are:<font size="2"><span><span style="color:purple;font-family:Wingdings"><br><span style="color:rgb(0,0,0)">1)</span></span></span><span style="font-family:arial,helvetica,sans-serif"><span style="color:black">Complex
name structure:</span></span></font><span style="font-family:arial,helvetica,sans-serif"><span style="font-size:24pt;color:rgb(23,55,94)"><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><font size="2">i)names consists of digits and characters;</font></span></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><span> ii</span>) names have variable length ;</font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><span> </span>iii) the upper bound length of names are unknown.</font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><br>2) and the size of the routing tables(PIT and FIB) which in NDN are 2 or 3 times larger than IP. <br><span style="color:rgb(255,0,0)">__________________________________________________________________________________________________________________________<br></span></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">NOW,
based on above papers that see lookup speed and forwarding table size
as major challenges in routing in NDN. I've come to a lookup method:<br><br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">first for<span style="color:rgb(255,0,0)"> ENTERING THE NAMES IN TABLES</span>:
first each name is divided into multiple parts. an efficient hash
function must be used for each name part. and the hash digest must be
stored in a table. </font></span></span></span><br><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">
I was thinking of using some kind of indexing method here. like the hash
result of first part of names must be stored in first level hash tables and
the hash result of the second part of the name must be stored in second level
hash tables. and so on. <br><br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">each entry in table has a pointer to a linked list which the complete names are stored there. </font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">and the rest of the name prefixes are sotored in linked lists.</font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">and for <span style="color:rgb(255,0,0)">LOOKING UP THE NAME</span>:
first the hash result of first part is computed and found in first
level hash table. then the second part is found and... the the rest of
the name is found from the linked lists. <br></font></span></span></span></div><div><br><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><span style="color:rgb(255,0,0)">__________________________________________________________________________________________________________________________<br></span></font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">I have the following questions:<br>1)
first of all i would like to know your idea about above papers: am i
working on the right subject? i mean are these papers seeing the problem
in NDN in the right way? are their work authentic? <br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">2) second, about the proposed method: what is your idea about the above method? <br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">3)
if i'm on the wrong subject, can you please guide me to
the right direction? can you suggest some similar works that has done on
routing in NDN?<br></font></span></span></span></div><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">It would be great to know your idea about these questions.</font></span></span></span></div><pre><span style="font-family:arial,helvetica,sans-serif"><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><span style="color:rgb(255,0,0)">__________________________________________________________________________________________________________________________<br></span></font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"></span></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2">I will be eternally grateful for any help you can provide.<br>Thank you.</font></span></span></span><span style="color:rgb(0,0,0)"><span style="background-color:rgb(255,255,255)"><span style="font-family:arial,helvetica,sans-serif"><font size="2"><br>Aliaar</font></span></span></span></pre></div></div>
<br>_______________________________________________<br>
Ndn-interest mailing list<br>
<a href="mailto:Ndn-interest@lists.cs.ucla.edu">Ndn-interest@lists.cs.ucla.edu</a><br>
<a href="http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest" rel="noreferrer" target="_blank">http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest</a><br>
<br></blockquote></div><br></div>