gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert...


From: Hermanni Hyytiälä
Subject: [Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert...
Date: Wed, 05 Mar 2003 06:31:32 -0500

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/03/05 06:31:32

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

Log message:
        More problem overview

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.113 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.114
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.113      Wed Mar 
 5 05:25:36 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Wed Mar  5 
06:31:31 2003
@@ -1755,50 +1755,54 @@
 
 In this chapter we evaluate Fenfire in Peer-to-Peer environment.
 We start by giving a problem overview when considering Fenfire in Peer-to-Peer
-environment. We define Fenfire's objectives and special needs. Finally, we
-evaluate different peer-to-peer approaches with regard to Fenfire, and propose 
-initial algorihms for obtaining Fenfire specific data from Peer-to-Peer overlay
-network.  
+environment. Then, we define Fenfire's objectives and special needs in 
Peer-to-Peer
+environment. Finally, we evaluate different peer-to-peer approaches with 
regard 
+to Fenfire, and propose initial algorihms for obtaining Fenfire specific data 
+from Peer-to-Peer overlay network.  
+
 
-In the following sections, we don't respond to security issues. We assume 
-that either system has a reliable techique for identifying invidual entities, 
or
-there are no hostile entities in the system.
 
 
 \section{Problem overview}
 
 As already mentioned in chapter 4, xanalogical document is a ''virtual
-file'', in which parts of the document (i.e. scroll blocks) are fetched from a 
+file'', in which parts of the document are fetched from a 
 \emph{global} data repository. Thus, system implementing xanalogical model 
\emph{must}
 support global data lookups efficiently in order to assemble a ''virtual file''
 from fragments of data. 
 
 In the xanalogical storage model, each fragment of data is identified by a 
globally 
-unique identifier. As we discussed already in chapter 4, Fenfire's Storm 
design 
+unique identifier. In Fenfire, data fragments are scroll blocks of Storm 
storage module.
+As we discussed already in chapter 4, Fenfire's Storm design 
 uses SHA-1 \footnote{SHA-1 is considered a collision free hash function. 
Therefore, it is 
 very unlikely that two different Storm scroll blocks would have same 
identifier.} 
-\cite{fips-sha-1} hash over the contents of a block for creating globally 
unique 
-identifiers.  In our scenario, fragments of data is distributed throughout the 
Peer-to-Peer
-overlay. Moreover, our task is to locate and fetch (i.e. obtain) \emph{all}
-Storm scroll blocks, associated to a specific ''virtual file'', from 
Peer-to-Peer
-overlay as efficiently as possible. In addition to \emph{direct} scroll block 
obtaining using
-globally unique identifier of Storm block, we also must support 
\emph{indirect} obtaining of 
-Storm scroll block using pointer blocks.
-
-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 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, Fenfire's Storm module has to support 
\emph{global scale}
-data lookup to locate and fetch scroll blocks by using 
\emph{location-independent} 
-identifiers.
+\cite{fips-sha-1} hash over the contents of a scroll block for creating 
globally unique 
+identifiers for each scroll block.  In our scenario, fragments of data is 
distributed 
+throughout the Peer-to-Peer overlay. Our task is to locate and fetch 
+(i.e. obtain) \emph{all} Storm scroll blocks, associated to a specific 
''virtual 
+file'', from Peer-to-Peer overlay as efficiently as possible. In addition to 
+\emph{direct} scroll block obtaining using globally unique identifier of Storm 
block, 
+we also must support \emph{indirect} obtaining of Storm scroll block using 
pointer blocks.
+
+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.
+use Freenet \cite{clarke00freenet} as a example Peer-to-Peer system supporting 
+globally unique identifiers. This thesis presented here extends their work by 
+evaluating different Peer-to-Peer approaches more extensively to Fenfire's 
needs. 
+Additionally, related to non-xanalogical hypermedia systems, Thompson and de 
Roure 
+\cite{thompson01hypermedia} have studied locating documents and links in 
Peer-to-Peer
+environment. Bouving \cite{bouvin02openhypermedia} has done initial work 
regarding  
+ 
+
+In the following sections, we don't respond to security issues. We assume 
+that either system has a reliable techique for identifying invidual entities, 
or
+there are no hostile entities in the system.
 
 
 
-\cite{thompson01hypermedia}
 \cite{wiil02p2phypertext}
-\cite{bouvin02openhypermedia} 
+
 
 
 \section{Objectives}




reply via email to

[Prev in Thread] Current Thread [Next in Thread]