Changes between Version 41 and Version 42 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 2, 2013 2:01:21 PM (6 years ago)
Author:
hottuna
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v41 v42  
    1313
    1414|| '''Name''' || '''Search horizon*''' || '''Lookup steps''' || '''Mutable data''' || '''Comments''' ||
    15 || Kademlia || Unlimited || O(log2^b^(n)) [2]** || No || Is susceptible to sybil and eclipse attacks.* ||
     15|| Kademlia || Unlimited || O(log2^b^(n)) [2]** || No || Is susceptible to Sybil and Eclipse attacks.* ||
    1616|| Freenet || Unlimited || O(log2(n)) [3]||No ||  ||
    17 || Chord || Unlimited || O(log2(n)*0.5)[8] || No ||Is highly susceptible to sybil and eclipse attacks.* ||
    18 || Pastry || Unlimited || O(log2^b^(n))[7] || No ||Is highly susceptible to sybil and eclipse attacks.* ||
     17|| Chord || Unlimited || O(log2(n)*0.5)[8] || No ||Is highly susceptible to Sybil and Eclipse attacks.* ||
     18|| Pastry || Unlimited || O(log2^b^(n))[7] || No ||Is highly susceptible to Sybil and Eclipse attacks.* ||
    1919
    2020[[BR]]
     
    6565The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, Iterative and Random Recursive. [[BR]]
    6666Recursive 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. [[BR]]
    67 Iterative 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. [[BR]]
     67Iterative is the standard Kademlia means of lookup. It is resistant to attacks since if will query ''a'' nodes for every iteration. [[BR]]
    6868Recursive 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.
    6969