[Ndn-interest] Similarity/Approximate matching in NDN forwarding

Lixia Zhang lixia at cs.ucla.edu
Sun Feb 14 11:44:54 PST 2021

Dear Vakili,

When I saw this msg, your name looked familiar, so I searched through my email box and found our earlier (private) exchanges, though I did not find the reply to my last msg.

In my earlier replies, I asked the question of why you would like to use hashing, what problems it could solve? 
(other than--perhaps--no one had done it before)

Speak for myself, I try my best to help people solve their problems, but I need to understand why/how one makes the design decisions (answer my questions); I need to understand how the use of DHT could help "get closer results"


> On Feb 14, 2021, at 11:04 AM, avakili <avakili at ut.ac.ir> wrote:
> Dear Junxiao,
> I already read paper "Fuzzy Interest Forwarding" which was doing the job on an FIB/CS of NDN node. I am studying possibility of such work to find the Interested packet over a distributed solution such DHT and same time apply similarity/approximate matching then to get closer results (possibility involve hierarchical matching too).
> I am doing some research for my PhD studies and that I appreciate to get your advice or feedback in order to come closer to my problem statement. 
> Best regards
> Vakili 
> _______________________________________________
> Ndn-interest mailing list
> Ndn-interest at lists.cs.ucla.edu
> http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest

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

More information about the Ndn-interest mailing list