[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/25 08:52:47

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

Log message:
        Refs into problem tables

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.73 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.74
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.73       Tue Feb 
25 07:13:50 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Feb 25 
08:52:46 2003
@@ -17,9 +17,9 @@
 %***********************
 %   Tyyliluokan pakolliset määritykset
 %***********************
-\title{Gzz in Peer-to-Peer Enviroment}
+\title{Fenfire in Peer-to-Peer Enviroment}
 
-\translatedtitle{Gzz in Peer-to-Peer Enviroment}
+\translatedtitle{Fenfire in Peer-to-Peer Enviroment}
 
 \author{Hermanni Hyytiälä}
 
@@ -492,11 +492,8 @@
 
 \scriptsize
 \begin{longtable}{|l|c|c|c|c|l|}
-
-\caption[Different Peer-to-Peer lookup protocols]{Different Peer-to-Peer 
lookup protocols} 
-\label{table_Peer-to-Peer_protocols}
  
-\\ \hline
+\hline
 \multicolumn{1}{|c|}{\textbf{Protocol}} &
 \multicolumn{1}{c|}{\textbf{Insert/Delete}} & 
 \multicolumn{1}{c|}{\textbf{Space}} & 
@@ -671,17 +668,16 @@
 \parbox{85pt}{System's performance may decrease if nodes are not homogeneous 
and nodes join and leave the system in a dynamic manner, not necessarily 
fault-tolerant because of constant degree of neighbors}
 \\ \hline
 
+
+\caption{Different Peer-to-Peer lookup protocols. In this table $n$ is the 
number of peers in the system. 
+Insert/Delete: Number of messages when a node joins or leaves the network. 
Space: Space required for a node's neighbors
+Search: Number of messages when an object lookup is performed. Number of 
network connections: number of concurrent
+network connections required to maintain correct neighbor information} 
+\label{table_Peer-to-Peer_protocols}
+
  
 \end{longtable}
 \normalsize
-Insert/Delete: 
-Number of messages when a node joins or leaves the network.
-
-Space: 
-Space required for a node's neighbors
-
-Search: 
-Number of messages when an object lookup is performed
 
 
 
@@ -1005,10 +1001,7 @@
 \scriptsize
 \begin{longtable}{|l|l|l|l|}
 
-\caption[Security problems in Peer-to-Peer]{Security problems in Peer-to-Peer} 
\label{table_security_problems_Peer-to-Peer}
-
-
-\\ \hline 
+\hline 
 \multicolumn{1}{|c|}{\textbf{Problem}} & 
 \multicolumn{1}{c|}{\textbf{Problem description}} & 
 \multicolumn{1}{c|}{\textbf{Solutions}} &
@@ -1029,28 +1022,28 @@
 
 
 
-\parbox{90pt}{Query routing} &                 
+\parbox{90pt}{Query routing \cite{sit02securitycons}, 
\cite{aspnes02faultrouting}, \cite{castro02securerouting}, 
\cite{ratnasamy02routing}, \cite{gavoille01routing}} &                        
 \parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} &
 \parbox{110pt}{Query monitoring, cross check routing tables, verify routing 
tables, create routing table invariants} &
 \parbox{110pt}{Increases system complexity} 
 \\ \hline
 
 
-\parbox{90pt}{DoS attack} &
+\parbox{90pt}{DoS attack \cite{sit02securitycons}, 
\cite{saia02dynamicfaultcontentnetwork}, \cite{datar02butterflies}, 
\cite{daswani02queryflooddos}} &
 \parbox{110pt}{Distributed, controlled burden againts specific computer(s)} &
 \parbox{110pt}{Client puzzles, load balancing, traffic measurements, traffic 
models, replication} &
 \parbox{110pt}{Only partial solutions, traffic models most effective}
 \\ \hline 
 
 
-\parbox{90pt}{Sybil attack} &
+\parbox{90pt}{Sybil attack \cite{douceur02sybil}, 
\cite{castro02securerouting}} &
 \parbox{110pt}{Single hostile entity present multiple entities} &
 \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{90pt}{Spam attack \cite{naor03simpledht}} &
 \parbox{110pt}{Hostile entity creates false versions of data} &
 \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} 
@@ -1064,49 +1057,49 @@
 \\ \hline
 
 
-\parbox{90pt}{Entity identification} &
+\parbox{90pt}{Entity identification \cite{ajmani02conchord}} &
 \parbox{110pt}{Identify participating entities reliably and efficiently        
} &
 \parbox{110pt}{Digital signatures, key infrastructure} &
 \parbox{110pt}{Not practically realizable}
 \\ \hline
 
 
-\parbox{90pt}{Data integrity/authenticity} &
+\parbox{90pt}{Data integrity/authenticity \cite{dabek01widearea}} &
 \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}{Anonymity} &
+\parbox{90pt}{Anonymity \cite{reiter98crowds}, \cite{tarzan:ccs9}, 
\cite{pub00}, \cite{clarke00freenet}} &
 \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}{Malicious nodes} &
+\parbox{90pt}{Malicious nodes \cite{sit02securitycons}, 
\cite{castro02securerouting}} &
 \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}{Access Control} &
+\parbox{90pt}{Access Control \cite{nejdl03accesscontrol}, 
\cite{daswani03openproblems}} &
 \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}{Inconsistent behaviour} &
+\parbox{90pt}{Inconsistent behaviour \cite{sit02securitycons}} &
 \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}{Hostile groups} &
+\parbox{90pt}{Hostile groups \cite{castro02securerouting}} &
 \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}
@@ -1119,6 +1112,9 @@
 \parbox{110pt}{Not much research has been done on this}
 \\ \hline
 
+\caption{Security problems in Peer-to-Peer.} 
+\label{table_security_problems_Peer-to-Peer}
+
 
 \end{longtable}
 \normalsize
@@ -1127,8 +1123,6 @@
 
 \scriptsize
 \begin{longtable}{|l|l|l|l|}
-\caption[Performance and usability problems in Peer-to-Peer]{Performance and 
usability problems in Peer-to-Peer} 
\label{table_performanceusability_problems_Peer-to-Peer} \\
-
 
 \hline 
 \multicolumn{1}{|c|}{\textbf{Problem}} & 
@@ -1149,21 +1143,21 @@
 
 \endfoot
                
-\parbox{90pt}{Web indexing and searching} &
+\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, 
\cite{Bhattacharjee03resultcache}, \cite{362692}} &
 \parbox{110pt}{Perform Web like searches in Peer-to-Peer network} &
 \parbox{110pt}{Data compression, view trees, bloom filters and its variations, 
gap compression, index intersection optimizations, clustering} &
 \parbox{110pt}{Effective but complex solutions, some compromises have to be 
done (decrease result quality, modify overlay's structure), more research 
needed}
 \\ \hline
 
 
-\parbox{90pt}{Efficient data discovery} &
-\parbox{110pt}{Find resources efficiently, if resource exists (broadcasting)} &
+\parbox{90pt}{Efficient data discovery \cite{lv02searchreplication}, 
\cite{osokine02distnetworks}, \cite{yang02improvingsearch}} &
+\parbox{110pt}{Find resources efficiently, if resource exists (loosely 
structured)} &
 \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{90pt}{Richness of queries \cite{harren02complex}, 
\cite{ansaryefficientbroadcast03}, \cite{andrzejak02rangequeries}} &
 \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}
@@ -1191,7 +1185,7 @@
 \\ \hline
 
 
-\parbox{90pt}{Network proximity} &
+\parbox{90pt}{Network proximity \cite{pias03lighthouse}, 
\cite{ng02predicting}} &
 \parbox{110pt}{Can we take account the underlying network's properties better 
when forming overlay network (network-awareness for performance) ?} &
 \parbox{110pt}{Global Network Positioning, Lighthouse technique, trianqulated 
heuristics} &
 \parbox{110pt}{Increases system complexity, no real world experience in a wide 
scale, proposed solutions are susceptible to single point of failure}
@@ -1248,6 +1242,9 @@
 \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
+
+\caption{Performance and usability problems in Peer-to-Peer.} 
+\label{table_performanceusability_problems_Peer-to-Peer}
                
 
 \end{longtable}
@@ -1256,7 +1253,6 @@
 
 \scriptsize
 \begin{longtable}{|l|l|l|l|}
-\caption[Miscellaneous problems in Peer-to-Peer]{Miscellaneous problems in 
Peer-to-Peer} \label{table_Miscellaneous_problems_Peer-to-Peer} \\
 
 
 \hline 
@@ -1300,7 +1296,7 @@
 \\ \hline
 
 
-\parbox{90pt}{Programming guidelines} &
+\parbox{90pt}{Programming guidelines \cite{zhao03api}, 
\cite{frise02p2pframework}, \cite{babaoglu02anthill}, \cite{rhea03benchmarks}} &
 \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 few proposals have 
been made (DHTs)}
@@ -1326,6 +1322,8 @@
 \parbox{110pt}{Depends on implementation and purpose of the system, for mobile 
ad hoc networks more research is needed}
 \\ \hline
 
+\caption{Miscellaneous problems in Peer-to-Peer.} 
+\label{table_Miscellaneous_problems_Peer-to-Peer}
 
 \end{longtable}
 \normalsize
@@ -1359,7 +1357,7 @@
 
 
 
-\chapter{Gzz hypermedia system}
+\chapter{Fenfire hypermedia system}
 
 \section{Overview}
 
@@ -1407,13 +1405,13 @@
 \cite{benja02urn5}
 \cite{balakrishnan03semanticfree}
 
-\chapter{Evaluation of Peer-to-Peer for Gzz}
+\chapter{Evaluation of Peer-to-Peer for Fenfire}
 
-In this chapter we evaluate Gzz in Peer-to-Peer enviroment.
-We start by giving an overview of Gzz Peer-to-Peer system. Then, 
+In this chapter we evaluate Fenfire in Peer-to-Peer enviroment.
+We start by giving an overview of Fenfire Peer-to-Peer system. Then, 
 we define our objectives and special needs and consider possible
 benefits over existing Peer-to-Peer filesharing systems. Finally, we
-evaluate different peer-to-peer systems with regard to Gzz, make 
+evaluate different peer-to-peer systems with regard to Fenfire, make 
 initial analsysis and discuss possible problems. In the following
 sections, we don't respond security issues. In fact, we assume 
 that system has a working distributed Public Key Infrastructure
@@ -1434,7 +1432,7 @@
 -supports simultaenous downloads
 -since each new downloader introduces a new upload capacity, eventually the 
upload overhead for the original server/node/computer bandwidth is reasonable 
small
 -uses SHA-1 for checking data integrity (suits for us very well!)
--we don't have to create 'mini-blocks' for Gzz p2p, since bitTorrent itself 
partitions data into several blocks for us
+-we don't have to create 'mini-blocks' for Fenfire p2p, since bitTorrent 
itself partitions data into several blocks for us
 
 5.1 The Merkle Hash Tree
 
@@ -1461,12 +1459,12 @@
 global, large scale data pool. To be practical and useful, system implementing
 xanalogical model have to be distributed. 
 
-We have decided to use Peer-to-Peer network as a Gzz's communication layer. For
+We have decided to use Peer-to-Peer network as a Fenfire's communication 
layer. For
 motivations and discussion, see \cite{lukka02freenetguids, 
fallenstein03storm}. 
 This paper's focus, however, is to evaluate existing Peer-to-Peer systems and 
their 
-applicably with regard to Gzz's requirements. Anyhow, it must be feasible to 
perform 
+applicably with regard to Fenfire's requirements. Anyhow, it must be feasible 
to perform 
 efficient lookups to locate parts of the document from the global repository 
based on 
-block's identifier. To be more specific, Gzz's Storm module has to support 
\emph{global scale}
+block's identifier. To be more specific, Fenfire's Storm module has to support 
\emph{global scale}
 data lookup to locate and fetch scroll blocks by using 
\emph{location-independent} 
 identifiers.
 
@@ -1526,7 +1524,7 @@
 
 \section{Special needs}
 
-Storm (and therefore Gzz) has several unique features which postulates 
+Storm (and therefore Fenfire) has several unique features which postulates 
 different kind of requirements for Peer-to-Peer system. First, Storm stores 
data
 as append-and-delete only blocks, which are immutable byte sequences. Second, 
Storm 
 uses urn-5 random strings for binding concepts to data. Finally, all data is 
identified
@@ -1606,17 +1604,14 @@
 globally unique identifiers for locating data. Furthermore, tightly structured
 overlays provides guaranteed data lookup and has very efficient lookup 
protocols,
 which are essential to xanalogical model to be usable in distributed 
environment.
-
 Table \ref{table_comparison_approach} lists the key feature of both approaches.
 
+
 \scriptsize
 \begin{longtable}{|l|l|l|}
 
-\caption[Comparison of loosely structured and tightly structured 
approaches]{Comparison of loosely structured and tighly structured approaches} 
-\label{table_comparison_approach} 
-
 
-\\ \hline 
+\hline 
 \multicolumn{1}{|c|}{\textbf{Property}} &
 \multicolumn{1}{c|}{\textbf{Unstructured}} & 
 \multicolumn{1}{c|}{\textbf{Structured}}  
@@ -1698,8 +1693,13 @@
 \\ \hline
 
 
+\caption{Comparison of loosely structured and tighly structured approaches} 
+\label{table_comparison_approach} 
+
+
 \end{longtable}
 \normalsize
+
 
 
 
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.82 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.83
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.82   Tue Feb 25 
04:01:51 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Tue Feb 25 
08:52:46 2003
@@ -1809,13 +1809,13 @@
        url = {http://www.ida.liu.se/~rosgr/p2psecurity.html}   
 }
 
address@hidden,
address@hidden,
        author = "Frank Dabek and Ben Zhao and Peter Druschel and Ion Stoica",
        title = "A Common API for Structured Peer to Peer Overlays",
-       howpublished = "Talk at OceanStore/ROC/Sahara Winter Retreat", 
-       month = jan,
-       year = 2003,
-       url = 
{\url{http://www.cs.berkeley.edu/~ravenben/tapestry/apis-1-03.pdf}},
+       booktitle = {The 2nd International Workshop on Peer-to-Peer Systems 
(IPTPS'03)}, 
+       month = {February},
+       year = {2003},  
+       url = {http://iptps03.cs.berkeley.edu/final-papers/api.ps},
 }
 
 %Schema based access control
@@ -1960,3 +1960,11 @@
        howpublished = {http://project-iris.net/}
 }
 
address@hidden,
+       author ={Daswani, Neil; Garcia-Molina, Hector},
+       title = {Query-Flood DoS Attacks in Gnutella},
+       booktitle = {In Proceedings of the ACM Transactions on Information 
Systems ({TOIS '02})},
+       year = {2002},  
+       url = 
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-26&format=pdf&compression=}
+
+}