[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/18 09:14:54

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

Log message:
        More

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.45 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.46
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.45       Mon Feb 
17 09:41:05 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Feb 18 
09:14:53 2003
@@ -359,7 +359,7 @@
 
 \scriptsize
 \begin{longtable}{|l|l|l|l|}
-\caption[Open problems in P2P]{Open problems in P2P} 
\label{table_problems_p2p} \\
+\caption[Security problems in P2P]{Security problems in P2P} 
\label{table_security_problems_p2p} \\
 
 
 
@@ -403,7 +403,7 @@
 \parbox{110pt}{Identify all nodes simultaneously across the system, collect 
pool of nodes which are validated, distributed node ID creation} &
 \parbox{110pt}{Not practically realizable, research focused on persistence, 
not on identity distinction}
 \\ \hline 
-       
+
 
 \parbox{90pt}{Spam attack} &
 \parbox{110pt}{Hostile entity creates false versions of data} &
@@ -417,118 +417,129 @@
 \parbox{110pt}{Do not trust to single entity, get information from multiple 
entities, trust on majority's opinion} &
 \parbox{110pt}{Easy to implement, creates more network traffic} 
 \\ \hline
-               
-
-\parbox{90pt}{Sudden network partition} &
-\parbox{110pt}{Sub network is isolated from other network because of network 
disconnection} &
-\parbox{110pt}{Self-tuning, environment observatorion, localized network 
connection for minimun latency (backup connections)} &
-\parbox{110pt}{Creates more overhead/space requirements per node}
-\\ \hline
-                
-
-\parbox{90pt}{Searching} &
-\parbox{110pt}{Efficient searching requires exploiting of previous queries} &
-\parbox{110pt}{View trees, bloom filters and its variations} &
-\parbox{110pt}{Effective, but not flexible}
-\\ \hline
-
 
-\parbox{90pt}{Efficient data discovery} &
-\parbox{110pt}{Find resources efficiently, if resource exists (broadcasting)} &
-\parbox{110pt}{Super nodes, node clusters, caching techiques} &
-\parbox{110pt}{More efficient, less network traffic, not comparable to DHT's 
efficiency}
-\\ \hline
-       
 
 \parbox{90pt}{Entity identification} &
 \parbox{110pt}{Identify participating entities reliably and efficiently        
} &
 \parbox{110pt}{Digital signatures, key infrastructure} &
 \parbox{110pt}{Not practically realizable}
 \\ \hline
-               
 
-\parbox{90pt}{Fail Stop} &
-\parbox{110pt}{A faulty node stops working} &
-\parbox{110pt}{Failure detectors, informing protocols} &
-\parbox{110pt}{Creates more network traffics, node's information can be 
outdated, failure detectors not reliable}
+
+\parbox{90pt}{Data integrity/authenticity} &
+\parbox{110pt}{Integrity/originality of data is unknown} &
+\parbox{110pt}{Cryptographic content hashes, key architectures} &
+\parbox{110pt}{For data integrity, there are working solutions, but for data 
authenticity, some of the solutions are partial, which may be practically 
realizable}
 \\ \hline
 
 
-\parbox{90pt}{Byzantine faults} &
-\parbox{110pt}{Faulty nodes may behave arbitrarily} &
-\parbox{110pt}{Byzantine replication protocols -> get information from 
multiple entities, trust majority's opinion} &
-\parbox{110pt}{Much research has been done on this field, practical solutions, 
decreases system's, performance slighly}
+\parbox{90pt}{Anonymity} &
+\parbox{110pt}{Anonymity cannot be provided in all cases} &
+\parbox{110pt}{Remailers, pre-routing} &
+\parbox{110pt}{Total anonymity cannot be provided yet}
 \\ \hline
 
 
-\parbox{90pt}{Richness of queries} &
-\parbox{110pt}{Query languages should be more powerful} &
-\parbox{110pt}{SQL-like queries} &
-\parbox{110pt}{Hard to implement, increases system complexity, not much 
research has been done}
+\parbox{90pt}{Malicious nodes} &
+\parbox{110pt}{How to identify malicious nodes in the system} &
+\parbox{110pt}{Create invariants for node behaviour, verify invariants, 
self-certifying data} &
+\parbox{110pt}{Partial solutions, self-certifying data most realiable}
 \\ \hline
 
 
-\parbox{90pt}{Robustness} &
-\parbox{110pt}{How well system performs under hostile attacks/in the case of 
severe failure ?} &
-\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law 
networks/properties} &
-\parbox{110pt}{Working solutions}
+\parbox{90pt}{Access Control} &
+\parbox{110pt}{Can we define access control levels in peer-to-peer network ?} &
+\parbox{110pt}{Schema-based rules} &
+\parbox{110pt}{Some initial experiences, need more research}
 \\ \hline
 
 
-\parbox{90pt}{Quality of Service} &
-\parbox{110pt}{The system can only provide (at most) best effort services)} &
-\parbox{110pt}{Use network proximity for better network performance 
(bandwidth, latency, jitter, packet loss)} &
-\parbox{110pt}{Increases system complexity, some initial experiences, need 
more research}
+\parbox{90pt}{Inconsistent behaviour} &
+\parbox{110pt}{Hostile node could act correctly with its neighbors, but 
incorrectly with others} &
+\parbox{110pt}{Public keys, digital signatures} &
+\parbox{110pt}{Not practical approach/working proposal created yet}
 \\ \hline
 
 
-\parbox{90pt}{Data availability/persistency} &
-\parbox{110pt}{Data might be temporarily unavailable, or lost permanently} &
-\parbox{110pt}{Data caching, data replication} &
-\parbox{110pt}{Working solutions, but creates more traffic and overhead per 
node}
+\parbox{90pt}{Hostile groups} &
+\parbox{110pt}{Joining node may join parallel network, formed a group of 
hostile nodes, hostile node(s) controls the construction of the network} &
+\parbox{110pt}{Use trusted nodes, based on history information, Cryptography, 
key infrastructure} &
+\parbox{110pt}{Not 100\% sure if Centreal Authority (CA) is missing, not 
practical approach/working proposal created yet}
 \\ \hline
 
 
-\parbox{90pt}{Data integrity/authenticity} &
-\parbox{110pt}{Integrity/originality of data is unknown} &
-\parbox{110pt}{Cryptographic content hashes, key architectures} &
-\parbox{110pt}{For data integrity, there are working solutions, but for data 
authenticity, some of the solutions are partial, which may be practically 
realizable}
+\parbox{90pt}{External security threats} &
+\parbox{110pt}{Viruses, trojans, sniffers} &
+\parbox{110pt}{Data integrity/authenticity, distributed antivirus software} &
+\parbox{110pt}{Not much research has been done on this}
 \\ \hline
 
 
-\parbox{90pt}{Anonymity} &
-\parbox{110pt}{Anonymity cannot be provided in all cases} &
-\parbox{110pt}{Remailers, pre-routing} &
-\parbox{110pt}{Total anonymity cannot be provided yet}
+\end{longtable}
+
+               
+\begin{longtable}{|l|l|l|l|}
+\caption[Performance and usability problems in P2P]{Performance/usabaility 
problems in P2P} \label{table_performanceusability_problems_p2p} \\
+
+
+\hline 
+\multicolumn{1}{|c|}{\textbf{Problem}} & 
+\multicolumn{1}{c|}{\textbf{Problem description}} & 
+\multicolumn{1}{c|}{\textbf{Solutions}} &
+\multicolumn{1}{c|}{\textbf{Comments/Status}}
+\\ \hline 
+\endfirsthead
+
+\multicolumn{4}{c}%
+{{\tablename\ \thetable{} -- continued from previous page}} \\
+\hline \multicolumn{1}{|c|}{\textbf{Problem}} &
+\multicolumn{1}{c|}{\textbf{Problem description}} &
+\multicolumn{1}{c|}{\textbf{Solutions}} &
+\multicolumn{1}{c|}{\textbf{Comments/Status}} 
+\\ \hline 
+\endhead
+
+\endfoot
+               
+\parbox{90pt}{Searching} &
+\parbox{110pt}{Efficient searching requires exploiting of previous queries} &
+\parbox{110pt}{View trees, bloom filters and its variations} &
+\parbox{110pt}{Effective, but not flexible}
 \\ \hline
 
 
-\parbox{90pt}{Malicious nodes} &
-\parbox{110pt}{How to identify malicious nodes in the system} &
-\parbox{110pt}{Create invariants for node behaviour, verify invariants, 
self-certifying data} &
-\parbox{110pt}{Partial solutions, self-certifying data most realiable}
+\parbox{90pt}{Efficient data discovery} &
+\parbox{110pt}{Find resources efficiently, if resource exists (broadcasting)} &
+\parbox{110pt}{Super nodes, node clusters, caching techiques} &
+\parbox{110pt}{More efficient, less network traffic, not comparable to DHT's 
efficiency}
 \\ \hline
 
 
+\parbox{90pt}{Richness of queries} &
+\parbox{110pt}{Query languages should be more powerful} &
+\parbox{110pt}{SQL-like queries} &
+\parbox{110pt}{Hard to implement, increases system complexity, not much 
research has been done}
+\\ \hline
 
-\parbox{90pt}{Mutual distrust} &
-\parbox{110pt}{Nobody trusts anybody} &
-\parbox{110pt}{Reputation methods, key infrastructures} &
-\parbox{110pt}{Resource demanding, not practical to implement/not working 
solutions, no real world experience in a wide scale}
+
+\parbox{90pt}{Robustness} &
+\parbox{110pt}{How well system performs under hostile attacks/in the case of 
severe failure ?} &
+\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law 
networks/properties} &
+\parbox{110pt}{Working solutions}
 \\ \hline
 
 
-\parbox{90pt}{Lack of motivation to cooperate} &
-\parbox{110pt}{All participants do not behave like they should be, instead 
they go for own profit} &
-\parbox{110pt}{Different reputation methods} &
-\parbox{110pt}{No real world experience in a wide scale}
+\parbox{90pt}{Quality of Service} &
+\parbox{110pt}{The system can only provide (at most) best effort services)} &
+\parbox{110pt}{Use network proximity for better network performance 
(bandwidth, latency, jitter, packet loss)} &
+\parbox{110pt}{Increases system complexity, some initial experiences, need 
more research}
 \\ \hline
 
 
-\parbox{90pt}{Heterogeneity} &
-\parbox{110pt}{There are different kind of nodes in the system, in light of 
bandwidth and computing power} &
-\parbox{110pt}{Super peers (broadcasting), cluster (broadcasting) additional 
layer upon DHTs, structural simplicity (DHTs)} &
-\parbox{110pt}{Working solutions, increases system complexity (additional 
layer)}
+\parbox{90pt}{Data availability/persistency} &
+\parbox{110pt}{Data might be temporarily unavailable, or lost permanently} &
+\parbox{110pt}{Data caching, data replication} &
+\parbox{110pt}{Working solutions, but creates more traffic and overhead per 
node}
 \\ \hline
 
 
@@ -560,45 +571,85 @@
 \\ \hline
 
 
-\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{90pt}{System in flux} &
+\parbox{110pt}{Nodes join and leave system constantly: load balancing, 
efficiency ?} &
+\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
 
 
-\parbox{90pt}{Access Control} &
-\parbox{110pt}{Can we define access control levels in peer-to-peer network ?} &
-\parbox{110pt}{Schema-based rules} &
-\parbox{110pt}{Some initial experiences, need more research}
+\end{longtable}
+
+
+\begin{longtable}{|l|l|l|l|}
+\caption[Miscellaneous problems in P2P]{Miscellaneous problems in P2P} 
\label{table_Miscellaneous_problems_p2p} \\
+
+
+\hline 
+\multicolumn{1}{|c|}{\textbf{Problem}} & 
+\multicolumn{1}{c|}{\textbf{Problem description}} & 
+\multicolumn{1}{c|}{\textbf{Solutions}} &
+\multicolumn{1}{c|}{\textbf{Comments/Status}}
+\\ \hline 
+\endfirsthead
+
+\multicolumn{4}{c}%
+{{\tablename\ \thetable{} -- continued from previous page}} \\
+\hline \multicolumn{1}{|c|}{\textbf{Problem}} &
+\multicolumn{1}{c|}{\textbf{Problem description}} &
+\multicolumn{1}{c|}{\textbf{Solutions}} &
+\multicolumn{1}{c|}{\textbf{Comments/Status}} 
+\\ \hline 
+\endhead
+
+\endfoot
+
+
+\parbox{90pt}{Sudden network partition} &
+\parbox{110pt}{Sub network is isolated from other network because of network 
disconnection} &
+\parbox{110pt}{Self-tuning, environment observatorion, localized network 
connection for minimun latency (backup connections)} &
+\parbox{110pt}{Creates more overhead/space requirements per node}
+\\ \hline              
+
+\parbox{90pt}{Fail Stop} &
+\parbox{110pt}{A faulty node stops working} &
+\parbox{110pt}{Failure detectors, informing protocols} &
+\parbox{110pt}{Creates more network traffics, node's information can be 
outdated, failure detectors not reliable}
 \\ \hline
 
 
-\parbox{90pt}{System in flux} &
-\parbox{110pt}{Nodes join and leave system constantly: load balancing, 
efficiency ?} &
-\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)}
+\parbox{90pt}{Byzantine faults} &
+\parbox{110pt}{Faulty nodes may behave arbitrarily} &
+\parbox{110pt}{Byzantine replication protocols -> get information from 
multiple entities, trust majority's opinion} &
+\parbox{110pt}{Much research has been done on this field, practical solutions, 
decreases system's, performance slighly}
 \\ \hline
 
 
-\parbox{90pt}{Inconsistent behaviour} &
-\parbox{110pt}{Hostile node could act correctly with its neighbors, but 
incorrectly with others} &
-\parbox{110pt}{Public keys, digital signatures} &
-\parbox{110pt}{Not practical approach/working proposal created yet}
+\parbox{90pt}{Mutual distrust} &
+\parbox{110pt}{Nobody trusts anybody} &
+\parbox{110pt}{Reputation methods, key infrastructures} &
+\parbox{110pt}{Resource demanding, not practical to implement/not working 
solutions, no real world experience in a wide scale}
 \\ \hline
 
 
-\parbox{90pt}{Hostile groups} &
-\parbox{110pt}{Joining node may join parallel network, formed a group of 
hostile nodes, hostile node(s) controls the construction of the network} &
-\parbox{110pt}{Use trusted nodes, based on history information, Cryptography, 
key infrastructure} &
-\parbox{110pt}{Not 100\% sure if Centreal Authority (CA) is missing, not 
practical approach/working proposal created yet}
+\parbox{90pt}{Lack of motivation to cooperate} &
+\parbox{110pt}{All participants do not behave like they should be, instead 
they go for own profit} &
+\parbox{110pt}{Different reputation methods} &
+\parbox{110pt}{No real world experience in a wide scale}
 \\ \hline
 
 
-\parbox{90pt}{External threats} &
-\parbox{110pt}{Viruses, trojans, sniffers} &
-\parbox{110pt}{Data integrity/authenticity, distributed antivirus software} &
-\parbox{110pt}{Not much research has been done on this}
+\parbox{90pt}{Heterogeneity} &
+\parbox{110pt}{There are different kind of nodes in the system, in light of 
bandwidth and computing power} &
+\parbox{110pt}{Super peers (broadcasting), cluster (broadcasting) additional 
layer upon DHTs, structural simplicity (DHTs)} &
+\parbox{110pt}{Working solutions, increases system complexity (additional 
layer)}
+\\ \hline
+
+
+\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}
 \\ \hline
 
 
@@ -608,19 +659,19 @@
 \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}
 \\ \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}
 \\ \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}
 \\ \hline
-
-
 
 
 \end{longtable}
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.71 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.72
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.71   Mon Feb 17 
09:15:45 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Tue Feb 18 
09:14:53 2003
@@ -1897,3 +1897,12 @@
        year = {2003},  
        url = {http://iptps03.cs.berkeley.edu/final-papers/coral.pdf}
 }
+
address@hidden,
+       author = {N.G. Bruijn},
+       title = {A combinatorial problem},
+       booktitle = {In Proceedings of the Koninklije Nederlandse Academie van 
Wetenshapen},
+       pages = {758--764},
+       year = {1946}
+}
+