6 |
|
|
7 |
\begin{abstract} |
\begin{abstract} |
8 |
Linking personal documents like we link Web pages is inconvenient |
Linking personal documents like we link Web pages is inconvenient |
9 |
enough that users rarely ever do it. A major reason is that |
enough that users rarely if ever do it. A major reason is that |
10 |
links break when documents are moved around or sent by mail. |
links break when documents are moved around or sent by mail. |
11 |
|
|
12 |
We propose Storm, a storage system for use both on the |
We propose Storm, a storage system for use both on the |
13 |
desktop and the public network. Storm assigns each document |
desktop and the public network. Storm assigns each document |
14 |
a permanent URI when it is created. Using peer-to-peer |
a permanent unique URI when it is created. Using peer-to-peer |
15 |
technology, we can locate documents even though our URIs |
technology, we can locate documents even though our URIs |
16 |
do not include location information. |
do not include location information. |
17 |
Thus, links continue to work unchanged when documents are emailed |
Thus, links continue to work unchanged when documents are emailed |
18 |
or published on the network. |
or published on the network. |
19 |
|
|
20 |
We have extended KDE and Netscape Communicator 4 to understand |
We have extended KDE and Netscape Communicator 4 to understand |
21 |
our experimental URIs. Most other systems can use Storm |
Storm URIs. Other systems are able to use Storm |
22 |
through an HTTP gateway. |
through an HTTP gateway. |
23 |
\end{abstract} |
\end{abstract} |
24 |
|
|
97 |
In Freenet [freenet-ieee]_, an anonymous peer-to-peer |
In Freenet [freenet-ieee]_, an anonymous peer-to-peer |
98 |
publication system, *cryptographic hashes* [bakhtiari95cryptographic]_ |
publication system, *cryptographic hashes* [bakhtiari95cryptographic]_ |
99 |
are used to identify versions of documents. Hashes |
are used to identify versions of documents. Hashes |
100 |
are short, e.g. 20 bytes, yet it is extremely unlikely |
are short, e.g. 20 bytes, yet it is practically impossible |
101 |
that two different documents will ever have the same hash, |
that two different documents will ever have the same hash, |
102 |
making them ideal identifiers on the Web. |
making them ideal identifiers on the Web. |
103 |
|
|