[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/17 04:43:04

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

Log message:
        Updates

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.147 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.148
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.147      Fri Mar 
14 07:44:46 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Mon Mar 17 
04:43:03 2003
@@ -29,7 +29,8 @@
 
 \keywords{Peer-to-Peer, P2P, security, distributed systems, hypermedia systems}
 
-\avainsanat{Vertaisverkot, P2P, tietoturva, hajautetut järjestelmät, 
hypermedia-järjestelmät}
+\avainsanat{Vertaisverkot, P2P, tietoturva, hajautetut järjestelmät, 
hypermedia-
+järjestelmät}
 
 \contactinformation{\\
 Hermanni Hyytiälä\\
@@ -322,8 +323,8 @@
 structured overlays have been proposed.
 The list includes CAN \cite{ratnasamy01can}, Chord \cite{stoica01chord}, 
 Kademlia \cite{maymounkov02kademlia}, Kelips \cite{gupta03kelips}, 
-Koorde \cite{kaashoek03koorde}, ODHDHT \cite{naor03simpledht}, 
-Pastry \cite{rowston01pastry}, PeerNet \cite{eriksson03peernet}, 
+Koorde \cite{kaashoek03koorde}, Overlapping Distance Halving Distributed 
Hashtable 
+(ODHDHT) \cite{naor03simpledht}, Pastry \cite{rowston01pastry}, PeerNet 
\cite{eriksson03peernet}, 
 Skip Graphs \cite{AspnesS2003}, SkipNet \cite{harvey03skipnet2}, 
 Symphony \cite{gurmeet03symphony}, SWAN \cite{bonsma02swan}, Tapestry 
 \cite{zhao01tapestry}, Viceroy \cite{malkhi02viceroy} and others 
\cite{freedman02trie}. 
@@ -1312,7 +1313,8 @@
 
 
 
-\parbox{90pt}{Query routing \cite{sit02securitycons}, 
\cite{aspnes02faultrouting}, \cite{castro02securerouting}, 
\cite{ratnasamy02routing}, \cite{gavoille01routing}, 
\cite{lynch02atomicdataaccess}} &                        
+\parbox{90pt}{Query routing \cite{sit02securitycons}, 
\cite{aspnes02faultrouting}, \cite{castro02securerouting}, 
\cite{ratnasamy02routing}, \cite{gavoille01routing}, 
+\cite{lynch02atomicdataaccess}, \cite{fiat02censorship}, 
\cite{saia02dynamicfaultcontentnetwork}, \cite{datar02butterflies}} &           
      
 \parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} &
 \parbox{110pt}{Query monitoring, cross check routing tables, verify routing 
tables, create routing table invariants} &
 \parbox{110pt}{Increases system complexity} 
@@ -1334,34 +1336,27 @@
 
 
 \parbox{90pt}{Spam attack \cite{naor03simpledht}} &
-\parbox{110pt}{Hostile entity creates false versions of data} &
+\parbox{110pt}{Hostile entity creates false versions of data, or gives wrong 
information about the data which entity is responsible for/knows about} &
 \parbox{110pt}{Do not trust to single entity, get information from multiple 
entities, trust on majority's opinion} &
 \parbox{110pt}{Easy to implement, creates more network traffic} 
 \\ \hline
 
 
-\parbox{90pt}{Resource spoofing} &
-\parbox{110pt}{Hostile entity gives wrong information about the data which 
entity is responsible for/knows about} &
-\parbox{110pt}{Do not trust to single entity, get information from multiple 
entities, trust on majority's opinion} &
-\parbox{110pt}{Easy to implement, creates more network traffic} 
-\\ \hline
-
-
-\parbox{90pt}{Entity identification \cite{ajmani02conchord}} &
+\parbox{90pt}{Entity identification \cite{ajmani02conchord}, 
\cite{douceur02sybil}} &
 \parbox{110pt}{Identify participating entities reliably and efficiently        
} &
 \parbox{110pt}{Digital signatures, key infrastructure} &
 \parbox{110pt}{Not practically realizable}
 \\ \hline
 
 
-\parbox{90pt}{Data integrity/authenticity \cite{dabek01widearea}} &
+\parbox{90pt}{Data integrity/authenticity \cite{fips-sha-1}, 
\cite{rivest96sdsi}, \cite{spkiworkinggroup}} &
 \parbox{110pt}{Integrity/originality of data is unknown} &
 \parbox{110pt}{Cryptographic content hashes, key architectures} &
 \parbox{110pt}{For data integrity, there are working solutions, but for data 
authenticity, some of the solutions are partial, which may be practically 
realizable}
 \\ \hline
 
 
-\parbox{90pt}{Anonymity \cite{tarzan:ccs9}, \cite{pub00}, 
\cite{clarke00freenet}, \cite{reiter98crowds}, \cite{352607},\cite{502002}} &
+\parbox{90pt}{Anonymity \cite{dingledine00free}, \cite{tarzan:ccs9}, 
\cite{pub00}, \cite{clarke00freenet}, \cite{reiter98crowds}, 
\cite{352607},\cite{502002}} &
 \parbox{110pt}{Anonymity cannot be provided in all cases} &
 \parbox{110pt}{Remailers, pre-routing} &
 \parbox{110pt}{Total anonymity cannot be provided yet}
@@ -1369,7 +1364,7 @@
 
 
 \parbox{90pt}{Malicious peers \cite{sit02securitycons}, 
\cite{castro02securerouting}} &
-\parbox{110pt}{How to identify malicious peers in the system} &
+\parbox{110pt}{How to identify malicious peers in the system ?} &
 \parbox{110pt}{Create invariants for peer behavior, verify invariants, 
self-certifying data} &
 \parbox{110pt}{Partial solutions, self-certifying data most reliable}
 \\ \hline
@@ -1396,7 +1391,7 @@
 \\ \hline
 
 
-\parbox{90pt}{External security threats} &
+\parbox{90pt}{External security threats \cite{grahamp2psecurity}} &
 \parbox{110pt}{Viruses, trojans, sniffers} &
 \parbox{110pt}{Data integrity/authenticity, distributed anti virus software} &
 \parbox{110pt}{Not much research has been done on this}
@@ -1433,14 +1428,19 @@
 
 \endfoot
                
-\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, 
\cite{Bhattacharjee03resultcache}, \cite{362692}, 
\cite{CuencaAcuna2002DSIWorkshop}, \cite{rhea02probabilistic}, 
\cite{joseph02neurogrid}, \cite{crespo02semanticoverlay}, 
\cite{joseph02p2players}, \cite{chord:om_p-meng}} &
+\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, 
\cite{Bhattacharjee03resultcache}, \cite{362692}, 
\cite{CuencaAcuna2002DSIWorkshop}, 
+\cite{rhea02probabilistic}, \cite{joseph02neurogrid}, 
\cite{crespo02semanticoverlay}, \cite{joseph02p2players}, 
\cite{chord:om_p-meng},
+\cite{wittengigabytes}, \cite{338634}} &
 \parbox{110pt}{Perform Web like searches in Peer-to-Peer network} &
 \parbox{110pt}{Data compression, view trees, bloom filters and its variations, 
gap compression, index intersection optimizations, clustering} &
 \parbox{110pt}{Effective but complex solutions, some compromises have to be 
done (decrease result quality, modify overlay's structure), more research 
needed}
 \\ \hline
 
 
-\parbox{90pt}{Efficient and scalable data discovery 
\cite{lv02searchreplication}, \cite{osokine02distnetworks}, 
\cite{yang02improvingsearch}, \cite{lv02gnutellascalable}, 
\cite{ganesan02yappers}, \cite{adamic02localsearch}, 
\cite{adamic01powerlawsearch}, \cite{ripeanu02mappinggnutella}, 
\cite{milgram67smallworld}, \cite{adamic99small}, \cite{ramanathan02goodpeers}, 
\cite{kleinberg99small}, \cite{nips02-Kleinberg}, \cite{zhang02using}, 
\cite{watts00dynamics}} &
+\parbox{90pt}{Efficient and scalable data discovery 
\cite{lv02searchreplication}, \cite{osokine02distnetworks}, 
\cite{yang02improvingsearch}, \cite{lv02gnutellascalable}, 
+\cite{ganesan02yappers}, \cite{adamic02localsearch}, 
\cite{adamic01powerlawsearch}, \cite{ripeanu02mappinggnutella}, 
\cite{milgram67smallworld}, \cite{adamic99small}, 
+\cite{ramanathan02goodpeers}, \cite{kleinberg99small}, 
\cite{nips02-Kleinberg}, \cite{zhang02using}, \cite{watts00dynamics}, 
\cite{karger02findingnearest}, 
+\cite{brinkmann02compactplacement}, \cite{rhea02probabilistic}, 
\cite{castro02networkproximity}, \cite{ng02predicting}, 
\cite{pias03lighthouse}} &
 \parbox{110pt}{Find resources efficiently, if resource exists (loosely 
structured)} &
 \parbox{110pt}{Super peers, peer clusters, caching techniques} &
 \parbox{110pt}{More efficient, less network traffic, not comparable to the 
efficiency of tightly structured systems}
@@ -1448,13 +1448,13 @@
 
 
 \parbox{90pt}{Richness of queries \cite{harren02complex}, 
\cite{ansaryefficientbroadcast03}, \cite{andrzejak02rangequeries}} &
-\parbox{110pt}{Query languages should be more powerful} &
+\parbox{110pt}{Query languages should be more powerful in tightly structured 
overlays} &
 \parbox{110pt}{SQL-like queries} &
 \parbox{110pt}{Hard to implement, increases system complexity, not much 
research has been done}
 \\ \hline
 
 
-\parbox{90pt}{Robustness \cite{datar02butterflies}, 
\cite{saia02dynamicfaultcontentnetwork}, \cite{fiat02censorship}, 
\cite{aspnes02faultrouting}, \cite{albert-00-tolerance}} &
+\parbox{90pt}{Robustness \cite{datar02butterflies}, 
\cite{saia02dynamicfaultcontentnetwork}, \cite{fiat02censorship}, 
\cite{aspnes02faultrouting}, \cite{albert-00-tolerance}, 
\cite{libennowell01observations}} &
 \parbox{110pt}{How well system performs under hostile attacks/in the case of 
severe failure ?} &
 \parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law 
networks/properties} &
 \parbox{110pt}{Working solutions}
@@ -1514,7 +1514,7 @@
 \parbox{110pt}{Creates more overhead/space requirements per peer}
 \\ \hline
 
-\parbox{90pt}{Fail Stop} &
+\parbox{90pt}{Fail Stop \cite{rowston03controlloingreliability}, 
\cite{zhang03somo}} &
 \parbox{110pt}{A faulty peer stops working} &
 \parbox{110pt}{Failure detectors, informing algorithms} &
 \parbox{110pt}{Creates more network traffic, peer's information can be 
outdated, failure detectors not reliable}
@@ -1566,14 +1566,14 @@
 \\ \hline
 
 
-\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p}} &
+\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p}, 
\cite{ngan03enforcefile}, \cite{shneidman03rationality}} &
 \parbox{110pt}{All participants do not behave like they should be, instead 
they go for own profit} &
 \parbox{110pt}{Different reputation methods} &
 \parbox{110pt}{No real world experience in a wide scale}
 \\ \hline
 
 
-\parbox{90pt}{Heterogeneity \cite{saroiu02measurementstudyp2p}, 
\cite{brinkmann02compactplacement}, 
\cite{zhao02brocade},\cite{gurmeet03symphony}} &
+\parbox{90pt}{Heterogeneity \cite{saroiu02measurementstudyp2p}, 
\cite{brinkmann02compactplacement}, 
\cite{zhao02brocade},\cite{gurmeet03symphony}, 
\cite{rowston03controlloingreliability}} &
 \parbox{110pt}{There are different kind of peers in the system, in light of 
bandwidth and computing power} &
 \parbox{110pt}{Super peers (loosely structured), clusters (loosely structured) 
additional layer upon tighty structured systems, structure itself is simple 
(tighty structured)} &
 \parbox{110pt}{Working solutions, increases system complexity (additional 
layer)}
@@ -1587,7 +1587,7 @@
 \\ \hline
 
 
-\parbox{90pt}{Comprehensive simulations/analysis of Peer-to-Peer network} &
+\parbox{90pt}{Comprehensive simulations or analysis of Peer-to-Peer system} &
 \parbox{110pt}{Ability to simulate whole Peer-to-Peer network's usage 
patterns, network traffics, flux state etc.} &
 \parbox{110pt}{Use same techniques as simulating/analyzing the Internet} &
 \parbox{110pt}{Only small subsets of Peer-to-Peer networks has been analysed, 
because of ad hoc properties of network, more powerful solutions needed}