/[gzz]/manuscripts/storm/article.rst
ViewVC logotype

Diff of /manuscripts/storm/article.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.122 by benja, Sun Feb 9 09:40:51 2003 UTC revision 1.123 by benja, Sun Feb 9 10:33:17 2003 UTC
# Line 63  In this paper, we address two issues rai Line 63  In this paper, we address two issues rai
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
# Line 91  on the public Internet. Line 91  on the public Internet.
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
# Line 309  a point in the space. The DHT defines a Line 309  a point in the space. The DHT defines a
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.

Legend:
Removed from v.1.122  
changed lines
  Added in v.1.123

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26