/[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.72 by hemppah, Tue Feb 25 11:53:16 2003 UTC revision 1.73 by hemppah, Tue Feb 25 12:13:50 2003 UTC
# Line 520  load balance Line 520  load balance
520    
521  \endfoot  \endfoot
522    
523  \parbox{37pt}{CAN} &  \parbox{37pt}{CAN \cite{ratnasamy01can}} &
524  \parbox{37pt}{$O$($d$)} &  \parbox{37pt}{$O$($d$)} &
525  \parbox{37pt}{$O$($d$)} &  \parbox{37pt}{$O$($d$)} &
526  \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &  \parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
# Line 528  load balance Line 528  load balance
528  \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}  \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}
529  \\ \hline  \\ \hline
530    
531  \parbox{37pt}{Chord} &  \parbox{37pt}{Chord \cite{stoica01chord}} &
532  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
533  \parbox{37pt}{$O(\log{n}$} &  \parbox{37pt}{$O(\log{n}$} &
534  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 537  load balance Line 537  load balance
537  \\ \hline  \\ \hline
538    
539    
540  \parbox{37pt}{Freenet} &  \parbox{37pt}{Freenet \cite{clarke00freenet}} &
541  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
542  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
543  \parbox{37pt}{$O(n)$} &  \parbox{37pt}{$O(n)$} &
# Line 546  load balance Line 546  load balance
546  \\ \hline  \\ \hline
547    
548    
549  \parbox{37pt}{Gnutella} &  \parbox{37pt}{Gnutella \cite{gnutellaurl}} &
550  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
551  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
552  \parbox{37pt}{$O(n)$} &  \parbox{37pt}{$O(n)$} &
# Line 555  load balance Line 555  load balance
555  \\ \hline  \\ \hline
556    
557    
558  \parbox{37pt}{Kademlia} &  \parbox{37pt}{Kademlia \cite{maymounkov02kademlia}} &
559  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
560  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
561  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 564  load balance Line 564  load balance
564  \\ \hline  \\ \hline
565    
566    
567  \parbox{37pt}{Kelips} &  \parbox{37pt}{Kelips \cite{gupta03kelips}} &
568  \parbox{37pt}{$O(2(\sqrt{n}*(log^2{n})) + (\sqrt{n} + (log^3{n})))$} &  \parbox{37pt}{$O(2(\sqrt{n}*(log^2{n})) + (\sqrt{n} + (log^3{n})))$} &
569  \parbox{37pt}{$O$($\sqrt{n}$)} &  \parbox{37pt}{$O$($\sqrt{n}$)} &
570  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
# Line 572  load balance Line 572  load balance
572  \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}  \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}
573  \\ \hline  \\ \hline
574    
575  \parbox{37pt}{Koorde} &  \parbox{37pt}{Koorde \cite{kaashoek03koorde}} &
576  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
577  \parbox{37pt}{$O(1)$ or $O(\log{n})$} &  \parbox{37pt}{$O(1)$ or $O(\log{n})$} &
578  \parbox{37pt}{$O(\log{n})$ or $O(\frac{\log{n}}{\log{}\log{n}})$} &  \parbox{37pt}{$O(\log{n})$ or $O(\frac{\log{n}}{\log{}\log{n}})$} &
# Line 580  load balance Line 580  load balance
580  \parbox{85pt}{Based on Chord protocol, uses de Bruijn graphs for better efficiency/fault-tolerance}  \parbox{85pt}{Based on Chord protocol, uses de Bruijn graphs for better efficiency/fault-tolerance}
581  \\ \hline  \\ \hline
582    
583  \parbox{37pt}{ODHDHT} &  \parbox{37pt}{ODHDHT \cite{naor03simpledht}} &
584  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
585  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
586  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 589  load balance Line 589  load balance
589  \\ \hline  \\ \hline
590    
591    
592  \parbox{37pt}{Pastry} &  \parbox{37pt}{Pastry \cite{rowston01pastry}} &
593  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
594  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
595  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 598  load balance Line 598  load balance
598  \\ \hline  \\ \hline
599    
600    
601  \parbox{37pt}{PeerNet} &  \parbox{37pt}{PeerNet \cite{eriksson03peernet}} &
602  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
603  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
604  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 606  load balance Line 606  load balance
606  \parbox{85pt}{Operates at network layer}  \parbox{85pt}{Operates at network layer}
607  \\ \hline  \\ \hline
608    
609  \parbox{37pt}{Plaxton} &  \parbox{37pt}{Plaxton \cite{plaxton97accessingnearby}} &
610  \parbox{37pt}{No support} &  \parbox{37pt}{No support} &
611  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
612  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 614  load balance Line 614  load balance
614  \parbox{85pt}{Plaxton's algortihm is designed to operate in static environment (e.g., web cache)}  \parbox{85pt}{Plaxton's algortihm is designed to operate in static environment (e.g., web cache)}
615  \\ \hline  \\ \hline
616    
617  \parbox{37pt}{Skip Graphs} &  \parbox{37pt}{Skip Graphs \cite{AspnesS2003}} &
618  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
619  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
620  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 622  load balance Line 622  load balance
622  \parbox{85pt}{In this approach, node is treated as 'named resource'; in this approach, \emph{resources} self-organise (opposite to DHTs)}  \parbox{85pt}{In this approach, node is treated as 'named resource'; in this approach, \emph{resources} self-organise (opposite to DHTs)}
623  \\ \hline  \\ \hline
624    
625  \parbox{37pt}{SkipNet} &  \parbox{37pt}{SkipNet \cite{harvey03skipnet2}} &
626  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
627  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
628  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 630  load balance Line 630  load balance
630  \parbox{85pt}{Partially supports underlying network's locality properties}  \parbox{85pt}{Partially supports underlying network's locality properties}
631  \\ \hline  \\ \hline
632    
633  \parbox{37pt}{Social} &  \parbox{37pt}{Social \cite{alpineurl}} &
634  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
635  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
636  \parbox{37pt}{$O(n)$} &  \parbox{37pt}{$O(n)$} &
# Line 638  load balance Line 638  load balance
638  \parbox{85pt}{Connection number depends on node's memory/network capabilities}  \parbox{85pt}{Connection number depends on node's memory/network capabilities}
639  \\ \hline  \\ \hline
640    
641  \parbox{37pt}{Symphony} &  \parbox{37pt}{Symphony \cite{gurmeet03symphony}} &
642  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
643  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
644  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 646  load balance Line 646  load balance
646  \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}  \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}
647  \\ \hline  \\ \hline
648    
649  \parbox{37pt}{SWAN} &  \parbox{37pt}{SWAN \cite{bonsma02swan}} &
650  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
651  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
652  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
# Line 655  load balance Line 655  load balance
655  \\ \hline  \\ \hline
656    
657    
658  \parbox{37pt}{Tapestry} &  \parbox{37pt}{Tapestry \cite{zhao01tapestry}} &
659  \parbox{37pt}{$O(\log^2{n})$} &  \parbox{37pt}{$O(\log^2{n})$} &
660  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
661  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
# Line 663  load balance Line 663  load balance
663  \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}  \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}
664  \\ \hline  \\ \hline
665    
666  \parbox{37pt}{Viceroy} &  \parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &
667  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &
668  \parbox{37pt}{$O(1)$} &  \parbox{37pt}{$O(1)$} &
669  \parbox{37pt}{$O(\log{n})$} &  \parbox{37pt}{$O(\log{n})$} &

Legend:
Removed from v.1.72  
changed lines
  Added in v.1.73

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