[Mini-NDN] Nearest router which cached file strategy
sepehr abdous
sepehrabdous1375 at gmail.com
Sun Oct 28 00:55:35 PDT 2018
Hi Junxiao
Is the path always to the nearest cache copy?
As in some cases load on the router may be regarded in choosing the path as
well.
Best,
Sepehr
On Sat, Oct 27, 2018 at 6:19 PM Junxiao Shi <shijunxiao at email.arizona.edu>
wrote:
> Hi Sepehr
>
> The strategy can:
> 1. Flood the Interest for segment 0. The response comes back via unicast.
> Network learns the path to the nearest cached copy.
> 2. Unicast Interest for subsequent segments toward the node with cached
> copy.
> See http://hdl.handle.net/10150/625652 chapter 4 for details.
>
> Yours, Junxiao
>
> On Sat, Oct 27, 2018 at 10:42 sepehr abdous <sepehrabdous1375 at gmail.com>
> wrote:
>
>>
>> I have a grid of 100 * 100 routers which randomly cached files from a
>> library of 100 files({F1, F2, F3, ..., F100}). A user is randomly connected
>> to one of this routers.
>> Lets say F1 is cached in 5 routers and user sends interest for F1. I want
>> the interest to get to the nearest router which have cached F1 regardless
>> of its loud.
>>
>> Is there any way to implement this strategy?
>>
>>
--
Sepehr Abdous
Faculty: abdous at ce.sharif.edu
Yahoo mail: sepehrabdous at yahoo.com
Cellphone:+989129751873
School of computer engineering
Sharif University of Technology
Tehran, Iran
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.lists.cs.ucla.edu/pipermail/mini-ndn/attachments/20181028/18ab0d75/attachment.html>
More information about the Mini-NDN
mailing list