Changes between Version 46 and Version 47 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 3, 2013 9:04:44 AM (6 years ago)
Author:
hottuna
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v46 v47  
    6666'''This is a draft of the proposal.'''
    6767
     68=== Why? ===
    6869Kademlia is preferable to Freenet due to its lookup speed and extendibility.
     70
    6971Kademlia is preferable to !Chord/Pastry due to being as fast or faster and more resilient against Eclipse attacks.
     72
     73UCSB FloodFill-takeover attack is fixed by making everyone a node.
     74
     75Eclipse attacks can be somewhat relieved by aggressive insertion replication factor higher/far higher than ''k''.
     76
     77
     78=== ''Key'' ===
     79''Key'' rotation might be an interesting idea in the form of hash(dest+low_res_timestamp). It may help out against eclipse attacks if the results of the (unpublished) UCSB paper holds up.
     80
     81
     82=== Store ===
     83'''Idea: Random Recursive Stores:''' By making stores travel a short number of random steps (short to avoid sybil nodes) and then begin recursive store. Where a value is stored in the ~''k'' closest nodes for each node in the path of the recursive insertion.
     84
     85
     86=== Lookup ===
    7087
    7188The ultimate goal is to provide a Kademlia implementation that supports three types of FIND_VALUE. Recursive, Iterative and Random Recursive. [[BR]]
     
    84101Parallel mode would increase network load considerably, but provide the fastest possible lookup times at all times.[[BR]]
    85102
     103=== Length of Random path ===
     104Estimated Buckets entries = 2^b^log2^b^(N) => N = (2^b^)^bucket_entries*2^-b^^
    86105
     106=== How ===
    87107
    88108==== 1: Implement Kademlia ====