[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/03/04 06:05:58

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

Log message:
        Programming guidelines, social behaviour, simulating p2p systems

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.107 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.108
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.107      Tue Mar 
 4 05:00:17 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Mar  4 
06:05:58 2003
@@ -1018,9 +1018,9 @@
 
 Currently, trust in Peer-to-Peer systems is based on \emph{reputation}. 
Current repuation methods focus either
 on the semantic properties, or data management properties of the trust model. 
Some research has been 
-done on reputation models in Peer-to-Peer systems, such as 
\cite{aberer01trust}. Implementations
-include Advogato \cite{advogatourl}. None of the current proposals or 
implementations based on reputation address trust
-in a trustworthy way.
+done on reputation models in Peer-to-Peer systems, such as 
\cite{aberer01trust}, \cite{cornelli02reputableservents}. 
+Implementations include Advogato \cite{advogatourl}. None of the current 
proposals or implementations 
+based on reputation address trust in a reliable way.
 
 Optimal solution for trust in Peer-to-Peer systems would be certificate based 
security methods.
 Quite recently, widely used Public Key Infrastructure (PKI) has been deployed 
in distributed
@@ -1248,7 +1248,7 @@
 
 
 
-\cite{crespo02semanticoverlay}
+
 Locality \cite{keleher-02-p2p}
 
 
@@ -1286,7 +1286,6 @@
 While it is expected that web-like searches can be layered on top of tightly 
structured overlay, much
 more research is required to make indexing and searching more efficient.
 
-\cite{ramanathan02goodpeers}
 
 Improve Freenet performance with small worlds \cite{zhang02using}
 
@@ -1354,34 +1353,49 @@
 
 \section{Miscellaneous problems in Peer-to-Peer}
 
-\subsection{Frameworks}
-
-\cite{zhao03api}
-\cite{frise02p2pframework}
-\cite{babaoglu02anthill}
-\cite{rhea03benchmarks}
-
-\subsection{Social behaviour}
-\cite{cornelli02reputableservents}
-\cite{oram01harnessingpower}
-\cite{golle01incentivesp2p}
-
-Notes from from \cite{hearn02mojonation}
-
-1) Attack resistance
-2) malicious nodes
-3) mutual distrust
-4) motivation to cooperate
+In this section we discuss miscellaneous problems related to Peer-to-Peer 
systems.
 
+\subsection{Programming guidelines and benchmarks}
 
+All existing Peer-to-Peer systems have rather different interfaces even they 
common points and 
+components. More important, all existing Peer-to-Peer systems incompatible 
with each other. One
+of the most important area of future research is to create common programming 
abstractions, i.e.
+interfaces, design patters and frameworks. Also, equal benchmarks are needed 
for comparing
+different algorithms. Recently, there have been few proposals towards common 
programming
+guidelines. This list includes \cite{zhao03api}, \cite{frise02p2pframework}, 
\cite{babaoglu02anthill}.
+Early experiments with Peer-to-Peer benchmarking include 
\cite{ratnasamy02routing} and \cite{rhea03benchmarks}.
 
-\subsection{Usage patterns}
-\cite{saroiu02measurementstudyp2p}
-\cite{krishnamurthy01earlymeasurements}
-
-Research on *usage patterns* haven't been done. However, there have been some 
research
-focusing on file popularity in in www and p2p networks: file popularity 
follows the zipf/harmonical distribution)
+\subsection{Social behaviour}
 
+Very frequent assumption in Peer-to-Peer systems is that peers are willing to 
cooperate. Another belief 
+is that all peers would behave equally, i.e. all peers both consume resources 
and contributes resources.
+However, these assumptions are not true as several studies show peers rather 
consume than contribute and
+and peers are unwilling to cooperate \cite{saroiu02measurementstudyp2p}, 
\cite{oram01harnessingpower}, 
+\cite{hearn02mojonation}. 
+
+Somewhat surprisingly little research has been in this area, especiaclly when 
considering 
+the possible impact of this \emph{unwanted socical behaviour} to performance 
of Peer-to-Peer 
+system. However, problem is addressed by Golle et al. 
\cite{golle01incentivesp2p}. Some 
+research has been focused on semantic properties of the overlay in order to 
increase 
+cooperation among participating peers \cite{crespo02semanticoverlay}. 
Ramanathan et al. 
+\cite{ramanathan02goodpeers} and Bernstein et al. \cite{bernstein03selection} 
use 
+empirical metrics and decision trees when teaching peers to make better 
decisions
+when contacting other peers in Peer-to-Peer system. Alpine is an example of
+Peer-to-Peer system, which uses empirical metrics for peer selection.
+
+
+\subsection{Simulating the Peer-to-Peer system}
+
+Very little research has been done on simulating the global Peer-to-Peer 
system. Presumably, this
+is due to complex nature of Peer-to-Peer system, which makes comprehensive 
simulations very 
+diffucult. Floyd et al. has been studying the simulation of the Internet in 
\cite{504642}. Authors
+state that simulating the Internet is very challenging task, because of 
Internet's heterogeneity
+and rapid change. Obviously, these factors exist also in Peer-to-Peer system 
even with higher
+rates.
+
+As long as global simulations of Peer-to-Peer systems are lacking, we cannot 
we make any further
+analysis e.g., on usage patterns in Peer-to-Peer systems. Presumedly, however, 
we can assume that
+queries follow the Zipf-like distributions both in the Internet and in 
Peer-to-Peer systems.
 
 \section{Summary}
 
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.94 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.95
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.94   Tue Mar  4 
05:00:17 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Tue Mar  4 
06:05:58 2003
@@ -2090,5 +2090,25 @@
 }
 
 
- 
address@hidden,
+       author = {Daniel Bernstein and Zhengzhu Feng and Brian Levine and 
Shlomo Zilberstein},
+       title = {Adaptive Peer Selection},
+       booktitle = {The 2nd International Workshop on Peer-to-Peer Systems 
(IPTPS'03)},
+       month = {February},
+       year = {2003},  
+       url = 
{http://iptps03.cs.berkeley.edu/final-papers/adaptive_selection.pdf}
+}
+
address@hidden,
+        title = {Difficulties in simulating the internet},
+        journal = {IEEE/ACM Transactions on Networking (TON)},
+        volume = {9},
+        number = {4},
+        year = {2001},
+        issn = {1063-6692},
+        pages = {392--403},
+        doi = {http://doi.acm.org/10.1145/504640.504642},
+        publisher = {ACM Press},
+}
+