<html><head><meta http-equiv="Content-Type" content="text/html charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class="">Hi,<div class=""><br class=""></div><div class="">there is a “size” method for each structure, however, this returns the number of entries for each one.</div><div class=""><br class=""></div><div class="">To get the size in KB, you have to do the math and figure out how many bytes are allocated for each entry of a structure. Every time that a new entry is created, you add the size of the entry to a variable representing the overall structure size in KB, every time an existing entry is deleted, you subtract from this variable.</div><div class=""><br class=""></div><div class="">And, yes, for the names that you mentioned, different amounts of memory have to be allocated. That has to do with the fact that they do not have the same number of name components. It might also have to do with the fact that each name component has a different number of characters (do not remember the very low-level details of the library. For each component, the library might allocate a fixed amount of memory no matter how many chars there are in the name component and does proper resizing in the case that the characters require more memory, but again I am not sure about that).</div><div class=""><br class=""></div><div class="">Hope that this helps,</div><div class=""><br class=""><div class="">
<div class=""><div class=""><div class=""><span class="" style="float: none; display: inline !important;">Spyridon (Spyros) Mastorakis</span><br class=""><span class="" style="float: none; display: inline !important;">Personal Website: </span><a href="http://cs.ucla.edu/~mastorakis/" class="">http://cs.ucla.edu/~mastorakis/</a><br class=""><span class="" style="float: none; display: inline !important;">Internet Research Laboratory</span><br class=""><span class="" style="float: none; display: inline !important;">Computer Science Department</span><br class=""><span class="" style="float: none; display: inline !important;">UCLA</span></div><div class=""><span class="" style="float: none; display: inline !important;"><br class=""></span></div></div></div><div class=""><br class=""></div></div><div><blockquote type="cite" class=""><div class="">On Nov 3, 2016, at 6:13 PM, Hwang In Chan <<a href="mailto:neogeoss1@gmail.com" class="">neogeoss1@gmail.com</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div dir="ltr" class="">Dear NDN researchers,<div class=""><br class=""></div><div class="">As far as I investigate, all the names of FIB and PIT are stored in the name tree data structure.</div><div class="">Is there anyway to measure it while running NDNSIM?</div><div class="">Since they are all stored in the same structure, can I know the separate sizes of those FIB and PIT in KB?</div><div class=""><br class=""></div><div class="">In addition, if there are two different names, such as "AB/V", "ABCD/DFDS/DFDG"</div><div class="">Do they take up a different amount of memory?</div><div class=""><br class=""></div><div class="">Best wishes,</div><div class=""><br class=""></div><div class="">inchan hwang</div></div></div></blockquote></div><br class=""></div></body></html>