gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] manuscripts/pointers article.rst


From: Hermanni Hyytiälä
Subject: [Gzz-commits] manuscripts/pointers article.rst
Date: Mon, 27 Oct 2003 09:53:27 -0500

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Branch:         
Changes by:     Hermanni Hyytiälä <address@hidden>      03/10/27 09:53:27

Modified files:
        pointers       : article.rst 

Log message:
        related work

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

Patches:
Index: manuscripts/pointers/article.rst
diff -u manuscripts/pointers/article.rst:1.13 
manuscripts/pointers/article.rst:1.14
--- manuscripts/pointers/article.rst:1.13       Mon Oct 27 08:55:45 2003
+++ manuscripts/pointers/article.rst    Mon Oct 27 09:53:26 2003
@@ -71,6 +71,7 @@
    - Load balancing (download from everyone who has a copy)
    - Can use one addressing scheme with different protocols,
      searching different networks for the content behind a hash
+   - Verifiable
    - Same namespace for local and for non-local data
 
 .. SFR (semantic-free referencing) not all that close, 
@@ -106,31 +107,45 @@
 Related work
 ============
 
-- In this section, we summarize how existing
-  peer-to-peer systems deal with versioning that use
-  hash-based ids.
+In this section, we summarize how existing peer-to-peer systems deal with 
+versioning that use hash-based ids.
 
   
 - No updates:
 
-  - PAST [rowstron01storage]_
-  - Free Haven [dingledine00free]_
+PAST [rowstron01storage]_ is a persistent storage system that use 
+[rowston01pastry]_ for locating data in a Peer-to-Peer environment.
+Nodes and data items are distributed uniformly based on the hash identifier
+in PAST network. 
+...
+    
+Free Haven [dingledine00free]_ provides a distributed anonymous storage. It 
+uses both cryptography and routing techniques to provide anonymity for the 
+participating peers. Free Haven's data lookup model is tightly binded to
+resembles gnutella's data lookup models and thus is not scalable.  
+  
+Both PAST and Free Haven do not have a model for updating data items
+in the system.
+
 
 - Centralized updates:
 
   - SFS &c; destructive updates
-  - Publius (apparently); destructive updates
+  - Publius focuses on anonymity (apparently); destructive updates    
   - Oceanstore; (byzantine) non-destructive, linearly versioned updates
   
 - Network-level destructive updates:
 
-  - Freenet [freenet-ieee]_
+  - Freenet [freenet-ieee]_ uses probabilistic routing scheme to preserve
+    the anominyt of the participating nodes in the networks.
+    
   - SFR (apparently)
   - CFS [dabek01widearea]_
+    CFS stores blocks, i.e., fragments of files, and spreads blocks uniformly
+    over the network
   
-- Conclusion: Doesn't provide the benefits of
-  hash-based addressing; doesn't allow accessing
-  past versions
+We conclude that existing peer-to-peer don't provide all the benefits of 
+hash-based addressing scheme.
 
 
 Basic model
@@ -138,7 +153,8 @@
 
 - Basic model of underlying system: Only blocks
 - Benefits of that, in a nutshell
-- Reverse indexing (nicely provided through DHT), *define* reverse indexing
+- Reverse indexing (nicely provided through structured overlays), 
+  *define* reverse indexing
 - Def.: Pointers are abstract references that *point*
   to different blocks (versions) over time
 - Storm is designed to be modular; different routing algorithms




reply via email to

[Prev in Thread] Current Thread [Next in Thread]