[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/19 05:55:31

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

Log message:
        More

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.47 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.48
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.47       Wed Feb 
19 05:04:10 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Wed Feb 19 
05:55:30 2003
@@ -479,7 +479,7 @@
 
                
 \begin{longtable}{|l|l|l|l|}
-\caption[Performance and usability problems in P2P]{Performance/usabaility 
problems in P2P} \label{table_performanceusability_problems_p2p} \\
+\caption[Performance and usability problems in P2P]{Performance and usability 
problems in P2P} \label{table_performanceusability_problems_p2p} \\
 
 
 \hline 
@@ -552,14 +552,14 @@
 
 \parbox{90pt}{Locality} &
 \parbox{110pt}{Could DHTs exploit locality properties better ?} &
-\parbox{110pt}{Constrained Load Balancing, using network properties for 
nearest neighbor selection} &
+\parbox{110pt}{Constrained Load Balancing, using network properties for 
nearest neighbor selection, self-organizing clusters} &
 \parbox{110pt}{Working solutions}
 \\ \hline
 
 
 \parbox{90pt}{Hotspots} &
 \parbox{110pt}{What will happen if some resource is extremely popular and only 
one node is hosting it ?} &
-\parbox{110pt}{Caching, multisource downloads, replication, load balancing} &
+\parbox{110pt}{Caching, multisource downloads, replication, load balancing, 
sloppy hashing} &
 \parbox{110pt}{For query hotspots, caching and multisource downloads 
efficiently reduces hotspots, for routing hotspots, benefits are smaller}
 \\ \hline
 
@@ -570,9 +570,14 @@
 \parbox{110pt}{Better scalability, but not comparable to DHTs}
 \\ \hline
 
+\parbox{90pt}{Load balancing} &
+\parbox{110pt}{Random (but uniformly distributed) identifier selection could 
cause systen imbalance among participants with different capabilities} &
+\parbox{110pt}{Caching, virtual server transfers} &
+\parbox{110pt}{Effective, more research required in fully dynamic environment}
+\\ \hline
 
 \parbox{90pt}{System in flux} &
-\parbox{110pt}{Nodes join and leave system constantly: load balancing, 
efficiency ?} &
+\parbox{110pt}{Nodes join and leave system constantly. What about load 
balancing and performance ?} &
 \parbox{110pt}{Half-life phenomenon (for analysis), simple overlay maintenance 
and construction protocol} &
 \parbox{110pt}{Initial theoretical analysis have been created, but not 
comprehensive model for analysing different system states and its variations 
(e.g. complex usage patterns)}
 \\ \hline
@@ -649,7 +654,7 @@
 \parbox{90pt}{Programming guidelines} &
 \parbox{110pt}{Set of programming guidelines/frameworks is needed for better 
interoperability between different systems} &
 \parbox{110pt}{Common frameworks and APIs} &
-\parbox{110pt}{Common framework/API is still missing, a lot of proposals have 
been made}
+\parbox{110pt}{Common framework/API is still missing, a few proposals have 
been made (DHTs)}
 \\ \hline
 
 
@@ -660,17 +665,16 @@
 \\ \hline
 
 
-\parbox{90pt}{How to locate existing network} &
-\parbox{110pt}{Ability to simulate whole p2p network's usage patterns, network 
traffics, flux state etc} &
-\parbox{110pt}{gnutellahosts.com} &
-\parbox{110pt}{Only small subset of peer-to-peer networks has been able to 
analyse, because of ad hoc properties of network, more poweful solutions needed}
+\parbox{90pt}{Overlay management and health monitoring} &
+\parbox{110pt}{System is self-capable to monitor it's status and health for 
better performance} &
+\parbox{110pt}{Build a metadata overlay atop of structured overlay (such as 
SOMO for structured overlays), make local decisions about overlay 
(unstrucured)} &
+\parbox{110pt}{For structured overlays, efficient and simple to implement, 
fault-tolerance unknowns, for unstructured, not necessarily efficient because 
decisions are based on local knowledge}
 \\ \hline
 
-
-\parbox{90pt}{Overlay management} &
-\parbox{110pt}{Ability to simulate whole p2p network's usage patterns, network 
traffics, flux state etc} &
-\parbox{110pt}{gnutellahosts.com} &
-\parbox{110pt}{Only small subset of peer-to-peer networks has been able to 
analyse, because of ad hoc properties of network, more poweful solutions needed}
+\parbox{90pt}{Locating peer-to-peer network} &
+\parbox{110pt}{How old peers or new peers are able to locate peer-to-peer 
network, if it exists} &
+\parbox{110pt}{Servers maintaining online peers (e.g. gnutellahosts.com), 
peer's history information} &
+\parbox{110pt}{Depends on implementation and purpose of the system, for mobile 
ad hoc networks more research is needed}
 \\ \hline
 
 
@@ -819,8 +823,8 @@
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(1)$} &
 \parbox{37pt}{$O(n)$} &
-\parbox{85pt}{??} &
-\parbox{85pt}{}
+\parbox{85pt}{Typical configuration e.g., 4-150} &
+\parbox{85pt}{Average lookup performance is $O(\log{n})$ with tens of 
thousands concurrent users, beyond that, the performace is $O(n)$}
 \\ \hline