[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/04 07:25:19

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

Log message:
        Updates

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.109 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.110
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.109      Tue Mar 
 4 06:56:30 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Mar  4 
07:25:17 2003
@@ -45,8 +45,7 @@
 problems, which have not solutions at all, or problems have proposed
 solutions, but they are practically unrealizable.
 
-Then, we give an overview of our Fenfire system and describe modules essential
-to Fenfire's Peer-to-Peer functionality. We evaluate existing
+Then, we give an overview of our Fenfire system.  We evaluate existing
 Peer-to-Peer approaches-- loosely and tightly structured overlays-- with regard
 to Fenfire's needs. Finally, we propose simple algorithms to efficiently find 
Fenfire
 related data from Peer-to-Peer network.
@@ -58,10 +57,9 @@
 on olemassa useita ongelmia, joihin ei ole ratkaisua lainkaan, tai on ehdotelma
 ongelman ratkaisemiseki, mikä kuitenkin käytännössä on mahdotonta toteuttaa.
 
-Tämän jälkeen annamme yleiskuvan Fenfire-järjestelmästämme ja kuvaamme 
-vertaisverkkotoiminnallisuuden kannalta Fenfiren tärkeimmät ohjelmamoduulit.
-Ar-vioimme olemassaolevia vertaisverkkoarkkitehtuureja- löyhästi ja tiukasti
-rakennettuja päällysverkkoja- Fenfiren vaatimusten valossa. Lopuksi ehdotamme
+Tämän jälkeen annamme yleiskuvan Fenfire-järjestelmästämme.
+Arvioimme olemassaolevia vertaisverkkoarkkitehtuureja-- löyhästi ja tiukasti
+rakennettuja päällysverkkoja-- Fenfiren vaatimusten valossa. Lopuksi ehdotamme
 yksin-kertaisia algoritmeja, joiden avulla voidaan tehokkaasti löytää
 vertaisverkosta tietoa Fenfire:n liittyen.
 }
@@ -89,8 +87,9 @@
 and reliability againts certain kinds of faults (e.g., single point of 
failure).
 
 There are many definitions of Peer-to-Peer networks. The Intel Peer-to-Peer 
-Working Group defines is as ''the sharing of computer resources and defines
-and services by direct exchange between systems''. Dave Winer 
\cite{winer00whatisp2p} lists several
+Working Group defines it as ''the sharing of computer resources and defines
+and services by direct exchange between systems'' \cite{p2pworkinggroup}. 
+Dave Winer \cite{winer00whatisp2p} lists several
 properties of Peer-to-Peer network, while most notably the statement 
 ''The user's machine is a client and a server'' describes best Peer-to-Peer
 networks. To summarize, Peer-to-Peer systems can be characterized as 
distributed 
@@ -104,7 +103,7 @@
 One of the most important properties of any distributed computing system are 
efficient 
 data lookup and security. In this thesis, we\footnote{Use of the plural is 
customary even if research paper is authored solely.}
 focus on these aspects in Peer-to-Peer domain.
-Specifically, we review existing Peer-to-Peer approaches, algorithms and their 
properties. We observe
+Specifically, we review existing Peer-to-Peer approaches, algorithms and their 
key properties. We observe
 that despite of greate amount of proposed Peer-to-Peer systems, all systems 
fall either
 loosely structured approach or tightly structured approach. Then, we discuss 
open problems in 
 Peer-to-Peer networks and divide problems into three sub-categories: security 
related problems, 
@@ -312,9 +311,9 @@
 scalable and effective. 
 
 
-\subsection{Formal definition}
+\subsection{Sketch of formal definition}
 
-In this subsection we formalize loosely strucured overlays main components. 
This
+In this subsection we formalize loosely strucured overlay's main components. 
This
 model is based on original Gnutella overlay network with power-law 
improvements.
 
 Let $S$ be the aggregate of all services $s$ in system. Let $P$ be the 
aggregate of 
@@ -322,9 +321,9 @@
 expressed as $p = provider(s)$. Every $p$ has neighbor(s), named as 
$neighbor$, which 
 is $P$ = \{$p \in P: \exists neighbor$, which is randomly chosen from $P$\}.
 Super peer is a peer, which hosts the indices of other peers, $sp = 
summaryindex(provider(s))$.
-Morover, $\forall$ reqular peer, $p$, there is super peer, which has has a 
index of regular
+Moreover, $\forall$ reqular peer $p$, there is super peer, which has has a 
index of regular
 peer's content, specifically $ps$, $P$ = \{$p \in P: \exists ps$, 
-where $ps$ = $summaryindex(provider(s)) \bigwedge (p = provider(s))$\}
+where $ps$ = $summaryindex(provider(s)) \wedge (p = provider(s))$\}
 
 
 \section{Tightly structured}
@@ -474,7 +473,11 @@
 \end{figure}
 
 
-\subsection{Formal definition}
+\subsection{Sketch of formal definition}
+
+In this subsection we formalize tightly strucured overlay's main features. The 
model
+describes basic features of tightly structured overlay, i.e. identifiers, 
identifier
+space and mapping function.
 
 Let $S$ be the aggregate of all services $s$ in system. Let $P$ be the 
aggregate of 
 all peers $p$ in system. Let $I$ be the aggregate of all identifiers $i$ in 
system. 
@@ -483,15 +486,14 @@
 is defined as $i = identifier(s)$. Metric space is defined as a pair $(IS,d)$, 
where $d$
 is the distance between two coordinate points $ip_i$, $ip_j$ in $IS$ space. 
Mapping 
 function is defined as $map: I \longmapsto IS$, and coordinate point as 
-$ip = map(identifier(s))$, which maps service, expressed by a identifier to 
coordinate 
+$ip = map(identifier(s))$, which maps data items, expressed by a identifier to 
coordinate 
 point $ip$ in $(IS,d)$. Peer's p resources are mapped onto a set $IS$ = \{$ip 
\in IS: 
-\exists s \in S$, $ip = map(identifier(s)) \bigwedge (provider(s) = p)$\}., 
+\exists s \in S$, $ip = map(identifier(s)) \wedge (provider(s) = p)$\}., 
 which means that resources that a peer provides into the system are not kept 
locally.
 Every $p$ has neighbor(s), named as $neighbor$, which are $P$ = \{$p \in P: 
\exists neighbor$, 
 where $difference(p,p_neighbor)= close$, and  $close$ is minimal difference 
$d$ in $(IS,d)$\}.
 
 
-
 \section{Summary}
 
 In this section we compare loosely structured approach and tightly structured 
approach.
@@ -1276,8 +1278,13 @@
 In this section we summarize open problems in Peer-to-Peer systems. All open 
problems entries 
 listed in this section are not necessarily mentioned in the previous sections. 
This is because
 we discussed only the most significant problems earlier. Problems listed here 
are variations
-of previously mentioned problems, or otherwise related to them.
+of previously mentioned problems, or otherwise related to them. For each 
entry, there is brief
+description of the problem, possible solutions and comments respectively.
 
+Next, we list open problems in Peer-to-Peer domain. In table 
\ref{table_security_problems_Peer-to-Peer} 
+we list open problems related to security; in table 
\ref{table_performanceusability_problems_Peer-to-Peer}, 
+we list problems related to performance; in table 
\ref{table_Miscellaneous_problems_Peer-to-Peer}, 
+we list miscellaneous open problems.
 
 
 \scriptsize
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.96 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.97
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.96   Tue Mar  4 
06:56:30 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Tue Mar  4 
07:25:17 2003
@@ -927,8 +927,7 @@
 
 %definition of p2p
 @misc{p2pworkinggroup,
-       key = {Peer-to-Peer Working Group},
-       author = {Ross Lee Graham},
+       key = {Peer-to-Peer Working Group},     
        title = {Peer-to-Peer Working Group},
        howpublished = {www.p2pwg.org}
 }