[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 04:34:07

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

Log message:
        GISP protocol notes

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/storm/storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst.diff?tr1=1.4&tr2=1.5&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.4 
storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.5
--- storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.4       Wed Jun 
 4 04:05:03 2003
+++ storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst   Wed Jun  4 
04:34:07 2003
@@ -5,8 +5,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-02
-:Last-Modified: $Date: 2003/06/04 08:05:03 $
-:Revision: $Revision: 1.4 $
+:Last-Modified: $Date: 2003/06/04 08:34:07 $
+:Revision: $Revision: 1.5 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -77,14 +77,25 @@
 The GISP protocol
 =================
 
-- GISP_ protocol resembles Kademlia_
-- XOR-metrin for distances
-- lacks of binary-tree abstraction ?
-- uses Chord_'s extended routing table - more space for caching 
-  (Log^2 messages)
-- replicates in a same way as Kademlia
+- "GISP intends leverage those (DHT) algoritms and make a practical protocol."
+- *distance function* is based on XOR-metric (Kademlia uses XOR)
+- protocol (most recent) talks about XOR-metric, publication
+  numerical metric
+- lacks of Kademlia's binary-tree abstraction (routing table) -the benefits 
+  of Kademlia's  lookup properties are not available
+- uses Chord_'s extended routing table expect more space is used for caching 
+  (Log^2 messages): asymmetric (requires stabilization protocol like Chord)
+  and lookup process is unidirectional (a virtual ring)
+  -Chord's routing table is rigid compared to Kademlia's (well known issue)  
+- replicates in a same way as Kademlia ?
 - no concurrent RPCs during lookup -- no free of choice during 
   lookups ? 
+- does GISP have the property of Kademlia: leaving peer costs nothing ?
+   - no, since GISP's routing table is based on Chord's routing table
+- supports "peer strength" for peer heteregeneity
+- nothing mentioned about the overlay topology -- however, routing table
+  is based on Chord's routing table --> toplogy resembles Chord's virtual
+  ring
 
 
 Research problems
@@ -98,8 +109,8 @@
   
 - What about GISP's lookup effieciency when the network grows ?
 
-- GISP does not use Kademlia's binary-tree abstraction - does it have 
influence 
-  anf yes, what are the influences ? 
+- GISP does not use Kademlia's binary-tree abstraction - does it have 
influences 
+  and if it does, what are the influences ? 
          
 - How well GISP is able to perform in adverse conditions, e.g., a
   network partition occurs ?