gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] gzz/Documentation/misc/hemppah-progradu researc...


From: Hermanni Hyytiälä
Subject: [Gzz-commits] gzz/Documentation/misc/hemppah-progradu researc...
Date: Thu, 19 Dec 2002 05:33:37 -0500

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/12/19 05:33:37

Modified files:
        Documentation/misc/hemppah-progradu: research_problems 

Log message:
        Some additions based on quick chat with Tuomas

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/research_problems.diff?tr1=1.11&tr2=1.12&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.11 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.12
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.11      Thu Dec 
19 04:06:32 2002
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Thu Dec 19 
05:33:37 2002
@@ -177,6 +177,7 @@
 -specific Storm block can be identified with an ID, generated by SHA-1 
algorithm
 -block ID is globally *unique*, e.g. "Front page of New York Times newspaper 
on 10.10.2002"
 -each Storm node can host multiple blocks
+-in my thesis, we can assume that there is working PKI
 
 2.1.2. Objectives
 -if block exists in the network, algorithm *will* find it
@@ -219,6 +220,12 @@
        -scalability
 -when searhing, do we have to know the exact hash of block ID or is there 
other alternatives ?
        -metadata ?
+-should we use self certifiying identities insted of PKIs ?
+-how systems (DHTs/SWNs) will behave when the size of value (key-value pair) 
differs ?
+-DoS attack: what if malicious node creates huge amount of blocks associated 
with a specific urn-5 ? How we know which block is the correct one ?
+-Concrete examples (how much there is data traffic in different kind of 
scenarios ?)
+-how well systems can self-organise ?
+
        
 2.1.5. Answers to research problem
 -the most efficient algorithm: O(log n)
@@ -312,6 +319,7 @@
        -solution: redundancy (replication, caching)
        -problem: sybil attack (attacker creates multiple identities and foils 
the redundancy)
        -solution: need a way to control creation of node IDs (ID = 
SHA-1(ip-address), challange node verify its ID)
+       
                
                
 2.2. "Searching for most recent Storm block associated with specific urn-5 
name, where



reply via email to

[Prev in Thread] Current Thread [Next in Thread]