[Gzz-commits] storm/doc/pegboard/storm_gisp_simulation--hempp...

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/storm
Module name:    storm
Changes by:     Hermanni Hyytiälä <address@hidden>      03/06/04 08:50:18

Modified files:
        doc/pegboard/storm_gisp_simulation--hemppah: peg.rst 

Log message:
        twids

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/storm/storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst.diff?tr1=1.11&tr2=1.12&r1=text&r2=text

Patches:
Index: storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst
diff -u storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.11 
storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.12
--- storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.11      Wed Jun 
 4 08:34:14 2003
+++ storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst   Wed Jun  4 
08:50:18 2003
@@ -5,8 +5,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-02
-:Last-Modified: $Date: 2003/06/04 12:34:14 $
-:Revision: $Revision: 1.11 $
+:Last-Modified: $Date: 2003/06/04 12:50:18 $
+:Revision: $Revision: 1.12 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -73,20 +73,21 @@
     GISP's routing table is based on Chord_'s routing 
     table -- O(log^2 n) messages are required to join/leave 
     operations and O(log n) for lookup efficiency (according to 
-    original Chord publication). GISP extends Chord's routing
-    table to have more space for cached data (peer information).
-    Chord's routing table maintains information about O(log n)
-    peers. 
+    the original Chord publication). GISP extends Chord's routing
+    table to have more space for cached data (both the protocol
+    specification and the original publication talks about 
+    "peer information"). Chord's routing table maintains 
+    information about O(log n) peers. 
     
     GISP publication does not (nor the protocol specification) 
     describe how much more space a GISP peer maintain compared 
     to Chord's O(log n). Instead, the protocol specification 
     states that "A peer should keep as much other
-    peer information as possible for cache". However, neither 
+    peer information as possible for cache". Neither 
     the original GISP publication nor the GISP
-    protocol specification do not provide any lookup properties.
-    
-    In the publication, the author states that GISP is more efficient
+    protocol specification do not provide any formal
+    properties of the GISP lookup protocol. However,    
+    in the publication the author states that GISP is more efficient
     than a "broadcasting system".    
        
 
@@ -126,7 +127,7 @@
 (unsigned integer of XOR). The GISP protocol specification paper describes the 
 XOR-metric but the original GISP publication describes only numerical 
 metric (which is little confusing since Chord uses numerical distance
-metric).
+metric and it's evident that a numerical metric is different from a 
XOR-metric).
 
 GISP extends Chord's routing table to have more peer information as a cache.
 Thus, log^2 messages are required to join/leave operations (according to the