|
101 | 101 | # True to save git diff and git commit |
102 | 102 | saveGit = False |
103 | 103 |
|
| 104 | +# --- DHT Parameters --- |
| 105 | + |
| 106 | +# True to simulate the distribution of the BlockSegments over a simulated DHTNetwork |
| 107 | +dhtSimulation = True |
| 108 | + |
| 109 | +# K replication factor, in how many DHT nodes are we going to store the block segments |
| 110 | +# reused as how many DHT nodes will fit into each Kbucket to the routing table |
| 111 | +ks = [20] |
| 112 | + |
| 113 | +# Number of concurrent DHT nodes that will be contacted during a Lookup |
| 114 | +alphas = [1] |
| 115 | + |
| 116 | +# Number of steps without finding any closer DHT nodes to a Hash will the DHT lookup perform before finishing it |
| 117 | +# Not using steps4StopCondition as 7 steps looks too much for the DHT (although it could be changed :)) |
| 118 | +nilStepsToStopLookup = 3 |
| 119 | + |
104 | 120 | def nextShape(): |
105 | | - for run, fm, fr, class1ratio, chi, vpn1, vpn2, blockSize, nn, netDegree, bwUplinkProd, bwUplink1, bwUplink2 in itertools.product( |
106 | | - runs, failureModels, failureRates, class1ratios, chis, validatorsPerNode1, validatorsPerNode2, blockSizes, numberNodes, netDegrees, bwUplinksProd, bwUplinks1, bwUplinks2): |
| 121 | + for run, fm, fr, class1ratio, chi, vpn1, vpn2, blockSize, nn, netDegree, bwUplinkProd, bwUplink1, bwUplink2, k, alpha in itertools.product( |
| 122 | + runs, failureModels, failureRates, class1ratios, chis, validatorsPerNode1, validatorsPerNode2, blockSizes, numberNodes, netDegrees, bwUplinksProd, bwUplinks1, bwUplinks2, ks, alphas): |
107 | 123 | # Network Degree has to be an even number |
108 | 124 | if netDegree % 2 == 0: |
109 | | - shape = Shape(blockSize, nn, fm, fr, class1ratio, chi, vpn1, vpn2, netDegree, bwUplinkProd, bwUplink1, bwUplink2, run) |
| 125 | + shape = Shape(blockSize, nn, fm, fr, class1ratio, chi, vpn1, vpn2, netDegree, bwUplinkProd, bwUplink1, bwUplink2, k, alpha, run) |
110 | 126 | yield shape |
0 commit comments