gzz-commits
[Top][All Lists]
Advanced

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

[Gzz-commits] gzz/Documentation/Presentations/ThursdaySeminar...


From: Hermanni Hyytiälä
Subject: [Gzz-commits] gzz/Documentation/Presentations/ThursdaySeminar...
Date: Thu, 27 Mar 2003 03:45:10 -0500

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/03/27 03:45:10

Modified files:
        Documentation/Presentations/ThursdaySeminar03: 
                                                       p2p_presentation.tex 

Log message:
        almost done

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex.diff?tr1=1.4&tr2=1.5&r1=text&r2=text

Patches:
Index: gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex
diff -u 
gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex:1.4 
gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex:1.5
--- gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex:1.4  
Thu Mar 27 03:00:20 2003
+++ gzz/Documentation/Presentations/ThursdaySeminar03/p2p_presentation.tex      
Thu Mar 27 03:45:10 2003
@@ -23,8 +23,8 @@
 \fancyhf{} % Clear all fields
 \renewcommand{\headrulewidth}{0.2mm}
 \renewcommand{\footrulewidth}{0.2mm}
-\fancyhead[C]{Using P2P tehcnologies with Fenfire}
-\fancyfoot[L]{\tiny March 26, 2003}
+\fancyhead[C]{Using P2P technologies with Fenfire}
+\fancyfoot[L]{\tiny March 27, 2003}
 \fancyfoot[C]{\small InBCT Seminar}
 \fancyfoot[R]{\tiny Page \theslide}
 
@@ -41,11 +41,11 @@
 
 \pagestyle{fancy}
 
-\title{Fenfire and P2P}
+\title{Using P2P technologies with Fenfire}
 \author{Hermanni Hyyti\"al\"a \\ 
 {\rm Hyperstructure group} \\
 {\rm University of Jyv\"askyl\"a} }
-\date{March 26, 2003}
+\date{March 27, 2003}
 
 % ********************************************************
 
@@ -71,9 +71,10 @@
 \large
 {\bf Why and how ?}
 \begin{itemize}
-\item Location transparency
+\item Location transparency: hiding the heterogeneous and distributed nature 
of the system
+      so that it appears to the end user like one system
 \item Ad hoc: meet other people, change data
-\item Storm module is used for low level storage operations 
+\item Storm module is used for low level storage operations
 \item Alph module is used for xanalogical operations
 \end{itemize}
 \end{slide}
@@ -83,32 +84,80 @@
 \large
 {\bf P2P objectives}
 \begin{itemize}
-\item Find data from P2P network, i.e., building blocks of ''virtual document''
+\item Find data from P2P network, i.e., building blocks of xanalogical 
''virtual document''
+\item Find xanalogical links and transclusions from P2P network
 \item Scalable (billions of users)
-\item Efficient 
-\item Robust 
+\item Efficient (logarithmic efficiency)
+\item Robust against network failures, fault tolerant against hostile attack
 \end{itemize}
 \end{slide}
 
 
 \begin{slide}
 \large
-{\bf Open problems}
+{\bf Data identifiers in Fenfire P2P}
+\begin{itemize}
+
+\item Pointers are \emph{concept} of data (''The front page of the most recent 
+      version of New York Times newspaper'') 
+\item Blocks \emph{contain} the data (''New York Times newspaper, 10.10.2002, 
version 1.0'')
+\item Pointers are used for handling mutable data
+\item All identifiers are globally unique (pointers and blocks identifiers)
+\item Identifiers are unstructured and semantic free 
+\item Used in next generation Reference Resolution Services (RRS) ? [Shenker]
+\item Currently, Domain Name System (DNS) is a widely used RRS system in the 
Internet
+\end{itemize}
+\end{slide}
+
+
+\begin{slide}
+\large
+{\bf P2P schemes 1/2}
+\begin{itemize}
+\item There are only two approaches in which all modern Peer-to-Peer
+      systems fall: the loosely structured approach and the tightly structured 
approach
+\item Structure: how the connections between participating peers are created
+      and maintained 
+\item Loosely structured scheme: construction and the maintenance of the 
overlay is controlled 
+      loosely and the placement of services and the topology of overlay is 
random
+\item Tightly structured scheme: the overlay is constructed determistically, 
which all participating 
+      peers have to follow; the topology of the overlay and the placement of 
services is controlled tightly
+      
+\end{itemize}
+\end{slide}
+
+\begin{slide}
+\large
+{\bf P2P schemes 2/2}
+\begin{itemize}
+\item The tightly structured scheme is more efficient and scalable than the 
loosely structured approach
+\item Since both Fenfire and tightly structured overlays use globally unique 
identifiers for each data item,
+      it is feasible to use tightly structured overlays for locating Fenfire 
data efficiently
+\item The unstructured and semantic-free properties of data identifiers in 
Fenfire enables
+      the use of general purpose Reference Resolution Services (RRS) on top of 
the tightly structured 
+      overlay
+\item It is likely that the problems related to tightly structured overlays 
will be solved in the near future, because of wide and 
+      intensive co-operation among research groups       
+\end{itemize}
+\end{slide}
+
+ 
+\begin{slide}
+\large
+{\bf Open problems and future work}
 \begin{itemize}
 \item Security issues: entity identification
 \item Not only limited to the Fenfire system as it 
-      concerns all Peer-to-Peer computer system 
+      concerns all Peer-to-Peer computer system
+\item Find xanalogical transclusions and links from P2P network
+\item Implement a prototype
 \end{itemize}
 \end{slide}
 
 
-3. Future work
- -transclusions and xu-links from p2p
- -prototype
-
 \begin{slide}
 \large
-{\bf Papers}
+{\bf Papers regarding this topic}
 \begin{itemize}
 \item Hypertext 02: Lukka, Fallenstein (published)
 \item Hypertext 03: Lukka, Fallenstein, Hyyti\"al\"a, Alatalo (submitted)
@@ -119,49 +168,10 @@
 
 
 \begin{slide}
+\large
+\center
 {\bf Questions ?}
 \end{slide}
 
 
-
-
 \end{document}
-
-1. P2P and Fenfire
- -what is P2P  
- -P2P and Fenfire
-   -why (location transparency, ad hoc, no central control etc.)
-   -how (built on top of Storm, requires that Storm presentation is before 
this)
- -objectives
-   -find data from global data repository --> blocks are building blocks of
-    xu-document (enflilade)
-   -xu-links, xu-transclusions
-   -scalable (billions of users)
-   -efficient
-   -robust
- -explain pointers and block IDs (even if explained in Storm presentation)
-   -block ID: globally unique identifier (SHA-1)
-   -urn-5: consept to data mapping, several urn-5s can point to a single block,
-   perhaps the newspaper example
- -urn-5 and block IDs:
-  -semantic-free
-  -location independent
-  -next generation Reference Resolution Services (DNS) ?
-  -ref to recent publication by Shenker et al., IRIS-project
- -current p2p schemes
-  -quick overview
-  -loosely and tightly structured systems
-  -currently, what is the best scheme for Fenfire (and why)
- 
-2. Open problems
- -security issues
- -not only the problems of Fenfire
-
-3. Future work
- -transclusions and xu-links from p2p
- -prototype
-
-4. Published/sumbitted papers regarding this topic
- -HT'02 paper by Tuomas and Benja (published)
- -HT'03 paper by Tuomas, Benja, Toni and hemppah (submitted)
- -hemppah's MSc thesis 




reply via email to

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