/[gzz]/manuscripts/storm/short-paper.rst
ViewVC logotype

Diff of /manuscripts/storm/short-paper.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.47 by benja, Thu Jun 19 20:30:33 2003 UTC revision 1.48 by benja, Thu Jun 19 20:54:28 2003 UTC
# Line 11  Storm: Using P2P to Make the Desktop Par Line 11  Storm: Using P2P to Make the Desktop Par
11    
12  .. raw:: latex  .. raw:: latex
13    
    \conferenceinfo{HT'03,} {August 26--30, 2003, Nottingham, United Kingdom.}  
   
    \CopyrightYear{2003}  
   
    \crdata{1-58113-704-4/03/0008}  
   
14      \begin{abstract}      \begin{abstract}
15      We present Storm, a storage system which unifies the      We present Storm, a storage system which unifies the
16      desktop and the public network, making Web links between      desktop and the public network, making Web links between
# Line 63  Storm: Using P2P to Make the Desktop Par Line 57  Storm: Using P2P to Make the Desktop Par
57     {\bf Keywords:} dangling links,     {\bf Keywords:} dangling links,
58     peer-to-peer, location-independent identifiers, content addressable networks     peer-to-peer, location-independent identifiers, content addressable networks
59    
    %\category{H.3.4}{Information Storage and Re\-trie\-val}{Systems and Software}[distributed systems, information networks]  
    %\terms{Design, Reliability, Performance}  
    %\keywords{dangling links,  
    %peer-to-peer, location-independent identifiers, content addressable networks}  
   
60    
61  Introduction  Introduction
62  ============  ============
# Line 112  is not possible on a global scale. Line 101  is not possible on a global scale.
101  However, recent developments in peer-to-peer systems have  However, recent developments in peer-to-peer systems have
102  rendered this assumption obsolete.  rendered this assumption obsolete.
103  Distributed hashtables (DHTs) and other content-addressable network algorithms  Distributed hashtables (DHTs) and other content-addressable network algorithms
104  [kato02gisp-andalso-malkhi02viceroy-andalso-maymounkov02kademlia-andalso-ratnasamy01can-andalso-stoica01chord]_  [kato02gisp-andalso-malkhi02viceroy-andalso-maymounkov02kademlia-andalso-ratnasamy01can-andalso-stoica01chord-andalso-zhao01tapestry]_
105  allow location-independent identifiers  allow location-independent identifiers
106  to be resolved on a global scale.  to be resolved on a global scale.
107    The use of peer-to-peer technology in hypermedia systems
108    is the topic of an ongoing discussion in the hypermedia community
109    [bouvin02open-andalso-lukka02guids-andalso-thompson01coincidence-andalso-p2p-hypertext-panel]_.
110    
111  Balakrishnan et al.  [balakrishnan03semanticfree]_ argue  Balakrishnan et al.  [balakrishnan03semanticfree]_ argue
112  that DHTs are suitable for the next generation  that DHTs are suitable for the next generation
113  Reference Resolution Services (RRS) [#]_.  Reference Resolution Services (RRS) [#]_.
# Line 149  are used as location-independent identif Line 142  are used as location-independent identif
142  document versions.  document versions.
143    
144  ..  [#] A cryptographic hash  ..  [#] A cryptographic hash
145      is short bit-string      is short bit-string (often 160 bits)
146      computed from a document, so that      computed from a document, so that
147      it is practically impossible      it is practically impossible
148      that two different published documents      that two different published documents
149      will ever have the same hash.      will ever have the same hash.
150      For a 160 bit hash, about `$2^{80}$`      For a 160 bit hash, hash collisions start
151      documents can be published without      to appear at about `$2^{80}$` published documents;
152      hash collisions.      that's about 60 trillion per human living.
153      See, e.g., [schneier96appliedcryptography]_.      See, e.g., [schneier96appliedcryptography]_.
154    
155  .. Hashes allow reference to a single version of a  .. Hashes allow reference to a single version of a
# Line 351  and the use of a DHT for finding externa Line 344  and the use of a DHT for finding externa
344  Storm is by no means finished: more work is needed  Storm is by no means finished: more work is needed
345  on, e.g., versioning when a pointer is  on, e.g., versioning when a pointer is
346  editable by more than one person.  editable by more than one person.
347    A practical improvement will be
348    WebDAV support, allowing many more systems to
349    save data in Storm.
350    
351  ..  A distributed hashtable is used to locate published documents  ..  A distributed hashtable is used to locate published documents
352      on a global scale.      on a global scale.
353    
 .. A next step will be  
    WebDAV support, allowing many more systems to  
    save data in Storm.  
   
354  .. [#] Our implementation of Xanalogical storage  .. [#] Our implementation of Xanalogical storage
355     is available at ``http://sv.gnu.org/projects/alph``.     is available at ``http://sv.gnu.org/projects/alph``.
356    
# Line 367  Acknowledgements Line 359  Acknowledgements
359    
360  This work was funded by the Agora Center InBCT project.  This work was funded by the Agora Center InBCT project.
361  We would like to thank  We would like to thank
362  Jukka Honkela  Jukka Honkela,
363  Erno Kuusela,  Erno Kuusela,
364  Harri Oinas-Kukkonen, and  Harri Oinas-Kukkonen, and
365  Sarah Stehlig  Sarah Stehlig

Legend:
Removed from v.1.47  
changed lines
  Added in v.1.48

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26