210 |
Possibilty for routing hotspots: Yes No |
Possibilty for routing hotspots: Yes No |
211 |
Design/Implementation complexity: High Low |
Design/Implementation complexity: High Low |
212 |
|
|
213 |
|
3) p2p open problems table: |
214 |
|
|
215 |
|
Approach Description Solutions Comments/Status |
216 |
|
Routing: DHT |
217 |
|
DDos: DHT/Broadcast |
218 |
|
Sybil: DHT/Broadcast |
219 |
|
Spam: DHT/Broadcast |
220 |
|
Resource spoofing: DHT/Broadcast |
221 |
|
Sudden network partition: DHT |
222 |
|
Searching: DHT/Broadcast View trees, bloom filters |
223 |
|
Efficient Resource discovery: Broadcast |
224 |
|
Entity identification: DHT/Broadcast |
225 |
|
Fail Stop: DHT/Broadcast |
226 |
|
Byzantine problem: DHT/Broadcast |
227 |
|
Richness of queries: DHT |
228 |
|
Robustness: DHT/Broadcast |
229 |
|
Quality of Service, QoS: DHT/Broadcast |
230 |
|
Data availability: DHT/Broadcast |
231 |
|
Data integrity/authenticity: DHT/Broadcast |
232 |
|
Anonymity: DHT/Broadcast |
233 |
|
Attack resistance: DHT/Broadcast |
234 |
|
Malicious nodes: DHT/Broadcast |
235 |
|
Mutual distrust: DHT/Broadcast |
236 |
|
Lack of motivation to cooperate: DHT/Broadcast |
237 |
|
Heterogeneity: DHT |
238 |
|
Network proximity: DHT/Broadcast |
239 |
|
Load Balancing: DHT |
240 |
|
Locality: DHT |
241 |
|
Hotspots: DHT |
242 |
|
Scalability: Broadcast |
243 |
|
Programming guidelines: DHT/Broadcast |
244 |
|
|
245 |
|
|
246 |
* = In Kademlia, there is no action required when nodes leaves the system |
* = In Kademlia, there is no action required when nodes leaves the system |