[Ndn-interest] efficient lookup method

[Tai-Lin Chu]

I am working on a different problem but it also involves converting an
NDN name to one specific bit pattern.

But here is the common problem: NDN name space is essentially
infinitely large, so the conversion process is lossy (we want these
bit patterns to be more concise than names).

If I understand the video correctly,

(NDN name) >> (hashing 2^N) >> (SDR)

>> means that the space is significantly larger.

How does SDR solve any existing problem for NDN that comes from
properties of any hashing function?

Thanks.


On Sun, Jul 5, 2015 at 6:00 PM, stewart mackenzie <setori88 at gmail.com> wrote:
>
> 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
> representation.
>
> https://m.youtube.com/watch?list=PLyh828DIg4wdSck2_H5A_KruczVscZXv6&v=LbZtc_zWBS4
>
> 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.
>
> /sjm
>
>
> _______________________________________________
> Ndn-interest mailing list
> Ndn-interest at lists.cs.ucla.edu
> http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest
>