[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/05 07:32:50

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

Log message:
        Added \cites

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex.diff?tr1=1.28&tr2=1.29&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/progradu.bib.diff?tr1=1.63&tr2=1.64&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/research_problems.diff?tr1=1.41&tr2=1.42&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.28 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.29
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.28       Thu Dec 
12 09:32:30 2002
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Wed Feb  5 
07:32:50 2003
@@ -4,7 +4,7 @@
 \documentclass[a4paper,12pt]{gradu2}
 
 \usepackage[T1]{fontenc}
-\usepackage[finnish]{babel}
+\usepackage[english]{babel}
 \usepackage{palatcm}     %  Palatino/Computer modern fontti
 \usepackage{amsmath}     %  AmS-LaTeX konstruktiot (align, aligned,...)
 \usepackage{amsfonts}    %  AmS-LaTeX fontit
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.63 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.64
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.63   Wed Feb  5 
06:50:09 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Wed Feb  5 
07:32:50 2003
@@ -841,7 +841,7 @@
  }
 
 %PAST storage utility
address@hidden rowstron01storage,
address@hidden,
     author = "Antony I. T. Rowstron and Peter Druschel",
     title = "Storage Management and Caching in {PAST}, A Large-scale, 
Persistent Peer-to-peer Storage Utility",
     booktitle = "Symposium on Operating Systems Principles",
@@ -879,6 +879,14 @@
        howpublished = {http://cubicmetercrystal.com/alpine/}
        
 }
+
+%BitTorrent - tool for downloading data from multpile hosts
address@hidden,
+       key = {BitTorrent},
+       title = {BitTorrent},
+       howpublished = {http://bitconjurer.org/BitTorrent/}
+}
+
 @misc{uclaseminar,     
        title = {{UCLA} Lecture Series - Peer-to-Peer Computing: Turning an 
Exciting Social Revolution into Boring Academic Research, 
        {A}lgorithmic Problems Related to Internet Protocols and Peer-to-Peer 
Networks},
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.41 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.42
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.41      Wed Feb 
 5 06:50:09 2003
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Wed Feb  5 
07:32:50 2003
@@ -40,15 +40,16 @@
 -Of couse, there is the possibility to route in constant times, but it 
requires that *each** node
 maintains information about all the nodes in the network. Therefore , 
practically, this method 
 impossible
--Example systems: Chord, CAN, Kademlia, Pastry, Tapestry, Viceroy, Symphony, 
SkipNet, Skip Graph
--Example applications: CFS, PAST, Oceanstore
+-Example systems: Chord \cite{stoica01chord}, CAN \cite{ratnasamy01can}, 
Kademlia \cite{maymounkov02kademlia}, Pastry \cite{rowston01pastry}, Tapestry 
\cite{zhao01tapestry}, Viceroy \cite{malkhi02viceroy}, Symphony 
\cite{gurmeet03symphony}, SkipNet \cite{harvey03skipnet2}, Skip Graph 
\cite{AspnesS2003}
+               Plaxton \cite{plaxton97accessingnearby}, Kelips 
\cite{gupta03kelips}, Overlapping Distance Halving DHT \cite{naor03simpledht}
+-Example applications: CFS \cite{dabek01widearea}, PAST 
\cite{rowstron01storage}, Oceanstore \cite{kubiatowicz00oceanstore}
 
 *Update*
 -Viceroy system achieves O(log n) hops with only O(1) neighbors
 -Isn't yet clear whether these improvements will interfere with the robustness
 -More on this later...
 
-1.2. Small World Networks (SWN)
+1.2. Small World Networks (SWN) \cite{kleinberg99small, nips02-Kleinberg}, 
\cite{bonsma02swan}
 +fast routing (aka searching)
 +quite scalable, however not as scalable as DHTs
 +robust
@@ -80,23 +81,20 @@
 And, if these requirements are met, SWN network can locate any data in O(log^2
 n) hops (Kleinberg and e.g. simulations in SWAN) 
 
-1.3. Flooding Broadcast Networks (FBN)
+1.3. Flooding Broadcast Networks (FBN) and Hybrid systems
 +own resources are not mapped into the network
 +keyword/fuzzy search possible
--not scalable
--huge network traffic
--not fast routing 
--no guarantee that all data will be located
-
--Example systems: Gnutella, Fastrack family (Kazaa, Morpheus), JXTA Search, 
Gnutella2
-
-1.4. Hybrid systems (HS)
 -based on FBNt technique, 
 +solves some of the Gnutella's scalability issues by introducing ``Super 
nodes'' (a superNode acts like a local hub, building an index 
 of the resources being shared by each node connected to it and proxying lookup 
queries on behalf of other nodes)
 +this kind of structure reduces network traffic in comparison to a original 
broadcast query algorithm employed on the Gnutella system
+-not scalable
+-huge network traffic
+-not fast routing 
+-no guarantee that all data will be located
 
--Example systems: FastTrack (Kazaa, Morpheus), Gnutella2, JXTA
+-Example systems: Gnutella \cite{gnutellaurl}, Fastrack family (Kazaa, 
Morpheus) \cite{fasttrackurl}, JXTA Search \cite{botros01jxtasearch}, Gnutella2 
\cite{gnutella2url, shareazaurl},
+YAPPERS \cite{ganesan02yappers}
 
 1.5  Social Discovery Systems (SDS)
 Notice: pros and cons are not presented here
@@ -105,7 +103,7 @@
 -as in real social life, nodes who have returned relevant results in the past, 
will have a high quality value in future query lookups
 -with every lookup query, a node determines how proficient a given node is to 
another node's objectives
 
--Example systems: Alpine Network
+-Example systems: Alpine Network \cite{alpineurl}
 
 
 1.6. Skip Graphs (based on skip lists)
@@ -144,9 +142,9 @@
 -we don't have to create 'mini-blocks' for Gzz p2p, since bitTorrent itself 
partitions data into several blocks for us
 -my initial suggestion for our p2p data obtaining scheme: use Kademlia for 
data lookup and bitTorrent/MFTP-like tool for downloading the data
 
-See http://bitconjurer.org/BitTorrent/ for details.
+See http://bitconjurer.org/BitTorrent/ for details. \cite{bittorrenturl}
 
-1.9. PeerNet
+1.9. PeerNet \cite{eriksson03peernet}
 Notice: pros and cons are not presented here
 -Peernet is a p2p based *network layer* for large networks
 -Peernet makes an explicit distinction between node identity and address