Storage, Mutability and Naming in Pasta

  • Tim D. Moreton
  • Ian A. Pratt
  • Timothy L. Harris
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2376)


We outline the design and operation of Pasta, a peer-to-peer storage system that provides traditional file system semantics while offering the wide-spread caching and distribution required for publishing networks. Pasta allows users to manipulate shared files and folders with strong consistency semantics and to collaboratively organize them in unmanaged decentralized namespaces. Storage quotas regulate consumption and allow the network to offer permanence of content.


Data Block Multicast Tree Distribute Hash Table Storage Node Index Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Castro, P. Druschel, Y. Hu and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Submitted for publication.Google Scholar
  2. 2.
    M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In Proc. OSDI 1999.Google Scholar
  3. 3.
    F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP 2001.Google Scholar
  4. 4.
    K. Fu, M. F. Kaashoek and D. Mazières. Fast and secure distributed read-only file system. In Proc. OSDI 2000.Google Scholar
  5. 5.
    A. Muthitacharoen, B. Chen and D. Mazières. A Low-bandwidth Network File System. In Proc. ACM SOSP 2001.Google Scholar
  6. 6.
    S. J. Mullender, and A. S. Tanenbaum. A distributed file service based on optimistic concurrency control. In Proc. ACM SOSP 1985.Google Scholar
  7. 7.
    M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.Google Scholar
  8. 8.
    D. Reed, I. Pratt, P. Menage, S. Early and N. Stratford. Xenoservers: accounted execution of untrusted code. In Proc. HotOS 1999.Google Scholar
  9. 9.
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Middleware 2001.Google Scholar
  10. 10.
    A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP 2001, Oct. 2001.Google Scholar
  11. 11.
    A. Rowstron, A.-M. Kermarrec, P. Druschel and M. Castro. Scribe: The design of a large-scale event notification infrastructure. In Proc. NGC 2001.Google Scholar
  12. 12.
    I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM’01.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Tim D. Moreton
    • 1
  • Ian A. Pratt
    • 1
  • Timothy L. Harris
    • 1
  1. 1.University of Cambridge Computer LaboratoryCambridgeUK

Personalised recommendations