[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/26 07:27:35

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

Log message:
        Introduction, research problems, thesis overview

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.79 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.80
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.79       Wed Feb 
26 04:35:10 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Wed Feb 26 
07:27:35 2003
@@ -80,55 +80,73 @@
 
 \chapter{Introduction}
 
-Peer-to-Peer (Peer-to-Peer) systems can be characterized as distributed 
systems in which all 
-communication is symmetric and all participants have identical capabilities 
and responsabilities. 
-Each participant may contribute data or computing resources (such as unused 
storage) to the overall 
-system, and the welfare of the community can scale with ne number of 
participants. Therefore each 
-participant rely on one another services and resources, rather than solely 
relying on dedicated 
-centralized infracstructure. 
-
-Peer-to-Peer systems have recently received significant attention in both 
academia and industry for a number 
-of reasons. First, the lack of decentralization means that participants can 
form a Peer-to-Peer system without any 
-investment to high-priced hardware to coordinate it. Moreover, Peer-to-Peer 
systems provides aggregation of enormous 
-resources and way to achieve interoperability. Finally, the distributed nature 
of Peer-to-Peer improves scalability 
-and reliability againts certain kinds of faults, e.g. single point of failure.
-
-footnote:use of the plural is customary even if research paper is authored 
solely
+Peer-to-Peer systems have recently received noteworthy attention in both 
+academia and industry for a number of reasons. First, the lack of 
centralization 
+means that participants can form a distributed system without any investment 
to 
+centralized, high-priced hardware which would to coordinate it. Second, 
Peer-to-Peer
+provides new, direct way to achieve interoperability between network 
participants. 
+Finally, the distributed and ad-hoc nature of Peer-to-Peer improves scalability
+and reliability againts certain kinds of faults (e.g., single point of 
failure).
+There are many definitions of Peer-to-Peer networks. The Intel Peer-to-Peer 
+Working Group defines is as ''the sharing of computer resources and defines
+and services by direct exchange between systems''. Dave Winer 
\cite{winer00whatisp2p} lists several
+properties of Peer-to-Peer network, while most notably the statement 
+''The user's machine is a client and a server'' describes best Peer-to-Peer
+networks. 
+
+To summarize, Peer-to-Peer systems can be characterized as distributed 
+systems in which all communication is symmetric and all participants have 
identical 
+capabilities and responsabilities. Each \emph{peer} may contribute data or 
+computing resources (e.g., unused storage) to the overall system and the 
welfare 
+of the community can scale with ne number of participants. Thus, each 
participant 
+rely on one another services and resources, rather than solely relying on 
dedicated 
+and centralized infracstructure. 
+
+One of the most important properties of any distributed computing system are 
efficient 
+data lookup and security. In this thesis, we \footnote{Use of the plural is 
customary even if research paper is authored solely.}
+focus on these aspects in Peer-to-Peer domain.
+Specifically, we review existing Peer-to-Peer approaches, protocols and their 
properties. We observe
+that despite of greate amount of proposed Peer-to-Peer systems, all systems 
fall either
+loosely structured approach or tightly structured approach. Then, we discuss 
open problems in 
+Peer-to-Peer networks and divide problems into three sub-categories: security 
related problems, 
+performance related problems and miscellaneous problems. In the end, we 
summarize all 
+problems in easy-to-understand tables. 
+
+Next, we give an overview of our Fenfire system, which implements xanalogical 
storage model. We
+also describe briefly Storm design and urn-5 concept, which are essential to 
Fenfire's
+Peer-to-Peer functionality. We evaluate existing Peer-to-Peer approaches and
+choose the best alternative to our needs. Finally, we propose effective but 
yet simple
+algortihms to be used  with our Fenfire system in Peer-to-Peer environment. 
+
+To our knowledge, this thesis is the most comprehensive work with regard to 
summarizing 
+existing Peer-to-Peer protocols and open problems in Peer-to-Peer domain. 
However, this
+thesis is not meant to be detailed work. More information can be found from 
genuine
+publications written by original authors.
 
 \section{Research problems}
 
-
-
- a)* Mist? riippuu ja kuinka nopeaa nykyisill? algoritmeilla
-           on tietyn storm-blokin haku mist? tahansa?
-
-       --> Distributed hash, esim. CAN, Chord jne. (Overview)
-
-           - summarize current research, specifically on problems
-             where we cannot trust any servers, and where 
-             probability distributions for the blocks are used.
-             Bibtex references.
-        
-        b)* Mist? riippuu ja kuinka nopeaa nykyisill? algoritmeilla
-           on tiettyyn urn-5 -nimeen liitetyn uusimman blokin haku
-           (jossa uusin blokki allekirjoitettu annetulla avaimella)
-
-        c)* Mist? riippuu ja kuinka nopeaa nykyisill? algoritmeilla
-           on tiettyyn urn-5 -nimeen liitetyn annettuna aikana
-           olleen blokin haku ("Hesarin etusivu 3.6.-02")?
-           (jossa blokki allekirjoitettu annetulla avaimella)
-
-       *=Näiden jälkeen voidaan miettiä, voidaanko systeemiä tehdä
-       ilman hierarkiaa (Tumbler).
-       
-       "Mistä riippuu" = Skaalautuvuus (verkokoko, datamäärä, levinneisyys, 
verkon kytkeytyvyys)
-
+There are three research problems related to this thesis. First research 
problem
+is to find the most efficient way to locate and fetch Fenfire related data 
from the 
+Peer-to-Peer network, where Scroll block's identifier is given. Second, we want
+to find the most efficient way to locate and fetch most recent Fenfire related 
data from the
+the Peer-to-Peer network, which is associated with a given urn-5 random 
string. Final problem
+is otherwise same as the second problem, except we want to locate and fetch 
all Fenfire
+related data from the Peer-to-Peer network, where given date and/or time range 
is given.
+
+When comparing different Peer-to-Peer approaches and protocols, we will 
examine their
+scalability, efficiency, space requirements for neighbor connections and 
overhead
+associated with system maintenance. When we have solutions to our research
+problems, we will use best solutions as examples in our algorithm proposals.
 
 \section{Thesis overview}
-
-definition \cite{p2pworkinggroup}
-definition \cite{graham02lecture}
-definition \cite{winer00whatisp2p}
+This thesis is structured as follows. In next chapter, we give an overview of
+existing Peer-to-Peer approaches, protocols and key differences. In chapter 3, 
we
+address open problems in Peer-to-Peer domain and divide problems into three
+sub-categories. Chapter 4 gives an overview of our Fenfire system. In chapter
+5 we evaluate existing Peer-to-Peer approaches with regard to Fenfire system 
and
+propose simple algorithms perform data lookups in Fenfire's Peer-to-Peer 
enviroment. 
+We also discuss open issues and future work. Finally, we present conclusions 
in chapter
+6.
 
 \chapter{Peer-to-Peer schemes}
 
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.84 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.85
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.84   Wed Feb 26 
03:14:41 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Wed Feb 26 
07:27:35 2003
@@ -883,7 +883,7 @@
        author = "Dejan S. Milojicic and Vana Kalogeraki and Rajan Lukose and 
Kiran Nagaraja1
                and Jim Pruyne and Bruno Richard and Sami Rollins and Zhichen 
Xu",
        title = "Peer-to-Peer Computing",
-       institution = "Hewlett-Packard",
+       institution = "Hewlett-Packard",winer
        number = "HPL-2002-57", 
        year = 2002,
        url = "http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf";