<html><head><meta http-equiv="Content-Type" content="text/html charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">Hi Michael,<div><br></div><div>Did you take a look to the current implementation of content store policies (utils/trie/lru-policy.h, utils/trie/lfu-policy.h, model/cs/custom-policies/freshness-policy.h)? While some policies are cache replacement (LRU, LFU, ...), they can be used as cache "placement" policies as well.</div><div><br></div><div>If the mapping function can be applied individually on each node, then the implementation could be very straightforward. If explicit collaboration is needed, it also can be implemented, but is more complicated.</div><div><br></div><div>---</div><div>Alex</div><div><br><div><div>On Jul 27, 2013, at 8:54 AM, Michael K. <<a href="mailto:mvhtew@googlemail.com">mvhtew@googlemail.com</a>> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite">
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-15">
<div text="#000000" bgcolor="#FFFFFF">
Hi,<br>
<br>
I am currently experimenting with
ndnSIM. I would like to implement (and evaluate) a distributed cache
in NDN, that is: <br>
<ul>
<li>m nodes (caches) form a (collaborative) domain</li>
<li>a hash function maps content onto exactly one node
(responsible for caching)<br>
</li>
</ul><p>Unfortunately, I am not sure whether this is easily realizable in
ndnSIM. Therefore, I would appreciate it to hear your suggestions
of where and how to start.<br>
</p>
Thanks and best regards,<br>
<br>
Michael
</div>
</blockquote></div><br></div></body></html>