[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/03/12 05:58:45

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

Log message:
        2nd ispell round

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.129 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.130
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.129      Wed Mar 
12 02:47:26 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Wed Mar 12 
05:58:45 2003
@@ -232,7 +232,7 @@
 peers can form the overlay network based on \emph{local} knowledge. Figure 
\ref{fig:gnutella_overlay}
 illustrates how peers form an overlay network. Initially, peer 1 creates the 
overlay, since
 it's the first participating peer. Then, repeatly new peers join the network 
and connects to
-other nodes in a random manner. Thus, gnutella can be considered as a 
variation of \emph{random graph}.
+other nodes in a random manner. Thus, Gnutella can be considered as a 
variation of \emph{random graph}.
 
 \begin{figure}
 \centering
@@ -243,7 +243,7 @@
 
 
 In Gnutella, each participating peer maintains local index of its own shared 
content. Also,
-each peer has a few connections to other peer, i.e., peer's \emph{neighbors}. 
Basic gnutella
+each peer has a few connections to other peer, i.e., peer's \emph{neighbors}. 
Basic Gnutella
 data lookup works as follows: peer broadcasts a query request to its 
neighbors, which in turn
 forwards the query to their neighbors. This leads in the situation where 
number of messages
 in the network can grow with $O(n^{2})$, where $n$ is the number of 
participating peers in the
@@ -395,7 +395,7 @@
 ''resource peer'' in the overlay network for each resource item pair it 
publishes.
 
 PeerNet differs from other tightly structured overlays in that it operates
-at the \emph{network} level layer. Peernet makes an explicit distinction 
+at the \emph{network} level layer. PeerNet makes an explicit distinction 
 between peer identity and address, which is not supported by standard
 TCP/IP-protocols. Otherwise, PeerNet has the same performance properties
 as other tightly structured overlays, i.e., $O(\log{n})$ space required
@@ -530,7 +530,7 @@
 logarithmic properties in real-life applications or not.}. 
 
 Another key point is the philosophy how overlay network is constructed and 
maintained. While loosely 
-structured approach gives much freedom to invidual peers to join and leave the 
overlay network, tightly 
+structured approach gives much freedom to individual peers to join and leave 
the overlay network, tightly 
 structured approach has certain features, in which participating peers have no 
control at all 
 (such as mapping of data items). 
 
@@ -1652,7 +1652,7 @@
 
 \section{Overview}
 
-Fenfire project \cite{fenfireurl} is an effort to build a distributed, 
hyperstructured user 
+Fenfire project \cite{fenfireurl} is an effort to build a distributed, hyper 
structured user 
 interface system. Fenfire is free software and it is licensed under GNU L-GPL. 
Fenfire's main goal 
 is to implement xanalogical storage model \cite{ted-xu-model}. Fenfire was 
formerly also a implementation 
 of the ZigZag\texttrademark --structure, which was originally invented 
@@ -1750,7 +1750,7 @@
 In practice, pointer is random string, which resembles Universal Resource 
Names 
 (URN) \cite{rfc2396}. Pointers are created automatically by Storm and each 
pointer is 
 associated with a collection of \emph{pointer blocks}. Pointer block has a 
single 
-target for the pointer. In figure \ref{fig:storm_model}, we present overal 
+target for the pointer. In figure \ref{fig:storm_model}, we present overall 
 pointer creation process. Pointer block may contain zero or more obsoleted 
 pointer blocks, i.e., when a new version of scroll block is created, it 
supersedes 
 one older version which has been created in the past. The most current pointer 
@@ -1808,7 +1808,7 @@
 
 Some research regarding to these problem has been made by Lukka et al. 
 \cite{lukka02freenetguids}. Authors' work is mainly based on insight of 
implementing
-xanalogical model in Peer-to-Peer enviroment with globally unique identifiers. 
Lukka et al.
+xanalogical model in Peer-to-Peer environment with globally unique 
identifiers. Lukka et al.
 use Freenet \cite{clarke00freenet} as a example Peer-to-Peer system supporting 
 globally unique identifiers. The work presented in this thesis extends their 
work by 
 evaluating different Peer-to-Peer systems more extensively to Fenfire's needs.