[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/11 09:42:58

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

Log message:
        protocol table: more latex formatting

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.35 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.36
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.35       Tue Feb 
11 09:10:28 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Feb 11 
09:42:58 2003
@@ -33,7 +33,7 @@
 \contactinformation{\\
 Hermanni Hyytiälä\\
 Huhtalammentie 5 as. 17\\
-40640 JYVÄSKYLÄ\\
+37637 JYVÄSKYLÄ\\
 sähköposti: address@hidden
 
 
@@ -707,138 +707,138 @@
 \multicolumn{1}{c|}{\textbf{Notes}}
 \\ \hline
 
-\parbox{40pt}{Chord} &
-\parbox{50pt}{$O$(log\^2 n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{2(log n)} &
+\parbox{37pt}{Chord} &
+\parbox{37pt}{$O(\log^2{n})$} &
+\parbox{37pt}{$O$(log $n$)} &
+\parbox{37pt}{$O$(log $n$)} &
+\parbox{50pt}{2(log $n$)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{40pt}{CAN} &
-\parbox{50pt}{$O$(d)} &
-\parbox{50pt}{$O$(d)} &
-\parbox{50pt}{$O$(dn\^(1/d))} &
-\parbox{50pt}{2d} &
+\parbox{37pt}{CAN} &
+\parbox{37pt}{$O$($d$)} &
+\parbox{37pt}{$O$($d$)} &
+\parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
+\parbox{50pt}{2$d$} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{40pt}{Pastry} &
-\parbox{50pt}{$O$(log\^2 n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{2\^b - 1)(log n)/b} &
+\parbox{37pt}{Pastry} &
+\parbox{37pt}{$O(\log^2{n})$} &
+\parbox{37pt}{$O$(log $n$)} &
+\parbox{37pt}{$O$(log $n$)} &
+\parbox{50pt}{$2^{b - 1}\frac{\log{n}}{b}$} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{40pt}{Tapestry} &
-\parbox{50pt}{$O$(log\^2 n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{2\^b - 1)(log n)/b} &
+\parbox{37pt}{Tapestry} &
+\parbox{37pt}{$O(\log^2{n})$} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{50pt}{$2^{b - 1}\frac{\log{n}}{b}$} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{40pt}{Kademlia} &
-\parbox{50pt}{$O$(log n)*} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{Kademlia} &
+\parbox{37pt}{$O$(log n)*} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{2(log n)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{40pt}{Viceroy} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{Viceroy} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{11} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{SWAN} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(log\^2 n)} &
+\parbox{37pt}{SWAN} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O(\log^2{n})$} &
 \parbox{50pt}{r(2b+2s+2l) (r=\# of resurces provided, b=boot, s=short, 
l=long), typical link conf: 2*(6+7+8)=36} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Gnutellas} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(n)} &
+\parbox{37pt}{Gnutellas} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(n)} &
 \parbox{50pt}{typical conf: 5, depends on implementation --> 2*5=10 total} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Social} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(n)} &
+\parbox{37pt}{Social} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(n)} &
 \parbox{50pt}{can be 1-10000 connections (aka social connections, connections 
are permament)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Skip Graphs} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{Skip Graphs} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{4r(log n) + (log n) (r=\# of resurces provided)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{SkipNet} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{SkipNet} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{2(log n)} &
 \parbox{50pt}{} 
 \\ \hline
 
-\parbox{50pt}{Symphony} &
-\parbox{50pt}{$O$(log\^2 n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{Symphony} &
+\parbox{37pt}{$O(\log^2{n})$} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{2k+2+f (k = long, 2 = node's neighbors, f = fault-tolerance 
links)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{ODHDHT} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)/O(log\^2 n)} &
+\parbox{37pt}{ODHDHT} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)/O(log\^2 n)} &
 \parbox{50pt}{2(log n)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Plaxton et al} &
-\parbox{50pt}{-} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{Plaxton} &
+\parbox{37pt}{-} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{$O$(log n)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{PeerNet} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
-\parbox{50pt}{$O$(log n)} &
+\parbox{37pt}{PeerNet} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
+\parbox{37pt}{$O$(log n)} &
 \parbox{50pt}{$O$(log n)} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Kelips} &
-\parbox{50pt}{} &
-\parbox{50pt}{$O$($\sqrt{n}$)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{'Total number of 
files'}{\sqrt{n}}$} &
+\parbox{37pt}{Kelips} &
+\parbox{37pt}{} &
+\parbox{37pt}{$O$($\sqrt{n}$)} &
+\parbox{37pt}{$O$(1)} &
+%\parbox{50pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{Totalnumber of 
files}{\sqrt{n}}$} &
 \parbox{50pt}{}
 \\ \hline
 
-\parbox{50pt}{Freenet} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(1)} &
-\parbox{50pt}{$O$(n)} &
+\parbox{37pt}{Freenet} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(1)} &
+\parbox{37pt}{$O$(n)} &
 \parbox{50pt}{??} &
 \parbox{50pt}{}
 \\ \hline