[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/05 06:03:43

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

Log message:
        issue resolved

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/storm/storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst.diff?tr1=1.14&tr2=1.15&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.14 
storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.15
--- storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst:1.14      Thu Jun 
 5 05:12:22 2003
+++ storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst   Thu Jun  5 
06:03:43 2003
@@ -5,8 +5,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-02
-:Last-Modified: $Date: 2003/06/05 09:12:22 $
-:Revision: $Revision: 1.14 $
+:Last-Modified: $Date: 2003/06/05 10:03:43 $
+:Revision: $Revision: 1.15 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -126,6 +126,46 @@
 
     - Node wants to spam a particular identifier or xu block
     
+    RESOLVED:
+    
+    Directly related to DHTs, there are two publications about this topic:
+
+    "Security Considerations for Peer-to-Peer Distributed Hash Tables"
+    by Emil Sit and Robert Morris
+
+    "Security for structured peer-to-peer overlay networks"
+    by M. Castro, P. Druschel, A. Ganesh, A. Rowstron and and D. Wallach
+
+    Both papers discusses scenarions mentioned above, e.g., Sit's
+    paper describes:
+
+    - incorrect lookup routing
+    - incorrect routing updates
+    - partition
+    - storage and retrieval attacks
+    - inconsistent behavior
+    - overload of targeted nodes
+    - rapid joins and leaves
+    - unsolicited messages    
+
+    Castro's paper discusses:
+
+    - secure nodeId assignment methods
+    - secure routing table maintenance
+    - secure message forwarding
+    - self-certifying data
+
+    Castro et al. first describe briefly different kinds of attacks
+    ans possible solutions to them.
+
+    "Controlling the Cost of Reliability in Peer-to-Peer
+    Overlays" focuses DHTs' capability to self-organise in highly
+    adverse conditions (e.g., a network partition). The paper
+    is written by Ratul Mahajan, Miguel Castro and Antony Rowston.
+
+    Additionally, Moni Naor and Udi Wieder have published a paper, "A Simple 
+    Fault Tolerant Distributed Hash Table" which is designed to be resilient
+    against the spam attack.     
     
 ISSUE: 
  
@@ -173,7 +213,6 @@
 
 According to Daishi Kato, the author of GISP, GISP ''...intends leverage 
 those (DHT) algoritms and make a practical protocol.''. GISP's distance 
-function is based on the XOR-metric, which is similar to Kademlia's XOR-metric 
 (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
@@ -268,7 +307,7 @@
   block request failure, average lookup length, number of timed-out lookups and
   the distribution of lookup messages processed per peer).
      
-- We can say that GISP is is rather fault-tolerant if 80% of lookups are 
succesful 
+- We can say that GISP is rather fault-tolerant if 80% of lookups are 
succesful 
   when 20% of peers die (this is Chord's simulation result) (e.g., 1000 Storm 
blocks are 
   insterted into a 1000 Storm-server system. After insertions, 1-99% of 
   servers die randomly or in a controlled way. Before GISP starts rebuilding