David Choffnes, Winter 2006 OceanStore Maintenance-Free Global Data StorageMaintenance-Free Global Data Storage, S. Rhea, C. Wells, P. Eaton, D. Geels,

Slides:



Advertisements
Similar presentations
Tapestry: Scalable and Fault-tolerant Routing and Location Stanford Networking Seminar October 2001 Ben Y. Zhao
Advertisements

Tapestry: Decentralized Routing and Location SPAM Summer 2001 Ben Y. Zhao CS Division, U. C. Berkeley.
P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
What is OceanStore? - 10^10 users with files each - Goals: Durability, Availability, Enc. & Auth, High performance - Worldwide infrastructure to.
Scalable Content-Addressable Network Lintao Liu
Peer-to-Peer (P2P) Distributed Storage 1Dennis Kafura – CS5204 – Operating Systems.
POND: the OceanStore Prototype Sean Rhea, Patrick Eaton, Dennis Geels, Hakim Weatherspoon, Ben Zhao and John Kubiatowicz UC, Berkeley File and Storage.
Pond: the OceanStore Prototype CS 6464 Cornell University Presented by Yeounoh Chung.
Pond The OceanStore Prototype. Pond -- Dennis Geels -- January 2003 Talk Outline System overview Implementation status Results from FAST paper Conclusion.
Pond: the OceanStore Prototype Sean Rhea, Patrick Eaton, Dennis Geels, Hakim Weatherspoon,
Pond The OceanStore Prototype. Introduction Problem: Rising cost of storage management Observations: Universal connectivity via Internet $100 terabyte.
Pond: the OceanStore Prototype Sean Rhea, Patrick Eaton, Dennis Geels, Hakim Weatherspoon,
Beyond the MDS Bound in Distributed Cloud Storage
Outline for today Structured overlay as infrastructures Survey of design solutions Analysis of designs.
OceanStore Status and Directions ROC/OceanStore Retreat 1/16/01 John Kubiatowicz University of California at Berkeley.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
OceanStore An Architecture for Global-scale Persistent Storage By John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels,
Distributed Lookup Systems
Tapestry : An Infrastructure for Fault-tolerant Wide-area Location and Routing Presenter: Chunyuan Liao March 6, 2002 Ben Y.Zhao, John Kubiatowicz, and.
Tentative Updates in MINO Steven Czerwinski Jeff Pang Anthony Joseph John Kubiatowicz ROC Winter Retreat January 13, 2002.
Naming and Integrity: Self-Verifying Data in Peer-to-Peer Systems Hakim Weatherspoon, Chris Wells, John Kubiatowicz University of California, Berkeley.
OceanStore: Data Security in an Insecure world John Kubiatowicz.
OceanStore Theoretical Issues and Open Problems John Kubiatowicz University of California at Berkeley.
OceanStore: An Architecture for Global-Scale Persistent Storage Professor John Kubiatowicz, University of California at Berkeley
Opportunities for Continuous Tuning in a Global Scale File System John Kubiatowicz University of California at Berkeley.
Peer To Peer Distributed Systems Pete Keleher. Why Distributed Systems? l Aggregate resources! –memory –disk –CPU cycles l Proximity to physical stuff.
OceanStore An Architecture for Global-Scale Persistent Storage Motivation Feature Application Specific Components - Secure Naming - Update - Access Control-
Long Term Durability with Seagull Hakim Weatherspoon (Joint work with Jeremy Stribling and OceanStore group) University of California, Berkeley ROC/Sahara/OceanStore.
Tapestry An off-the-wall routing protocol? Presented by Peter, Erik, and Morten.
OceanStore: An Architecture for Global - Scale Persistent Storage John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patric Eaton, Dennis Geels,
7/15/2015ROC/OceanStore Winter Retreat Introspective Replica Management in OceanStore Dennis Geels.
Efficient Proactive Security for Sensitive Data Storage Arun Subbiah Douglas M. Blough School of ECE, Georgia Tech {arun,
Servers Redundant Array of Inexpensive Disks (RAID) –A group of hard disks is called a disk array FIGURE Server with redundant NICs.
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.
Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
Version 4.0. Objectives Describe how networks impact our daily lives. Describe the role of data networking in the human network. Identify the key components.
Cooperative File System. So far we had… - Consistency BUT… - Availability - Partition tolerance ?
Failure Resilience in the Peer-to-Peer-System OceanStore Speaker: Corinna Richter.
Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.
Low-Overhead Byzantine Fault-Tolerant Storage James Hendricks, Gregory R. Ganger Carnegie Mellon University Michael K. Reiter University of North Carolina.
Pond: the OceanStore Prototype Sean Rhea, Patric Eaton, Dennis Gells, Hakim Weatherspoon, Ben Zhao, and John Kubiatowicz University of California, Berkeley.
OceanStore: An Infrastructure for Global-Scale Persistent Storage John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels,
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Byzantine fault-tolerance COMP 413 Fall Overview Models –Synchronous vs. asynchronous systems –Byzantine failure model Secure storage with self-certifying.
Plethora: A Wide-Area Read-Write Storage Repository Design Goals, Objectives, and Applications Suresh Jagannathan, Christoph Hoffmann, Ananth Grama Computer.
OceanStore: An Architecture for Global- Scale Persistent Storage.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Toward Achieving Tapeless Backup at PB Scales Hakim Weatherspoon University of California, Berkeley Frontiers in Distributed Information Systems San Francisco.
Slides for Chapter 10: Peer-to-Peer Systems
POND: THE OCEANSTORE PROTOTYPE S. Rea, P. Eaton, D. Geels, H. Weatherspoon, J. Kubiatowicz U. C. Berkeley.
Peer to Peer Network Design Discovery and Routing algorithms
Bruce Hammer, Steve Wallis, Raymond Ho
The Design and Implementation of a Next Generation Name Service for the Internet V. Ramasubramanian, E. Gun Sirer Cornell Univ. SIGCOMM 2004 Ciprian Tutu.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
Database Laboratory Regular Seminar TaeHoon Kim Article.
Seminar On Rain Technology
1 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Network Architecture Characteristics  Explain four characteristics that are addressed by.
CS791Aravind Elango Maintenance-Free Global Data Storage Sean Rhea, Chris Wells, Patrick Eaten, Dennis Geels, Ben Zhao, Hakim Weatherspoon and John Kubiatowicz.
OceanStore : An Architecture for Global-Scale Persistent Storage Jaewoo Kim, Youngho Yi, Minsik Cho.
Peer-to-Peer Information Systems Week 12: Naming
Data Management on Opportunistic Grids
OceanStore: An Architecture for Global-Scale Persistent Storage
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
OceanStore: Data Security in an Insecure world
Pond: the OceanStore Prototype
ACM Transactions on Information and System Security, November 2001
Content Distribution Network
Peer-to-Peer Information Systems Week 12: Naming
Outline for today Oceanstore: An architecture for Global-Scale Persistent Storage – University of California, Berkeley. ASPLOS 2000 Feasibility of a Serverless.
Presentation transcript:

David Choffnes, Winter 2006 OceanStore Maintenance-Free Global Data StorageMaintenance-Free Global Data Storage, S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, J. Kubiatowicz, IEEE Internet Computing, 5(5):40-49,

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 2 Data makes the world go round We’re addicted to persistent storage –Wouldn’t it be great if it would follow us globally? –And automatically make itself resilient to failures? –But that would require 1,000s or millions of PCs! OceanStore –A global data store that manages itself –Scales to billions of users and exabytes of data –Features: Durability Resistance to attack/failures Fault tolerant Churn-resistant Catchy name

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 3 A bit of this, a byte of that Routing messages/data –Self-maintaining (DHT) Durabilitly –M x N erasure encoding Security/Fault tolerance –Byzantine updates, secure hashes, encryption Availability –Introspective replica management

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 4 Don’t call it a comeback Erasure codes –Break object into m chunks of size n; n*m > n –Encode chunks such that any k set of them can reconstruct entire object

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 5 An object by any other GUID would smell as sweet Each object assigned a GUID based on 160- bit SHA-1 hash OceanStore supports versioning, so each object has an active GUID that points to a list of GUIDs from different versions –Each GUID is a B-tree of links to chunks

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 6 Magic Tapestry Ride Tapestry = DHT Allows nodes to join and leave network relatively seamlessly Named objects found in deterministic # of hops OceanStore uses multiple “root nodes” for each object –More redundancy –Lower latency Inner ring made responsible for objects

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 7 He says, she says Possibility for faulty, malicious servers –Byzantine protocol ensures correctness if less than 1/3 of servers is faulty/misbehaving New technique vastly reduces n^2 message complexity Cached data is signed Proactive signature threshold allows same public key despite inner ring membership change

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 8 Know thyself Introspection –Servers measure independence of failure rates and change encoding rate appropriately –Auto repair: root node can check redundancy, regenerate/redistribute blocks –Durability: sweep/repair

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 9 Put it all together

CS 395/495 Autonomic Computing Systems EECS, Northwestern University 10 Some Performance Numbers