Changes between Version 34 and Version 35 of NetDB/NextBackend


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

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v34 v35  
    6363Kademlia is preferable to !Chord/Pastry due to being as fast or faster and more resilient against Eclipse attacks.
    6464
    65 The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, iterative and recursive random.
     65The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, Iterative and Random Recursive.
    6666
    6767Recursive 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.
     
    6969Iterative 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.
    7070
    71 Recursive 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.
     71Recursive 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.
    7272
    7373|| '''Method''' || '''Lookup time (avg.)''' || '''Reliability''' ||
    7474|| Recursive || (log2^b^(n) + 1)*RTT/2 || Low ||
    7575|| Iterative || log2^b^(n)*RTT || Medium ||
    76 || Random recursive || (log2^b^(n) + rand + 1)*RTT/2 || High ||
     76|| Random Recursive || (log2^b^(n) + rand + 1)*RTT/2 || High ||
     77
     78The three lookup mechanisms could be used in either sequential failover mode, hybrid mode and parallel mode. [[BR]]
     79Sequential failover mode would would produce the lowest possible network load, while still maintaining the reliability of Random Recursive lookups.[[BR]]
     80Hybrid mode would use success rates for the different lookup methods to try to decide which method to use. This might be a bad mechanism since it likely would be susceptible to attacks that provide high success rates for most but not all keys. [[BR]]
     81Parallel mode would increase network load considerably, but provide the fastest possible lookup times at all times.[[BR]]
     82
     83
    7784
    7885==== 1: Implement Kademlia ====
     
    100107
    101108
    102 == Unresolved issues ==
     109=== Unresolved issues ===
    103110==== ''k''-bucket building for recursive lookups ====
    104111''k''-buckets need to be continually updated.
     
    111118
    112119
    113 == Further work ==
     120=== Further work ===
    114121==== Use the locally known nodes as for routing ====
    115122If we have nodes in our local NetDB that have distance, d,,xor,, , that is lower than any distance found in the Kademlia routing tables they are good candidates for FIND_VALUE querying. However to find such candidates the local NetDB has to be sorted, which is expensive.