[Csci551-talk] Random selections.
rmchandr at usc.edu
Tue Apr 19 16:12:37 PDT 2005
For the 'R' algorithm, it has been suggested in the spec to select a random segment that is missing from the file and then randomly choose a peer that has the segment. This means we have to look into all peers' segments and choose the ones that have that segment and then make a random selection among them. Wouldnt it be better in terms of computation time if we choose a random peer first and then choose one of its segments randomly and download it if we still havent downloaded it ? Any suggestions ?
More information about the Csci551-talk