[Gzz-commits] storm/doc/pegboard/attacking_gisp--hemppah peg.rst

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/storm
Module name:    storm
Branch:         
Changes by:     Hermanni Hyytiälä <address@hidden>      03/06/13 08:42:12

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

Log message:
        more

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

Patches:
Index: storm/doc/pegboard/attacking_gisp--hemppah/peg.rst
diff -u storm/doc/pegboard/attacking_gisp--hemppah/peg.rst:1.32 
storm/doc/pegboard/attacking_gisp--hemppah/peg.rst:1.33
--- storm/doc/pegboard/attacking_gisp--hemppah/peg.rst:1.32     Fri Jun 13 
08:13:07 2003
+++ storm/doc/pegboard/attacking_gisp--hemppah/peg.rst  Fri Jun 13 08:42:12 2003
@@ -4,8 +4,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-05
-:Last-Modified: $Date: 2003/06/13 12:13:07 $
-:Revision: $Revision: 1.32 $
+:Last-Modified: $Date: 2003/06/13 12:42:12 $
+:Revision: $Revision: 1.33 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -239,6 +239,18 @@
   and "QUERY" messages are part of GISP-3.4 specification. Also, 
   a hostile peer is able to use this "dumb" behaviour with other GISP-3.4 
   messages.
+  
+- In the GISP overlay, the average routing hop length is proportional to 
+  O(log n).
+  
+- In a GISP network, when fraction f of the peers are "dumb" and a "dumb"
+  peer do not provide a "RESULT" message for a "QUERY" message, the 
+  probability of routing successfully "QUERY" message between two regular 
+  peers is (1-f)^h-1, where h is the routing hops used in the overlay. 
+
+
+  
+- - -
 
 - It is expected that (popular) data items can be found with fewer hops in 
   *some cases* in GISP network w.r.t Chord network, since GISP extends Chord's 
@@ -260,8 +272,7 @@
   not process or forward queries at all
   
 .. more specific, create a formula (?)
-  
-
+   
 If fraction f of the peers are dumb in a static network with 10 - 10000
   peer and fraction f of the lookups, then fraction of the lookups will 
   fail at all network sizes