Changes between Version 22 and Version 23 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 2, 2013 11:57:46 AM (6 years ago)
Author:
hottuna
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v22 v23  
    5858
    5959== Proposal ==
    60 This is a draft of the proposal.
     60'''This is a draft of the proposal.''''
     61Kademlia is preferable to Freenet due to its lookup speed and extendibility.
     62Kademlia is preferable to Chord/Pastry due to being as fast or faster and more resilient against eclipse attacks.
     63
     64The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, iterative and recursive random.
     65
     66Recursive is the fastest means of lookup. However it is very vulnerable to Sybil attacks where a node in the recursion simply answers 'no result' instead of continuing the recursion.
     67
     68Iterative is the standard Kademlia means of lookup. It is resistant to Eclipse attacks and Storage attacks since if will query ''a'' nodes for every iteration.
     69
     70Recursive random is the R5N[4] means of lookup. It is resistant to most if not all forms of attacks since it eventually will find a path to the data if one exists.
     71
     72|| '''Method''' || '''Lookup time''' || '''Reliability''' ||
     73|| Recursive ||
     74|| Iterative ||
     75|| Random recursive ||
    6176
    6277==== 1: Implement Kademlia ====
    63 Kademlia is preferable to freenet due to its speed and extendibility and chord/pastry due to being at least as fast but safer. A full routing table will be needed to provide the O(log n) routing that is needed.
     78A full implementation of Kademlia will be used as a base for further enhancements.
    6479
    65  * Investigate i2p.zzz.kademlia implementation
     80 * Investigate the i2p.zzz.kademlia implementation
    6681 * Make sure that i2p.zzz.kademlia implements Kademlia fully
    6782   * Implement k-bucket merging