Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Castro, P. Druschel, Y. Hu and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Submitted for publication.
M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In Proc. OSDI 1999.
F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP 2001.
K. Fu, M. F. Kaashoek and D. Mazières. Fast and secure distributed read-only file system. In Proc. OSDI 2000.
A. Muthitacharoen, B. Chen and D. Mazières. A Low-bandwidth Network File System. In Proc. ACM SOSP 2001.
S. J. Mullender, and A. S. Tanenbaum. A distributed file service based on optimistic concurrency control. In Proc. ACM SOSP 1985.
M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.
D. Reed, I. Pratt, P. Menage, S. Early and N. Stratford. Xenoservers: accounted execution of untrusted code. In Proc. HotOS 1999.
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.
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.
A. Rowstron, A.-M. Kermarrec, P. Druschel and M. Castro. Scribe: The design of a large-scale event notification infrastructure. In Proc. NGC 2001.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moreton, T.D., Pratt, I.A., Harris, T.L. (2002). Storage, Mutability and Naming in Pasta . In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds) Web Engineering and Peer-to-Peer Computing. NETWORKING 2002. Lecture Notes in Computer Science, vol 2376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45745-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-45745-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44177-9
Online ISBN: 978-3-540-45745-9
eBook Packages: Springer Book Archive