Changes between Version 54 and Version 55 of NetDB/NextBackend
 Timestamp:
 Jun 3, 2013, 10:43:33 AM (6 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

NetDB/NextBackend
v54 v55 110 110 ==== Alternative 2 ==== 111 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. 112 Estimated Buckets entries = 2^b^log2^b^(N) => N = (2^b^)^bucket_entries*pow(2,b)^ [[BR]]112 Estimated Buckets entries = 2^b^log2^b^(N) <=> N = (2^b^)^bucket_entries*pow(2,b)^ [[BR]] 113 113 max_hops_to_live = log2^b^(N), which is the average number of steps needed to go anywhere in the network [4]. 114 114 115 115 116 116 === Length of Random path === 117 Estimated Buckets entries = 2^b^log2^b^(N) => N = (2^b^)^bucket_entries*pow(2,b)^ [[BR]]117 Estimated Buckets entries = 2^b^log2^b^(N) <=> N = (2^b^)^bucket_entries*pow(2,b)^ [[BR]] 118 118 rand_path_length = log2^b^(N), which is the average number of steps needed to go anywhere in the network [4]. 119 119 120 121 === Replication factor === 122 In standard kad, ''k'' is used as the replication factor, or how many STORE request that will be sent by the originator. The replication factor, henceforth ''r'' is a tradeof between FIND_VALUE performance and the cost of STORE. Since no data is permanent in the NetDB a relatively high replication factor should be acceptable. 123 124 ''r'' is determined by, ''r'' = (N/c)^1/2^, where c is a constant describing the number of nodes with direct TCP/UDP connection to this node. For our purposes a value for c would be chosen. 125 126 ==== Recursive Replication factor ==== 127 For recursive stores a replication factor has to be calculated for each node on the path of recursion. 128 129 r,,local_recursion,, = 1 + (''r''1) / (''T'' + (''r''1)/''h''), where ''T'' = log2^b^(N) and h represents the hops travelled. 130 Recursion is stopped when h < 2*T. 2*T to compensate for inaccuracies in determining T. 131 132 (h > T && closest)  (h > 4T) right now (4T or 3T or 2T, not sure);  C. Grothoff 120 133 121 134 === How ===