Changes between Version 12 and Version 13 of NetDB/NextBackend


Ignore:
Timestamp:
May 30, 2013 11:14:12 AM (6 years ago)
Author:
hottuna
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v12 v13  
    1313
    1414|| '''Name''' || '''Search horizon*''' || '''Lookup steps''' || '''Mutable data''' || '''Comments''' ||
    15 || Kademlia || Unlimited || Min: O(log2 n)[[BR]]Max: O(log2^b^ n)** || No || Is susceptible to sybil and eclipse attacks.* ||
     15|| Kademlia || Unlimited || Max: O(log2 n)[[BR]]Min: O(log2^b^ n)** || No || Is susceptible to sybil and eclipse attacks.* ||
    1616|| Freenet || Unlimited || O(log2 n) [2]||No ||Does not handle mutable data gracefully? ||
    1717|| Choord || Unlimited || || No ||Is highly susceptible to sybil and eclipse attacks.* ||
     
    2222* Kademlia is less susceptible to eclipse attacks.
    2323  "For one thing, it is difficult to affect the routing tables of a Kademlia node, as each node tends to keep only highly available peers in its routing table. This increases the required costs for an attacker to convince honest nodes to link to the compromised nodes. Similarly, Kademlia uses iterative routing, exploring multiple nodes at each step, making routing less dependent on specific nodes and thus less vulnerable to attacks." [1] [[BR]]
    24 ** Kademlia lookups can be optimized by enlarging how many bits of IDs b, that are considered for each bucket. With b > 1 lookup steps would be decreased from O(log2 n) to O(log2^b^ n) but the number of buckets would be increased from to an expected 2^b^log2^b^n. [2] [[BR]]
     24** Kademlia lookups can be optimized by enlarging how many bits of IDs, b, that are considered for each bucket. With b > 1 lookup steps would be decreased from O(log2 n) to O(log2^b^ n) but the number of buckets would be increased to an expected 2^b^log2^b^n. [2] [[BR]]
    2525
    2626[[BR]]