[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/24 07:21:37

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

Log message:
        Started evaluate chapter

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.62 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.63
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.62       Mon Feb 
24 04:56:58 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Mon Feb 24 
07:21:37 2003
@@ -504,8 +504,8 @@
 {{\tablename\ \thetable{} -- continued from previous page}} \\
 \hline 
 \multicolumn{1}{|c|}{\textbf{Property}} &
-\multicolumn{1}{c|}{\textbf{Unstructured}} &
-\multicolumn{1}{c|}{\textbf{Structured}}
+\multicolumn{1}{c|}{\textbf{Loosely structured}} &
+\multicolumn{1}{c|}{\textbf{Tightly structured}}
 \\ \hline 
 \endhead
 
@@ -1511,6 +1511,16 @@
 
 \chapter{Evaluation of Peer-to-Peer for Gzz}
 
+In this chapter we evaluate Gzz in Peer-to-Peer enviroment.
+We start by giving an overview of Gzz 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 
+initial analsysis and discuss possible problems.
+
+
+
+Fething videos, pictures, music and other media:
 
 -BitTorrent is not a lookup system-- it's a tool for *distributing* data
 -MIT License, written in Python
@@ -1537,16 +1547,37 @@
    2. To describe a serialization format for storage and transmission of hash 
trees.
    
    
+   
    \cite{mohr02thex}
    \cite{overneturl}
    \cite{edonkey2kurl}
 
 \section{Overview}
 
--need to make Gzz distributed system
+As we mentioned in previous chapter (ref), xanalogical document is a virtual
+document, in where parts of the document (i.e. scroll blocks) are fetched from 
a 
+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
+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 
+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}
+data lookup to locate and fetch scroll blocks by using 
\emph{location-independent} 
+identifiers.
+
+Storm uses SHA-1 \cite{fips-sha-1} hash over the contents of a block for 
creating globally 
+unique identifiers. SHA-1 is consired a collision free hash function, so it's 
very unlikely 
+that two different scroll blocks would have same identifiers. Obviously, Storm 
has to 
+efficiently find a specific scroll block if it is available in the network. 
+
 
 \section{Objectives}
 
+We use
+
 2.1  "Searching for a specific Storm block"
 
 2.1.1 Facts
@@ -1576,6 +1607,7 @@
 %-in every block's header, there is a timestamp for date&time
 
 2.2.2. Objectives
+
 -Find the specific (and the most recent) Storm block as quicly as possible 
(and return it to the user) based on the given urn-5 with a block's ID
 -simple pseudo thinking: "find all Storm blocks from the network, which uses 
specific urn-5 name. Compare blocks and 
 return the most recent block, if the signing key is "valid"."
@@ -1592,6 +1624,26 @@
 
 \section{Special needs}
 
+Storm (and therefore Gzz) 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
+by globally unique identifiers.
+
+With regard to Storm, the most important requirement for Peer-to-Peer system 
+is to capability to performa a global scale data lookup, since xanalogical 
+model assumes that scroll blocks are fetched from a global block repository. 
+Moreover, Peer-to-Peer system has to support location-independent identifiers 
(and
+location independent routing), since Storm uses SHA-1 based identifiers
+for identifying scroll blocks. Of course, Peer-to-Peer infrasctructure has to 
be 
+scalable, efficient, adaptive, robust, self-organising and resistant againts 
DDoS 
+attacks. Additionally, if possible, it would be benefitial if Peer-to-Peer 
system 
+would represent all named resources keys.
+
+
+
+
+
 Gzz's requirements
 -append-and-delete (when a modification has been commited, a new version must 
be created)
 -the same data block can be stored to many different locations (can we use 
'How share a secret ?', like in Publius and Tangler ?)
@@ -1602,19 +1654,6 @@
 -do we have a support for transcopyright ?
 
 
-%[2003-02-21T12:40:48Z] <hemppah/#gzz> one question about pointers and pointer 
blocks:
-%[2003-02-21T12:41:19Z] <hemppah/#gzz> In which order does urn-5 random 
string, pointer block and scroll block is created ?
-%[2003-02-21T12:41:45Z] <hemppah/#gzz> or, to be more specific:
-%[2003-02-21T12:42:22Z] <hemppah/#gzz> when one creates urn-5 random string, 
does storm automatically create a (dummy) pointer block, or
-%[2003-02-21T12:42:47Z] <tuomasl2/#gzz> certainly not
-%[2003-02-21T12:42:53Z] <hemppah/#gzz> when scroll block is created, 
associated with a given urn-5, then ?
-%[2003-02-21T12:43:06Z] <tuomasl2/#gzz> yes
-%[2003-02-21T12:43:08Z] <benja/#gzz> scroll blocks are not pointed to by 
pointer blocks
-%[2003-02-21T12:43:16Z] <benja/#gzz> do you mean blocks containing documents?
-%[2003-02-21T12:43:26Z] <hemppah/#gzz> yes, regular data blocks
-%[2003-02-21T12:43:52Z] <benja/#gzz> then it's 1) urn-5, 2) document block, 3) 
pointer block
-%[2003-02-21T12:44:14Z] <hemppah/#gzz> ok, that's way I thought it
-%[2003-02-21T12:44:15Z] <benja/#gzz> and for the next version, only document 
block and then pointer block
 
 
 P2P network requirements
@@ -1797,10 +1836,9 @@
        +blocks have unique IDs, they can be used as keys in DHT, it's a 
natural choice
        +DHT will find a resource, if it exists in a network
        +for a specific urn-5, we could find all associated block information 
from a single peer
-       -for every urn-5, there is one permanent ID
+       -for every urn-5, there is one permanent pointer block (with ID)
        -for every version of block, there is one permanent ID
-       -for every version of xu link, there is one permanent ID (does 
transclusion have different versions ?)
-       -for every version xu transclusion, there is one permanent ID (does 
links have different versions ?) 
+        
 
 
 \bibliographystyle{gradu}
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.79 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.80
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.79   Mon Feb 24 
04:56:58 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Mon Feb 24 
07:21:37 2003
@@ -228,7 +228,7 @@
        howpublished = {http://www.shareaza.com}
 }
 
address@hidden,
address@hidden,
        key = {eDonkey2000},
        title = {eDonkey2000},
        howpublished = {http://www.edonkey2000.com}