[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/28 07:36:15

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

Log message:
        Fenfire overview

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.96 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.97
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.96       Fri Feb 
28 05:24:51 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Fri Feb 28 
07:36:15 2003
@@ -437,8 +437,8 @@
 
 Kademlia, Pastry and Tapestry uses balanced tree-like 
 data structures. Figure \ref{fig:kademlia_lookup} shows the process of Kademlia
-data lookup. Viceroy maintains a butterfly data structure, which requires 
-only constant number of neighbor peers while providing $O(\log{n})$ data lookup
+data lookup. Viceroy maintains a butterfly data structure (see e.g., 
\cite{226658}), 
+which requires only constant number of neighbor peers while providing 
$O(\log{n})$ data lookup
 efficiency. Koorde, recent modification of Chord, uses de Bruijn graphs to 
maintain
 local routing tables. Koorde requires each peer to have only about two links 
to other
 peers to to provide $O(\log{n})$ performance.
@@ -550,7 +550,7 @@
 have support for keyword search and fuzzy search. On the other, tightly 
structured systems support
 only exact key lookups as each data item is identified by unique keys.
 
-In the end, both systems have open problems and issues. We will discuss these 
aspect more detail in 
+In the end, both systems have open problems and issues. We will discuss these 
aspects more detail in 
 chapter 3. Table \ref{table_comparison_approach} lists key differences between 
loosely structured 
 approach and tightly structured approach.
 
@@ -1644,16 +1644,43 @@
 
 \chapter{Fenfire hypermedia system}
 
+In this chaper we give an overview of Fenfire system and its objectives. We 
also 
+describe briefly xanalogical model. At the end of this chapter we study Storm, 
+Fenfire's software module, which is an essential part of Fenfire's 
Peer-to-Peer 
+functionality. 
+
 \section{Overview}
 
-\section{Objectives}
+Fenfire project \cite{fenfireurl} is an effort to build a distributed, 
hyperstructured user 
+interface system. Fenfire is licenced under GNU L-GPL. It's main goal is to 
implement
+xanalogical storage model \cite{ted-xu-model}. Fenfire was formely also an 
implementation 
+of the ZigZag\texttrademark --structure, which was originally invented 
+by Ted Nelson. Now, however, Fenfire uses Resource Description Framework 
\cite{w3rdfurl}
+for representing internal data structures and their relationships. 
 
-\cite{thompson01hypermedia}
-\cite{wiil02p2phypertext}
-\cite{bouvin02openhypermedia}
+Fenfire is high modular software system. It consists of several independent 
software modules:
+
+\begin{itemize}
+\item \textbf{Storm}: distributed storage module for storing arbitrary data 
items
+\item \textbf{UMLLinker}: UML based tool for generating software documentation 
 
+\item \textbf{Xu-Storm}: xanalogical hypertext built upon Storm storage model
+\item \textbf{GLMosaicText}: flexible OpenGL interface for font manipulation
+\item \textbf{CallGL}: wrapping library used for OpenGL calls
+\item \textbf{LibVob}: graphic library used for creating navigation interfaces 
in complex data views
+\end{itemize}
+
+In this thesis, we focus on Storm module, since it's the foundation of 
Fenfire's Peer-to-Peer
+functionality.
 
 \section{Xanalogical model}
 
+Xanalogical storage \cite{nelson99xanalogicalneeded} is different kind of 
model for 
+presenting data and relationships between data. While in World Wide Web links 
are
+between \emph{documents}, in xanalogical model links are between individual 
+\emph{characters}.
+
+
+
 4.1. Xanalocical model (some parts from our article, modify)
 Xanalocical model [cite] is a simple, but rather different model for 
representing content. 
 Project Xanadu [cite] has been a pioneer implementing xanalogical model. In 
xanalocical model
@@ -1677,7 +1704,7 @@
     * Documents can be created by listing new content or transcluding existing 
content in an enfilade.
     * Annotations can be entered as new content and Xanadu-linked to a part of 
document.
 
-\cite{nelson99xanalogicalneeded}
+
 
 \section{Storm}
 
@@ -1756,7 +1783,11 @@
 Storm uses SHA-1 \cite{fips-sha-1} hash over the contents of a block for 
creating globally 
 unique identifiers. SHA-1 is considered 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. 
+efficiently find a specific scroll block if it is available in the network.
+
+\cite{thompson01hypermedia}
+\cite{wiil02p2phypertext}
+\cite{bouvin02openhypermedia} 
 
 
 \section{Objectives}
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.87 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.88
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.87   Fri Feb 28 
04:09:15 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Fri Feb 28 
07:36:15 2003
@@ -1978,3 +1978,36 @@
         year = "2001",  
         url = 
"http://www.cs.berkeley.edu/~ravenben/publications/pdf/bayeux.pdf";
 }
+
address@hidden,
+       key = {Fenfire project},
+       title = {Fenfire project},
+       howpublished = {http://www.gzz.info and http://www.nongnu.org/fenfire/}
+}
+
address@hidden,
+       author = {Sandeep N. Bhatt and Fan R. K. Chung and Jia-Wei Hong and F. 
Thomson Leighton and Bojana Obrenic and Arnold L. Rosenberg and Eric J. 
Schwabe},
+       title = {Optimal emulations by butterfly-like networks},
+       journal = {Journal of the ACM (JACM)},
+       volume = {43},
+       number = {2},
+       year = {1996},
+       issn = {0004-5411},
+       pages = {293--330},
+       doi = {http://doi.acm.org/10.1145/226643.226658},
+       publisher = {ACM Press},
+}
+
address@hidden,
+       author = {Ted Nelson},
+       title = {Deep hypertext: the {X}anadu{\textregistered} model},
+       howpublished = {\url{http://xanadu.net/xuTheModel/}},
+       year = 2001,
+}
+
address@hidden,
+       key = {Resource Description Framework},
+       title = {Resource Description Framework},
+       howpublished = {http://www.w3.org/RDF/}
+}
+