/[gzz]/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
ViewVC logotype

Diff of /gzz/Documentation/misc/hemppah-progradu/masterthesis.tex

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.33 by hemppah, Tue Feb 11 13:26:53 2003 UTC revision 1.34 by hemppah, Tue Feb 11 14:09:38 2003 UTC
# Line 694  Increases system complexity Line 694  Increases system complexity
694    
695    
696    
697  \begin{longtable}{|l|l|l|l|l|}  \begin{longtable}{|l|c|c|c|c|l|}
698  \caption[Comparison of Broadicasting and Structured approaches]{Comparison of Broadicasting and Structured approaches}  \caption[Comparison of Broadicasting and Structured approaches]{Comparison of Broadicasting and Structured approaches}
699  \label{table_comparison_approach} \\  \label{table_comparison_approach} \\
700    
701  \hline  \hline
702  \multicolumn{1}{|c|}{\textbf{Protocol}} &  \multicolumn{1}{|c|}{\textbf{Protocol}} &
703  \multicolumn{1}{|c|}{\textbf{Insert/Delete}} &  \multicolumn{1}{c|}{\textbf{Insert/Delete}} &
704  \multicolumn{1}{c|}{\textbf{Space}} &  \multicolumn{1}{c|}{\textbf{Space}} &
705  \multicolumn{1}{c|}{\textbf{Search}} &  \multicolumn{1}{c|}{\textbf{Search}} &
706  \multicolumn{1}{c|}{\textbf{# of network connections}} &  \multicolumn{1}{c|}{\textbf{\# of network connections}} &
707  \multicolumn{1}{c|}{\textbf{Notes}}  \multicolumn{1}{c|}{\textbf{Notes}}
708    \\ \hline
709    
710  \parbox{50pt}{Chord}  \parbox{50pt}{Chord} &
711  \parbox{50pt}{O(log\^2 n)}  \parbox{50pt}{$O$(log\^2 n)} &
712  \parbox{50pt}{O(log n)}  \parbox{50pt}{$O$(log n)} &
713  \parbox{50pt}{O(log n)}  \parbox{50pt}{$O$(log n)} &
714  \parbox{50pt}{2(log n)}  \parbox{50pt}{2(log n)} &
715  \parbox{50pt}{}  \parbox{50pt}{}
716    \\ \hline
717    
718  CAN  \parbox{50pt}{CAN} &
719    \parbox{50pt}{$O$(d)} &
720  Pastry  \parbox{50pt}{$O$(d)} &
721    \parbox{50pt}{$O$(dn\^(1/d))} &
722    \parbox{50pt}{2d} &
723    \parbox{50pt}{}
724    \\ \hline
725    
726  Tapestry  \parbox{50pt}{Pastry} &
727    \parbox{50pt}{$O$(log\^2 n)} &
728    \parbox{50pt}{$O$(log n)} &
729    \parbox{50pt}{$O$(log n)} &
730    \parbox{50pt}{2\^b - 1)(log n)/b} &
731    \parbox{50pt}{}
732    \\ \hline
733    
734  Kademlia  \parbox{50pt}{Tapestry} &
735    \parbox{50pt}{$O$(log\^2 n)} &
736    \parbox{50pt}{$O$(log n)} &
737    \parbox{50pt}{$O$(log n)} &
738    \parbox{50pt}{2\^b - 1)(log n)/b} &
739    \parbox{50pt}{}
740    \\ \hline
741    
742  Viceroy  \parbox{50pt}{Kademlia} &
743    \parbox{50pt}{$O$(log n)*} &
744    \parbox{50pt}{$O$(log n)} &
745    \parbox{50pt}{$O$(log n)} &
746    \parbox{50pt}{2(log n)} &
747    \parbox{50pt}{}
748    \\ \hline
749    
750  SWAN  \parbox{50pt}{Viceroy} &
751    \parbox{50pt}{$O$(log n)} &
752    \parbox{50pt}{$O$(1)} &
753    \parbox{50pt}{$O$(log n)} &
754    \parbox{50pt}{11} &
755    \parbox{50pt}{}
756    \\ \hline
757    
758  Gnutellas  \parbox{50pt}{SWAN} &
759    \parbox{50pt}{$O$(1)} &
760    \parbox{50pt}{$O$(1)} &
761    \parbox{50pt}{$O$(log\^2 n)} &
762    \parbox{50pt}{r(2b+2s+2l) (r=\# of resurces provided, b=boot, s=short, l=long), typical link conf: 2*(6+7+8)=36} &
763    \parbox{50pt}{}
764    \\ \hline
765    
766  Social  \parbox{50pt}{Gnutellas} &
767    \parbox{50pt}{$O$(1)} &
768    \parbox{50pt}{$O$(1)} &
769    \parbox{50pt}{$O$(n)} &
770    \parbox{50pt}{typical conf: 5, depends on implementation --> 2*5=10 total} &
771    \parbox{50pt}{}
772    \\ \hline
773    
774  Skip Graphs  \parbox{50pt}{Social} &
775    \parbox{50pt}{$O$(1)} &
776    \parbox{50pt}{$O$(1)} &
777    \parbox{50pt}{$O$(n)} &
778    \parbox{50pt}{can be 1-10000 connections (aka social connections, connections are permament)} &
779    \parbox{50pt}{}
780    \\ \hline
781    
782  SkipNet  \parbox{50pt}{Skip Graphs} &
783    \parbox{50pt}{$O$(log n)} &
784    \parbox{50pt}{$O$(log n)} &
785    \parbox{50pt}{$O$(log n)} &
786    \parbox{50pt}{4r(log n) + (log n) (r=\# of resurces provided)} &
787    \parbox{50pt}{}
788    \\ \hline
789    
790  Symphony  \parbox{50pt}{SkipNet} &
791    \parbox{50pt}{$O$(log n)} &
792    \parbox{50pt}{$O$(log n)} &
793    \parbox{50pt}{$O$(log n)} &
794    \parbox{50pt}{2(log n)} &
795    \parbox{50pt}{}
796    \\ \hline
797    
798    \parbox{50pt}{Symphony} &
799    \parbox{50pt}{$O$(log\^2 n)} &
800    \parbox{50pt}{$O$(log n)} &
801    \parbox{50pt}{$O$(log n)} &
802    \parbox{50pt}{2k+2+f (k = long, 2 = node's neighbors, f = fault-tolerance links)} &
803    \parbox{50pt}{}
804    \\ \hline
805    
806  ODHDHT  \parbox{50pt}{ODHDHT} &
807    \parbox{50pt}{$O$(log n)} &
808    \parbox{50pt}{$O$(log n)} &
809    \parbox{50pt}{$O$(log n)/O(log\^2 n)} &
810    \parbox{50pt}{2(log n)} &
811    \parbox{50pt}{}
812    \\ \hline
813    
814  Plaxton et al  \parbox{50pt}{Plaxton et al} &
815    \parbox{50pt}{-} &
816    \parbox{50pt}{$O$(log n)} &
817    \parbox{50pt}{$O$(log n)} &
818    \parbox{50pt}{$O$(log n)} &
819    \parbox{50pt}{}
820    \\ \hline
821    
822  Kelips  \parbox{50pt}{PeerNet} &
823    \parbox{50pt}{$O$(log n)} &
824    \parbox{50pt}{$O$(log n)} &
825    \parbox{50pt}{$O$(log n)} &
826    \parbox{50pt}{$O$(log n)} &
827    \parbox{50pt}{}
828    \\ \hline
829    
830  Freenet  \parbox{50pt}{Kelips} &
831    \parbox{50pt}{} &
832    \parbox{50pt}{$O$($\sqrt{n}$)} &
833    \parbox{50pt}{$O$(1)} &
834    \parbox{50pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{'Total number of files'}{\sqrt{n}}$} &
835    \parbox{50pt}{}
836    \\ \hline
837    
838    \parbox{50pt}{Freenet} &
839    \parbox{50pt}{$O$(1)} &
840    \parbox{50pt}{$O$(1)} &
841    \parbox{50pt}{$O$(n)} &
842    \parbox{50pt}{??} &
843    \parbox{50pt}{}
844  \\ \hline  \\ \hline
845    
846    

Legend:
Removed from v.1.33  
changed lines
  Added in v.1.34

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26