Changes between Version 30 and Version 31 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 2, 2013 12:27:52 PM (6 years ago)
Author:
hottuna
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v30 v31  
    1313
    1414|| '''Name''' || '''Search horizon*''' || '''Lookup steps''' || '''Mutable data''' || '''Comments''' ||
    15 || Kademlia || Unlimited || Max: O(log2 n)[[BR]]Min: O(log2^b^ n)** || No || Is susceptible to sybil and eclipse attacks.* ||
    16 || Freenet || Unlimited || O(log2 n) [2]||No ||  ||
    17 || Choord || Unlimited || || No ||Is highly susceptible to sybil and eclipse attacks.* ||
    18 || Pastry || Unlimited || || No ||Is highly 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.* ||
     16|| Freenet || Unlimited || O(log2(n)) [2]||No ||  ||
     17|| Chord || Unlimited || O(0.5*log2(n))[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]]
     
    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 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]]
     
    6161
    6262Kademlia is preferable to Freenet due to its lookup speed and extendibility.
    63 Kademlia is preferable to !Choord/Pastry due to being as fast or faster and more resilient against eclipse attacks.
     63Kademlia is preferable to !Chord/Pastry due to being as fast or faster and more resilient against Eclipse attacks.
    6464
    6565The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, iterative and recursive random.
     
    123123[5] Eclipse attacks on overlay networks: Threats and defenses [http://www.eecs.harvard.edu/~mema/courses/cs264/papers/eclipse-infocom06.pdf _] [[BR]]
    124124[6] R/Kademlia: Recursive and Topology-aware Overlay Routing [http://telematics.tm.kit.edu/publications/Files/416/RKademlia_2010.pdf _] [http://telematics.tm.kit.edu/publications/Files/416/RKademlia_2010_slides.pdf slides] [[BR]]
     125[7] Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems ["Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems _]
     126[8] Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications [http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf _]
    125127