<div dir="ltr"><div>Hello,</div><div><br></div><div>I want to ask how I can use suffix trie and Huffman encoding mechanism to faster lookup in NDN FIB.</div><div><br></div><div>Please advise</div><div><br></div>-- <br><div dir="ltr" class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><p style="color:rgb(34,34,34);font-size:13.33px;background-image:none;background-repeat:repeat;margin:0px"><i>Arundhati Arjaria</i></p><p style="color:rgb(34,34,34);font-size:13.33px;background-image:none;background-repeat:repeat;margin:0px"><i>Research Scholar (Department of Computer Science & Engineering)</i></p><p style="color:rgb(34,34,34);font-size:13.33px;background-image:none;background-repeat:repeat;margin:0px"><i>PDPM-Indian Institute of Information Technology, Design and Manufacturing, Jabalpur</i></p><p style="color:rgb(34,34,34);font-size:13.33px;background-image:none;background-repeat:repeat;margin:0px"><b><i>(An Institute of National Importance, established by MHRD, Govt. of India)</i></b></p><p style="color:rgb(34,34,34);font-size:13.33px;background-image:none;background-repeat:repeat;margin:0px"><br></p></div></div></div>