[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 07:10:22

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

Log message:
        Comments: almost done

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.184 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.185
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.184      Tue Mar 
25 06:41:05 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Mar 25 
07:10:22 2003
@@ -556,58 +556,53 @@
 \endfoot
 
 
-\parbox{90pt}{Queries} &
-\parbox{100pt}{Uncontrolled} &
-\parbox{100pt}{Controlled}  
+\parbox{90pt}{Data lookup routing} &
+\parbox{100pt}{Non-deterministic} &
+\parbox{100pt}{Deterministic}  
 \\ \hline
 
-\parbox{90pt}{A way for performing data lookups} &
+\parbox{90pt}{Construction and maintenance of the overlay} &
+\parbox{100pt}{Ad hoc and uncontrolled} &
+\parbox{100pt}{Structured and controlled}  
+\\ \hline
+
+\parbox{90pt}{A way for locating data} &
 \parbox{100pt}{Keywords} &
-\parbox{100pt}{Exact keys} 
+\parbox{100pt}{Unique identifiers} 
 \\ \hline
          
-\parbox{90pt}{Query traffic} &
-\parbox{100pt}{$O(n), O(n^{2})$}  &
-\parbox{100pt}{$O(1), O(\log{n})$} 
+\parbox{90pt}{Query traffic generated during data lookups (worst case)} &
+\parbox{100pt}{$O(n^{2})$}  &
+\parbox{100pt}{$O(\log{n})$} 
 \\ \hline
 
-\parbox{90pt}{Guaranteed data lookup} &
-\parbox{100pt}{Not necessarily} &
+\parbox{90pt}{Support for global data lookups} &
+\parbox{100pt}{No} &
 \parbox{100pt}{Yes} 
 \\ \hline
 
-\parbox{90pt}{Construction and maintenance of overlay} &
+\parbox{90pt}{Construction and maintenance of the overlay} &
 \parbox{100pt}{Uncontrolled and ad hoc}  &
 \parbox{100pt}{Controlled and structured}
 \\ \hline
                  
-\parbox{90pt}{Maximum number of peers} &
-\parbox{100pt}{Millions} &
-\parbox{100pt}{Billions} 
+\parbox{90pt}{Scalable query lookup model} &
+\parbox{100pt}{No} &
+\parbox{100pt}{Yes} 
 \\ \hline
                        
-\parbox{90pt}{Data placement} &
-\parbox{100pt}{Local} &
-\parbox{100pt}{Not local} 
-\\ \hline
-       
-\parbox{90pt}{Support for locality} &
-\parbox{100pt}{Yes} &
-\parbox{100pt}{Partial}        
-\\ \hline
-         
-\parbox{90pt}{Possibility for routing hot spots} &
+\parbox{90pt}{Data item mapped into the overlay} &
 \parbox{100pt}{No} &
 \parbox{100pt}{Yes} 
 \\ \hline
 
-\parbox{90pt}{Fault-tolerant} &
-\parbox{100pt}{High} &
-\parbox{100pt}{High}
+\parbox{90pt}{Fault tolerant} &
+\parbox{100pt}{High (the overlay), high (data lookup routing)} &
+\parbox{100pt}{High (the overlay), unknown (data lookup routing)}
 \\ \hline
 
 
-\caption{Comparison of loosely structured and tightly structured approaches} 
+\caption{Comparison of loosely structured and tightly structured approaches. 
In this table $n$ is the number of peers in the system.} 
 \label{table_comparison_approach} 
 
 
@@ -635,7 +630,7 @@
 
 \begin{itemize}
 \item \textbf{Lookup}: the number of messages required when a data lookup is 
performed.
-\item \textbf{Space}: the number of neighbors which peers knows about 
(neighbors).
+\item \textbf{Space}: the number of other peers which peer knows about 
(neighbors).
 \item \textbf{Insert/delete}: the number of messages required when a peer 
joins or leaves the network.
  \item \textbf{Number of network connections}: the number of concurrent 
network connections required to maintain correct neighbor information.
 \end{itemize}
@@ -672,7 +667,7 @@
 \parbox{37pt}{$O$($d$)} &
 \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
 \parbox{85pt}{2$d$} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner, where $d$ is the dimension 
of virtual key space}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly. $d$ is the dimension of virtual key 
space}
 \\ \hline
 
 \parbox{37pt}{Chord \cite{stoica01chord}} &
@@ -680,7 +675,7 @@
 \parbox{37pt}{$O(\log{n}$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{85pt}{2$(\log{n})$} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly}
 \\ \hline
 
 
@@ -716,7 +711,7 @@
 \parbox{37pt}{$O$($\sqrt{n}$)} &
 \parbox{37pt}{$O(1)$} &
 \parbox{85pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{Totalnumber of 
files}{\sqrt{n}}$, where n is the number of peers and c the number of 
contacts/foreign affinity group} &
-\parbox{85pt}{Insert/delete overhead is constant and performed in the 
background, system performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner}
+\parbox{85pt}{Insert/delete overhead is constant and performed in the 
background, system performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly}
 \\ \hline
 
 \parbox{37pt}{Koorde \cite{kaashoek03koorde}} &
@@ -741,7 +736,7 @@
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable 
parameter for tuning digit-fixing properties (routing table)} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner, based on Plaxton's 
algorithm}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly, based on Plaxton's algorithm}
 \\ \hline
 
 
@@ -807,7 +802,7 @@
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable 
parameter for tuning digit-fixing properties (routing table)} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner, based on Plaxton's 
algorithm}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly, based on Plaxton's algorithm}
 \\ \hline
 
 \parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &
@@ -815,7 +810,7 @@
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{85pt}{11} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system in a dynamic manner, not necessarily 
fault-tolerant because of constant degree of neighbors}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and 
peers join and leave the system constantly, not necessarily fault-tolerant 
because of constant degree of neighbors}
 \\ \hline