Changes between Version 55 and Version 56 of NetDB/NextBackend
 Timestamp:
 Jun 3, 2013 11:00:03 AM (6 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

NetDB/NextBackend
v55 v56 83 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 84 85 ==== Recursive === 86 ''r'' STOREs are initiated at the originator node. Every node should forward STOREs using r,,local_recursion,,. 85 87 86 88 === Lookup === … … 101 103 Parallel mode would increase network load considerably, but provide the fastest possible lookup times at all times.[[BR]] 102 104 103 === Recursion === 105 ==== Recursive === 106 ''r'' STOREs are initiated at the originator node. Every node should forward STOREs using r,,local_recursion,,. 107 108 109 === End of Recursion === 104 110 Recursion can be used to slow DOS the network. 105 111 106 ==== Alternative1 ====112 ==== Metric 1 ==== 107 113 Each node in the path of the recursion will stop forwarding the query if it is closer to the ''key'' than any node in its routing table. 108 114 This is what is used by R5N. 109 115 110 ==== Alternative 2 ==== 111 A HopsToLive counter can be used. Each node in the recursion path would lower the HTL counter by one or lower it to what it calculates the max needed recursion steps needed to be. 116 ==== Metric 2 ==== 117 A Hopstravelled counter, ''h,,travelled,,'', can be used. The recursion can be terminated using ''h,,travelled,,'' ≤ 2*''T''. 118 112 119 Estimated Buckets entries = 2^b^log2^b^(N) <=> N = (2^b^)^bucket_entries*pow(2,b)^ [[BR]] 113 max_hops_to_live = log2^b^(N), which is the average number of steps needed to go anywhere in the network [4]. 120 ''T'' = log2^b^(N), which is the average number of steps needed to go anywhere in the network. 121 122 ==== Metric 1 && 2 ==== 123 "(h > T && closest)  (h > 4T) right now (4T or 3T or 2T, not sure); that way, the random walk (h <= T) doesn't terminate at a local min by accident."  C. Grothoff [4] 124 114 125 115 126 … … 130 141 Recursion is stopped when h < 2*T. 2*T to compensate for inaccuracies in determining T. 131 142 132 (h > T && closest)  (h > 4T) right now (4T or 3T or 2T, not sure);  C. Grothoff 143 133 144 134 145 === How ===