[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:01:51

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.9&tr2=1.10&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.9 
storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.10
--- storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.9       Wed Jun 
 4 07:27:21 2003
+++ storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst   Wed Jun  4 
08:01:51 2003
@@ -5,8 +5,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-02
-:Last-Modified: $Date: 2003/06/04 11:27:21 $
-:Revision: $Revision: 1.9 $
+:Last-Modified: $Date: 2003/06/04 12:01:51 $
+:Revision: $Revision: 1.10 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -59,8 +59,8 @@
     
     Why GISP ? Why are we using it versus some other systems?
     
-    - According to Benja, "it's written in Java" :)
-    - Easy implementation (and it's implemented)
+    - According to Benja, "...since it's written in Java" :)
+    - Easy implementation (and it's already implemented)
     - (belief that) GISP is a Kademlia implementation (which
       is not true - only distance function is similar)
      
@@ -72,14 +72,20 @@
     
     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) lookup efficiency (according to 
+    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. 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, for example, the protocol
+    specification states that "A peer should keep as much other
+    peer information as possible for cache".
     
     However, neither the original GISP publication nor the GISP
     protocol specification do not provide any lookup properties.
-    In publication, the author states that GISP is more efficient
-    than "broadcasting system".    
+    In the publication, the author states that GISP is more efficient
+    than a "broadcasting system".    
        
 
 ISSUE:
@@ -98,7 +104,7 @@
      - very fast connections between peers
     - some form of formal analyses ("proofs") are used with, 
       e.g., Chord and Kademlia
-    - number of peers used in simulations: from 2^7 to 2^20 
+    - number of peers commonly used in simulations: from 2^7 to 2^20 
     
 Plan
 ====