177 |
-specific Storm block can be identified with an ID, generated by SHA-1 algorithm |
-specific Storm block can be identified with an ID, generated by SHA-1 algorithm |
178 |
-block ID is globally *unique*, e.g. "Front page of New York Times newspaper on 10.10.2002" |
-block ID is globally *unique*, e.g. "Front page of New York Times newspaper on 10.10.2002" |
179 |
-each Storm node can host multiple blocks |
-each Storm node can host multiple blocks |
180 |
|
-in my thesis, we can assume that there is working PKI |
181 |
|
|
182 |
2.1.2. Objectives |
2.1.2. Objectives |
183 |
-if block exists in the network, algorithm *will* find it |
-if block exists in the network, algorithm *will* find it |
220 |
-scalability |
-scalability |
221 |
-when searhing, do we have to know the exact hash of block ID or is there other alternatives ? |
-when searhing, do we have to know the exact hash of block ID or is there other alternatives ? |
222 |
-metadata ? |
-metadata ? |
223 |
|
-should we use self certifiying identities insted of PKIs ? |
224 |
|
-how systems (DHTs/SWNs) will behave when the size of value (key-value pair) differs ? |
225 |
|
-DoS attack: what if malicious node creates huge amount of blocks associated with a specific urn-5 ? How we know which block is the correct one ? |
226 |
|
-Concrete examples (how much there is data traffic in different kind of scenarios ?) |
227 |
|
-how well systems can self-organise ? |
228 |
|
|
229 |
|
|
230 |
2.1.5. Answers to research problem |
2.1.5. Answers to research problem |
231 |
-the most efficient algorithm: O(log n) |
-the most efficient algorithm: O(log n) |
319 |
-solution: redundancy (replication, caching) |
-solution: redundancy (replication, caching) |
320 |
-problem: sybil attack (attacker creates multiple identities and foils the redundancy) |
-problem: sybil attack (attacker creates multiple identities and foils the redundancy) |
321 |
-solution: need a way to control creation of node IDs (ID = SHA-1(ip-address), challange node verify its ID) |
-solution: need a way to control creation of node IDs (ID = SHA-1(ip-address), challange node verify its ID) |
322 |
|
|
323 |
|
|
324 |
|
|
325 |
2.2. "Searching for most recent Storm block associated with specific urn-5 name, where |
2.2. "Searching for most recent Storm block associated with specific urn-5 name, where |