333 |
along the routing path. |
along the routing path. |
334 |
|
|
335 |
Of course, there are major differences within approaches. For DHT approach, |
Of course, there are major differences within approaches. For DHT approach, |
336 |
perhaps the biggest difference is *what* is self-organized into virtual key space. |
perhaps the biggest difference is the fact *what* is self-organized into |
337 |
For instance, in SWAN [ref] and Skip Graph [ref], *data items* self-organise |
virtual key space. For instance, in SWAN [ref] and Skip Graph [ref], *data |
338 |
into virtual address space, while in other DHT implementations *peers* |
items* self-organise into virtual address space, while in other DHT |
339 |
self-organise in structured form in virtual space. In broadcasting approach, |
implementations *peers* self-organise in structured form in virtual space. |
340 |
implementations' differences lie in the structural *level* of overlay network |
In broadcasting approach, implementations' differences mostly lie in the |
341 |
(super peers, clusters). |
*structural level* of overlay network, i.e. super peers and peer clusters. |
|
|
|
|
|
|
|
|
|
|
For our purposes, DHT seems to be the best choice. |
|
|
|
|
|
|
|
342 |
|
|
343 |
|
|
344 |
7. Experience and future directions |
7. Experience and future directions |