144 |
- Fraction of "dumb" peers is dynamic: create n*10^k normal peers, |
- Fraction of "dumb" peers is dynamic: create n*10^k normal peers, |
145 |
d*10^k "dumb" peers, where k = 1..3, n = 1..9 and d = 1..9 |
d*10^k "dumb" peers, where k = 1..3, n = 1..9 and d = 1..9 |
146 |
- Use both the constant and dynamic fraction scenarios, start with the |
- Use both the constant and dynamic fraction scenarios, start with the |
147 |
constant |
constant |
148 |
- For a normal peers ID is in the format "peer1, peer2..." and for a |
- Create 100*N key/value items in the network, where the N is the number of all peers in the network |
|
"dumb" peer ID is in the format "dumb1, dumb2..." |
|
|
- Create 100*N key/value items in the network (the format is "key1, key2...", |
|
|
"value1, value2..."), where the N is the number of all peers in the network |
|
149 |
- Each peer queries a set of random keys |
- Each peer queries a set of random keys |
150 |
- Try to use same code as in GISP's implementation/simulation base |
- Try to use same code as in GISP's implementation/simulation base |
151 |
- For "dumb" peers we have to create own class |
- For "dumb" peers we have to create own class |