[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/17 04:01:45

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

Log message:
        typos

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/storm/storm/doc/pegboard/attacking_gisp--hemppah/peg.rst.diff?tr1=1.39&tr2=1.40&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.39 
storm/doc/pegboard/attacking_gisp--hemppah/peg.rst:1.40
--- storm/doc/pegboard/attacking_gisp--hemppah/peg.rst:1.39     Tue Jun 17 
03:53:31 2003
+++ storm/doc/pegboard/attacking_gisp--hemppah/peg.rst  Tue Jun 17 04:01:45 2003
@@ -4,8 +4,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-05
-:Last-Modified: $Date: 2003/06/17 07:53:31 $
-:Revision: $Revision: 1.39 $
+:Last-Modified: $Date: 2003/06/17 08:01:45 $
+:Revision: $Revision: 1.40 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -254,9 +254,8 @@
   a static GISP network since the current GISP implementation do not handle 
   "dumb" peers properly. More specifically, if there are n peers and fraction 
   f are "dumb" (i.e., do not process regular messages, replies only to "SEEN" 
-  messages), the overlay has O(log n) average path length and all 
-  peers perform n-1 lookups (i.e., worst case: have to lookup every other peer
-  in the network), then the estimated total number of lost packets is 
+  messages), the overlay has O(log n) average path length and all n
+  peers perform n-1 lookups, then the estimated total number of lost packets 
is 
   [f^((log n)-1)]*[n((n-1)(log n))]. 
   
     
@@ -284,20 +283,18 @@
 
   Notes:
   
-  n peers, O(log n) path length, all peers perform n-1 lookups (i.e., worst 
-  case: have to lookup every other peer). Then the total number of packets 
-  is n((n-1)(log n))
+  n peers, O(log n) path length, all peers perform n-1 lookups. Then the 
+  total number of packets is n((n-1)(log n))
   
   n peers, O(log n) path length, random fraction of peers, r, perform rl 
   lookups. Then the total number of packets is r((rl)(log n))
 
-  GISP network:  n peers, O(log n) path length, all peers perform n-1 lookups 
-  (i.e., worst case: have to lookup every other peer). Then the total number 
-  of packets is n((n-1)(log n))
+  GISP network:  n peers, O(log n) path length, all peers perform n-1 lookups. 
+  Then the total number of packets is n((n-1)(log n))
   
   n peers where fraction f are hostile, O(log n) path length, all peers 
-  perform n-1 lookups (i.e., worst case: have to lookup every other peer). 
Then 
-  the total number of lost packets is  [f^((log n)-1)]*[n((n-1)(log n))]
+  perform n-1 lookups. Then the total number of lost packets is 
+  [f^((log n)-1)]*[n((n-1)(log n))]
   
   
 .. No, you should not say "expect similar" - it's far too vague.