212 |
|
|
213 |
3) p2p open problems table: |
3) p2p open problems table: |
214 |
|
|
215 |
Problem description Solutions Comments/Status |
Problem description Solutions Comments/Status |
216 |
Routing: |
Routing: Incorrect forwarding (hostile), Query monitoring, crossc heck |
217 |
DDos: |
incorrect routing (hostile) routing tables |
218 |
Sybil: |
|
219 |
Spam: |
DoS: Distributed, controlled burden of a Client puzzles |
220 |
Resource spoofing: |
computer(s) |
221 |
Sudden network partition: |
|
222 |
Searching: View trees, bloom filters |
Sybil: Single hostile entity present multiple Resource demanding mechanisms for Not practically realizable |
223 |
Efficient Resource discovery: |
entities validating identities |
224 |
Entity identification: |
|
225 |
Fail Stop: |
Spam: Hostile entity creates false versions |
226 |
Byzantine problem: |
of data |
227 |
Richness of queries: |
|
228 |
Robustness: |
Resource spoofing: Hostile entity gives wrong information |
229 |
Quality of Service, QoS: |
about the data which entity is responsible |
230 |
Data availability: |
for |
231 |
Data integrity/authenticity: |
|
232 |
Anonymity: |
Sudden network partition: Sub network is isolated from other network |
233 |
Attack resistance: |
because of disconnection |
234 |
Malicious nodes: |
|
235 |
Mutual distrust: |
Searching: Efficient searching exploiting previous |
236 |
Lack of motivation to cooperate: |
queries View trees, bloom filters |
237 |
Heterogeneity: |
|
238 |
Network proximity: |
Efficient Resource discovery: Find resources efficiently, if resource |
239 |
Load Balancing: |
exists (broadcasting) |
240 |
Locality: |
|
241 |
Hotspots: |
Entity identification: Identify participating entities reliably |
242 |
Scalability: |
and efficiently |
243 |
Programming guidelines: |
|
244 |
|
Fail Stop: A specific faulty nodes is deleted/isolated |
245 |
|
from the system |
246 |
|
|
247 |
|
Byzantine faults: Faulty nodes may behave arbitrarily |
248 |
|
|
249 |
|
Richness of queries: Queries should be more powerful |
250 |
|
|
251 |
|
Robustness: How well system performs under hostile |
252 |
|
attacks |
253 |
|
|
254 |
|
Quality of Service, QoS: The system cannot promise the quality of |
255 |
|
service in all cases |
256 |
|
|
257 |
|
Data availability: Data might be temporary unavailable, or lost |
258 |
|
permanently |
259 |
|
|
260 |
|
Data integrity/authenticity: Integrity/originality of data is unknown |
261 |
|
|
262 |
|
Anonymity: Anonymity cannot be provided in all |
263 |
|
cases |
264 |
|
|
265 |
|
Malicious nodes: There are malicious nodes in the system. |
266 |
|
How we are able to discover them ? |
267 |
|
|
268 |
|
Mutual distrust: Nobody trust anybody |
269 |
|
|
270 |
|
Lack of motivation to cooperate: All participants do not behave |
271 |
|
like they should be, instead they go for |
272 |
|
own profit |
273 |
|
|
274 |
|
Heterogeneity: There are different kind of nodes |
275 |
|
in the system, in light of bandwidth |
276 |
|
and computing power. |
277 |
|
|
278 |
|
Network proximity: Can we take account the underlying |
279 |
|
network's properties better when forming |
280 |
|
overlay network ? |
281 |
|
|
282 |
|
Locality: In the case on DHTs, can we take account |
283 |
|
locality ? |
284 |
|
|
285 |
|
Hotspots: What will happen if some resource |
286 |
|
is extremely popular and only |
287 |
|
one node is hosting it |
288 |
|
|
289 |
|
Scalability: Broadcasting doesn't scale when performing |
290 |
|
searches |
291 |
|
|
292 |
|
Programming guidelines: Set of programming guidelines/frameworks |
293 |
|
is needed for better combatibility between |
294 |
|
different systems |
295 |
|
|
296 |
|
Access Control Can we define access control levels |
297 |
|
in peer-to-peer network ? |
298 |
|
|
299 |
|
|
300 |
* = In Kademlia, there is no action required when nodes leaves the system |
* = In Kademlia, there is no action required when nodes leaves the system |