[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert...
|
From: |
Hermanni Hyytiälä |
|
Subject: |
[Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert... |
|
Date: |
Tue, 08 Apr 2003 07:39:23 -0400 |
CVSROOT: /cvsroot/gzz
Module name: gzz
Changes by: Hermanni Hyytiälä <address@hidden> 03/04/08 07:39:22
Modified files:
Documentation/misc/hemppah-progradu: masterthesis.tex
progradu.bib
Log message:
Continue Tommi's comments
CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex.diff?tr1=1.201&tr2=1.202&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/progradu.bib.diff?tr1=1.117&tr2=1.118&r1=text&r2=text
Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.201
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.202
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.201 Tue Apr
8 05:25:03 2003
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex Tue Apr 8
07:39:22 2003
@@ -296,7 +296,7 @@
approach the overlay is constructed deterministically, which all participating
peers have to follow; the topology of the
overlay and the placement of services is controlled tightly.
-\subsection{Definition}
+\subsection{Sketch of definition}
In this subsection, we try to introduce a \emph{sketch} of formal definition
of the tightly structured overlay, such as
identifiers, identifier space and the mapping function.
@@ -369,7 +369,7 @@
\ref{fig:kademlia_lookup} shows the process of Kademlia's
data lookup. Viceroy \cite{malkhi02viceroy} maintains a butterfly data
structure (e.g., \cite{226658}),
which requires only a constant number of neighbor peers while providing
$O(\log{n})$ data lookup
-efficiency. Koorde \cite{kaashoek03koorde}, a recent modification of Chord,
uses de Bruijn graphs
+efficiency, where $n$ is the number of peers in the system. Koorde
\cite{kaashoek03koorde}, a recent modification of Chord, uses de Bruijn graphs
\cite{debruijn46graph} to maintain local routing tables. It requires
each peer to have only about two links to other peers to provide $O(\log{n})$
performance.
@@ -471,7 +471,8 @@
which has initially published services into the overlay.
PeerNet \cite{eriksson03peernet} differs from other tightly structured
overlays in that it operates
-at the \emph{network} layer instead of application layer. This property would
provide a common interface
+at the \emph{network} layer instead of application layer (see the ISO-OSI
reference model, e.g., \cite{800902}).
+This property would provide a common interface
to all Peer-to-Peer systems using PeerNet. PeerNet makes an explicit
distinction
between peer identity and address, which is not supported by standard
TCP/IP-protocols. PeerNet has the same performance properties as other tightly
structured
@@ -542,7 +543,7 @@
\endfirsthead
\multicolumn{3}{c}%
-{{\tablename\ \thetable{} -- continued from previous page}} \\
+{{\tablename\ \thetable{} -- continued from the previous page}} \\
\hline
\multicolumn{1}{|c|}{\textbf{Property}} &
\multicolumn{1}{c|}{\textbf{Loosely structured}} &
@@ -609,9 +610,9 @@
Table \ref{table_Peer-to-Peer_algorithms} lists proposed Peer-to-Peer
algorithms
and their key properties with regard to performance and scalability. The list
includes algorithms from both loosely and tightly structured approaches. The
list doesn't
-include \emph{all} proposed Peer-to-Peer algorithms. Only the ones which
already have
+include \emph{all} proposed Peer-to-Peer algorithms; only the ones which
already have
been widely deployed, or the ones which may be promising in the future
-Peer-to-Peer systems are included in this thesis.
+Peer-to-Peer systems are included.
We decided to follow the guidelines from \cite{kaashoek03koorde} in measuring
the properties of different Peer-to-Peer systems. However, we dropped
@@ -641,7 +642,7 @@
\endfirsthead
\multicolumn{6}{c}%
-{{\tablename\ \thetable{} -- continued from previous page}} \\
+{{\tablename\ \thetable{} -- continued from the previous page}} \\
\hline
\multicolumn{1}{|c|}{\textbf{Algorithm}} &
\multicolumn{1}{c|}{\textbf{Insert/Delete}} &
@@ -659,15 +660,15 @@
\parbox{37pt}{$O$($d$)} &
\parbox{37pt}{$O(dn^{\frac{1}{d}})$} &
\parbox{85pt}{2$d$} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly. $d$ is the dimension of virtual key
space}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly. $d$ is the dimension of virtual key
space.}
\\ \hline
\parbox{37pt}{Chord \cite{stoica01chord}} &
\parbox{37pt}{$O(\log^2{n})$} &
-\parbox{37pt}{$O(\log{n}$} &
+\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{2$(\log{n})$} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly.}
\\ \hline
@@ -675,8 +676,8 @@
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(n)$} &
-\parbox{85pt}{Typical configuration e.g., {4--150}} &
-\parbox{85pt}{Average lookup performance is $O(\log{n})$ with tens of
thousands concurrent users, beyond that, the performance is $O(n)$}
+\parbox{85pt}{Typical configuration e.g., {4--150}.} &
+\parbox{85pt}{Average lookup performance is $O(\log{n})$ with tens of
thousands concurrent users; beyond that, the performance is $O(n)$.}
\\ \hline
@@ -684,8 +685,8 @@
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(n)$} &
-\parbox{85pt}{Typical configuration is 5 connections (2*5=10 total), however,
this depends on implementation} &
-\parbox{85pt}{Number of messages can grow as fast as $O(n^{2})$}
+\parbox{85pt}{Typical configuration is 5 connections (2*5=10 total), however,
this depends on implementation.} &
+\parbox{85pt}{Number of messages can grow as fast as $O(n^{2})$.}
\\ \hline
@@ -694,7 +695,7 @@
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{$2(\log{n})$} &
-\parbox{85pt}{There is no action required when peers leave the system}
+\parbox{85pt}{There is no action required when peers leave the system.}
\\ \hline
@@ -702,8 +703,8 @@
\parbox{37pt}{$O(2(\sqrt{n}*(log^2{n})) + (\sqrt{n} + (log^3{n})))$} &
\parbox{37pt}{$O$($\sqrt{n}$)} &
\parbox{37pt}{$O(1)$} &
-\parbox{85pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{Totalnumber of
files}{\sqrt{n}}$, where n is the number of peers and c the number of
contacts/foreign affinity group} &
-\parbox{85pt}{Insert/delete overhead is constant and performed in the
background, system performance may decrease if peers are not homogeneous and
peers join and leave the system constantly}
+\parbox{85pt}{$\frac{n}{\sqrt{n}} + c*(\sqrt{n}-1) + \frac{Totalnumber of
files}{\sqrt{n}}$, where n is the number of peers and c the number of
contacts/foreign affinity group.} &
+\parbox{85pt}{Insert/delete overhead is constant and performed in the
background. System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly.}
\\ \hline
\parbox{37pt}{Koorde \cite{kaashoek03koorde}} &
@@ -711,7 +712,7 @@
\parbox{37pt}{$O(1)$ or $O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$ or $O(\frac{\log{n}}{\log{}\log{n}})$} &
\parbox{85pt}{$2(\log{n})$} &
-\parbox{85pt}{Based on Chord algorithm, uses de Bruijn graphs for better
efficiency and fault tolerance}
+\parbox{85pt}{Based on Chord algorithm, uses de Bruijn graphs for better
efficiency and fault tolerance.}
\\ \hline
\parbox{37pt}{ODHDHT \cite{naor03simpledht}} &
@@ -727,8 +728,8 @@
\parbox{37pt}{$O(\log^2{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
-\parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable
parameter for tuning digit-fixing properties (routing table)} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly, based on Plaxton's algorithm}
+\parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable
parameter for tuning digit-fixing properties (routing table).} &
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly; based on Plaxton's algorithm.}
\\ \hline
@@ -737,7 +738,7 @@
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{$O(\log{n})$} &
-\parbox{85pt}{Operates at network layer}
+\parbox{85pt}{Operates at network level layer.}
\\ \hline
\parbox{37pt}{Plaxton \cite{plaxton97accessingnearby}} &
@@ -745,15 +746,15 @@
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{$O(\log{n})$} &
-\parbox{85pt}{Plaxton's algorithm is designed to operate in static environment
(e.g., web cache)}
+\parbox{85pt}{Plaxton's algorithm is designed to operate in static environment
(e.g., web cache).}
\\ \hline
\parbox{37pt}{Skip Graphs \cite{AspnesS2003}} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
-\parbox{85pt}{$4r(\log{n}) + (\log{n})$, where r=number of resources
provided)} &
-\parbox{85pt}{In this approach peer is treated as ''named resource''}
+\parbox{85pt}{$4r(\log{n}) + O(\log{n})$, where r=number of resources
provided.} &
+\parbox{85pt}{In this approach peer is treated as ''named resource''.}
\\ \hline
\parbox{37pt}{SkipNet \cite{harvey03skipnet2}} &
@@ -761,31 +762,31 @@
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{$2(\log{n})$} &
-\parbox{85pt}{Partially supports underlying network's locality properties}
+\parbox{85pt}{Partially supports underlying network's locality properties.}
\\ \hline
\parbox{37pt}{Social \cite{alpineurl}} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(n)$} &
-\parbox{85pt}{Can be 1-10000 connections (as known as ''social'' connections,
connections are permanent)} &
-\parbox{85pt}{Number of connections number depends on peer's memory/network
capabilities}
+\parbox{85pt}{Can be 1-10000 connections (as known as ''social'' connections,
connections are permanent).} &
+\parbox{85pt}{Number of connections depends on peer's memory/network
capabilities.}
\\ \hline
\parbox{37pt}{Symphony \cite{gurmeet03symphony}} &
\parbox{37pt}{$O(\log^2{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
-\parbox{85pt}{$2k+2+f$, where k = long range connections, 2 = peer's
neighbors, f = fault tolerance connections)} &
-\parbox{85pt}{Space can also be $O(1)$. Additional space of can be used as a
lookahead list for better performance}
+\parbox{85pt}{$2k+2+f$, where k = long range connections, 2 = peer's
neighbors, f = fault tolerance connections).} &
+\parbox{85pt}{Space can also be $O(1)$. Additional space of can be used as a
lookahead list for better performance.}
\\ \hline
\parbox{37pt}{SWAN \cite{bonsma02swan}} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(\log^2{n})$} &
-\parbox{85pt}{$r(2b+2s+2l)$ (where r=number of resources provided, b=boot
connections, s=short range connections, l=long range connections), typical
connection configuration: 2*(6+7+8)=36} &
-\parbox{85pt}{In this approach, peer is treated as ''named resource''}
+\parbox{85pt}{$r(2b+2s+2l)$ (where r=number of resources provided, b=boot
connections, s=short range connections, l=long range connections), typical
connection configuration: 2*(6+7+8)=36.} &
+\parbox{85pt}{In this approach, peer is treated as ''named resource''.}
\\ \hline
@@ -793,8 +794,8 @@
\parbox{37pt}{$O(\log^2{n})$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{37pt}{$O(\log{n})$} &
-\parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable
parameter for tuning digit-fixing properties (routing table)} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly, based on Plaxton's algorithm}
+\parbox{85pt}{$(2^{b - 1})\frac{\log{n}}{b}$, where $b$ is a configurable
parameter for tuning digit-fixing properties (routing table).} &
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly, based on Plaxton's algorithm.}
\\ \hline
\parbox{37pt}{Viceroy \cite{malkhi02viceroy}} &
@@ -802,7 +803,7 @@
\parbox{37pt}{$O(1)$} &
\parbox{37pt}{$O(\log{n})$} &
\parbox{85pt}{11} &
-\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly, not necessarily fault-tolerant
because of constant degree of neighbors}
+\parbox{85pt}{System performance may decrease if peers are not homogeneous and
peers join and leave the system constantly, not necessarily fault-tolerant
because of constant degree of neighbors.}
\\ \hline
@@ -829,8 +830,8 @@
open problems to be solved. Also, many techniques developed for traditional
distributed
systems may no longer apply with Peer-to-Peer systems, e.g., load balancing
techiques \cite{byers03dhtbalancing}.
-Different problems apply to both the loosely structured and the tightly
structured approach have their own specific problems.
-Since the introduction of Gnutella \cite{gnutellaurl}, the main concern has
been the scalability problem of loosely structured
+Different problems apply to both the loosely structured and the tightly
structured approach.
+For instance, since the introduction of Gnutella \cite{gnutellaurl}, the main
concern has been the scalability problem of loosely structured
systems. However, the scalability problem of the loosely structured is often
misunderstood;
\emph{the network overlay} of loosely structured systems is scalable, but the
\emph{data lookup model} is not as
the data lookup process creates lot of extra network traffic (e.g.,
\cite{yang02improvingsearch}).
@@ -881,23 +882,23 @@
Naor et al. \cite{naor03simpledht} have proposed a partial solution against
Spam attack in a \emph{faulty} peer environment (not hostile).
Overloading of targeted peers is a form of Distributed Denial of Service
attack (DDoS) (see, e.g., \cite{372148}). For instance,
-a hostile entity can attempt to burden targeted peers with garbage network
packets. As a consequence, peers may act incorrectly or
+a hostile entity can attempt to burden specific peers with garbage network
packets. As a consequence, peers may act incorrectly or
stop working. Daswani et al. \cite{daswani02queryflooddos} suggest efficient
load balancing
policies for Peer-to-Peer system in order to prevent massive system failures.
They suggest a traffic model
that can be used to understand the effects of DDoS attacks. Sit et al.
\cite{sit02securitycons}
suggest that identifier assignment algorithm for peers would assign identifier
with respect to network topology
-and that replicas should be located physically to different locations.
+and that replicas of data should be located physically to different locations.
\subsection{Trust management, data authenticity and integrity}
According to \cite{aberer01trust}, mutual trust ''...allows agents to
cooperate in a game-theoretic situation that corresponds
to the repeated prisoners dilemma and leads in the long term to an increased
aggregated utility for the participating agents''.
-The authors of \cite{aberer01trust} define \emph{trust management} as a
mechanism that allows to establish mutual trust. Furthermore, \emph{reputation}
is a measure
+The authors of \cite{aberer01trust} define \emph{trust management} as a
mechanism that allows one to establish mutual trust. Furthermore,
\emph{reputation} is a measure
that is derived from knowledge on interactions in the past
\cite{aberer01trust}. In this subsection, we discuss mechanisms to maintain
trust in Peer-to-Peer systems.
-Trust in Peer-to-Peer systems is based on \emph{reputation}. Little research
has been done on reputation models in Peer-to-Peer
+Trust in Peer-to-Peer systems is based on \emph{reputation}. Little research
has been done on the reputation models in Peer-to-Peer
systems, such as \cite{aberer01trust}, \cite{cornelli02reputableservents}. In
\cite{aberer01trust}, authors present a scalable
trust management model, which can be used in Peer-to-Peer enviroment. Authors
in \cite{cornelli02reputableservents}
suggest techniques to keep track and share information about the reputation of
a peer with others peers.
@@ -905,8 +906,7 @@
Quite recently, widely used Public Key Infrastructure (PKI) has been deployed
in distributed
systems \cite{rivest96sdsi}, \cite{spkiworkinggroup}. PKI is a reliable
technology for securing
data in computing systems, such as the Internet. However, in Peer-to-Peer
-networks, the problem of key-based security mechanism may be the maintenance
of keys as participating
-peers constantly join and leave the system, i.e., the revocation of keys and
the
+networks, the problem of key-based security mechanism may be the revocation of
keys and the
distribution of new keys in a hostile environment \cite{KohMau99}.
ConChord \cite{ajmani02conchord} is the first Peer-to-Peer system which has a
support for PKI based
@@ -948,7 +948,7 @@
Even if many existing Peer-to-Peer systems are able to provide some of the
types of anonymity, there is no
such system which is able to provide complete anonymity in all levels (see
above). Specifically, the conflicts
-between anonymity and other properties of Peer-to-Peer system require more
research work.
+between anonymity and other properties of Peer-to-Peer systems require more
research work.
\subsection{Access control}
@@ -1006,7 +1006,7 @@
$h$ is the number of hops in the overlay. Sit and Morris
\cite{sit02securitycons} discuss the possibility of
allowing the query originator to observe lookup progress and cross-check
routing tables using random queries to achieve
secure routing in tightly structured overlay. However, their
-approach is not very efficient, since this method creates lot of additional
network traffic when
+approach is not very efficient, since this method creates a lot of additional
network traffic when
in function i.e., it is unknown if this technique is realizable in an
efficient way.
Lynch et al. \cite{lynch02atomicdataaccess} propose a solution for secure
routing table
maintenance, but their solution seems to have two major problems according to
\cite{castro02securitystructured}.
@@ -1047,7 +1047,7 @@
\endfirsthead
\multicolumn{4}{c}%
-{{\tablename\ \thetable{} -- continued from previous page}} \\
+{{\tablename\ \thetable{} -- continued from the previous page}} \\
\hline \multicolumn{1}{|c|}{\textbf{Problem}} &
\multicolumn{1}{c|}{\textbf{Problem description}} &
\multicolumn{1}{c|}{\textbf{Solutions}} &
@@ -1061,86 +1061,86 @@
\parbox{90pt}{Query routing \cite{sit02securitycons, aspnes02faultrouting,
castro02securerouting, ratnasamy02routing, gavoille01routing,
lynch02atomicdataaccess, fiat02censorship, saia02dynamicfaultcontentnetwork,
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}
+\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.}
\\ \hline
\parbox{90pt}{DoS attack \cite{sit02securitycons,
saia02dynamicfaultcontentnetwork, datar02butterflies, daswani02queryflooddos,
juels99clientpuzzles}} &
-\parbox{110pt}{Distributed, controlled burden against specific computer(s)} &
-\parbox{110pt}{Client puzzles, load balancing, traffic measurements, traffic
models, replication} &
-\parbox{110pt}{Only partial solutions, traffic models most effective}
+\parbox{110pt}{Distributed, controlled burden against specific computer(s).} &
+\parbox{110pt}{Client puzzles, load balancing, traffic measurements, traffic
models, replication.} &
+\parbox{110pt}{Only partial solutions, traffic models most effective.}
\\ \hline
\parbox{90pt}{Sybil attack \cite{douceur02sybil, castro02securerouting}} &
-\parbox{110pt}{Single hostile entity presents multiple entities} &
-\parbox{110pt}{Identify all peers simultaneously across the system, collect
pool of peers which are validated, distributed peer ID creation} &
-\parbox{110pt}{Not practically realizable, research focused on persistence,
not on identity distinction}
+\parbox{110pt}{Single hostile entity presents multiple entities.} &
+\parbox{110pt}{Identify all peers simultaneously across the system, collect
pool of peers which are validated, distributed peer ID creation.} &
+\parbox{110pt}{Not practically realizable, research focused on persistence,
not on identity distinction.}
\\ \hline
\parbox{90pt}{Spam attack \cite{naor03simpledht}} &
-\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}
+\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}{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}
+\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{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}
+\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{dingledine00free, tarzan:ccs9, pub00,
clarke00freenet, reiter98crowds, 352607, 502002}} &
-\parbox{110pt}{Anonymity cannot be provided in all cases} &
-\parbox{110pt}{Remailers, pre-routing} &
-\parbox{110pt}{Total anonymity cannot be provided yet}
+\parbox{110pt}{Anonymity cannot be provided in all cases.} &
+\parbox{110pt}{Remailers, pre-routing.} &
+\parbox{110pt}{Total anonymity cannot be provided yet.}
\\ \hline
\parbox{90pt}{Malicious peers \cite{sit02securitycons, castro02securerouting}}
&
\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}
+\parbox{110pt}{Create invariants for peer behavior, verify invariants,
self-certifying data.} &
+\parbox{110pt}{Partial solutions, self-certifying data most reliable.}
\\ \hline
\parbox{90pt}{Access Control \cite{nejdl03accesscontrol,
daswani03openproblems}} &
\parbox{110pt}{Can we define access control levels in Peer-to-Peer network ?} &
-\parbox{110pt}{Schema-based rules} &
-\parbox{110pt}{Some initial experiences, needs more research}
+\parbox{110pt}{Schema-based rules.} &
+\parbox{110pt}{Some initial experiences, needs more research.}
\\ \hline
\parbox{90pt}{Inconsistent behavior \cite{sit02securitycons}} &
-\parbox{110pt}{Hostile peer could act correctly with its neighbors, but
incorrectly with others} &
-\parbox{110pt}{Public keys, digital signatures} &
-\parbox{110pt}{Not practical approach/working proposal created yet}
+\parbox{110pt}{Hostile peer could act correctly with its neighbors, but
incorrectly with others.} &
+\parbox{110pt}{Public keys, digital signatures.} &
+\parbox{110pt}{Not practical approach/working proposal created yet.}
\\ \hline
\parbox{90pt}{Hostile groups \cite{castro02securerouting}} &
-\parbox{110pt}{Joining peer may join parallel network, formed a group of
hostile peers, hostile peer(s) controls the construction of the network} &
-\parbox{110pt}{Use trusted peers, based on history information, cryptography,
key infrastructure} &
-\parbox{110pt}{Not 100\% sure if Central Authority (CA) is missing, not
practical approach/working proposal created yet}
+\parbox{110pt}{Joining peer may join parallel network, formed a group of
hostile peers, hostile peer(s) controls the construction of the network.} &
+\parbox{110pt}{Use trusted peers, based on history information, cryptography,
key infrastructure.} &
+\parbox{110pt}{Not 100\% sure if Central Authority (CA) is missing, not
practical approach/working proposal created yet.}
\\ \hline
\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 area}
+\parbox{110pt}{Viruses, trojans, sniffers.} &
+\parbox{110pt}{Data integrity/authenticity, distributed anti virus software.} &
+\parbox{110pt}{Not much research has been done on this area.}
\\ \hline
\caption{Security problems in Peer-to-Peer.}
@@ -1237,7 +1237,7 @@
is designed for the CAN system \cite{ratnasamy01can}.
Recent study has been focused on the feasibility of Peer-to-Peer Web-like
indexing and searching
-on top of tightly structured overlays \cite{li03feasibility}. Authors argue,
that it is possible to implement
+on top of tightly structured overlays \cite{li03feasibility}. Authors argue
that it is possible to implement
Peer-to-Peer Web-like search with certain compromises. First, Peer-to-Peer
search engine may need to
decrease the result quality in order to make searching more efficient. Second,
Peer-to-Peer systems must
consult the properties of underlying network for better performance.
@@ -1336,7 +1336,7 @@
\endfirsthead
\multicolumn{4}{c}%
-{{\tablename\ \thetable{} -- continued from previous page}} \\
+{{\tablename\ \thetable{} -- continued from the previous page}} \\
\hline \multicolumn{1}{|c|}{\textbf{Problem}} &
\multicolumn{1}{c|}{\textbf{Problem description}} &
\multicolumn{1}{c|}{\textbf{Solutions}} &
@@ -1348,9 +1348,9 @@
\parbox{90pt}{Web indexing and searching \cite{li03feasibility,
Bhattacharjee03resultcache, 362692, CuencaAcuna2002DSIWorkshop,
rhea02probabilistic, joseph02neurogrid, crespo02semanticoverlay,
joseph02p2players, chord:om_p-meng, wittengigabytes, 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}
+\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
@@ -1359,90 +1359,90 @@
ramanathan02goodpeers, kleinberg99small, nips02-Kleinberg, zhang02using,
watts00dynamics, karger02findingnearest,
brinkmann02compactplacement, rhea02probabilistic, castro02networkproximity,
ng02predicting, pias03lighthouse, waterhouse02searchp2p, botros01jxtasearch,
ganesan02yappers}} &
-\parbox{110pt}{Find resource 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}
+\parbox{110pt}{Find resource 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.}
\\ \hline
\parbox{90pt}{Richness of queries \cite{harren02complex,
ansaryefficientbroadcast03, andrzejak02rangequeries}} &
-\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}
+\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,
saia02dynamicfaultcontentnetwork, fiat02censorship, aspnes02faultrouting,
albert-00-tolerance, 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}
+\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law
networks/properties.} &
+\parbox{110pt}{Partially working solutions.}
\\ \hline
\parbox{90pt}{Quality of Service} &
-\parbox{110pt}{The system can only provide (at most) best effort services} &
-\parbox{110pt}{Use network proximity for better network performance
(bandwidth, latency, jitter, packet loss)} &
-\parbox{110pt}{Increases system complexity, some initial experiences, need
more research}
+\parbox{110pt}{The system can only provide (at most) best effort services.} &
+\parbox{110pt}{Use network proximity for better network performance
(bandwidth, latency, jitter, packet loss).} &
+\parbox{110pt}{Increases system complexity, some initial experiences, need
more research.}
\\ \hline
\parbox{90pt}{Data availability/persistence \cite{bhagwan03availability}} &
-\parbox{110pt}{Data might be temporarily unavailable, or lost permanently} &
-\parbox{110pt}{Data caching, data replication} &
-\parbox{110pt}{Working solutions, but creates more traffic and overhead per
peer}
+\parbox{110pt}{Data might be temporarily unavailable, or lost permanently.} &
+\parbox{110pt}{Data caching, data replication.} &
+\parbox{110pt}{Working solutions, but creates more traffic and overhead per
peer.}
\\ \hline
\parbox{90pt}{Network proximity \cite{pias03lighthouse, ng02predicting,
ratnasamy02ght, eriksson03peernet, castro02networkproximity}} &
\parbox{110pt}{Can we take into account the underlying network's properties
better when forming overlay network (network-awareness for performance) ?} &
-\parbox{110pt}{Global network positioning, lighthouse technique, triangulated
heuristics} &
-\parbox{110pt}{Increases system complexity, no real world experience in a wide
scale, proposed solutions are susceptible to single point of failure}
+\parbox{110pt}{Global network positioning, lighthouse technique, triangulated
heuristics.} &
+\parbox{110pt}{Increases system complexity, no real world experience in a wide
scale, proposed solutions are susceptible to single point of failure.}
\\ \hline
\parbox{90pt}{Locality \cite{keleher-02-p2p, hildrum02distributedobject,
freedman02trie, sloppy:iptps03, plaxton97accessingnearby,
karger02findingnearest}} &
\parbox{110pt}{Could tightly structured systems exploit locality properties
better ?} &
-\parbox{110pt}{Constrained Load Balancing, using network properties for
nearest neighbor selection, self-organizing clusters} &
-\parbox{110pt}{Working solutions}
+\parbox{110pt}{Constrained Load Balancing, using network properties for
nearest neighbor selection, self-organizing clusters.} &
+\parbox{110pt}{Partially working solutions.}
\\ \hline
\parbox{90pt}{Hot spots \cite{258660, sloppy:iptps03,
maymounkov03ratelesscodes}} &
\parbox{110pt}{What will happen if some resource is extremely popular and only
one peer is hosting it ?} &
-\parbox{110pt}{Caching, multisource downloads, replication, load balancing,
sloppy hashing} &
-\parbox{110pt}{For query hot spots, caching and multisource downloads
efficiently reduce hot spots, for routing hot spots, benefits are smaller}
+\parbox{110pt}{Caching, multisource downloads, replication, load balancing,
sloppy hashing.} &
+\parbox{110pt}{For query hot spots, caching and multisource downloads
efficiently reduce hot spots, for routing hot spots, benefits are smaller.}
\\ \hline
\parbox{90pt}{Load balancing \cite{rao03loadbalancing, ledlie02selfp2p,
byers03dhtbalancing}} &
-\parbox{110pt}{Random (but uniformly distributed) identifier selection could
cause system inbalance among participants with different capabilities} &
-\parbox{110pt}{Caching, virtual server transfers} &
-\parbox{110pt}{Effective, more research required in fully dynamic environment}
+\parbox{110pt}{Random (but uniformly distributed) identifier selection could
cause system inbalance among participants with different capabilities.} &
+\parbox{110pt}{Caching, virtual server transfers.} &
+\parbox{110pt}{Effective, more research required in fully dynamic environment.}
\\ \hline
\parbox{90pt}{System in flux \cite{libennowell01observations, 571863,
ledlie02selfp2p, albert-02-statistical}} &
\parbox{110pt}{Peers join and leave system constantly. What about load
balancing and performance ?} &
-\parbox{110pt}{Half-life phenomenon (for analysis), simple overlay maintenance
and construction algorithm} &
-\parbox{110pt}{Initial theoretical analysis have been created, but not
comprehensive model for analyzing different system states and its variations
(e.g. complex usage patterns)}
+\parbox{110pt}{Half-life phenomenon (for analysis), simple overlay maintenance
and construction algorithm.} &
+\parbox{110pt}{Initial theoretical analysis have been created, but not
comprehensive model for analyzing different system states and its variations
(e.g. complex usage patterns).}
\\ \hline
\parbox{90pt}{Sudden network partition \cite{harvey03skipnet1,
harvey03skipnet2, rowston03controlloingreliability}} &
-\parbox{110pt}{Sub network is isolated from other network because of network
disconnection} &
-\parbox{110pt}{Self-tuning, environment observation, localized network
connection for minimum latency (backup connections)} &
-\parbox{110pt}{Creates more overhead/space requirements per peer}
+\parbox{110pt}{Sub network is isolated from other network because of network
disconnection.} &
+\parbox{110pt}{Self-tuning, environment observation, localized network
connection for minimum latency (backup connections).} &
+\parbox{110pt}{Creates more overhead/space requirements per peer.}
\\ \hline
\parbox{90pt}{Fail Stop \cite{rowston03controlloingreliability, 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}
+\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.}
\\ \hline
\parbox{90pt}{Byzantine faults \cite{296824}} &
-\parbox{110pt}{Faulty peers may behave arbitrarily} &
-\parbox{110pt}{Byzantine replication algorithms, get information from multiple
entities, trust majority's opinion} &
-\parbox{110pt}{Much research has been done on this field, practical solutions,
decreases system performance slightly}
+\parbox{110pt}{Faulty peers may behave arbitrarily.} &
+\parbox{110pt}{Byzantine replication algorithms, get information from multiple
entities, trust majority's opinion.} &
+\parbox{110pt}{Much research has been done on this field, practical solutions,
decreases system performance slightly.}
\\ \hline
\caption{Performance and usability problems in Peer-to-Peer.}
@@ -1525,7 +1525,7 @@
\endfirsthead
\multicolumn{4}{c}%
-{{\tablename\ \thetable{} -- continued from previous page}} \\
+{{\tablename\ \thetable{} -- continued from the previous page}} \\
\hline \multicolumn{1}{|c|}{\textbf{Problem}} &
\multicolumn{1}{c|}{\textbf{Problem description}} &
\multicolumn{1}{c|}{\textbf{Solutions}} &
@@ -1537,50 +1537,50 @@
\parbox{90pt}{Mutual distrust \cite{cornelli02reputableservents,
aberer01trust}} &
-\parbox{110pt}{Nobody trusts anybody} &
-\parbox{110pt}{Reputation methods, key infrastructures} &
-\parbox{110pt}{Resource demanding, not practical to implement/not working
solutions, no real world experience in a wide scale}
+\parbox{110pt}{Nobody trusts anybody.} &
+\parbox{110pt}{Reputation methods, key infrastructures.} &
+\parbox{110pt}{Resource demanding, not practical to implement/not working
solutions, no real world experience in a wide scale.}
\\ \hline
\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p,
ngan03enforcefile, 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}
+\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,
brinkmann02compactplacement, zhao02brocade, gurmeet03symphony,
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
(tightly structured)} &
-\parbox{110pt}{Working solutions, increases system complexity (additional
layer)}
+\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
(tightly structured).} &
+\parbox{110pt}{Working solutions, increases system complexity (additional
layer).}
\\ \hline
\parbox{90pt}{Programming guidelines \cite{zhao03api, frise02p2pframework,
babaoglu02anthill, rhea03benchmarks, garciamolina03sil,
balakrishnan03semanticfree}} &
-\parbox{110pt}{Set of programming guidelines/frameworks is needed for better
interoperability between different systems} &
-\parbox{110pt}{Common frameworks and APIs} &
-\parbox{110pt}{Common framework/API is still missing, a few proposals have
been made (tightly structured)}
+\parbox{110pt}{Set of programming guidelines/frameworks is needed for better
interoperability between different systems.} &
+\parbox{110pt}{Common frameworks and APIs.} &
+\parbox{110pt}{Common framework/API is still missing, a few proposals have
been made (tightly structured).}
\\ \hline
\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}
+\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.}
\\ \hline
\parbox{90pt}{Overlay management and health monitoring \cite{zhang03somo}} &
-\parbox{110pt}{System is self-capable to monitor it is status and health for
better performance} &
-\parbox{110pt}{Build a meta data overlay atop of structured overlay (such as
SOMO for structured overlays), make local decisions about overlay (loosely
structured)} &
-\parbox{110pt}{For tightly structured overlays, efficient and simple to
implement, fault tolerance unknown, for the loosely structured approach not
necessarily efficient because decisions are based on local knowledge}
+\parbox{110pt}{System is self-capable to monitor it is status and health for
better performance.} &
+\parbox{110pt}{Build a meta data overlay atop of structured overlay (such as
SOMO for structured overlays), make local decisions about overlay (loosely
structured).} &
+\parbox{110pt}{For tightly structured overlays, efficient and simple to
implement, fault tolerance unknown, for the loosely structured approach not
necessarily efficient because decisions are based on local knowledge.}
\\ \hline
\parbox{90pt}{Locating Peer-to-Peer network} &
-\parbox{110pt}{How old peers or new peers are able to locate Peer-to-Peer
network, if it exists} &
-\parbox{110pt}{Servers maintaining online peers (e.g. gnutellahosts.com),
peer's history information} &
-\parbox{110pt}{Depends on implementation and purpose of the system, for a
desktop system there are working solutions}
+\parbox{110pt}{How old peers or new peers are able to locate Peer-to-Peer
network, if it exists.} &
+\parbox{110pt}{Servers maintaining online peers (e.g. gnutellahosts.com),
peer's history information.} &
+\parbox{110pt}{Depends on implementation and purpose of the system, for a
desktop system there are working solutions.}
\\ \hline
\caption{Miscellaneous problems in Peer-to-Peer.}
@@ -1600,10 +1600,10 @@
The Fenfire project \cite{fenfireurl} is an effort to build a location
transparent, hyperstructured desktop
environment. By location transparent, we mean hiding the heterogeneous and
distributed nature of the system
-so that it appears to the end user like one system and by hyperstructured
system
+so that it appears to the end user like one system, and by hyperstructured
system
a system in which data can be associated with other data arbitrarily. Fenfire
uses xanalogical storage model
\cite{ted-xu-model} as a basis for hyperstructured media. Each data item in
the Fenfire system has a globally unique
-identifier. This property should allow making references between \emph{any}
+identifier. This property allows making references between \emph{any}
data easier and more seamlessly interoperating than in other systems. For
location transparency in the Fenfire system,
we are currently analysing the applicability of Peer-to-Peer infrastructure.
@@ -1629,8 +1629,8 @@
\section{Xanalogical storage model}
Xanalogical storage model \cite{nelson99xanalogicalneeded} is a different kind
of model for
-presenting data and relationships between data, e.g., while in the World Wide
Web links are
-between documents, in the xanalogical storage model links are between
individual
+presenting data and relationships between data. For example, in the World Wide
Web links are
+between documents, while in the xanalogical storage model links are between
individual
characters\footnote{Xanalogical storage model
is not limited to text. It can support arbitrary data, e.g., pixels of picture
or
frames of video.}. \emph{Enfilade} is a mutable ''virtual file'' (or part of
one), which is a list
@@ -1666,8 +1666,7 @@
\section{Storm}
In this section, we will give a brief overview of Storm design. More
information can be found
-from recent publications. For general discussion about Fenfire in Peer-to-Peer
environment,
-see \cite{lukka02freenetguids}, and for detailed Storm design, see
\cite{fallenstein03storm}.
+from recent publications. For detailed Storm design, see
\cite{fallenstein03storm}.
Storm (for \emph{STORage Module}) stores all data as \emph{blocks}, which
are immutable byte sequences. Storm \emph{assigns} a globally unique
identifier to each
@@ -1713,7 +1712,7 @@
\centering
\includegraphics[width=10cm, height=10cm]{storm_uml.eps}
\caption{Implementation of the xanalogical storage model on Storm. Storm
storage model is based on
-fluid media units, i.e., fluid media units are smallest units of data.
Currently, Storm provides a support
+fluid media units, which represent the smallest units of data. Currently,
Storm provides a support
for textual fluid media units (characters) only, but a support for arbitrary
data (e.g., video or music) is
planned in future versions of Storm.}
\label{fig:storm_model}
@@ -1834,8 +1833,8 @@
within a small group of working people.
For better fault tolerance and self-monitoring for Fenfire, we propose
techniques
-presented by Rowston et al. \cite{rowston03controlloingreliability}. With
these
-techniques, we can ensure the performance of the Fenfire system in a highly
adverse conditions, such
+presented by Rowston et al. \cite{rowston03controlloingreliability}. With
their methods,
+we can ensure the performance of the Fenfire system in a highly adverse
conditions, such
as sudden network partition, or highly dynamic and heterogeneous environment.
Additionally, for more efficient data transfer, we can use variable techniques
for this purpose.
@@ -1866,7 +1865,9 @@
Also, we don't respond to the security issues related to Peer-to-Peer systems,
since there is no working solution
available yet. We either assume that Fenfire has a reliable technique for
identifying individual entities, or
there are no hostile entities among participating peers, i.e., Storm blocks
can be identified correctly (e.g., when
-performing searches). In the next subsection, we discuss security problems in
more detail.
+performing searches). In the next subsection, we discuss security problems in
more detail.
+
+Next, we present methods for locating Storm data blocks using the DOLR
abstraction.
\begin{itemize}
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.117
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.118
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.117 Tue Apr 8
05:25:03 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib Tue Apr 8
07:39:22 2003
@@ -14,8 +14,8 @@
P2P systems. We describe the issues involved and
outline our research plan and current status.},
year = {2002},
- location = {Cambridge, USA},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/191.pdf}
+ location = {Cambridge, USA}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/191.pdf}
}
%Open questions related DHTs
@@ -23,8 +23,8 @@
author = {Sylvia Ratnasamy and Scott Shenker and Ion Stoica},
title = {Routing Algorithms for {DHTs}: Some Open Questions},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/174.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/174.pdf}
}
%Tapestry p2p system
@@ -33,8 +33,8 @@
title = {Tapestry: An Infrastructure for Fault-tolerant Wide-area
Location and Routing},
number = {UCB/CSD-01-1141},
institution = {Computer Science Division, U. C. Berkeley},
- year = {2001},
- url = {http://www.cs.berkeley.edu/~ravenben/
publications/CSD-01-1141.pdf}
+ year = {2001}
+ %url = {http://www.cs.berkeley.edu/~ravenben/
publications/CSD-01-1141.pdf}
}
%Pastry p2p system
@@ -44,8 +44,8 @@
booktitle= {IFIP/ACM International Conference on Distributed Systems
Platforms (Middleware)},
year = {2001},
pages = {329-350},
- location = {Heidelberg, Germany},
- url = {http://www.cs.cornell.edu/People/egs/615/pastry.pdf}
+ location = {Heidelberg, Germany}
+ %url = {http://www.cs.cornell.edu/People/egs/615/pastry.pdf}
}
%Chord p2p system
@@ -54,11 +54,11 @@
title = {Chord: A scalable peer-to-peer lookup service for internet
applications},
booktitle = {Proceedings of the 2001 conference on applications,
technologies, architectures, and protocols for computer communications},
year = {2001},
- isbn = {1-58113-411-8},
+ %isbn = {1-58113-411-8},
pages = {149--160},
location = {San Diego, California, United States},
- url = {http://www.pdos.lcs.mit.edu/papers/chord:sigcomm01/
chord_sigcomm.pdf},
- publisher = {ACM Press},
+ %url = {http://www.pdos.lcs.mit.edu/papers/chord:sigcomm01/
chord_sigcomm.pdf},
+ publisher = {ACM Press}
}
%Distributed filesystem CFS (CFS is built on Chord)
@@ -67,11 +67,11 @@
title = {Wide-area cooperative storage with {CFS}},
booktitle = {Proceedings of the eighteenth ACM symposium on Operating
systems principles},
year = {2001},
- isbn = {1-58113-389-8},
+ %isbn = {1-58113-389-8},
pages = {202--215},
location = {Banff, Alberta, Canada},
- url = {http://www.pdos.lcs.mit.edu/papers/cfs:sosp01/cfs_sosp.pdf},
- publisher = {ACM Press},
+ %url = {http://www.pdos.lcs.mit.edu/papers/cfs:sosp01/cfs_sosp.pdf},
+ publisher = {ACM Press}
}
%CAN p2p system
@@ -80,11 +80,11 @@
title = {A scalable content-addressable network},
booktitle = {Proceedings of the 2001 conference on applications,
technologies, architectures, and protocols for computer communications },
year = {2001},
- isbn = {1-58113-411-8},
+ %isbn = {1-58113-411-8},
pages = {161--172},
location = {San Diego, California, United States},
- publisher = {ACM Press},
- url = {http://robotics.eecs.berkeley.edu/~wlr/
228a/Projects/Ratnasamy2.pdf}
+ publisher = {ACM Press}
+ %url = {http://robotics.eecs.berkeley.edu/~wlr/
228a/Projects/Ratnasamy2.pdf}
}
%DHT structure, overnet and ed2k uses this method
@@ -93,8 +93,8 @@
title = {{Kademlia: A Peer-to-peer Information System Based on the XOR
metric}},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
year = {2002},
- location ={Cambridge, USA},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/109.pdf}
+ location ={Cambridge, USA}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/109.pdf}
}
%Freenet p2p system
@@ -103,8 +103,8 @@
title = {Freenet: {A} Distributed Anonymous Information Storage and
Retrieval System},
booktitle = {ICSI Workshop on Design Issues in Anonymity and
Unobservability},
year = {2000},
- location = {Berkeley, CA},
- url = {http://freenetproject.org/twiki/Main/Papers/icsi-revised.pdf}
+ location = {Berkeley, CA}
+ %url = {http://freenetproject.org/twiki/Main/Papers/icsi-revised.pdf}
}
%Methods for finding resources in p2p environment
@@ -113,11 +113,11 @@
title = {Distributed object location in a dynamic network},
booktitle = {Proceedings of the fourteenth annual ACM symposium on
Parallel algorithms and architectures},
year = {2002},
- isbn = {1-58113-529-7},
+ %isbn = {1-58113-529-7},
pages = {41--52},
location = {Winnipeg, Manitoba, Canada},
- url =
{http://oceanstore.cs.berkeley.edu/publications/papers/pdf/SPAA02.pdf},
- publisher = {ACM Press},
+ %url =
{http://oceanstore.cs.berkeley.edu/publications/papers/pdf/SPAA02.pdf},
+ publisher = {ACM Press}
}
%The book with the same title
@@ -136,8 +136,8 @@
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
address = {Cambridge, MA},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/167.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/167.pdf}
}
%Distributed Sloppy Hash Table
@@ -166,8 +166,8 @@
into existing systems for immediate impact.},
month = {July},
year = {2002},
- location = {Vienna, Austria},
- url = {http://hake.stanford.edu/~byang/pubs/p2psearch.pdf}
+ location = {Vienna, Austria}
+ %url = {http://hake.stanford.edu/~byang/pubs/p2psearch.pdf}
}
%Mixed Gnutella and DHTs
@@ -175,8 +175,8 @@
author = {Prasanna Ganesan and Qixiang Sun and Hector Garcia-Molina},
title = {{YAPPERS}: A Peer-to-Peer Lookup Service Over Arbitrary
Topology},
booktitle = {Proceedings of {IEEE} Infocom},
- year = {2003},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-24&format=pdf&compression=}
+ year = {2003}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-24&format=pdf&compression=}
}
%Problems related to p2p systems
@@ -194,8 +194,8 @@
systems -- search and security -- and suggest several open and
important research
problems for the community to address.},
month = {January},
- year = {2003},
- url = {http://dbpubs.stanford.edu:8090/pub/2003-1}
+ year = {2003}
+ %url = {http://dbpubs.stanford.edu:8090/pub/2003-1}
}
@misc{gnutellaurl,
@@ -278,7 +278,7 @@
year = {2002},
month = {October},
institution = {Sun Microsystems, Inc.},
- url = {http://www.jxta.org/project/www/docs/jxtaview_01nov02.pdf}
+ %url = {http://www.jxta.org/project/www/docs/jxtaview_01nov02.pdf}
}
%Method which e.g. Pastry and Tapestry are build on
@@ -287,11 +287,11 @@
title = {Accessing nearby copies of replicated objects in a
distributed environment},
booktitle = {Proceedings of the ninth annual ACM symposium on Parallel
algorithms and architectures},
year = {1997},
- isbn = {0-89791-890-8},
+ %isbn = {0-89791-890-8},
pages = {311--320},
location = {Newport, Rhode Island, United States},
- url = {http://www.cs.utexas.edu/users/plaxton/ps/1999/tocs.ps},
- publisher = {ACM Press},
+ %url = {http://www.cs.utexas.edu/users/plaxton/ps/1999/tocs.ps},
+ publisher = {ACM Press}
}
%Seucurity issues related to DHTs
@@ -301,8 +301,8 @@
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
year = {2002},
month = {March},
- address = {Cambridge, MA},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/173.pdf}
+ address = {Cambridge, MA}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/173.pdf}
}
%Analysis about search and replication in p2p environment
@@ -311,11 +311,11 @@
title = {Search and replication in unstructured peer-to-peer networks},
booktitle = {Proceedings of the 16th international conference on
Supercomputing},
year = {2002},
- isbn = {1-58113-483-5},
+ %isbn = {1-58113-483-5},
pages = {84--95},
location = {New York, New York, USA},
- url = {http://www.cs.princeton.edu/~qlv/download/searchp2p_full.pdf},
- publisher = {ACM Press},
+ %url = {http://www.cs.princeton.edu/~qlv/download/searchp2p_full.pdf},
+ publisher = {ACM Press}
}
%Oceanstore distributed persistant storage system
@@ -324,11 +324,11 @@
title = {OceanStore: an architecture for global-scale persistent
storage},
booktitle = {Proceedings of the ninth international conference on
Architectural support for programming languages and operating systems},
year = {2000},
- isbn = {1-58113-317-0},
+ %isbn = {1-58113-317-0},
pages = {190--201},
location = {Cambridge, Massachusetts, United States},
- url = {http://oceanstore.cs.berkeley.edu/publications/
papers/pdf/asplos00.pdf},
- publisher = {ACM Press},
+ %url = {http://oceanstore.cs.berkeley.edu/publications/
papers/pdf/asplos00.pdf},
+ publisher = {ACM Press}
}
@@ -336,8 +336,8 @@
title = {Observations on the Dynamic Evolution of Peer-to-Peer
Networks},
author = {David {Liben-Nowell} and Hari Balakrishnan and David Karger},
year = {2002},
- booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
- url = {http://www.pdos.lcs.mit.edu/chord/papers/iptps-evol.pdf}
+ booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})}
+ %url = {http://www.pdos.lcs.mit.edu/chord/papers/iptps-evol.pdf}
}
% ?
@@ -346,11 +346,11 @@
title = {Viceroy: a scalable and dynamic emulation of the butterfly},
booktitle = {Proceedings of the twenty-first annual symposium on
Principles of distributed computing},
year = {2002},
- isbn = {1-58113-485-1},
+ %isbn = {1-58113-485-1},
pages = {183--192},
location = {Monterey, California},
- url = {http://www.wisdom.weizmann.ac.il/~naor/PAPERS/viceroy.pdf},
- publisher = {ACM Press},
+ %url = {http://www.wisdom.weizmann.ac.il/~naor/PAPERS/viceroy.pdf},
+ publisher = {ACM Press}
}
% ?
@@ -359,11 +359,11 @@
title = {Early measurements of a cluster-based architecture for P2P
systems},
booktitle = {Proceedings of the First ACM SIGCOMM Workshop on Internet
Measurement Workshop},
year = {2001},
- isbn = {1-58113-435-5},
+ %isbn = {1-58113-435-5},
pages = {105--109},
location = {San Francisco, California, USA},
- url = {http://www.icir.org/vern/imw-2001/imw2001-papers/29.pdf},
- publisher = {ACM Press},
+ %url = {http://www.icir.org/vern/imw-2001/imw2001-papers/29.pdf},
+ publisher = {ACM Press}
}
% Routing methhods to be used in p2p env.
@@ -372,11 +372,11 @@
title = {Fault-tolerant routing in peer-to-peer systems},
booktitle = {Proceedings of the twenty-first annual symposium on
Principles of distributed computing},
year = {2002},
- isbn = {1-58113-485-1},
+ %isbn = {1-58113-485-1},
pages = {223--232},
location = {Monterey, California},
- url = {http://cs-www.cs.yale.edu/homes/shah/html/pubs/p2p-podc02.pdf},
- publisher = {ACM Press},
+ %url = {http://cs-www.cs.yale.edu/homes/shah/html/pubs/p2p-podc02.pdf},
+ publisher = {ACM Press}
}
%Free riding problem in p2p networks
@@ -385,11 +385,11 @@
title = {Incentives for sharing in peer-to-peer networks},
booktitle = {Proceedings of the 3rd ACM conference on Electronic
Commerce},
year = {2001},
- isbn = {1-58113-387-1},
+ %isbn = {1-58113-387-1},
pages = {264--267},
location = {Tampa, Florida, USA},
- url = {http://robotics.stanford.edu/~kevinlb/welcom01.pdf},
- publisher = {ACM Press},
+ %url = {http://robotics.stanford.edu/~kevinlb/welcom01.pdf},
+ publisher = {ACM Press}
}
%Distributed web cache
@@ -398,11 +398,11 @@
title = {Squirrel: a decentralized peer-to-peer web cache},
booktitle = {Proceedings of the twenty-first annual symposium on
Principles of distributed computing},
year = {2002},
- isbn = {1-58113-485-1},
+ %isbn = {1-58113-485-1},
pages = {213--222},
location = {Monterey, California},
- url = {http://citeseer.nj.nec.com/iyer02squirrel.html},
- publisher = {ACM Press},
+ %url = {http://citeseer.nj.nec.com/iyer02squirrel.html},
+ publisher = {ACM Press}
}
%Circle p2p system
@@ -418,11 +418,11 @@
title = {Finding nearest neighbors in growth-restricted metrics},
booktitle = {Proceedings of the thiry-fourth annual ACM symposium on
Theory of computing},
year = {2002},
- isbn = {1-58113-495-9},
+ %isbn = {1-58113-495-9},
pages = {741--750},
location = {Montreal, Quebec, Canada},
- url = {http://www.pdos.lcs.mit.edu/chord/papers/2002-stoc.pdf},
- publisher = {ACM Press},
+ %url = {http://www.pdos.lcs.mit.edu/chord/papers/2002-stoc.pdf},
+ publisher = {ACM Press}
}
%Methods for better search efficiency
@@ -435,8 +435,8 @@
year = {2002},
issn = {0146-4833},
pages = {80--80},
- url =
{http://detache.cmcl.cs.cmu.edu/~kunwadee/research/papers/ccrabstract.pdf},
- publisher = {ACM Press},
+ %url =
{http://detache.cmcl.cs.cmu.edu/~kunwadee/research/papers/ccrabstract.pdf},
+ publisher = {ACM Press}
}
%Agent techniques in p2p systems
@@ -445,11 +445,11 @@
title = {Agent-based transactions into decentralised P2P},
booktitle = {Proceedings of the first international joint conference
on Autonomous agents and multiagent systems},
year = {2002},
- isbn = {1-58113-480-0},
+ %isbn = {1-58113-480-0},
pages = {1288--1289},
location = {Bologna, Italy},
- url = {http://doi.acm.org/10.1145/545056.545118},
- publisher = {ACM Press},
+ %url = {http://doi.acm.org/10.1145/545056.545118},
+ publisher = {ACM Press}
}
%Security issues, reputation in p2p networks
@@ -458,11 +458,11 @@
title = {Choosing reputable servents in a {P2P} network},
booktitle = {Proceedings of the eleventh international conference on
World Wide Web},
year = {2002},
- isbn = {1-58113-449-5},
+ %isbn = {1-58113-449-5},
pages = {376--386},
location = {Honolulu, Hawaii, USA},
- url = {http://doi.acm.org/10.1145/511446.511496},
- publisher = {ACM Press},
+ %url = {http://doi.acm.org/10.1145/511446.511496},
+ publisher = {ACM Press}
}
%GISP p2p systems, which is built on JXTA framework
@@ -472,8 +472,8 @@
booktitle = {Proceedings of 2nd International Conference on
Peer-to-Peer Computing (P2P'02)},
year = {2002},
pages = {65--73},
- location = { Linkoping, Sweden },
- url = {http://www.stanford.edu/~daishi/papers/gisp2002.pdf}
+ location = {Linkoping, Sweden},
+ %url = {http://www.stanford.edu/~daishi/papers/gisp2002.pdf}
}
%Security issues related to p2p systems
@@ -482,11 +482,11 @@
title = {Managing trust in a Peer-to-Peer information system},
booktitle = {Proceedings of the tenth international conference on
Information and knowledge management},
year = {2001},
- isbn = {1-58113-436-3},
+ %isbn = {1-58113-436-3},
pages = {310--317},
location = {Atlanta, Georgia, USA},
- url = {http://www.p-grid.org/Papers/CIKM2001.pdf},
- publisher = {ACM Press},
+ %url = {http://www.p-grid.org/Papers/CIKM2001.pdf},
+ publisher = {ACM Press}
}
%Own publication: initial p2p and gzz
@@ -495,11 +495,11 @@
title = {Freenet-like {GUIDs} for implementing xanalogical hypertext},
booktitle = {Proceedings of the thirteenth conference on Hypertext and
hypermedia},
year = {2002},
- isbn = {1-58113-477-0},
+ %isbn = {1-58113-477-0},
pages = {194--195},
location = {College Park, Maryland, USA},
- doi = {http://doi.acm.org/10.1145/513338.513386},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/513338.513386},
+ publisher = {ACM Press}
}
%Xanalogical structures
@@ -512,8 +512,8 @@
year = {1999},
issn = {0360-0300},
pages = {33},
- doi = {http://doi.acm.org/10.1145/345966.346033},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/345966.346033},
+ publisher = {ACM Press}
}
%Groove p2p system
@@ -524,8 +524,8 @@
year = {2001},
location = {Orlando, Florida},
pages = {399 -- 404},
- isbn = {980--07--7541--2},
- url = {http://erwin.dstc.edu.au/Herring/GrooveAnalysis-SCI2001.pdf}
+ %isbn = {980--07--7541--2}
+ %url = {http://erwin.dstc.edu.au/Herring/GrooveAnalysis-SCI2001.pdf}
}
%Hypermedia in p2p networks
@@ -534,11 +534,11 @@
title = {Hypermedia by coincidence},
booktitle = {Proceedings of the twelfth ACM conference on Hypertext and
Hypermedia},
year = {2001},
- isbn = {1-59113-420-7},
+ %isbn = {1-59113-420-7},
pages = {129--130},
location = {Arhus, Denmark},
- url =
{http://eprints.ecs.soton.ac.uk/archive/00005901/01/ht01-coincidence.pdf},
- publisher = {ACM Press},
+ %url =
{http://eprints.ecs.soton.ac.uk/archive/00005901/01/ht01-coincidence.pdf},
+ publisher = {ACM Press}
}
%Search methods in p2p networks
@@ -547,8 +547,8 @@
title = {Local Search in Unstructured Networks},
booktitle = {Review chapter to appear in: 'Handbook of Graphs and
Networks: From the Genome to the Internet},
year = {2002},
- location = {Berlin, Germany},
- url = {http://www.hpl.hp.com/shl/papers/review/reviewchap.pdf}
+ location = {Berlin, Germany}
+ %url = {http://www.hpl.hp.com/shl/papers/review/reviewchap.pdf}
}
@@ -559,8 +559,8 @@
journal = {Physical Review E},
volume = {64},
number = {046135},
- year = {2001},
- url = {http://www.hpl.hp.com/shl/papers/plsearch/PRE46135.pdf}
+ year = {2001}
+ %url = {http://www.hpl.hp.com/shl/papers/plsearch/PRE46135.pdf}
}
%Analysis about routing in p2p networks
@@ -569,8 +569,8 @@
title = {Scalability Issues for Query Routing Service Discovery},
booktitle = {Proceedings of the Second Workshop on Infrastructure for
Agents, MAS and Scalable MAS at the Fourth International Conference on
Autonomous Agents (ICMAS2001)},
pages = {209-217},
- year = {2001},
- url =
{http://www.cs.cf.ac.uk/User/O.F.Rana/agents2001/papers/13_gibbins_hall.pdf}
+ year = {2001}
+ %url =
{http://www.cs.cf.ac.uk/User/O.F.Rana/agents2001/papers/13_gibbins_hall.pdf}
}
%Analysis about p2p systems
@@ -579,8 +579,8 @@
title = {A Measurement Study of Peer-to-Peer File Sharing Systems},
booktitle = {Proceedings of Multimedia Computing and Networking 2002
(MMCN '02)},
year = {2002},
- location = {San Jose, CA, USA},
- url = {http://www.cs.washington.edu/homes/gribble/papers/mmcn.pdf}
+ location = {San Jose, CA, USA}
+ %url = {http://www.cs.washington.edu/homes/gribble/papers/mmcn.pdf}
}
@@ -590,11 +590,11 @@
title = {Resource discovery in distributed networks},
booktitle = {Proceedings of the eighteenth annual ACM symposium on
Principles of distributed computing},
year = {1999},
- isbn = {1-58113-099-6},
+ %isbn = {1-58113-099-6},
pages = {229--237},
location = {Atlanta, Georgia, United States},
- url =
{http://www.cs.ucsd.edu/~savage/cse291/papers/Harchol-Balter99.pdf},
- publisher = {ACM Press},
+ %url =
{http://www.cs.ucsd.edu/~savage/cse291/papers/Harchol-Balter99.pdf},
+ publisher = {ACM Press}
}
@@ -616,8 +616,8 @@
Volume = {6},
Number = {1},
Month = {Jan./Feb.},
- Year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/128.pdf}
+ Year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/128.pdf}
}
@@ -627,8 +627,8 @@
title = {Peer-to-peer Architecture Case Study: Gnutella Network},
booktitle = {Proceedings of International Conference on Peer-to-peer
Computing},
year = {2001},
- month = {August},
- url = {http://www.cs.uchicago.edu/~matei/PAPERS/gnutella-rc.pdf }
+ month = {August}
+ %url = {http://www.cs.uchicago.edu/~matei/PAPERS/gnutella-rc.pdf }
}
%Search engine built on Freenet p2p system
@@ -637,8 +637,8 @@
title = {{FASD}: A Fault-tolerant, Adaptive, Scalable, Distributed
Search Engine},
school = {Princeton University},
month = {May},
- year = {2002},
- url =
{http://freenetproject.org/twiki/Main/FASD/kronfol_final_thesis.pdf}
+ year = {2002}
+ %url =
{http://freenetproject.org/twiki/Main/FASD/kronfol_final_thesis.pdf}
}
@@ -648,8 +648,8 @@
title = {Search in {JXTA} and Other Distributed Networks},
booktitle = {First International Conference on Peer-to-Peer Computing
(P2P'01)},
year = {2001},
- location = {Lingkoping, Sweden},
- url =
{http://ieeexplore.ieee.org/iel5/7771/21356/00990421.pdf?isNumber=21356&prod=CNF&arnumber=990421&arSt=30&ared=35&arAuthor=Botros%2C+S.%3B+Waterhouse%2C+S.}
+ location = {Lingkoping, Sweden}
+ %url =
{http://ieeexplore.ieee.org/iel5/7771/21356/00990421.pdf?isNumber=21356&prod=CNF&arnumber=990421&arSt=30&ared=35&arAuthor=Botros%2C+S.%3B+Waterhouse%2C+S.}
}
@@ -659,11 +659,11 @@
title = {Compact, adaptive placement schemes for non-uniform
requirements},
booktitle = {Proceedings of the fourteenth annual ACM symposium on
Parallel algorithms and architectures},
year = {2002},
- isbn = {1-58113-529-7},
+ %isbn = {1-58113-529-7},
pages = {53--62},
location = {Winnipeg, Manitoba, Canada},
- url = {http://doi.acm.org/10.1145/564870.564878},
- publisher = {ACM Press},
+ %url = {http://doi.acm.org/10.1145/564870.564878},
+ publisher = {ACM Press}
}
@@ -673,11 +673,11 @@
title = {Peer-to-peer Hypertext},
booktitle = {Proceedings of the thirteenth conference on Hypertext and
hypermedia},
year = {2002},
- isbn = {1-58113-477-0},
+ %isbn = {1-58113-477-0},
pages = {69--71},
location = {College Park, Maryland, USA},
- url = {http://eprints.ecs.soton.ac.uk/archive/00006647/},
- publisher = {ACM Press},
+ %url = {http://eprints.ecs.soton.ac.uk/archive/00006647/},
+ publisher = {ACM Press}
}
%Discussion about p2p and hypertext
@@ -686,11 +686,11 @@
title = {Open hypermedia in a peer-to-peer context},
booktitle = {Proceedings of the thirteenth conference on Hypertext and
hypermedia},
year = {2002},
- isbn = {1-58113-477-0},
+ %isbn = {1-58113-477-0},
pages = {138--139},
location = {College Park, Maryland, USA},
- url = {http://doi.acm.org/10.1145/513338.513373},
- publisher = {ACM Press},
+ %url = {http://doi.acm.org/10.1145/513338.513373},
+ publisher = {ACM Press}
}
%Overview of distributed file systems
@@ -703,8 +703,8 @@
year = {1990},
issn = {0360-0300},
pages = {321--374},
- url = {http://doi.acm.org/10.1145/98163.98169},
- publisher = {ACM Press},
+ %url = {http://doi.acm.org/10.1145/98163.98169},
+ publisher = {ACM Press}
}
%DHT which is relies on geographic hash
@@ -713,11 +713,11 @@
title = {{GHT}: a geographic hash table for data-centric storage},
booktitle = {Proceedings of the first ACM international workshop on
Wireless sensor networks and applications},
year = {2002},
- isbn = {1-58113-589-0},
+ %isbn = {1-58113-589-0},
pages = {78--87},
location = {Atlanta, Georgia, USA},
- url = {http://wsna02.cs.uga.edu/papers/p78-ratnasamy.pdf},
- publisher = {ACM Press},
+ %url = {http://wsna02.cs.uga.edu/papers/p78-ratnasamy.pdf},
+ publisher = {ACM Press}
}
%SDSI (distributed key management) in Chord p2p system
@@ -726,7 +726,7 @@
title = {{C}on{C}hord: Cooperative {SDSI} Certificate Storage and Name
Resolution},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
year = {2002},
- url = {http://www.pmg.lcs.mit.edu/~ajmani/papers/lncs2429.pdf}
+ %url = {http://www.pmg.lcs.mit.edu/~ajmani/papers/lncs2429.pdf}
}
@@ -736,7 +736,7 @@
title = {{LS*S}: A High-Availability and High-Security Scalable
Distributed Data Structure},
booktitle = {Proceedings of Research Issues in Data Engineering (RIDE)},
year = {1997},
- url = {http://ceria.dauphine.fr/Lhraid2.pdf}
+ %url = {http://ceria.dauphine.fr/Lhraid2.pdf}
}
%Term Distributed Hash Table mentioned first time
@@ -749,8 +749,8 @@
year = {1996},
issn = {0362-5915},
pages = {480--525},
- doi = {http://doi.acm.org/10.1145/236711.236713},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/236711.236713},
+ publisher = {ACM Press}
}
@@ -791,7 +791,7 @@
number = "1",
pages = "48--63",
year = "1996",
- url = "citeseer.nj.nec.com/stonebraker96mariposa.html"
+ %url = "citeseer.nj.nec.com/stonebraker96mariposa.html"
}
%Mobile ad-hoc networks
@@ -823,8 +823,8 @@
year = {1970},
issn = {0001-0782},
pages = {422--426},
- doi = {http://doi.acm.org/10.1145/362686.362692},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/362686.362692},
+ publisher = {ACM Press}
}
%Feasibility studie of DFS on desktop PCs: Farsite
@@ -833,11 +833,11 @@
title = {Feasibility of a serverless distributed file system deployed
on an existing set of desktop PCs},
booktitle = {Proceedings of the 2000 ACM SIGMETRICS international
conference on Measurement and modeling of computer systems},
year = {2000},
- isbn = {1-58113-194-1},
+ %isbn = {1-58113-194-1},
pages = {34--43},
location = {Santa Clara, California, United States},
- doi = {http://doi.acm.org/10.1145/339331.339345},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/339331.339345},
+ publisher = {ACM Press}
}
%PAST storage utility
@@ -846,8 +846,8 @@
title = "Storage Management and Caching in {PAST}, A Large-scale,
Persistent Peer-to-peer Storage Utility",
booktitle = "Symposium on Operating Systems Principles",
pages = "188-201",
- year = "2001",
- url = "http://www.cs.ucsd.edu/sosp01/papers/rowstron.pdf";
+ year = "2001"
+ %url = "http://www.cs.ucsd.edu/sosp01/papers/rowstron.pdf";
}
%Search method
@@ -857,8 +857,8 @@
booktitle = {Proceedings of International Workshop on Peer-to-Peer
Computing},
publisher = {Springer-Verlag},
year = 2002,
- month = may,
- url = "http://www.cs.rutgers.edu/~mcuenca";,
+ month = may
+ %url = "http://www.cs.rutgers.edu/~mcuenca";
}
%Review of existing p2p systems
@@ -868,8 +868,8 @@
title = "Peer-to-Peer Computing",
institution = "Hewlett-Packard",
number = "HPL-2002-57",
- year = 2002,
- url = "http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf";
+ year = 2002
+ %url = "http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf";
}
%Alpine p2p system, licence LGPL
@@ -920,8 +920,8 @@
title = {Traditional and Non-Traditional Applications; Peer-to-Peer
Networks},
author = {Ross Lee Graham},
text = {Lecture},
- year = {2002},
- url = {http://www.ida.liu.se/conferences/p2p/p2p2001/p2pwhatis.html}
+ year = {2002}
+ %url = {http://www.ida.liu.se/conferences/p2p/p2p2001/p2pwhatis.html}
}
%definition of p2p
@@ -937,16 +937,16 @@
@misc{shirky00whatisp2p,
title = {What is P2P...and what Isn't},
author = {Clay Shirky},
- year = {2000},
- url =
{http://www.openp2p.com/pub/a/p2p/2000/11/24/shirky1-whatisp2p.html,
http://www.ida.liu.se/conferences/p2p/p2p2001/pure.html}
+ year = {2000}
+ %url =
{http://www.openp2p.com/pub/a/p2p/2000/11/24/shirky1-whatisp2p.html,
http://www.ida.liu.se/conferences/p2p/p2p2001/pure.html}
}
%definition of p2p (good one!)
@misc{winer00whatisp2p,
title = {What is P2P?},
author = {Dave Winer},
- year = {2000},
- url = {http://davenet.userland.com/2000/09/20/whatIsP2p}
+ year = {2000}
+ %url = {http://davenet.userland.com/2000/09/20/whatIsP2p}
}
%distributed net
@@ -968,13 +968,13 @@
author = {Ian Foster and Carl Kesselman},
year = {1998},
publisher = {Morgan Kaufmann Publishers},
- isbn = {1558604758}
+ %isbn = {1558604758}
}
@book{perkins01adhocnetworking,
title = {Ad Hoc Networking},
author = {Charles E. Perkins},
- isbn = {0--201--30976--9},
+ %isbn = {0--201--30976--9},
publisher ={Addison-Wesley},
year = {2001}
}
@@ -1005,8 +1005,8 @@
author = "Russel Sandberg",
title = "The Sun Network Filesystem: Design, Implementation, and
Experience",
booktitle = "Proceedings of the Summer 1986 USENIX Technical Conference
and Exhibition",
- year = "1986",
- url =
"http://www.diku.dk/topps/activities/plan10/papers/sandbergnfs.pdf";
+ year = "1986"
+ %url =
"http://www.diku.dk/topps/activities/plan10/papers/sandbergnfs.pdf";
}
@@ -1016,8 +1016,8 @@
booktitle = {Proceedings of the Fourth International Workshop on the
Web and Databases (WebDB'2001)},
year = {2001},
month = {may},
- location = {Santa Barbara, CA, USA},
- url = {http://www.cs.washington.edu/homes/gribble/papers/p2p.pdf}
+ location = {Santa Barbara, CA, USA}
+ %url = {http://www.cs.washington.edu/homes/gribble/papers/p2p.pdf}
}
@misc{internet2url,
@@ -1030,8 +1030,8 @@
title = "The {Free Haven Project}: Distributed Anonymous Storage
Service",
booktitle = "Workshop on Design Issues in Anonymity and
Unobservability",
pages = "67-95",
- year = "2000",
- url = "http://www.freehaven.net/paper/paper.html";
+ year = "2000"
+ %url = "http://www.freehaven.net/paper/paper.html";
}
%Anonymity
@@ -1055,8 +1055,8 @@
volume = "1",
number = "1",
pages = "66--92",
- year = "1998",
- url = "http://avirubin.com/crowds.pdf";
+ year = "1998"
+ %url = "http://avirubin.com/crowds.pdf";
}
%Anonymity
@@ -1065,11 +1065,11 @@
title = {A protocol for anonymous communication over the Internet},
booktitle = {Proceedings of the 7th ACM conference on Computer and
communications security},
year = {2000},
- isbn = {1-58113-203-4},
+ %isbn = {1-58113-203-4},
pages = {33--42},
location = {Athens, Greece},
- doi = {http://doi.acm.org/10.1145/352600.352607},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/352600.352607},
+ publisher = {ACM Press}
}
%Anonymity
@@ -1082,8 +1082,8 @@
year = {1999},
issn = {0001-0782},
pages = {42--47},
- doi = {http://doi.acm.org/10.1145/293411.293447},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/293411.293447},
+ publisher = {ACM Press}
}
%Publius publishing system
@@ -1094,8 +1094,8 @@
booktitle = {Proc. 9th USENIX Security Symposium},
pages = {59--72},
year = 2000,
- month = {August},
- url = {http://cs1.cs.nyu.edu/~waldman/publius/publius.pdf}
+ month = {August}
+ %url = {http://cs1.cs.nyu.edu/~waldman/publius/publius.pdf}
}
%Definition of self organizing system
@@ -1129,8 +1129,8 @@
publisher = "Springer-Verlag",
editor = "S. Abiteboul and A.-M. Vercoustre",
pages = "443--452",
- year = "1999",
- url = "http://www.hpl.hp.com/shl/papers/smallworld/smallworldpaper.html";
+ year = "1999"
+ %url =
"http://www.hpl.hp.com/shl/papers/smallworld/smallworldpaper.html";
}
%The Small world problem
@@ -1140,8 +1140,8 @@
booktitle = {Proceedings of International Parallel and Distributed
Computing Symposium (IPDPS)},
location = {Fort Lauderdale, Florida},
year = {2002},
- month = {april},
- url = {http://www.cs.ucr.edu/~vana/kalogeraki-IPDPS02.ps}
+ month = {april}
+ %url = {http://www.cs.ucr.edu/~vana/kalogeraki-IPDPS02.ps}
}
%1st major milestone that showed that high performance can be obtained by
using a number of standard machines
@@ -1151,8 +1151,8 @@
booktitle = "Proceedings of the 24th International Conference on
Parallel Processing",
address = "Oconomowoc, WI",
pages = "I:11--14",
- year = "1995",
- url = "http://www.beowulf.org/papers/ICPP95/icpp95.html";
+ year = "1995"
+ %url = "http://www.beowulf.org/papers/ICPP95/icpp95.html";
}
%Example of grid computing
@@ -1164,8 +1164,8 @@
number = "2/3",
month = "Summer\slash Fall",
pages = "123--131",
- year = "1996",
- url = "citeseer.nj.nec.com/defanti96overview.html"
+ year = "1996"
+ %url = "citeseer.nj.nec.com/defanti96overview.html"
}
@@ -1182,8 +1182,8 @@
title = "Probabilistic location and routing",
booktitle = {Proceedings of the 21st Annual Joint Conference of the
IEEE Computer and Communications Societies},
month = {June},
- year = "2002",
- url =
"http://oceanstore.cs.berkeley.edu/publications/papers/pdf/rk-infocom-2002.pdf";
+ year = "2002"
+ %url =
"http://oceanstore.cs.berkeley.edu/publications/papers/pdf/rk-infocom-2002.pdf";
}
%Tangler publishing system
@@ -1192,11 +1192,11 @@
title = {Tangler: a censorship-resistant publishing system based on
document entanglements},
booktitle = {Proceedings of the 8th ACM conference on Computer and
Communications Security},
year = {2001},
- isbn = {1-58113-385-5},
+ %isbn = {1-58113-385-5},
pages = {126--135},
location = {Philadelphia, PA, USA},
- doi = {http://doi.acm.org/10.1145/501983.502002},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/501983.502002},
+ publisher = {ACM Press}
}
%Security considerations for structured peer-to-peer overlay networks
@@ -1227,8 +1227,8 @@
journal = "Cornell Computer Science Technical Report",
volume = "1776",
number = "99",
- year = "1999",
- url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html#papers";
+ year = "1999"
+ %url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html#papers";
}
%Small world phenomenon
@@ -1240,8 +1240,8 @@
editor = "T. G. Dietterich and S. Becker and Z. Ghahramani",
publisher = "MIT Press",
address = "Cambridge, MA",
- year = "2002",
- url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html#papers";
+ year = "2002"
+ %url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html#papers";
}
%Small world phenomenon in Freenet
@@ -1249,8 +1249,8 @@
author = "H. Zhang and A. Goel and R. Govindan",
title = "Using the Small-World Model to Improve {F}reenet's
Performance",
booktitle = "Proceedings of IEEE Infocom",
- year = "2002",
- url = "http://www.ieee-infocom.org/2002/papers/386.pdf";
+ year = "2002"
+ %url = "http://www.ieee-infocom.org/2002/papers/386.pdf";
}
%SWAN system (small world network)
@@ -1267,11 +1267,11 @@
title = {Core specification and experiments in {DIET}: a decentralised
ecosystem-inspired mobile agent system},
booktitle = {Proceedings of the first international joint conference on
Autonomous agents and multiagent systems},
year = {2002},
- isbn = {1-58113-480-0},
+ %isbn = {1-58113-480-0},
pages = {623--630},
location = {Bologna, Italy},
- doi = {http://doi.acm.org/10.1145/544862.544890},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/544862.544890},
+ publisher = {ACM Press}
}
%SHA-1 secure hash standard
@@ -1287,8 +1287,8 @@
title = {Brocade: Landmark routing on overlay networks},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
year = {2002},
- month = {March},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/151.pdf}
+ month = {March}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/151.pdf}
}
@misc{neurogridurl,
@@ -1302,16 +1302,16 @@
title = {Butterflies and Peer-to-Peer Networks},
booktitle = {Proceedings of ESA 2002 (LNCS)},
year = {2002},
- month = {June},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-33&format=pdf&compression=}
+ month = {June}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-33&format=pdf&compression=}
}
@inproceedings{crespo02semanticoverlay,
author = {Arturo Crespo and Hector Garcia-Molina},
title = {Semantic Overlay Networks for {P2P} Systems},
booktitle = {Submitted for Publication},
- year = {2003},
- url = {http://www-db.stanford.edu/~crespo/publications/op2p.pdf}
+ year = {2003}
+ %url = {http://www-db.stanford.edu/~crespo/publications/op2p.pdf}
}
@inproceedings{ripeanu02mapping,
@@ -1319,8 +1319,8 @@
title = {Mapping the Gnutella Network: Macroscopic Properties of
Large-Scale Peer-to-Peer Systems},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/128.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/128.pdf}
}
@inproceedings{lv02gnutellascalable,
@@ -1328,8 +1328,8 @@
title = {Can Heterogeneity Make Gnutella Scalable ?},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/165.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/165.pdf}
}
@inProceedings{keleher-02-p2p,
@@ -1337,8 +1337,8 @@
author = "Pete Keleher and Samrat Bhattacharjee and Bujor Silaghi",
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/169.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/169.pdf}
}
@inProceedings{saia02dynamicfaultcontentnetwork,
@@ -1346,8 +1346,8 @@
author = "Jared Saia and Amos Fiat and Steven Gribble and Anna Karlin
and Stefan Saroiu",
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/180.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/180.pdf}
}
@inProceedings{yang02efficientsearch,
@@ -1355,8 +1355,8 @@
author = "Beverly Yang and Hector Garcia-Molina",
booktitle = {Proceedings of the 22nd IEEE International Conference on
Distributed Computing Systems (ICDCS)},
month = {July},
- year = {2002},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2001-47&format=pdf&compression=}
+ year = {2002}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2001-47&format=pdf&compression=}
}
@@ -1365,16 +1365,16 @@
author = "Nancy Lynch and Dahlia Malkhi and David Ratajczak",
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/137.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/137.pdf}
}
@inProceedings{yang02comparinghybrid,
title = "Comparing Hybrid Peer-to-Peer Systems",
author = "Beverly Yang and Hector Garcia-Molina",
booktitle = {Proceedings of Very Large Databases (VLDB)},
- year = {2001},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2000-35&format=pdf&compression=}
+ year = {2001}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2000-35&format=pdf&compression=}
}
@inproceedings{571863,
@@ -1382,11 +1382,11 @@
title = {Analysis of the evolution of peer-to-peer systems},
booktitle = {Proceedings of the twenty-first annual symposium on
Principles of distributed computing},
year = {2002},
- isbn = {1-58113-485-1},
+ %isbn = {1-58113-485-1},
pages = {233--242},
location = {Monterey, California},
- doi = {http://doi.acm.org/10.1145/571825.571863},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/571825.571863},
+ publisher = {ACM Press}
}
@@ -1396,8 +1396,8 @@
booktitle = {Proceedings of the 10th ACM SIGOPS European Workshop},
location = {Saint-Émilion, France},
month = {September},
- year = {2002},
- url = {http://www.eecs.harvard.edu/~jonathan/p2p/sigops02abstract.pdf}
+ year = {2002}
+ %url = {http://www.eecs.harvard.edu/~jonathan/p2p/sigops02abstract.pdf}
}
@inProceedings{castro02securerouting,
@@ -1406,8 +1406,8 @@
booktitle = {Proceedings of the 5th Usenix Symposium on Operating
Systems Design and Implementation},
location = {Boston, MA},
month = {December},
- year = {2002},
- url = {http://www.cs.rice.edu/~dwallach/pub/osdi2002.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/~dwallach/pub/osdi2002.pdf}
}
%WOW!
@@ -1416,8 +1416,8 @@
title = {A Framework for Resource Management in Peer-to-Peer Networks},
booktitle = {Proceedings of NetObjectdays 2002},
month = {October},
- year ={2002},
- url = {http://www.netobjectdays.org/pdf/02/papers/node/0017.pdf}
+ year ={2002}
+ %url = {http://www.netobjectdays.org/pdf/02/papers/node/0017.pdf}
}
@inProceedings{schlosser-scalable,
@@ -1425,8 +1425,8 @@
title = "A Scalable and Ontology-Based P2P Infrastructure for Semantic
Web Services",
booktitle = "Proceedings of the Second IEEE International Conference on
Peer-to-Peer Computing (P2P2002)",
month = {September},
- year = {2002},
- url = "http://www-db.stanford.edu/~schloss/docs/SWSP2P-P2P2002.pdf";
+ year = {2002}
+ %url = "http://www-db.stanford.edu/~schloss/docs/SWSP2P-P2P2002.pdf";
}
@misc{joseph02p2players,
@@ -1440,8 +1440,8 @@
title = {Scalable, Efficient Range Queries for Grid Information
Services},
booktitle = "Proceedings of the Second IEEE International Conference on
Peer-to-Peer Computing (P2P2002)",
month = {September},
- year = {2002},
- url = {http://www.hpl.hp.com/techreports/2002/HPL-2002-209.pdf}
+ year = {2002}
+ %url = {http://www.hpl.hp.com/techreports/2002/HPL-2002-209.pdf}
}
@inProceedings{joseph02neurogrid,
@@ -1450,8 +1450,8 @@
booktitle = {Proceedings of Internation Workshop on Peer-to-Peer
Computing},
location = {Pisa, Italy},
month = {May},
- year = {2002},
- url = {http://www.neurogrid.net/NeuroGridSimulations_mod_b.pdf}
+ year = {2002}
+ %url = {http://www.neurogrid.net/NeuroGridSimulations_mod_b.pdf}
}
@inProceedings{babaoglu02anthill,
@@ -1460,8 +1460,8 @@
booktitle = "Proceedings of the 22th International Conference on
Distributed Computing Systems",
location = {Vienna, Austria},
month = {July},
- year = "2002",
- url = "http://www.cs.unibo.it/projects/anthill/papers/anthill-01.pdf";
+ year = "2002"
+ %url = "http://www.cs.unibo.it/projects/anthill/papers/anthill-01.pdf";
}
%Research about network construction, molecules in cell, internet
@@ -1471,8 +1471,8 @@
journal = {Reviews of Modern Physics},
volume = {74},
number = {47},
- year = {2002},
- url = {http://www.santafe.edu/sfi/education/csss/files02/albert.pdf}
+ year = {2002}
+ %url = {http://www.santafe.edu/sfi/education/csss/files02/albert.pdf}
}
@article{albert-00-tolerance,
@@ -1531,7 +1531,7 @@
year = {1990},
issn = {0001-0782},
pages = {668--676},
- doi = {http://doi.acm.org/10.1145/78973.78977},
+ %doi = {http://doi.acm.org/10.1145/78973.78977},
publisher = {ACM Press},
}
@@ -1540,8 +1540,8 @@
title = "Censorship Resistant Peer-to-Peer Content Addressable
Networks",
booktitle = "Thirteenth ACM-SIAM Symposium on Discrete Algorithms",
month = "Jan",
- year = "2002",
- url = "citeseer.nj.nec.com/fiat02censorship.html"
+ year = "2002"
+ %url = "citeseer.nj.nec.com/fiat02censorship.html"
}
@inproceedings{gurmeet03symphony,
@@ -1550,8 +1550,8 @@
booktitle = {Proceedings of the 4th USENIX Symposium on Internet
Technologies and System (USITS '03)},
month = {March},
year = {2003},
- location = {Seattle, Washington},
- url = {http://www-db.stanford.edu/~manku/papers/03usits-symphony.pdf}
+ location = {Seattle, Washington}
+ %url = {http://www-db.stanford.edu/~manku/papers/03usits-symphony.pdf}
}
@inproceedings{258660,
@@ -1559,11 +1559,11 @@
title = {Consistent hashing and random trees: distributed caching
protocols for relieving hot spots on the World Wide Web},
booktitle = {Proceedings of the twenty-ninth annual ACM symposium on
Theory of computing},
year = {1997},
- isbn = {0-89791-888-6},
+ %isbn = {0-89791-888-6},
pages = {654--663},
location = {El Paso, Texas, United States},
- doi = {http://doi.acm.org/10.1145/258533.258660},
- publisher = {ACM Press},
+ %doi = {http://doi.acm.org/10.1145/258533.258660},
+ publisher = {ACM Press}
}
@@ -1589,8 +1589,8 @@
title = {Experiences Deploying a Large-Scale Emergent Network},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/188.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/188.pdf}
}
@inproceedings{eriksson03peernet,
@@ -1598,8 +1598,8 @@
title = {{PeerNet}: Pushing Peer-to-Peer Down the Stack},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {Mar},
- year = {2003},
- url = {http://www.cs.ucr.edu/~jeriksson/peernet_iptps03.pdf}
+ year = {2003}
+ %url = {http://www.cs.ucr.edu/~jeriksson/peernet_iptps03.pdf}
}
@@ -1608,8 +1608,8 @@
title = {Efficient Recovery From Organizational Disconnects in
{SkipNet}},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {Mar},
- year = {2003},
- url =
{http://research.microsoft.com/sn/Herald/papers/usits_submission.pdf}
+ year = {2003}
+ %url =
{http://research.microsoft.com/sn/Herald/papers/usits_submission.pdf}
}
@inproceedings{ansaryefficientbroadcast03,
@@ -1617,8 +1617,8 @@
title = {Efficient Broadcast in Structured {P2P} Networks},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {Mar},
- year = {2003},
- url = {http://www.sics.se/pepito/D2.7/paper3.pdf}
+ year = {2003}
+ %url = {http://www.sics.se/pepito/D2.7/paper3.pdf}
}
@inproceedings{harvey03skipnet2,
@@ -1627,8 +1627,8 @@
booktitle = {Proceedings of the 4th USENIX Symposium on Internet
Technologies and Systems (USITS '03)},
month = {March},
year = {2003},
- location = {Seattle, Washington},
- url =
{http://research.microsoft.com/sn/Herald/papers/usits_submission.pdf}
+ location = {Seattle, Washington}
+ %url =
{http://research.microsoft.com/sn/Herald/papers/usits_submission.pdf}
}
@inproceedings{castro03evalutionoverlays,
@@ -1636,8 +1636,8 @@
title = {An Evaluation of Scalable Application-Level Multicast Built
Using Peer-To-Peer Overlays},
booktitle = {The 22nd Annual Joint Conference of the IEEE Computer
and Communications Societies (INFOCOM 2003)},
month = {April},
- year = {2003},
- url = {http://research.microsoft.com/sn/Herald/papers/Infocom03.pdf}
+ year = {2003}
+ %url = {http://research.microsoft.com/sn/Herald/papers/Infocom03.pdf}
}
@inproceedings{garciamolina03sil,
@@ -1645,8 +1645,8 @@
title = {Studying search networks with {SIL}},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-51&format=pdf&compression=}
+ year = {2003}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-51&format=pdf&compression=}
}
@inproceedings{rowston03controlloingreliability,
@@ -1654,8 +1654,8 @@
title = {Controlling the Cost of Reliability in Peer-to-Peer Overlays},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {Mar},
- year = {2003},
- url = {http://research.microsoft.com/~antr/PAST/reliability.pdf}
+ year = {2003}
+ %url = {http://research.microsoft.com/~antr/PAST/reliability.pdf}
}
@inProceedings{Bhattacharjee03resultcache,
@@ -1663,8 +1663,8 @@
title = "Efficient Peer-To-Peer Searches Using Result-Caching",
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://www.cs.umd.edu/~keleher/papers/view02.pdf}
+ year = {2003}
+ %url = {http://www.cs.umd.edu/~keleher/papers/view02.pdf}
}
@inproceedings{byers03dhtbalancing,
@@ -1672,8 +1672,8 @@
title = {Simple Load Balancing for Distributed Hash Tables},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://www.cs.bu.edu/techreports/ps/2002-029-simple-load-balancing.ps}
+ year = {2003}
+ %url =
{http://www.cs.bu.edu/techreports/ps/2002-029-simple-load-balancing.ps}
}
@inproceedings{pias03lighthouse,
@@ -1681,8 +1681,8 @@
title = {Lighthouses for Scalable Distributed Location},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://www.cs.ucl.ac.uk/staff/m.pias/reports_ucl_phd/lighthouse-final.ps}
+ year = {2003}
+ %url =
{http://www.cs.ucl.ac.uk/staff/m.pias/reports_ucl_phd/lighthouse-final.ps}
}
@inproceedings{naor03simpledht,
@@ -1690,8 +1690,8 @@
title = {A Simple Fault Tolerant Distributed Hash Table},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://www.wisdom.weizmann.ac.il/~uwieder/papers/ftdht.ps}
+ year = {2003}
+ %url = {http://www.wisdom.weizmann.ac.il/~uwieder/papers/ftdht.ps}
}
@inproceedings{gupta03kelips,
@@ -1699,8 +1699,8 @@
title = {Kelips: Building an Efficient and Stable {P2P DHT} Through
Increased Memory and Background Overhead},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://www.cs.cornell.edu/info/projects/spinglass/public_pdfs/Kelips.pdf}
+ year = {2003}
+ %url =
{http://www.cs.cornell.edu/info/projects/spinglass/public_pdfs/Kelips.pdf}
}
@inproceedings{ng02predicting,
@@ -1708,8 +1708,8 @@
title = {Predicting Internet network distance with coordiantes-based
approaches},
booktitle = {The 21st Annual Joint Conference of the IEEE Computer
and Communications Societies (INFOCOM '02)},
location = {New York, USA},
- year = {2001},
- url = {http://www.ieee-infocom.org/2002/papers/785.pdf}
+ year = {2001}
+ %url = {http://www.ieee-infocom.org/2002/papers/785.pdf}
}
@InProceedings{Gribble:2000:SDD,
@@ -1717,8 +1717,8 @@
title = "Scalable, Distributed Data Structures for {Internet} Service
Construction",
booktitle = "Proceedings of the Fourth OSDI",
month = "October",
- year = "2000",
- url =
"http://www.usenix.org/publications/library/proceedings/osdi2000/gribble.html";
+ year = "2000"
+ %url =
"http://www.usenix.org/publications/library/proceedings/osdi2000/gribble.html";
}
@inproceedings{douceur02sybil,
@@ -1726,8 +1726,8 @@
title = {The {S}ybil Attack},
booktitle = {Proceedings of the 1st {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS02})},
month = {March},
- year = {2002},
- url = {http://www.cs.rice.edu/Conferences/IPTPS02/101.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/Conferences/IPTPS02/101.pdf}
}
@techreport{castro02networkproximity,
@@ -1735,8 +1735,8 @@
title = {Exploiting network proximity in peer-to-peer overlay networks},
number = {MSR-TR-2002-82},
institution = {Microsoft Research},
- year = {2002},
- url = {http://www.cs.rice.edu/CS/Systems/PAST/location.pdf}
+ year = {2002}
+ %url = {http://www.cs.rice.edu/CS/Systems/PAST/location.pdf}
}
@inproceedings{296824,
@@ -1744,11 +1744,11 @@
title = {Practical Byzantine fault tolerance},
booktitle = {Proceedings of the third symposium on Operating systems
design and implementation},
year = {1999},
- isbn = {1-880446-39-1},
+ %isbn = {1-880446-39-1},
pages = {173--186},
location = {New Orleans, Louisiana, United States},
- publisher = {USENIX Association},
- url = {http://www.pmg.lcs.mit.edu/papers/osdi99.pdf}
+ publisher = {USENIX Association}
+ %url = {http://www.pmg.lcs.mit.edu/papers/osdi99.pdf}
}
@inproceedings{juels99clientpuzzles,
@@ -1757,8 +1757,8 @@
booktitle = {Proceedings of NDSS '99 (Networks and Distributed Security
Systems)},
pages = {151--165},
month = {February},
- year = {1999.},
- url =
{http://www.rsasecurity.com/rsalabs/staff/bios/ajuels/publications/client-puzzles/clientpuzzles.ps}
+ year = {1999.}
+ %url =
{http://www.rsasecurity.com/rsalabs/staff/bios/ajuels/publications/client-puzzles/clientpuzzles.ps}
}
@article{357176,
@@ -1770,15 +1770,15 @@
year = {1982},
issn = {0164-0925},
pages = {382--401},
- doi = {http://doi.acm.org/10.1145/357172.357176},
+ %doi = {http://doi.acm.org/10.1145/357172.357176},
publisher = {ACM Press},
}
@misc{grahamp2psecurity,
title = {{P2P} Security Issues},
author = {Ross Lee Graham},
- year = {2001},
- url = {http://www.ida.liu.se/~rosgr/p2psecurity.html}
+ year = {2001}
+ howpublished = {http://www.ida.liu.se/~rosgr/p2psecurity.html}
}
@inproceedings{zhao03api,
@@ -1786,8 +1786,8 @@
title = "Towards a {C}ommon {API} for Structured Peer to Peer Overlays",
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/api.ps},
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/api.ps},
}
%Schema based access control
@@ -1796,7 +1796,7 @@
title = {Information Integration in Schema-Based Peer-To-Peer Networks},
booktitle = {In proceedings of the Twelfth International WWW03
Conference},
year = {2003},
- location = {Budapest, Hungary},
+ location = {Budapest, Hungary}
}
@inproceedings{bhagwan03availability,
@@ -1804,8 +1804,8 @@
title = {Understanding Availability},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/availability.pdf}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/availability.pdf}
}
@@ -1814,8 +1814,8 @@
title = {Rateless Codes and Big Downloads},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/rateless_codes.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/rateless_codes.ps}
}
@inproceedings{li03feasibility,
@@ -1823,8 +1823,8 @@
title = {On the Feasibility of Peer-to-Peer Web Indexing and Search},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://iptps03.cs.berkeley.edu/final-papers/search_feasibility.ps}
+ year = {2003}
+ %url =
{http://iptps03.cs.berkeley.edu/final-papers/search_feasibility.ps}
}
@inproceedings{balakrishnan03semanticfree,
@@ -1832,8 +1832,8 @@
title = {Semantic-Free Referencing in Linked Distributed Systems},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/sfl.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/sfl.ps}
}
@inproceedings{zhang03somo,
@@ -1841,8 +1841,8 @@
title = {{SOMO}: self-organized metadata overlay for resource
management in {P2P DHT}},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/somo.pdf}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/somo.pdf}
}
@inproceedings{kaashoek03koorde,
@@ -1850,8 +1850,8 @@
title = {Koorde: A Simple Degree-optimal Hash Table},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/koorde.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/koorde.ps}
}
@inproceedings{rao03loadbalancing,
@@ -1859,8 +1859,8 @@
title = {Load Balancing in Structured P2P Systems},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/load_balancing.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/load_balancing.ps}
}
@inproceedings{rhea03benchmarks,
@@ -1868,8 +1868,8 @@
title = {Structured Peer-to-Peer Overlays Need Application-Driven
Benchmarks},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/benchmark.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/benchmark.ps}
}
@@ -1898,8 +1898,8 @@
number = {2},
year = {2003},
pages = {43--48},
- url = {http://project-iris.net/papers/cacm-paper.pdf},
- publisher = {ACM Press},
+ %url = {http://project-iris.net/papers/cacm-paper.pdf},
+ publisher = {ACM Press}
}
@@ -1936,8 +1936,8 @@
author ={Neil Daswani and Hector Garcia-Molina},
title = {Query-Flood {DoS} Attacks in {Gnutella}},
booktitle = {Proceedings of the ACM Transactions on Information Systems
({TOIS '02})},
- year = {2002},
- url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-26&format=pdf&compression=}
+ year = {2002}
+ %url =
{http://dbpubs.stanford.edu/pub/showDoc.Fulltext?lang=en&doc=2002-26&format=pdf&compression=}
}
@@ -1947,8 +1947,8 @@
booktitle ="In Proc. of the Eleventh International Workshop on Network
and Operating System Support
for Digital Audio and Video (NOSSDAV 2001)",
month = "June",
- year = "2001",
- url =
{http://www.cs.berkeley.edu/~ravenben/publications/pdf/bayeux.pdf}
+ year = "2001"
+ %url =
{http://www.cs.berkeley.edu/~ravenben/publications/pdf/bayeux.pdf}
}
@misc{fenfireurl,
@@ -1966,14 +1966,14 @@
year = {1996},
issn = {0004-5411},
pages = {293--330},
- doi = {http://doi.acm.org/10.1145/226643.226658},
+ %doi = {http://doi.acm.org/10.1145/226643.226658},
publisher = {ACM Press},
}
@misc{ted-xu-model,
author = {Ted Nelson},
title = {Deep hypertext: the {X}anadu{\textregistered} model},
- howpublished = {\url{http://xanadu.net/xuTheModel/}},
+ howpublished = {http://xanadu.net/xuTheModel},
year = 2001,
}
@@ -1989,37 +1989,37 @@
title = "{SDSI} -- {A} Simple Distributed Security Infrastructure",
howpublished = "Presented at CRYPTO'96 Rumpsession",
year = "1996",
- url = "http://theory.lcs.mit.edu/~rivest/sdsi10.html";
+ %url = "http://theory.lcs.mit.edu/~rivest/sdsi10.html";
}
@misc{spkiworkinggroup,
title = {Simple Public Key Infrastructure working group},
key = {Simple Public Key Infrastructure working group},
- url = {http://www.ietf.org/html.charters/spki-charter.html}
+ howpublished = {http://www.ietf.org/html.charters/spki-charter.html}
}
address@hidden,
address@hidden,
title = {Advogato Trust Metric},
key = {Advogato Trust Metric},
- url = {http://advogato.org/trust-metric.html}
+ howpublished = {http://advogato.org/trust-metric.html}
}
@misc{kashmirurl,
key = {Khashmir},
title ={Khashmir},
- url = {http://khashmir.sourceforge.net/}
+ howpublished = {http://khashmir.sourceforge.net/}
}
@misc{mixminionurl,
title ={Mixminion},
key = {Mixminion},
- url ={http://www.mixminion.net/}
+ howpublished ={http://www.mixminion.net/}
}
@misc{mneturl,
title = {MNet},
key = {MNet},
- url = {http://mnet.sourceforge.net/}
+ howpublished = {http://mnet.sourceforge.net/}
}
@article{Shamir1979a,
@@ -2054,10 +2054,10 @@
title = {Adaptive set intersections, unions, and differences},
booktitle = {Proceedings of the eleventh annual ACM-SIAM symposium on
Discrete algorithms},
year = {2000},
- isbn = {0-89871-453-2},
+ %isbn = {0-89871-453-2},
pages = {743--752},
location = {San Francisco, California, United States},
- doi = {http://doi.acm.org/10.1145/338219.338634},
+ %doi = {http://doi.acm.org/10.1145/338219.338634},
publisher = {ACM Press},
}
@@ -2067,8 +2067,8 @@
title = {Adaptive Peer Selection},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url =
{http://iptps03.cs.berkeley.edu/final-papers/adaptive_selection.pdf}
+ year = {2003}
+ %url =
{http://iptps03.cs.berkeley.edu/final-papers/adaptive_selection.pdf}
}
@article{504642,
@@ -2080,7 +2080,7 @@
year = {2001},
issn = {1063-6692},
pages = {392--403},
- doi = {http://doi.acm.org/10.1145/504640.504642},
+ %doi = {http://doi.acm.org/10.1145/504640.504642},
publisher = {ACM Press},
}
@@ -2119,8 +2119,8 @@
journal = {IEEE Internet Computing},
volume = {6},
pages = {68--73},
- year = {2002},
- url = {http://www.jxta.org/project/www/docs/jsearch.pdf}
+ year = {2002}
+ %url = {http://www.jxta.org/project/www/docs/jsearch.pdf}
}
@@ -2129,8 +2129,8 @@
title = {Rationality and Self-Interest in Peer to Peer Networks},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/rationality.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/rationality.ps}
}
@inproceedings{ngan03enforcefile,
@@ -2138,8 +2138,8 @@
title = {Enforcing Fair Sharing of Peer-to-Peer Resources},
booktitle = {Proceedings of the 2nd {I}nternational {W}orkshop on
{P}eer-to-{P}eer {S}ystems ({IPTPS03})},
month = {February},
- year = {2003},
- url = {http://iptps03.cs.berkeley.edu/final-papers/rationality.ps}
+ year = {2003}
+ %url = {http://iptps03.cs.berkeley.edu/final-papers/rationality.ps}
}
@misc{googleurl,
@@ -2157,7 +2157,7 @@
year = {1997},
issn = {0001-0782},
pages = {102--108},
- doi = {http://doi.acm.org/10.1145/253671.253741},
+ %doi = {http://doi.acm.org/10.1145/253671.253741},
publisher = {ACM Press},
}
@@ -2168,7 +2168,7 @@
publisher = {Prentice-Hall},
Pages = {651},
Year = {1990},
- ISBN = {0-13-643016-3}
+ %isbn = {0-13-643016-3}
}
@inproceedings{372148,
@@ -2176,10 +2176,10 @@
title = {Protecting web servers from distributed denial of service
attacks},
booktitle = {Proceedings of the tenth international conference on World
Wide Web},
year = {2001},
- isbn = {1-58113-348-0},
+ %isbn = {1-58113-348-0},
pages = {514--524},
location = {Hong Kong, Hong Kong},
- doi = {http://doi.acm.org/10.1145/371920.372148},
+ %doi = {http://doi.acm.org/10.1145/371920.372148},
publisher = {ACM Press},
}
@@ -2201,7 +2201,7 @@
title = {Implementing the ISO-OSI reference model},
booktitle = {Proceedings of the eigth Data Communications Symposium},
year = {1983},
- isbn = {0-89791-113-X},
+ %isbn = {0-89791-113-X},
pages = {56--66},
location = {North Falmouth, Massachusetts, United States},
}
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Gzz-commits] gzz/Documentation/misc/hemppah-progradu mastert...,
Hermanni Hyytiälä <=