gzz-commits
[Top][All Lists]

 From: Hermanni Hyytiälä Subject: [Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert... Date: Mon, 17 Mar 2003 06:42:02 -0500

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/03/17 06:42:01

Modified files:

Log message:
Better intro

CVSWeb URLs:

Patches:
17 05:06:11 2003
06:42:01 2003
@@ -43,10 +43,10 @@
In this thesis, we review existing Peer-to-Peer approaches, algorithms and
their
key properties. We summarize open problems in Peer-to-Peer systems and divide
problems into three sub-categories. We observe that there are many
-problems, which have no solutions at all, or problems that have proposed
-solutions but they are practically unrealizable.
+problems which have no solutions at all, or problems that have proposed
+solutions but which are practically unrealizable.

-Then, we give an overview of Fenfire system.  We evaluate existing
+Then, we give an overview of the Fenfire system.  We evaluate existing
Peer-to-Peer approaches-- loosely and tightly structured overlays-- with regard
to Fenfire's needs. Finally, we propose simple methods to efficiently find
Fenfire
data from Peer-to-Peer network.
@@ -81,8 +81,8 @@
\chapter{Introduction}

Peer-to-Peer systems have recently received considerable attention in both
\cite{jxtaurl} for a
-number of reasons. The lack of centralization
+academia \cite{projectirisurl} and industry \cite{p2pworkinggroup, jxtaurl}
for a
+number of reasons. The lack of centralization in Peer-to-Peer systems
means that the participants can form a distributed system without any
investment to
centralized hardware which would coordinate it by sharing their services
hoc nature of
@@ -91,14 +91,14 @@
There are many definitions of Peer-to-Peer networks. Schollmeier
\cite{schollmeier01p2pdefinition}
describes Peer-to-Peer system as a system of
distributed entities that share their own services. Indeed, Peer-to-Peer
systems can be characterized as distributed
-systems in which all communication is symmetric and all participants entities
have similar
+systems in which all communication is symmetric and all participant entities
have similar
capabilities and responsibilities. Each entity, i.e., \emph{peer}, may
contribute services
to the overall system.

-Fenfire project is an attempt to build hyperstructured, seamlessly
interoperating desktop
-environment. In Fenfire, all data is stored in the same format, i.e., data
blocks.
-All blocks have globally unique identifiers and they can be referred by other
blocks, i.e.,
-pointer blocks. Additional features of Fenfire include innovative user
+The Fenfire project is an attempt to build hyperstructured, seamlessly
interoperating desktop
+environment. In Fenfire, all data is stored as data blocks.
+All data blocks have globally unique identifiers and they can be referred by
pointer blocks.
+Other features of Fenfire include innovative user
interfaces for viewing data and usage of Peer-to-Peer networking for network
transparency.

In this thesis, we\footnote{Use of the plural is customary even if research
@@ -106,33 +106,33 @@
choose the best alternative to Fenfire's needs.

We start by reviewing existing Peer-to-Peer approaches, algorithms and their
key properties.
-We observe that despite of great amount of proposed Peer-to-Peer systems, all
systems fall either to
+We observe that despite the great amount of proposed Peer-to-Peer systems, all
systems fall either to
loosely structured approach or tightly structured approach. We also discuss
open problems in
Peer-to-Peer systems and divide problems into three sub-categories: security
problems,
performance problems and miscellaneous problems.

Then, we give an overview of Fenfire project, and evaluate Peer-to-Peer
approaches to Fenfire's
-needs. Finally, we propose yet simple but efficient methods to be used for
data lookups in Peer-to-Peer
+needs. Finally, we propose simple but yet efficient methods to be used for
data lookups in Peer-to-Peer
environment.

-We have attempted to comprehensively summarize existing algorithms and open
problems in
+We attempt to comprehensively summarize existing algorithms and open problems
in
Peer-to-Peer domain. However, this thesis is not meant to be detailed work.
More detailed
-information can be found from references written by original authors.
+information can be found from the references.

-There are three research problems related to this thesis. First research
problem
-is to find the most efficient way to locate and fetch Fenfire data blocks from
the
-Peer-to-Peer network, where block's identifier is given. Second, we want
-to find the most efficient way to locate and fetch most recent Fenfire data
block from the
-Peer-to-Peer network referred by a pointer block. Third problem
-is otherwise same as the second problem, except we want to locate and fetch
Fenfire
-data block from the Peer-to-Peer network, where given date and/or time range
is given.
+There are three research problems discussed in this thesis. First research
problem
+is to find the most efficient way to locate and fetch Fenfire data blocks from
a
+Peer-to-Peer network, where the block's identifier is given. Second, we want
+to find the most efficient way to locate and fetch the most recent Fenfire
data block from a
+Peer-to-Peer network referred by a pointer block. The third problem
+is otherwise the same as the second problem, except we want to locate and
fetch the Fenfire
+data block, where date and or time range is given.

-This thesis is structured as follows. In next chapter, we give an overview of
+This thesis is structured as follows. In the next chapter, we give an overview
of
existing Peer-to-Peer approaches, algorithms and key differences between them.
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 Fenfire system. In chapter
5, we evaluate existing Peer-to-Peer approaches with regard to Fenfire system.
-Finally, in chapter 6 we present conclusions and future work.
+Finally, in chapter 6 we conclusions and future work.

\chapter{Peer-to-Peer architectures}