Changes between Version 66 and Version 67 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 4, 2013, 8:07:57 AM (6 years ago)
Author:
hottuna
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v66 v67  
    99== General P2P networks ==
    1010
     11[[BR]]
    1112|| '''Name''' || '''Search horizon*''' ||  '''Comments''' ||
    1213|| Gnutella || Limited || ||
    1314|| Gnutella2 || Limited || ||
    14 
    15 [[BR]]
     15[[BR]]
     16
    1617* Search horizon describes how much the network that can be searched from a certain position in the network graph. Limited search horizon means that a search from one part of the network won't necessarily find results from another part of the network.
    1718
     
    1920DHTs are a good alternative due to O(log n) lookup time and a unlimited search horizon. But have serious issues when it comes to being robust against attacks.
    2021
     22[[BR]]
    2123|| '''Name''' || '''Search horizon*''' || '''Lookup steps''' || '''Mutable data''' || '''Comments''' ||
    2224|| Kademlia || Unlimited || O(log2^b^(n)) [2]** || No || Is susceptible to Sybil and Eclipse attacks.* ||
     
    2426|| Chord || Unlimited || O(log2(n)*0.5)[8] || No ||Is highly susceptible to Sybil and Eclipse attacks.* ||
    2527|| Pastry || Unlimited || O(log2^b^(n))[7] || No ||Is highly susceptible to Sybil and Eclipse attacks.* ||
    26 
    2728[[BR]]
    2829
     
    4647Eclipse attacks are attacks on the routing / routing tables.
    4748
     49[[BR]]
    4850|| '''Name''' || '''Source''' || '''Description''' ||
    4951|| Random Recursive lookups || R5N[4]||  Before initiating a recursive kad lookup, do a random walk in the network graph to determine the start of the kad lookup. ||
    5052|| Control in/out-degrees || [5][1] || Control of the in-degree and out-degree of nodes via anonymous auditing. At the cost of slower avg. lookups. ||
     53[[BR]]
    5154
    5255
     
    6164Standard Kademlia performance can be improved by modifying it.
    6265
     66[[BR]]
    6367|| '''Name''' || '''Source''' || '''Description''' ||
    6468|| Recursive lookups || [6] || Make FIND_VALUE request recursive by forwarding the query recursively and returning the answer directly to the original source of the request. ||
     69[[BR]]
    6570
    6671= Proposal =
     
    102107== Store ==
    103108Stores should ideally always be performed using Random Recursion to increase the spread of nodes that contain the inserted data.
     109
    104110Iterative and Recursive STORE queries are possible, however they both have limited spread of inserted data. Additionally the benefits of non-random Recursive STOREs would be insertion speed. Something that likely isn't a very important factor.
    105111