[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/13 08:19:00

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.137&tr2=1.138&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/progradu.bib.diff?tr1=1.108&tr2=1.109&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.137 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.138
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.137      Thu Mar 
13 06:23:49 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Thu Mar 13 
08:18:54 2003
@@ -1,5 +1,5 @@
 %***********************
-%   K?ytet??n gradu2-tyyliluokkaa
+%   Käytetään gradu2-tyyliluokkaa
 %***********************
 \documentclass[a4paper,12pt, english]{gradu2}
 
@@ -15,7 +15,7 @@
 \usepackage{verbatim}
 
 %***********************
-%   Tyyliluokan pakolliset m??ritykset
+%   Tyyliluokan pakolliset määritykset
 %***********************
 \title{Fenfire in Peer-to-Peer Environment}
 
@@ -67,7 +67,7 @@
 \begin{document}
 
 %***********************
-%   Sis?llysluettelo
+%   Sisällysluettelo
 %***********************
 
 \mainmatter
@@ -79,72 +79,60 @@
 \chapter{Introduction}
 
 Peer-to-Peer systems have recently received considerable attention in both 
-academia and industry for a number of reasons. First, the lack of 
centralization 
+academia \cite{projectirisurl} and industry \cite{p2pworkinggroup}, 
\cite{jxtaurl} for a 
+number of reasons. The lack of centralization 
 means that the participants can form a distributed system without any 
investment to 
-centralized, high-priced hardware which would coordinate it. Second, 
Peer-to-Peer
-provides new direct way to achieve interoperability between network 
participants. 
-Finally, the distributed and ad-hoc nature of Peer-to-Peer improves scalability
-and reliability againts certain kinds of faults (e.g., single point of 
failure).
+centralized hardware which would coordinate it by sharing their services
+and connecting to each other directly. Additionally, the distributed and ad 
hoc nature of 
+Peer-to-Peer improves scalability and avoids single points of failure.
 
 There are many definitions of Peer-to-Peer networks. The Intel Peer-to-Peer 
 Working Group defines it as ''the sharing of computer resources 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
-systems. Schollmeier \cite{schollmeier01p2pdefinition} characterizes a 
Peer-to-Peer network as a system of 
-distributed entities that share their own resources (e.g. CPU time or storage 
space). 
-To summarize, Peer-to-Peer systems can be characterized as distributed 
-systems in which all communication is symmetric and all participants entities 
have identical 
-capabilities and responsibilities. Each entity, i.e., \emph{peer}, may 
contribute data or 
-computing resources (e.g., unused storage) to the overall system and the 
welfare 
-of the community can scale with the number of participants. Thus, each 
participant 
-rely on one another's services and resources, rather than solely relying on 
dedicated 
-and centralized infrastructure. 
-
-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 
key properties. We observe
-that despite of great amount of proposed Peer-to-Peer systems, all systems 
fall either to
+Dave Winer \cite{winer00whatisp2p} describes Peer-to-Peer systems as
+''The user's machine is a client and a server''. 
+Schollmeier \cite{schollmeier01p2pdefinition} characterizes a Peer-to-Peer 
system as a system of 
+distributed entities that share their own services. Thus, Peer-to-Peer systems 
can be characterized as distributed 
+systems in which all communication is symmetric and all participants entities 
have similar 
+capabilities and responsibilities. Each entity, i.e., \emph{peer}, may 
contribute services 
+to the overall system.
+
+In this thesis, we\footnote{Use of the plural is customary even if research 
+paper is authored solely.} review existing Peer-to-Peer approaches, algorithms 
and their key properties. 
+We observe that despite of great amount of proposed Peer-to-Peer systems, all 
systems fall either to
 loosely structured approach or tightly structured approach. We also discuss 
open problems in 
 Peer-to-Peer systems and divide problems into three sub-categories: security 
problems, 
-performance problems and miscellaneous problems. In the end, we summarize all 
-problems in easy-to-understand tables. 
+performance problems and miscellaneous problems.  
 
-Next, we give an overview of Fenfire hypermedia system, which implements 
xanalogical storage model. We
-also describe briefly Storm software module of Fenfire system, which is an 
essential part of Fenfire's
-Peer-to-Peer functionality. We evaluate existing Peer-to-Peer approaches and
-choose the best alternative to Fenfire's needs. We discover that Fenfire, 
xanalogical model and
-tightly structured Peer-to-Peer approach all have similar method to deal with 
data,
-i.e., globally unique identifiers. Finally, we propose system model for 
Fenfire in Peer-to-Peer
+Next, we give an overview of Fenfire project. Fenfire project is an attempt to 
build hyperstructured,
+seamlessly interoperating desktop environment. Additional features of Fenfire 
include innovative user 
+interfaces for viewing data and usage of Peer-to-Peer networking for network 
transparency. In Fenfire, 
+all data is stored in the same format, i.e., data blocks.  All blocks have 
globally unique 
+identifiers and they can be referred by other blocks, i.e., pointer blocks. 
+
+After overview, we evaluate existing Peer-to-Peer approaches and
+choose the best alternative to Fenfire's needs. Finally, we propose system 
model for Fenfire in Peer-to-Peer
 environment and present yet simple but efficient algorithms to be used for 
data lookups in 
 Peer-to-Peer environment. 
 
-To our knowledge, this thesis is the most comprehensive work with regard to 
summarizing 
-existing algorithms and open problems in Peer-to-Peer domain. However, this
-thesis is not meant to be detailed work. More detailed information can be 
found from genuine
-publications written by original authors.
-
-\section{Research problems}
+We have attempted to comprehensively summarize existing algorithms and open 
problems in 
+Peer-to-Peer domain. However, this thesis is not meant to be detailed work. 
More detailed 
+information can be found from references written by original authors.
 
 There are three research problems related to this thesis. First research 
problem
-is to find the most efficient way to locate and fetch Fenfire related data 
from the 
-Peer-to-Peer network, where Storm scroll block's identifier is given. Second, 
we want
-to find the most efficient way to locate and fetch most recent Fenfire related 
data from the
-Peer-to-Peer network, which is associated with a given pointer random string. 
Third problem
-is otherwise same as the second problem, except we want to locate and fetch 
all Fenfire
-related data from the Peer-to-Peer network, where given date and/or time range 
is given.
+is to find the most efficient way to locate and fetch Fenfire data blocks from 
the 
+Peer-to-Peer network, where block's identifier is given. Second, we want
+to find the most efficient way to locate and fetch most recent Fenfire data 
block from the
+Peer-to-Peer network referred by a pointer block. Third problem
+is otherwise same as the second problem, except we want to locate and fetch 
Fenfire
+data block from the Peer-to-Peer network, where given date and/or time range 
is given.
 
-\section{Thesis overview}
 This thesis is structured as follows. In next chapter, we give an overview of
-existing Peer-to-Peer approaches, algorithms and key differences. In chapter 
3, we
+existing Peer-to-Peer approaches, algorithms and key differences between them. 
In chapter 3, we
 address open problems in Peer-to-Peer domain and divide problems into three
 sub-categories. Chapter 4 gives an overview of Fenfire system. In chapter
-5, we evaluate existing Peer-to-Peer approaches with regard to Fenfire system, 
propose a system
-model for Fenfire in Peer-to-Peer environment and present simple algorithms to 
perform data 
-lookups in Peer-to-Peer environment. In addition, we discuss possible problems 
of using Fenfire
-in Peer-to-Peer environment. In chapter 6, we present conclusions and future 
work.
+5, we evaluate existing Peer-to-Peer approaches with regard to Fenfire system. 
+In chapter 6, we present conclusions and future work.
 
 
 \chapter{Peer-to-Peer architectures}
@@ -582,8 +570,6 @@
 \endfoot
 
 
-\\ \hline
-
 \parbox{90pt}{Queries} &
 \parbox{100pt}{Uncontrolled} &
 \parbox{100pt}{Controlled}  
@@ -1656,9 +1642,14 @@
 
 \section{Overview}
 
-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 
+Fenfire project \cite{fenfireurl} is an effort to build a location 
transparent, hyperstructured desktop 
+environment. Fenfire's uses xanalogical storage model \cite{ted-xu-model} as a 
basis for hyperstructured
+media. Fenfire uses innovative user interfaces for displaying data to the end 
users. All data in Fenfire
+is stored in same format, i.e., blocks. This should allow making references 
between data easier and more 
+seamlessly interoperating than in other systems. For location transparency in 
a distributed system, Fenfire 
+uses Peer-to-Peer network for locating and fetching blocks.
+
+Fenfire is free software and it is licensed under GNU L-GPL.  Fenfire was 
formerly also a implementation 
 of the ZigZag\texttrademark --structure, which was originally invented 
 by Ted Nelson. Now, however, Fenfire uses Resource Description Framework (RDF) 
\cite{w3rdfurl}
 for representing internal data structures and their relationships. 
@@ -1925,7 +1916,7 @@
 are sensitive to certain attacks (e.g., DDoS attack). Additionally, we prefer 
\emph{abstraction}
 level analysis as very recently better and better tightly structured 
algorihtms have been proposed. 
 Thus, we don't want to bind our system proposal to a specific algorithm 
definitively as we expect 
-that this development continues.   
+that this development continues.
 
 In the following subsections we assume that we know the structure of 
 ''virtual file'' before hand, i.e., when assembling a ''virtual file'', we 
know all Storm 
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.108 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.109
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.108  Thu Mar 13 
06:23:49 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Thu Mar 13 
08:18:58 2003
@@ -1928,7 +1928,7 @@
        title = {Tree Hash EXchange format ({THEX})},   
        howpublished = 
{http://open-content.net/specs/draft-jchapweske-thex-01.html}
 }
-
+j
 @inproceedings{merkle87hashtree,
        author = {R. C. Merkle},
        title = {A digital signature based on a conventional encryption 
function},