41 |
The Web could benefit greatly from the bandwith savings, |
The Web could benefit greatly from the bandwith savings, |
42 |
increased availability, and reduced server costs offered |
increased availability, and reduced server costs offered |
43 |
by filesharing systems. |
by filesharing systems. |
44 |
However, filesharing systems don't allow documents |
However, current update mechanisms for P2P networks do not |
45 |
to be updated, and |
offer the simplicity of filesharing systems, as versioning |
46 |
in P2P, updating has so far only been investigated |
information has to be kept as special internal state in the network. |
47 |
in systems that do not allow files to be obtained |
|
48 |
from any user who has a downloaded a copy, |
|
49 |
but only from locations designated by the system. |
.. filesharing systems don't allow documents |
50 |
|
to be updated. |
51 |
|
|
52 |
|
.. In P2P, updating has so far only been investigated |
53 |
|
in systems that do not allow files to be obtained |
54 |
|
from any user who has a downloaded a copy, |
55 |
|
but only from locations designated by the system. |
56 |
|
|
57 |
.. thus making them disappear once the original publisher loses interest. |
.. thus making them disappear once the original publisher loses interest. |
58 |
|
|
62 |
because |
because |
63 |
|
|
64 |
To allow versions to be obtained from any host that has a copy, |
To allow versions to be obtained from any host that has a copy, |
65 |
we propose to use *pointer records*, |
we propose to use *pointer records*, |
66 |
signed files associating a document's id, |
which can be shared and sought for |
|
its current version's hash, and a timestamp. |
|
|
Pointer records can be shared and sought for |
|
67 |
through the network as ordinary files. |
through the network as ordinary files. |
68 |
|
Similar to |
69 |
|
OceanStore's heartbeats, they are signed files containing a document's id, |
70 |
|
its current version's hash, and a timestamp. |
71 |
We also present the Storm data model, |
We also present the Storm data model, |
72 |
a simple API for hash-based storage, such as P2P networks. |
a simple API for hash-based storage systems, such as P2P networks. |
73 |
Using pointer records layered on the Storm |
Using pointer records layered on the Storm data model, |
74 |
data model, several P2P networks can be used interoperably |
all versions of a document, stored on any host in any P2P network, |
75 |
as a P2P Web (except, naturally, for dynamically generated pages). |
can be found using the same URI. |
76 |
All versions of a web page |
|
77 |
can be found using the same URI |
.. Past versions of a web page |
78 |
while residing on any host on any network. |
remain accessible as long as at least only one person keeps a copy. |
79 |
Past versions of a web page |
|
80 |
remain accessible as long as at least only one person keeps a copy. |
.. several P2P networks can be used interoperably |
81 |
|
as a P2P Web (except, naturally, for dynamically generated pages). |
82 |
|
|
83 |
We discuss our preliminary implementation |
We discuss our preliminary implementation |
84 |
of pointer records |
of pointer records |