skip to main content
article
Free Access

OceanStore: an architecture for global-scale persistent storage

Published:01 November 2000Publication History
Skip Abstract Section

Abstract

OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development.

References

  1. 1 M. Abadi. On SDSI's linked local name spaces. In Proc. of IEEE CSFW, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 S. Acharya and S. B. Zdonik. An efficient scheme for dynamic data replication. Technical Report CS-93-43, Department of Computer Science, Brown University, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 T. Anderson, M. Dahlin, J. Neefe, D. Patterson, D. Roselli, and R. Wang. Serveriess Network File Systems. In Proc. of ACM SOSP, Dec. 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 B. Barak, A. Herzberg, D. Naor, and E. Shai. The proactive security toolkit and applications. In Proc. ofACM CCS Conf., pages 18-27, Nov. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 M. Blaze. A cryptographic file system for UNIX. In Proc. of ACM CCS Conf., Nov. 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 M. Blaze, J. Feigenbaum, and J. Lacy. Decentralized trust management. In Proc. oflEEE SRSP, May 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 B. Bloom. Space/time trade-offs in hash coding with allowable errors. In Communications of the ACM, volume 13(7), pages 422-426, July 1970.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 W. Bolosky, J. Douceur, D. Ely, and M. Theimer. Feasibility of a servefless distributed file system deployed on an existing set of desktop pcs. In Proc. of Sigmetrics, June 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 W. Bolosky, R. Draves, R. Fitzgerald, C. Fraser, M. Jones, T. Knoblock, and R. Rashid. Operating systems directions for the next millennium. In Proc. of HOTOS Conf., May 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. of USENIX Symp. on OSDI, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 S. Chaudhuri and V. Narasayya. AutoAdmin "what-if" index analysis utility. In Proc. ofACM SIGMOD Conf., pages 367- 378, June 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 M. Dahlin, T. Anderson, D. Patterson, and R. Wang. Cooperative caching: Using remote client memory to improve file system performance. In Proc. of USENIX Syrup. on OSDI, Nov. 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 A. Demers, K. Petersen, M. Spreitzer, D. Terry, M. Tbeimer, and B. Welch. The Bayou architecture: Support for data sharing among mobile users. In Proc. of lEEE Workshop on Mobile Computing Systems & Applications, Dec. 1994.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 W. Edwards, E. Mynatt, K. Petersen, M. Spreitzer, D. Terry, and M. Theimer. Designing and implementing asynchronous collaborative applications with Bayou. In Proc. of ACM Syrup. on User Interface Software & Technology, pages 119-128, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 C. Ellison, B. Frantz, R. Rivest, B. Thomas, and T. Ylonen. SPKI certificate theory. RFC 2693, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 L. Fan, P. Cao, J. Almeida, and A. Broder. Summary cache: A scalable wide-area Web cache sharing protocol. In Proc. of ACM SIGCOMM Conf., pages 254-265, Sept. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 M. Franklin, M. Carey, and M. Livny. Transactional clientserver cache consistency: Alternatives and performance. ACM Transactions on Database Systems, 22(3):315-363, Sept. 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 A. Goldberg and P. Yianilos. Towards an archival intermemory. In Proc. oflEEEADL, pages 147-156, Apr. 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 J. Gray, P. Helland, P. O'Neil, and D. Shasha. The dangers of replication and a solution. In Proc. ofACM SIGMOD Conf., volume 25, 2, pages 173-182, June 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 J. Griffioen and R. Appleton. Reducing file system latency using a predictive approach. In Proc. of USENIX Summer Technical Conf., June 1994,]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 E. Hagersten, A. Landin, and S. Haridi. DDM -- A Cacheonly Memory Architecture. IEEE Computer, Sept. 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 J. Hill, R. Szewczyk, A. Woo, D. Culler, S. Hollar, and K. Pister. System architecture directions for networked sensors. In Proc. of ASPLOS, Nov. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West. Scale and performance in a distributed file system. ACM Transactions on Computer Systems, 6(1):51-81, Feb. 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 J. Hughes, C. Feist, H. S, M. O'Keefe, and D. Corcoran. A universal access, smart-card-based secure file system. In Proc. of the Atlanta Linux Showcase, Oct. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 L. Kawell, S. Beckhardt, T. Halvorsen, R. Ozzie, and I. Greif. Replicated document management in a group communication system. In Proc. of ACM CSCW Conf., Sept. 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26 J. Kistler and M. Satyanarayanan. Disconnected operation in the Coda file system. ACM Transactions on Computer Systems, 10(1):3-25, Feb. 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 T. Kroeger and D. Long. Predicting file-system actions from prior events. In Proc. of USENIX ~qnter Technical Conf., pages 319-328, Jan. 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28 G. Kuenning. The design of the seer predictive caching system. In Proc. of IEEE Workshop on Mobile Computing Systems & Applications, Dec. 1994.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 29 H. Kung and J. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6(2):213-226, June 1981.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 30 L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM TOPLAS, 4(3):382-.-3,01, 1982.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. 31 E. Levy and A. Silberschatz. Distributed file systems: Concepts and examples. ACM Computing Surveys, 22(4):321- 375, Dec. 1990.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 32 M. Luby, M. Mitzenmacher, M. Shokrollahi, D. Spielman, and V. Stemann. Analysis of low density codes and improved designs using irregular graphs. In Proc. ofACM STOC, May 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. 33 L. Mackert and G. Lohman. R* optimizer validation and performance for distributed queries. In Proc. of Intl. Conf. on VLDB, Aug. 1986.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. OceanStore: an architecture for global-scale persistent storage

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGPLAN Notices
          ACM SIGPLAN Notices  Volume 35, Issue 11
          Nov. 2000
          269 pages
          ISSN:0362-1340
          EISSN:1558-1160
          DOI:10.1145/356989
          Issue’s Table of Contents

          Copyright © 2000 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 November 2000

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader