[Gzz-commits] manuscripts/pointers article.rst

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Branch:         
Changes by:     Benja Fallenstein <address@hidden>      03/11/06 02:23:22

Modified files:
        pointers       : article.rst 

Log message:
        edit

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

Patches:
Index: manuscripts/pointers/article.rst
diff -u manuscripts/pointers/article.rst:1.140 
manuscripts/pointers/article.rst:1.141
--- manuscripts/pointers/article.rst:1.140      Thu Nov  6 02:11:51 2003
+++ manuscripts/pointers/article.rst    Thu Nov  6 02:23:22 2003
@@ -21,8 +21,8 @@
 
 We propose *pointer records*, 
 signed files containing a document's id, 
-its current version's hash, and a timestamp.
-Pointer records are shared and sought for
+its current version's hash, and a timestamp,
+which can be shared and sought for
 through the network like ordinary files.
 We also present the Storm data model, 
 an API for P2P networks and other kinds of storage
@@ -33,6 +33,7 @@
 can have the same URI while residing on any host on any network.
 Past versions of a web page 
 remain accessible as long as anybody keeps a copy.
+
 We discuss our preliminary implementation
 as well as possible applications of pointer records
 and the Storm data model outside the P2P Web.
@@ -67,7 +68,7 @@
    benefits from hash-based addressing)---
 
 If the Web worked like a filesharing system, there would be
-no central point of failure for a web page; it could be downloaded
+no central point of failure for a web page; a page could be downloaded
 from any host that has a copy. This would save bandwidth
 and increase availability. However, if the Web worked like
 a filesharing system, web pages could not be updated.
@@ -86,7 +87,7 @@
 that do offer an update mechanism. *CFS* [dabek01widearea]_
 is a file system based on Chord [stoica01chord]_, storing
 data in a distributed hashtable (DHT). CFS identifies
-different users' trees by the users' cryptographic keys;
+different users' directory trees by the users' cryptographic keys;
 it stores in its DHT mappings from these keys to the
 the current version of the tree. A node participating
 in the DHT will update a mapping if the update message
@@ -155,8 +156,8 @@
 replica ceases to function, the current version cannot be
 determined any longer (for some applications, this only happens
 30 seconds after the primary replica disappears).
-In Freenet, this isn't possible anyway; files only
-remain on-line as long as they are requested regularly.
+In Freenet, files only
+remain on-line as long as they are requested regularly in any case.
 In the Content-Addressable Web proposal, the situation
 is the same as on the current Web.
 
@@ -216,7 +217,7 @@
 an API formalizing the notion of searching for data
 by hash and content. The API is used by applications
 such as browsers and implemented for each P2P network
-accessed. Pointer records can be implemented
+accessed. Pointer records may be implemented
 on top of the Storm model, rather than separately
 for each P2P network.
 
@@ -240,7 +241,7 @@
 In Section 2, we introduce pointer records.
 In Section 3, we present the Storm data model.
 In Section 4 we discuss some applications
-of pointer records, and Section 5 gives an overview of our
+of our contributions, and Section 5 gives an overview of our
 implementation. Section 6 concludes.
 
 
@@ -259,7 +260,7 @@
 because it *points* to different versions
 (identified by hash) over time.
 
-The pointer id is the hash of the pointer's *charter*,
+As the pointer id, we use the hash of the pointer's *charter*,
 a file including identification information for the pointer's owner,
 the entity that has change control over the document.
 This can be the owner's public key, or information about the CA