[Csci551-talk] Re: [Cs551] Doubt regarding Algorithm T

[Xi Wang]

You are free to design your own method for this case. Please document it 
in README. We think some reasonable approaches are:

1. skip sequentially to the next viable segment

2. timeout and retry when more peers are on-line (since once the seed
    is online every segment will be covered

-Xi

Rohith Mark Varghese wrote:

> Hi,
>  
> I have a small doubt on how we are supposed to implement Algo T.
>  
> Assume the following scenario:
> Node 2 is a seed i.e. it has the entire file
> Node 1 has segments 4,5,6,7,8 (he is downloading segments sequentially 
> from segment 4 onwards)
> Node 0 is beginning his life in our system. He is expected to download 
> segnemts sequentially from segment 1 onwards. He's recieved INFO_REPLY 
> only from node 1, since node 2 probabilistically dropped his reply packet.
>  
> Now, since node 0 has only node 1as a neighbor, should he request 
> segments 4 to 8 from node 1 and get segments 1 to 3 later; or should he 
> simply keep mum for this cycle because he is expected to download 
> segments sequentially from segment 1 onwards?
>  
> Thanks,
>  
> Mark
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> Cs551 mailing list
> Cs551 at catarina.usc.edu
> http://catarina.usc.edu/mailman/listinfo/cs551