[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/02/25 07:13:51

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

Log message:
        Refs into protocol table

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.72 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.73
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.72       Tue Feb 
25 06:53:16 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Feb 25 
07:13:50 2003
@@ -520,7 +520,7 @@
 
 \endfoot
 
-\parbox{37pt}{CAN} &
+\parbox{37pt}{CAN \cite{ratnasamy01can}} &
 \parbox{37pt}{$O$($d$)} &
 \parbox{37pt}{$O$($d$)} &
 \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
@@ -528,7 +528,7 @@
 \parbox{85pt}{System's performance may decrease if nodes are not homogeneous 
and nodes join and leave the system in a dynamic manner, where $d$ is the 
dimension of virtual key space}
 \\ \hline
 
-\parbox{37pt}{Chord} &
+\parbox{37pt}{Chord \cite{stoica01chord}} &
 \parbox{37pt}{$O(\log^2{n})$} &
 \parbox{37pt}{$O(\log{n}$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -537,7 +537,7 @@
 \\ \hline
 
 
-\parbox{37pt}{Freenet} &
+\parbox{37pt}{Freenet \cite{clarke00freenet}} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(n)$} &
@@ -546,7 +546,7 @@
 \\ \hline
 
 
-\parbox{37pt}{Gnutella} &
+\parbox{37pt}{Gnutella \cite{gnutellaurl}} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(n)$} &
@@ -555,7 +555,7 @@
 \\ \hline
 
 
-\parbox{37pt}{Kademlia} &
+\parbox{37pt}{Kademlia \cite{maymounkov02kademlia}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -564,7 +564,7 @@
 \\ \hline
 
 
-\parbox{37pt}{Kelips} &
+\parbox{37pt}{Kelips \cite{gupta03kelips}} &
 \parbox{37pt}{$O(2(\sqrt{n}*(log^2{n})) + (\sqrt{n} + (log^3{n})))$} &
 \parbox{37pt}{$O$($\sqrt{n}$)} &
 \parbox{37pt}{$O(1)$} &
@@ -572,7 +572,7 @@
 \parbox{85pt}{Insert/delete overhead is constant and performed background, 
System's performance may decrease if nodes are not homogeneous and nodes join 
and leave the system in a dynamic manner}
 \\ \hline
 
-\parbox{37pt}{Koorde} &
+\parbox{37pt}{Koorde \cite{kaashoek03koorde}} &
 \parbox{37pt}{$O(\log^2{n})$} &
 \parbox{37pt}{$O(1)$ or $O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$ or $O(\frac{\log{n}}{\log{}\log{n}})$} &
@@ -580,7 +580,7 @@
 \parbox{85pt}{Based on Chord protocol, uses de Bruijn graphs for better 
efficiency/fault-tolerance}
 \\ \hline
 
-\parbox{37pt}{ODHDHT} &
+\parbox{37pt}{ODHDHT \cite{naor03simpledht}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -589,7 +589,7 @@
 \\ \hline
  
  
-\parbox{37pt}{Pastry} &
+\parbox{37pt}{Pastry \cite{rowston01pastry}} &
 \parbox{37pt}{$O(\log^2{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -598,7 +598,7 @@
 \\ \hline
 
 
-\parbox{37pt}{PeerNet} &
+\parbox{37pt}{PeerNet \cite{eriksson03peernet}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -606,7 +606,7 @@
 \parbox{85pt}{Operates at network layer}
 \\ \hline
 
-\parbox{37pt}{Plaxton} &
+\parbox{37pt}{Plaxton \cite{plaxton97accessingnearby}} &
 \parbox{37pt}{No support} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -614,7 +614,7 @@
 \parbox{85pt}{Plaxton's algortihm is designed to operate in static environment 
(e.g., web cache)}
 \\ \hline
 
-\parbox{37pt}{Skip Graphs} &
+\parbox{37pt}{Skip Graphs \cite{AspnesS2003}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -622,7 +622,7 @@
 \parbox{85pt}{In this approach, node is treated as 'named resource'; in this 
approach, \emph{resources} self-organise (opposite to DHTs)}
 \\ \hline
 
-\parbox{37pt}{SkipNet} &
+\parbox{37pt}{SkipNet \cite{harvey03skipnet2}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -630,7 +630,7 @@
 \parbox{85pt}{Partially supports underlying network's locality properties} 
 \\ \hline
 
-\parbox{37pt}{Social} &
+\parbox{37pt}{Social \cite{alpineurl}} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(n)$} &
@@ -638,7 +638,7 @@
 \parbox{85pt}{Connection number depends on node's memory/network capabilities}
 \\ \hline
 
-\parbox{37pt}{Symphony} &
+\parbox{37pt}{Symphony \cite{gurmeet03symphony}} &
 \parbox{37pt}{$O(\log^2{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -646,7 +646,7 @@
 \parbox{85pt}{Space can be also $O(1)$. Additional space of $space^2$ can be 
used as a lookahead list for better performance, not necessarily fault-tolerant 
because of constant degree of neighbors}
 \\ \hline
 
-\parbox{37pt}{SWAN} &
+\parbox{37pt}{SWAN \cite{bonsma02swan}} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(\log^2{n})$} &
@@ -655,7 +655,7 @@
 \\ \hline
 
 
-\parbox{37pt}{Tapestry} &
+\parbox{37pt}{Tapestry \cite{zhao01tapestry}} &
 \parbox{37pt}{$O(\log^2{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(\log{n})$} &
@@ -663,7 +663,7 @@
 \parbox{85pt}{System's performance may decrease if nodes are not homogeneous 
and nodes join and leave the system in a dynamic manner, based on Plaxton's 
algorithm}
 \\ \hline
 
-\parbox{37pt}{Viceroy} &
+\parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &
 \parbox{37pt}{$O(\log{n})$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(\log{n})$} &