[Gzz-commits] manuscripts/storm article.rst

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/02/15 14:15:07

Modified files:
        storm          : article.rst 

Log message:
        twid

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/storm/article.rst.diff?tr1=1.206&tr2=1.207&r1=text&r2=text

Patches:
Index: manuscripts/storm/article.rst
diff -u manuscripts/storm/article.rst:1.206 manuscripts/storm/article.rst:1.207
--- manuscripts/storm/article.rst:1.206 Sat Feb 15 14:13:05 2003
+++ manuscripts/storm/article.rst       Sat Feb 15 14:15:06 2003
@@ -316,21 +316,19 @@
 responsible for a hashtable key, then, is the one that is *closest*
 to it in the key space, according to the distance metric.
 A DHT peer is roughly analogous to a hashtable bucket.
-Query is routed on top of overlay network, each hop bringing
-query closer to its destination in key space, until they reach
-the peer responsible for the query.
+Queries are routed in the overlay network, each hop bringing
+them closer to their destination in key space, until they reach
+the responsible peer. A common API that can be supported by current and future 
DHTs
+is proposed in [zhao03api]_.
 
-A common API that can be supported by current and future DHTs
-is being proposed in [zhao03api]_.
-
-Recently, a few DHT-like systems have been developed which employ
-a key space similarly to a DHT, but in which queries are routed
-to (key,value) pairs [bonsma02swan-andalso-AspnesS2003]_: A peer 
-occupies several positions in the key space, one for each 
-(key,value) pair. In such a system, the indirection of placing
-close keys in the custody of a 'hashtable bucket' peer is removed
-at the cost of each peer maintaining one node in the overlay network
-for each (key,value) pair it publishes.
+.. Recently, a few DHT-like systems have been developed which employ
+   a key space similarly to a DHT, but in which queries are routed
+   to (key,value) pairs [bonsma02swan-andalso-AspnesS2003]_: A peer 
+   occupies several positions in the key space, one for each 
+   (key,value) pair. In such a system, the indirection of placing
+   close keys in the custody of a 'hashtable bucket' peer is removed
+   at the cost of each peer maintaining one node in the overlay network
+   for each (key,value) pair it publishes.
 
 The basic definition of a distributed hashtable does not indicate
 how large the keys and values used may be. Intuitively, we expect keys
@@ -344,15 +342,12 @@
 The choice between the schemes affects the scalability and reliability
 of the network.
 
-CFS [dabek01widearea]_ is a global peer-to-peer storage system. CFS is built 
upon the Chord DHT 
-peer-to-peer routing layer [stoica01chord]_. CFS stores data as blocks. 
However, CFS *splits* data 
-(files) into several miniblocks and spreads blocks over the available CFS 
servers.
-PAST [rowstron01storage]_ is another large scale storage utility, 
-which uses Pastry [rowston01pastry]_ for routing.
-Freenet [clarke00freenet]_ is an anonymous storage system, which supports read 
and write 
-operations (i.e. publishing). Both PAST and Freenet do not split files into 
blocks, since 
-they store data as whole files. All previously mentioned systems lack of the 
immutable 
-property which is used in Storm blocks.
+CFS [dabek01widearea]_ and PAST [rowstron01storage]_ 
+are scalable storage systems using the home node approach,
+based on the Chord [stoica01chord]_ and
+Pastry [rowston01pastry]_ DHTs, respectively.
+Freenet [clarke00freenet]_ is a system for anonymous reading
+and publication.
 
 Recently there has been some interest in peer-to-peer hypermedia.
 Thompson and de Roure [thompson01coincidence]_ examine the discovery