63 |
Dangling links and keeping track of alternative versions. |
Dangling links and keeping track of alternative versions. |
64 |
Resolvable location-independent identifiers |
Resolvable location-independent identifiers |
65 |
make these issues much easier to deal with, since data |
make these issues much easier to deal with, since data |
66 |
can be recognized whereever it is moved [#]_. |
can be recognized wherever it is moved [#]_. |
67 |
|
|
68 |
.. [#] It might be more appropriate to speak about *resources* |
.. [#] It might be more appropriate to speak about *resources* |
69 |
and *references* instead of *documents* and *links*, but |
and *references* instead of *documents* and *links*, but |
91 |
|
|
92 |
Location-independent identifiers for documents |
Location-independent identifiers for documents |
93 |
make such a system unnecessary; a peer-to-peer lookup system |
make such a system unnecessary; a peer-to-peer lookup system |
94 |
can find documents whereever they are moved. |
can find documents wherever they are moved. |
95 |
Such a system also works for data not publicized on the Internet. |
Such a system also works for data not publicized on the Internet. |
96 |
For example, if one email has a document attached to it, and another email |
For example, if one email has a document attached to it, and another email |
97 |
links to this document, an index of locally stored documents |
links to this document, an index of locally stored documents |
309 |
between points in the key space (e.g. numeric, XOR); the peer |
between points in the key space (e.g. numeric, XOR); the peer |
310 |
responsible for a hashtable key, then, is the one that is *closest* |
responsible for a hashtable key, then, is the one that is *closest* |
311 |
to it in the key space, according to the distance metric. |
to it in the key space, according to the distance metric. |
312 |
A peer, then, is analogous to a hashtable bucket. |
A DHT peer is roughly analogous to a hashtable bucket. |
313 |
Queries are routed to the overlay network, each hop bringing |
Queries are routed to the overlay network, each hop bringing |
314 |
them closer to its destination in key space, until they reach |
them closer to its destination in key space, until they reach |
315 |
the peer responsible for them. |
the peer responsible for them. |