/[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.184 by hemppah, Tue Mar 25 11:41:05 2003 UTC revision 1.185 by hemppah, Tue Mar 25 12:10:22 2003 UTC
# Line 556  approach and the tightly structured appr Line 556  approach and the tightly structured appr
556  \endfoot  \endfoot
557    
558    
559  \parbox{90pt}{Queries} &  \parbox{90pt}{Data lookup routing} &
560  \parbox{100pt}{Uncontrolled} &  \parbox{100pt}{Non-deterministic} &
561  \parbox{100pt}{Controlled}    \parbox{100pt}{Deterministic}  
562  \\ \hline  \\ \hline
563    
564  \parbox{90pt}{A way for performing data lookups} &  \parbox{90pt}{Construction and maintenance of the overlay} &
565    \parbox{100pt}{Ad hoc and uncontrolled} &
566    \parbox{100pt}{Structured and controlled}  
567    \\ \hline
568    
569    \parbox{90pt}{A way for locating data} &
570  \parbox{100pt}{Keywords} &  \parbox{100pt}{Keywords} &
571  \parbox{100pt}{Exact keys}  \parbox{100pt}{Unique identifiers}
572  \\ \hline  \\ \hline
573                        
574  \parbox{90pt}{Query traffic} &  \parbox{90pt}{Query traffic generated during data lookups (worst case)} &
575  \parbox{100pt}{$O(n), O(n^{2})$}  &  \parbox{100pt}{$O(n^{2})$}  &
576  \parbox{100pt}{$O(1), O(\log{n})$}  \parbox{100pt}{$O(\log{n})$}
577  \\ \hline  \\ \hline
578    
579  \parbox{90pt}{Guaranteed data lookup} &  \parbox{90pt}{Support for global data lookups} &
580  \parbox{100pt}{Not necessarily} &  \parbox{100pt}{No} &
581  \parbox{100pt}{Yes}  \parbox{100pt}{Yes}
582  \\ \hline  \\ \hline
583    
584  \parbox{90pt}{Construction and maintenance of overlay} &  \parbox{90pt}{Construction and maintenance of the overlay} &
585  \parbox{100pt}{Uncontrolled and ad hoc}  &  \parbox{100pt}{Uncontrolled and ad hoc}  &
586  \parbox{100pt}{Controlled and structured}  \parbox{100pt}{Controlled and structured}
587  \\ \hline  \\ \hline
588                                        
589  \parbox{90pt}{Maximum number of peers} &  \parbox{90pt}{Scalable query lookup model} &
590  \parbox{100pt}{Millions} &  \parbox{100pt}{No} &
591  \parbox{100pt}{Billions}  \parbox{100pt}{Yes}
592  \\ \hline  \\ \hline
593                                                    
594  \parbox{90pt}{Data placement} &  \parbox{90pt}{Data item mapped into the overlay} &
 \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} &  
595  \parbox{100pt}{No} &  \parbox{100pt}{No} &
596  \parbox{100pt}{Yes}  \parbox{100pt}{Yes}
597  \\ \hline  \\ \hline
598    
599  \parbox{90pt}{Fault-tolerant} &  \parbox{90pt}{Fault tolerant} &
600  \parbox{100pt}{High} &  \parbox{100pt}{High (the overlay), high (data lookup routing)} &
601  \parbox{100pt}{High}  \parbox{100pt}{High (the overlay), unknown (data lookup routing)}
602  \\ \hline  \\ \hline
603    
604    
605  \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.}
606  \label{table_comparison_approach}  \label{table_comparison_approach}
607    
608    
# Line 635  Here, we describe the listed properties Line 630  Here, we describe the listed properties
630    
631  \begin{itemize}  \begin{itemize}
632  \item \textbf{Lookup}: the number of messages required when a data lookup is performed.  \item \textbf{Lookup}: the number of messages required when a data lookup is performed.
633  \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).
634  \item \textbf{Insert/delete}: the number of messages required when a peer joins or leaves the network.  \item \textbf{Insert/delete}: the number of messages required when a peer joins or leaves the network.
635   \item \textbf{Number of network connections}: the number of concurrent network connections required to maintain correct neighbor information.   \item \textbf{Number of network connections}: the number of concurrent network connections required to maintain correct neighbor information.
636  \end{itemize}  \end{itemize}
# Line 672  Here, we describe the listed properties Line 667  Here, we describe the listed properties
667  \parbox{37pt}{$O$($d$)} &  \parbox{37pt}{$O$($d$)} &
668  \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &  \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
669  \parbox{85pt}{2$d$} &  \parbox{85pt}{2$d$} &
670  \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}
671  \\ \hline  \\ \hline
672    
673  \parbox{37pt}{Chord \cite{stoica01chord}} &  \parbox{37pt}{Chord \cite{stoica01chord}} &
# Line 680  Here, we describe the listed properties Line 675  Here, we describe the listed properties
675  \parbox{37pt}{$O(\log{n}$} &  \parbox{37pt}{$O(\log{n}$} &
676  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
677  \parbox{85pt}{2$(\log{n})$} &  \parbox{85pt}{2$(\log{n})$} &
678  \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}
679  \\ \hline  \\ \hline
680    
681    
# Line 716  Here, we describe the listed properties Line 711  Here, we describe the listed properties
711  \parbox{37pt}{$O$($\sqrt{n}$)} &  \parbox{37pt}{$O$($\sqrt{n}$)} &
712  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
713  \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}{$\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} &
714  \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}
715  \\ \hline  \\ \hline
716    
717  \parbox{37pt}{Koorde \cite{kaashoek03koorde}} &  \parbox{37pt}{Koorde \cite{kaashoek03koorde}} &
# Line 741  Here, we describe the listed properties Line 736  Here, we describe the listed properties
736  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
737  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
738  \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable parameter for tuning digit-fixing properties (routing table)} &  \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable parameter for tuning digit-fixing properties (routing table)} &
739  \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}
740  \\ \hline  \\ \hline
741    
742    
# Line 807  Here, we describe the listed properties Line 802  Here, we describe the listed properties
802  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
803  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
804  \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable parameter for tuning digit-fixing properties (routing table)} &  \parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable parameter for tuning digit-fixing properties (routing table)} &
805  \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}
806  \\ \hline  \\ \hline
807    
808  \parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &  \parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &
# Line 815  Here, we describe the listed properties Line 810  Here, we describe the listed properties
810  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
811  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
812  \parbox{85pt}{11} &  \parbox{85pt}{11} &
813  \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}
814  \\ \hline  \\ \hline
815    
816    

Legend:
Removed from v.1.184  
changed lines
  Added in v.1.185

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