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: Incorrect forwarding (hostile), Query monitoring, crossc heck |
Routing: Incorrect forwarding (hostile), Query monitoring, cross check |
217 |
incorrect routing (hostile) routing tables |
incorrect routing (hostile) routing tables, verify routing tables |
218 |
|
|
219 |
DoS: Distributed, controlled burden againts Client puzzles |
DoS attack Distributed, controlled burden againts Client puzzles, load balancing, traffic |
220 |
specific computer(s) |
specific computer(s) measurements, traffic models |
221 |
|
|
222 |
Sybil: Single hostile entity present multiple Resource demanding mechanisms for Not practically realizable |
Sybil attack: Single hostile entity present multiple Resource demanding mechanisms for Not practically realizable, |
223 |
entities validating identities |
entities validating identities research focused on persistence, |
224 |
|
not on distincn |
225 |
|
|
226 |
Spam: Hostile entity creates false versions |
Spam attack: Hostile entity creates false versions Do not trust to single entity, |
227 |
of data |
of data get information from multiple entities, |
228 |
|
trust on majority |
229 |
|
|
230 |
Resource spoofing: Hostile entity gives wrong information |
Resource spoofing: Hostile entity gives wrong information Do not trust to single entity, |
231 |
about the data which entity is responsible |
about the data which entity is responsible get information from multiple entities, |
232 |
for/knows about |
for/knows about trusy on majority |
233 |
|
|
234 |
Sudden network partition: Sub network is isolated from other network |
Sudden network partition: Sub network is isolated from other network Self-tuning, environment observatorion, |
235 |
because of network disconnection |
because of network disconnection backup connections |
236 |
|
|
237 |
Searching: Efficient searching requires exploiting |
Searching: Efficient searching requires exploiting View trees, bloom filters |
238 |
of previous queries View trees, bloom filters |
of previous queries |
239 |
|
|
240 |
Efficient data discovery: Find resources efficiently, if resource |
Efficient data discovery: Find resources efficiently, if resource Super nodes, node clusters, |
241 |
exists (broadcasting) |
exists (broadcasting) caching |
242 |
|
|
243 |
Entity identification: Identify participating entities reliably |
Entity identification: Identify participating entities reliably Digital signatures Research focused on persistence, |
244 |
and efficiently |
and efficiently not on disti |
245 |
|
|
246 |
Fail Stop: A specific faulty nodes is deleted/isolated |
Fail Stop: A specific faulty nodes is deleted/isolated |
247 |
from the system |
from the system |
248 |
|
|
249 |
Byzantine faults: Faulty nodes may behave arbitrarily |
Byzantine faults: Faulty nodes may behave arbitrarily |
250 |
|
|
251 |
Richness of queries: Query languages should be more powerful |
Richness of queries: Query languages should be more powerful |
252 |
|
|
253 |
Robustness: How well system performs under hostile |
Robustness: How well system performs under hostile Form of connectivity graph, |
254 |
attacks/in the case of severe failure |
attacks/in the case of severe failure ? backup links |
255 |
|
|
256 |
Quality of Service, QoS: The system cannot promise the quality of |
Quality of Service, QoS: The system cannot promise the quality of |
257 |
service in all cases |
service in all cases |
279 |
|
|
280 |
Network proximity: Can we take account the underlying |
Network proximity: Can we take account the underlying |
281 |
network's properties better when forming |
network's properties better when forming |
282 |
overlay network ? |
overlay network (network-awareness for |
283 |
|
performance) ? |
284 |
|
|
285 |
Locality: In the case on DHTs, can we take account |
Locality: In the case on DHTs, can we take account |
286 |
locality ? |
locality ? |
293 |
searches |
searches |
294 |
|
|
295 |
Programming guidelines: Set of programming guidelines/frameworks |
Programming guidelines: Set of programming guidelines/frameworks |
296 |
is needed for better combatibility between |
is needed for better interoperability between |
297 |
different systems |
different systems |
298 |
|
|
299 |
Access Control Can we define access control levels |
Access Control: Can we define access control levels |
300 |
in peer-to-peer network ? |
in peer-to-peer network ? |
301 |
|
|
302 |
|
System in flux: Nodes join and leave system constantly: |
303 |
|
load balancing, efficiency ? |
304 |
|
|
305 |
|
Inconsistent behaviour: Hostile node could act correctly with |
306 |
|
its neighbors, but incorrectly with other |
307 |
|
|
308 |
|
Hostile groups: Joining node may join parallel network, |
309 |
|
formed a group of hostile nodes |
310 |
|
|
311 |
|
External threats: Viruses, troijans, sniffers |
312 |
|
|
313 |
|
Overlay construction: Hostile node controls the construction Cryptography |
314 |
|
of the network |
315 |
|
|
316 |
|
at each hop, querier knows that the lookup is supposed to get "closer". The querier should check this so that |
317 |
|
this attack can be detected and backtrack as necessary in routing path |
318 |
|
-incorrect routing updates |
319 |
|
-problem: an individual malicious node could corrupt the routing tables of other nodes by sending incorrect updates |
320 |
|
-solution: system maintains information of requirements of correct routing tables (and verifies them) |
321 |
|
|
322 |
|
|
323 |
|
|
324 |
* = In Kademlia, there is no action required when nodes leaves the system |
* = In Kademlia, there is no action required when nodes leaves the system |