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

Diff of /manuscripts/pointers/article.rst

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

revision 1.19 by hemppah, Mon Oct 27 17:09:31 2003 UTC revision 1.20 by hemppah, Mon Oct 27 17:27:37 2003 UTC
# Line 148  No versioning model Line 148  No versioning model
148    
149  PAST [rowstron01storage]_ is a persistent storage system that use  PAST [rowstron01storage]_ is a persistent storage system that use
150  [rowston01pastry]_ for locating data in a Peer-to-Peer environment.  [rowston01pastry]_ for locating data in a Peer-to-Peer environment.
151  Nodes and data items are distributed uniformly based on the hash identifier  Nodes and data items are distributed uniformly based on the hash
152  in a PAST network. Free Haven [dingledine00free]_ provides a distributed  identifier in a PAST network. Free Haven [dingledine00free]_
153  anonymous storage. It uses both cryptography and routing techniques to  provides a distributed anonymous persistent data storage. It uses
154  provide anonymity for the participating peers and splits a file to shares  both cryptography and routing techniques to provide anonymity for
155  that are distributed in a network.  Both PAST and Free Haven do not have a  the participating peers and splits a file to a number of shares
156  model for updating data items in the system.  which are distributed through a network. Because of persistency
157    commitment both PAST and Free Haven do not have a model for
158    updating data items in the system.
159    
160  Centralized versioning model  Centralized versioning model
161  ----------------------------  ----------------------------
162    
 - Centralized updates:  
   
163    - SFS &c; destructive updates    - SFS &c; destructive updates
   - Publius focuses on anonymity (apparently); destructive updates    
164        
165        
166    Like Free Haven, Publius [pub00]_ focuses on anonymity of the
167    participating nodes. Compared to Free Haven, however, Publius
168    has a support for destructive updates. An issue with Publius
169    is that it requires a globally maintained list of participating
170    nodes currently available in a system.
171        
172  OceanStore [kubiatowicz00oceanstore]_ is a global storage system based  OceanStore [kubiatowicz00oceanstore]_ is a global storage system
173  on Tapestry [zhao01tapestry]_ routing algorithm. It supports non-destructive,  based on Tapestry [zhao01tapestry]_ routing algorithm. It
174  linearly versioned updates through a centralized Byzantine agreement protocol.  supports non-destructive, linearly versioned updates through a
175    centralized Byzantine agreement protocol.
176                
177        
178  Network-level destructive versioning  Network-level destructive versioning
179  ------------------------------------  ------------------------------------
180    
181  Freenet [freenet-ieee]_ uses probabilistic routing scheme to preserve  Freenet [freenet-ieee]_ uses probabilistic routing scheme to
182  the anominy of the participating nodes in the networks.  preserve the anominy of the participating nodes in the networks.
183            
184    - SFR (apparently)    - SFR (apparently)
   - CFS  
185    
186  CFS [dabek01widearea]_ is based on Chord [stoica01chord]_ and stores data  CFS [dabek01widearea]_ is based on Chord [stoica01chord]_ and
187  blocks, i.e., fragments of files, and spreads blocks uniformly over the  stores data blocks, i.e., fragments of files, and spreads
188  network based on identifier of a block.  blocks uniformly over the network based on identifier of a block.
189            
190        
191  We conclude that existing peer-to-peer don't provide all the benefits of  We conclude that existing peer-to-peer don't provide all the
192  hash-based addressing scheme.  benefits of hash-based addressing scheme.
193    
194    
195  Basic model  Basic model

Legend:
Removed from v.1.19  
changed lines
  Added in v.1.20

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