Changes between Version 3 and Version 4 of TahoeTwo


Ignore:
Timestamp:
2009-10-19T18:25:09Z (15 years ago)
Author:
davidsarah
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • TahoeTwo

    v3 v4  
    77
    88Early in 2007, we were planning to use the following "Tahoe Two" algorithm.
    9 By the time we released 0.2.0, we switched to "tahoe3", but when we released
     9By the time we released 0.2.0, we switched to "TahoeThree", but when we released
    1010v0.6, we switched back (ticket #132).
    1111
    12 As in Tahoe Three, the verifierid is used to consistently-permute the set of
    13 all peers (by sorting the peers by HASH(verifierid+peerid)). Each file gets a
    14 different permutation, which (on average) will evenly distribute shares among
     12As in TahoeThree, the verifierid (= StorageIndex) is used to consistently-permute
     13the set of all peers (by sorting the peers by HASH(verifierid+peerid)). Each file
     14gets a different permutation, which (on average) will evenly distribute shares among
    1515the grid and avoid hotspots.
    1616
    … …  
    5252talked to during upload).
    5353
    54 I suspect that this approach handles churn more efficiently than tahoe3, but
     54I suspect that this approach handles churn more efficiently than TahoeThree, but
    5555I haven't gotten my head around the math that could be used to show it. On
    5656the other hand, it takes a lot more round trips to find homes in small meshes
    57 (one per share, whereas tahoe three can do just one per node).
     57(one per share, whereas TahoeThree can do just one per node).
    5858