[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/25 06:42:04

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

Log message:
        Open issues and future work

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.69 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.70
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.69       Tue Feb 
25 06:03:29 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Feb 25 
06:42:04 2003
@@ -1863,11 +1863,36 @@
 
 \section{Open issues and future work}
 
--identification
--search engine & fake blocks
--transclusions and filtering
--xanadu links and filtering
+One of the most important issues in Peer-to-Peer networks is the fact that
+online entities cannot be identified and verifyied safely. For our purposes
+this is a problem when user wants to perform global search with a given
+urn-5 random string. For instance, how user is able to verify the correctness
+of the search results ? Which one is the correct scroll block ? Furthermore,
+if user downloads data to local computer and wants to verify \emph{offline}
+that data really came from the entity which it was supposed to. These problems
+are not only limited to our Storm design, it concerns all Peer-to-Peer
+based computer systems. However, we believe this problem is solved in a near 
+future as Peer-to-Peer networks will come more and more important in 
+computing world.
 
+Our future work includes support for searching transclusions and xanalogical
+links in a Peer-to-Peer network. Specifically, we want to find transclusions
+or xanalogical links in a global scale. Preliminary analysis have showed
+that these questions are rather different than locating scroll or pointer
+blocks \emph{directly} from the network. Techiques used in distributed 
+database systems may prove to be useful. However, more research is needed
+in this area. 
+
+In the following months, we will implement a working Storm Peer-to-Peer 
+prototype. Potential candidates for tightly structured overlays are 
+Kademlia \cite{maymounkov02kademlia}, Koorde \cite{kaashoek03koorde} and
+Chord \cite{stoica01chord}. One possibility for future work is to 
+implement multisource downloading, which would creatly improve the 
+performance of fetching large amounts of scroll blocks from the network.
+Additionally, we will likely use both DHT and DOLR methods when performing
+data lookups in the network. DOLR is used under normal condition and DHT
+when inviduals wants mirror their data to other peers. Again, future work
+os required how to implement this sensibly way.
 
 
 \cite{gribble01p2pdatabase}