240 |
|
|
241 |
We propose to use pointer records along with hash-based |
We propose to use pointer records along with hash-based |
242 |
addressing to implement a P2P-based replacement |
addressing to implement a P2P-based replacement |
243 |
for the Web (not including dynamic pages |
for the Web (not including server-side scripting). Such a Web |
|
generated through server-side scripting). Such a Web |
|
244 |
would have the benefits of semantic-free referencing-- |
would have the benefits of semantic-free referencing-- |
245 |
URIs don't have to change because of trademark conflicts |
URIs don't have to change because of trademark conflicts |
246 |
as in DNS, for example-- but go beyond the proposal |
as in DNS, for example-- but go beyond the proposal |
|
[balakrishnan03semanticfree]_ |
|
247 |
to replace DNS but keep the centralized architecture of |
to replace DNS but keep the centralized architecture of |
248 |
Web servers. |
Web servers [balakrishnan03semanticfree]_. |
249 |
|
|
250 |
The remainder of this paper is structured as follows. |
The remainder of this paper is structured as follows. |
251 |
In Section 2, we discuss how existing P2P systems handle updating. |
In Section 2, we discuss how existing P2P systems handle updating. |
252 |
In Section 3, we introduce pointer records. |
In Section 3, we introduce pointer records. |
253 |
In Section 4, we present the Storm data model. |
In Section 4, we present the Storm data model. |
254 |
In Section 5 we discuss some applications |
In Section 5 we discuss some applications, |
255 |
of our contributions, and Section 6 gives an overview of our |
and Section 6 discusses our |
256 |
implementation. Section 7 concludes. |
implementation. Section 7 concludes. |
257 |
|
|
258 |
Related work |
Related work |