<html><head><meta http-equiv="Content-Type" content="text/html charset=iso-8859-1"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><div>Hi BoDeng,</div><div><br></div><div>NS-3 has its internal mechanism (ns3::Names class) that is used to associate names and pointers, such as pointers to Node objects. Internally, ns3::Names uses std::map, so it is not exactly hash operations, but should not be too inefficient (each operation on the order of logN).</div><div><br></div><div>Creating FIB table from scratch using AddRoute method (this specific version: <a href="http://ndnsim.net/doxygen/classns3_1_1ndn_1_1_stack_helper.html#a64db64bd1b98144cda977dc5659a7d98">http://ndnsim.net/doxygen/classns3_1_1ndn_1_1_stack_helper.html#a64db64bd1b98144cda977dc5659a7d98</a>) should be relatively efficient. There is no way currently to save/restore FIB from the disk, as its data structure is special.</div><div><br></div><div>How big is your FIB? </div><div><br></div><div>---</div><div>Alex</div><div><br></div><div><br></div><div><div>On Mar 22, 2013, at 1:08 AM, dengbo <<a href="mailto:dengbo2013@ict.ac.cn">dengbo2013@ict.ac.cn</a>> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite">
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
<div link="#0000EE" text="#000000" vlink="#551A8B" bgcolor="#ffffff" alink="#EE0000">
<font face="WenQuanYi Micro Hei">Dear Alex:<br>
<br>
My name is BoDeng , I will study for master in September
and be student of teacher sun . I have some doubt about your
ndnSIM and <br>
wish get your answer.(I am helping teacher sun to do his
experiment about ndn with weiwang)<br>
</font><font face="WenQuanYi Micro Hei"><font face="WenQuanYi Micro
Hei"> The first is about the function</font> <span style="font-size: 13px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: 13px; text-align: start; text-indent: -53px; text-transform: none; white-space: pre-wrap; word-spacing: 0px; background-color: rgb(252, 252, 252); display: inline !important; float: none; ">Names::Find<Node>
(nodeName) used in function </span></font>
<meta http-equiv="content-type" content="text/html;
charset=ISO-8859-1">
<span class="keywordtype">void</span> <font>StackHelper::AddRouter
(<span class="keyword">const</span> std::string &nodeName, <span class="keyword"><br>
const</span> std::string &prefix, uint32_t faceId, int32_t
metric). I want to know how you store the nodeName ? Do you use
hash?<br>
The second is that the fib table is stored in the memory and
be added in every experiment , I think it is not suitable when the
fib<br>
table is big , can you store them in disk with some structure so
that we can read them from the file and needn`t calculate<br>
it every time .Also, if the structure is very special , we can
create the fib file alone to reduce the experiment time . <br>
<br>
Thanks<br>
</font>
<meta http-equiv="content-type" content="text/html;
charset=ISO-8859-1">
<pre class="moz-signature" cols="72">--
BSET REGARDS
DengBo
Student of Network Technology Research Center , ict , ac
Addr: No. 6 Kexueyuan South Rd, Haidian, Beijing, China
Tel:+86-15271810335</pre>
</div>
</blockquote></div><br></body></html>