[Ndn-interest] efficient lookup method

stewart mackenzie setori88 at gmail.com
Sun Jul 5 03:00:23 PDT 2015

On 5 Jul 2015 16:28, "Arunkumar Dhananjayan" <arunkd13 at gmail.com> wrote:

> 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

please take a look at how numenta's nupic uses sparse distributed


When naming content one could convert the name into 2k bit SDR (only the
index is transmitted to save bandwidth).
Now when you add the content into your store the SDR is binary OR'ed into
the content store. Thus future Interests just check PIT by binary AND'ing
against the content.

Now this is a constant nime operation, so you can efficiently determine if
the content is there or not.

Essentially I propose the naming mechanism for NDN should be SDR.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/ndn-interest/attachments/20150705/ec8354ba/attachment.html>

More information about the Ndn-interest mailing list