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

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/03/25 08:48:46

Modified files:
        Documentation/misc/hemppah-progradu: masterthesis.tex 

Log message:
        Clarify four requirements (dht <-> tighty)

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex.diff?tr1=1.186&tr2=1.187&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.186 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.187
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.186      Tue Mar 
25 08:37:05 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Mar 25 
08:48:46 2003
@@ -179,7 +179,7 @@
 loosely. The placement of services and topology of the overlay is random. The 
data lookup model in loosely structured systems is
 not very efficient, because of unstructured properties of the overlay.
 
-\subsection{Sketch of a formal definition}
+\subsection{Definition}
 
 In this subsection we formalize loosely structured overlay's main components. 
This
 model is based on original Gnutella overlay network with power-law 
improvements.
@@ -296,7 +296,7 @@
 approach the overlay is constructed determistically, which all participating 
peers have to follow. The topology of the
 overlay and the placement of services is controlled tightly therefore enabling 
more scalable and efficient data lookup model.
 
-\subsection{Sketch of a formal definition}
+\subsection{Definition}
 
 In this subsection, we formalize the main features of tightly structured 
overlay, i.e., 
 identifiers, identifier space and the mapping function.
@@ -350,7 +350,8 @@
 \end{figure}
 
 Balakrishnan et al. \cite{balakrishanarticle03lookupp2p} have listed four 
requirements
-for tightly structured overlays which have to be addressed in order 
+for tightly structured overlays\footnote{Authors use the term 'DHT' in their 
text, but in this context
+it doesn't matter as they list \emph{general} properties of tightly structured 
overlays.} which have to be addressed in order 
 to perform efficient data lookups in tightly structured overlays. 
 First, mapping of keys to peers must be done in a load-balanced
 way. Second, the overlay must be able to forward a data lookup for a 
@@ -874,7 +875,6 @@
 Castro et al. \cite{castro02securerouting} suggest the use of cryptographic 
content hashes in the creation process of peer identifier
 against the Sybil attack. According to authors, in this technique the IP 
address of a peer can be verified by the other peer. 
 They call this method as a one form of \emph{self-certifying data}. 
- 
  
 In the Fail-stop attack model, cited in \cite{naor03simpledht}, a faulty peer 
is deleted from the Peer-to-Peer system. Thus,
 a specific data item can be lost from the system temporaraly (or permanently). 
The reason for the faultiness of a peer can be a