Abstract
Redundancy in distributed systems is used to provide increased performance and reliability by techniques such as striping and mirroring [27.1], fast fail-over [27.2], and byzantine fault-tolerance [27.3]. These schemes are oriented toward collections of machines and devices which are fairly small (a few hundred at most) relative to modern wide-area distributed systems - particularly ‘peer-to-peer’ systems - which may have particpant nodes numbering in the hundreds of thousands.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Thomas Anderson, Michael Dahlin, Jeanna Neefe, David Patterson, Drew Roselli, and Randolph Wang. Serverless Network File Systems. In Proceedings of the 15th Symposium on Operating System Principles.ACM, pages 109–126, Copper Mountain Resort, Colorado, December 1995.
Fernando Pedone and Svend Frolund. Pronto: A Fast Failover Mechanism for Off-the-Shelf Commercial Databases. Technical Report HPL-2000-96, HP Laboratories, July 2000.
Miguel Castro and Barbara Liskov. Practical Byzantine Fault Tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation, Usenix Association, New Orleans, LA, USA, February 1999. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS.
F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP’ 01), Banff, Canada., October 2001.
Peter Druschel and Antony Rowstron. PAST:A large-scale, persistent peer-to-peer storage utility. In Proceedings of the EighthWorkshop on Hot Topics in Operating Systems (HotOSVIII). Schloss Elmau, Germany, May 2001.
John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, and Ben Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
Tim D. Moreton, Ian A. Pratt, and Timothy L. Harris. Storage, Mutability and Naming in Pasta. In Proceedings of the International Workshop on Peer-to-Peer Computing at Networking 2002, Pisa, Italy., May 2002.
S Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of ACM SIGCOMM 2001, San Diego, California, USA., August 2001.
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peerto-peer Lookup Service for Internet Applications. In Proceedings of ACM SIGCOMM 2001, San Diego, California, USA., August 2001.
Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM Internation Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November 2001.
BenY. Zhao, John D. Kubiatowicz, and Anthony D. Joseph. Tapestry:An Infrastructure for Fault-tolerantWide-area Location and Routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2000.
D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, February 1981.
Ross Anderson. The Eternity Service. In Proceedings of the 1st International Conference on the Theory and Applications of Cryptology (PRAGOCRYPT’96). CTU Publishing House, Prague, 1996.
Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Workshop on Design Issues in Anonymity and Unobservability, pages 46–66, July 2000.
Roger Dingledine, Michael J. Freedman, and David Molnar. The Free Haven Project: Distributed Anonymous Storage Service. In Workshop on Design Issues in Anonymity and Unobservability, pages 67–95, July 2000.
Marc Waldman, Aviel D. Rubin, and Lorrie Faith Cranor. Publius:Arobust, tamper-evident, censorship-resistant, web publishing system. In Proceeding of the 9th USENIX Security Symposium, pages 59–72, August 2000.
Steven Hand and Timothy Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, Boston, MA, March 2002.
Timothy Roscoe and Steven Hand. Transaction-based Charging in Mnemosyne: a Peerto-Peer Steganographic Storage System. In Proceedings of the InternationalWorkshop on Peer-to-Peer Computing at Networking 2002, Pisa, Italy., May 2002.
M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Communications of the ACM, 36(2):335–348, April 1989.
Phillip Rogaway, Mihir Bellare, John Black, and Ted Krovetz. OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption. In Eighth ACM Conference on Computer and Communications Security (CCS-8). ACM Press, August 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hand, S., Roscoe, T. (2003). Spread Spectrum Storage with Mnemosyne. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-37795-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00912-2
Online ISBN: 978-3-540-37795-5
eBook Packages: Springer Book Archive