Mondo Bringing Distributed File Systems to the People Xavid Pretzer Bringing Distributed File Systems to the People Xavid Pretzer.

Slides:



Advertisements
Similar presentations
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Advertisements

Kademlia: A Peer-to-peer Information System Based on the XOR Metric.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment Presented by: Boon Thau Loo CS294-4 (Adapted from Adya’s OSDI’02.
CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
Robert Morris, M. Frans Kaashoek, David Karger, Hari Balakrishnan, Ion Stoica, David Liben-Nowell, Frank Dabek Chord: A scalable peer-to-peer look-up.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Robert Morris Ion Stoica, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion StoicaRobert Morris David Liben-NowellDavid R. Karger M. Frans KaashoekFrank.
Ivy: A Read/Write P2P File System Athicha Muthitacharoan, Robert Morris, Thomer Gil and Benjie Chen Presented by Rachel Rubin CS 294-4, Fall 2003.
An Overview of Peer-to-Peer Networking CPSC 441 (with thanks to Sami Rollins, UCSB)
1 Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Robert Morris Ion Stoica, David Karger, M. Frans Kaashoek, Hari Balakrishnan.
FRIENDS: File Retrieval In a dEcentralized Network Distribution System Steven Huang, Kevin Li Computer Science and Engineering University of California,
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
Introduction to Peer-to-Peer (P2P) Systems Gabi Kliot - Computer Science Department, Technion Concurrent and Distributed Computing Course 28/06/2006 The.
CSc 461/561 CSc 461/561 Peer-to-Peer Streaming. CSc 461/561 Summary (1) Service Models (2) P2P challenges (3) Service Discovery (4) P2P Streaming (5)
Looking Up Data in P2P Systems Hari Balakrishnan M.Frans Kaashoek David Karger Robert Morris Ion Stoica.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.
Structure Overlay Networks and Chord Presentation by Todd Gardner Figures from: Ion Stoica, Robert Morris, David Liben- Nowell, David R. Karger, M. Frans.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
File Sharing : Hash/Lookup Yossi Shasho (HW in last slide) Based on Chord: A Scalable Peer-to-peer Lookup Service for Internet ApplicationsChord: A Scalable.
Structured P2P Network Group14: Qiwei Zhang; Shi Yan; Dawei Ouyang; Boyu Sun.
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
CSE 461 University of Washington1 Topic Peer-to-peer content delivery – Runs without dedicated infrastructure – BitTorrent as an example Peer.
Storage management and caching in PAST PRESENTED BY BASKAR RETHINASABAPATHI 1.
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.
Data Consistency in the Structured Peer-to-Peer Network Cheng-Ying Ou, Polly Huang Network and Systems Lab 台灣大學電機資訊學院電機所.
Federated, Available, and Reliable Storage for an Incompletely Trusted Environment Atul Adya, Bill Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken,
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment.
Wide-Area Cooperative Storage with CFS Robert Morris Frank Dabek, M. Frans Kaashoek, David Karger, Ion Stoica MIT and Berkeley.
Distributed Systems Concepts and Design Chapter 10: Peer-to-Peer Systems Bruce Hammer, Steve Wallis, Raymond Ho.
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.
FARSITE: Federated, Available and Reliable Storage for an Incompletely Trusted Environment A. Atta, W. J. Bolowsky, M. Castro, G. Cermak, R. Chaiken, J.
Pond: the OceanStore Prototype Sean Rhea, Patric Eaton, Dennis Gells, Hakim Weatherspoon, Ben Zhao, and John Kubiatowicz University of California, Berkeley.
Latest Relevant Techniques and Applications for Distributed File Systems Ela Sharda
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
Ivy: A Read/Write Peer-to-Peer File System A. Muthitacharoen, R. Morris, T. M. Gil, and B. Chen In Proceedings of OSDI ‘ Presenter : Chul Lee.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Vincent Matossian September 21st 2001 ECE 579 An Overview of Decentralized Discovery mechanisms.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
1 Slides from Richard Yang with minor modification Peer-to-Peer Systems: DHT and Swarming.
Chord+DHash+Ivy: Building Principled Peer-to-Peer Systems Robert Morris Joint work with F. Kaashoek, D. Karger, I. Stoica, H. Balakrishnan,
Peer-to-Peer Supported Cache System for File Transfer Joonbok Lee
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.
Peer-to-peer Information Systems Universität des Saarlandes Max-Planck-Institut für Informatik – AG5: Databases and Information Systems Group Prof. Dr.-Ing.
Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.
1 JTE HPC/FS Pastis: a peer-to-peer file system for persistant large-scale storage Jean-Michel Busca Fabio Picconi Pierre Sens LIP6, Université Paris 6.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
Kademlia: A Peer-to-peer Information System Based on the XOR Metric
Introduction to Active Directory
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Bruce Hammer, Steve Wallis, Raymond Ho
Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
Distributed Systems: Distributed File Systems Ghada Ahmed, PhD. Assistant Prof., Computer Science Dept. Web:
Truly Distributed File Systems Paul Timmins CS 535.
Ivy: A Read/Write Peer-to- Peer File System Authors: Muthitacharoen Athicha, Robert Morris, Thomer M. Gil, and Benjie Chen Presented by Saurabh Jha 1.
Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M
Distributed Hash Tables
Federated, Available, and Reliable Storage for an Incompletely Trusted Environment Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie.
MIT LCS Proceedings of the 2001 ACM SIGCOMM Conference
Consistent Hashing and Distributed Hash Table
#02 Peer to Peer Networking
Presentation transcript:

Mondo Bringing Distributed File Systems to the People Xavid Pretzer Bringing Distributed File Systems to the People Xavid Pretzer

Location-Independent Files What do we want to be able to do? Existing Strategies Distributed File Systems Peer-to-Peer File Sharing Mondo: a different approach What do we want to be able to do? Existing Strategies Distributed File Systems Peer-to-Peer File Sharing Mondo: a different approach

What’s the problem? Sharing files between home and work Use existing computers to help distribute data Distributing information through often-partitioned networks Sharing files between home and work Use existing computers to help distribute data Distributing information through often-partitioned networks

Distributed File Systems NFS emulates local access All peers trusted AFS uses trusted servers, untrusted clients Also introduced a global namespace Coda: disconnected operation NFS emulates local access All peers trusted AFS uses trusted servers, untrusted clients Also introduced a global namespace Coda: disconnected operation NFS AFS Coda

Why isn’t this enough? Need dedicated, trusted servers Servers can bottleneck file access Need more servers for more clients Extra client space not used Localized failures disrupt system Need dedicated, trusted servers Servers can bottleneck file access Need more servers for more clients Extra client space not used Localized failures disrupt system

Peer-to-peer File Sharing Composed of untrusted peers Popular files easier to obtain Gnutella: share files without centralized server Bittorrent: cooperate to share large files with low bandwidth Composed of untrusted peers Popular files easier to obtain Gnutella: share files without centralized server Bittorrent: cooperate to share large files with low bandwidth Gnutella Bittorrent Tracker Seeder

Limitations of File Sharing Limited access control and authentication No dynamic files No useful directory structure Difficult to ensure availability Limited access control and authentication No dynamic files No useful directory structure Difficult to ensure availability Seeder F F’ ? ?

Combining P2P with DFS Farsite: serverless Uses encryption, Byzantine protocols Trusts self-reporting Files delocalized Ivy: log-structured Logs changes to distributed hash table Must agree on which logs to trust Can recover from broken trust Farsite: serverless Uses encryption, Byzantine protocols Trusts self-reporting Files delocalized Ivy: log-structured Logs changes to distributed hash table Must agree on which logs to trust Can recover from broken trust Ivy Farsite /farsite /farsite/user a 8c b9 e1

Mondo: a different approach File data served both by primary hosts and caching clients File location info stored in a Distributed Hash Table Encryption and cryptographic signing used for file permissions No central authority needed Expandable to large, heterogeneous groups File data served both by primary hosts and caching clients File location info stored in a Distributed Hash Table Encryption and cryptographic signing used for file permissions No central authority needed Expandable to large, heterogeneous groups

Data Storage Primary hosts always keep designated files Clients cache used files and share with other peers Mutual exchanges for file replication File blocks requested in parallel from multiple peers Primary hosts always keep designated files Clients cache used files and share with other peers Mutual exchanges for file replication File blocks requested in parallel from multiple peers P H  1  2  3  4  H  1 2  3 4  H  1  2 

Permissions without Trust File permissions signed by owner File data, version, block checksums signed by writer Read-restricted files encrypted with unique key Read key encrypted in header with readers’ public keys File permissions signed by owner File data, version, block checksums signed by writer Read-restricted files encrypted with unique key Read key encrypted in header with readers’ public keys Signed, Alice File 7ce5ab92 Owner: Alice Writers: Alice, Bob Alice’s Read Key: 523ea220 Bob’s Read Key: 9a45bc31 Charlie’s Read Key: efed3238 … Signed, Bob Version 2 File length: 3214 bytes Block size: 1024 bytes Block 1 checksum: a4b23ac4 Block 2 checksum: 8bed0123 Block 3 checksum: 76f3dc13 Encrypted File Data

Directories Directories are files and use permissions Directories store file ids for contents Also store public keys for file owners as a “web of trust” Directories can be multiply linked Directories are files and use permissions Directories store file ids for contents Also store public keys for file owners as a “web of trust” Directories can be multiply linked info.txt: 8cd349a3 Owned by Alice Signed, Alice Directory 5ab9217e … Signed, Bob photo.jpeg: 29468ecd Owned by Charles junk: ea2bc891 Owned by Joe Version 7 … Contents:

Locating Files Peers serve as a Distributed Hash Table Each peer tells DHT what files it stores Primary host labels signed by file owner Changes propagated to all primary hosts; clients update copies lazily Peers serve as a Distributed Hash Table Each peer tells DHT what files it stores Primary host labels signed by file owner Changes propagated to all primary hosts; clients update copies lazily Cached by ab9217e Signed, Alice Primary host ab9217e a 8c b9 e1

Handling Malicious Peers Refuse to store improperly signed files DHT pairs stored redundantly Block checksums verify file data Tit-for-tat data sharing Periodically verify mutual replication Refuse to store improperly signed files DHT pairs stored redundantly Block checksums verify file data Tit-for-tat data sharing Periodically verify mutual replication Signed, Alice File 7ce5ab92 Owner: Alice Writers: Alice, Bob … Signed, Joe … H  1  2  3 4  H  1’ 2’ 3’ 4’ 1

Example: Reading a file Start with a root directory id and its owner’s public key Look up that id in the DHT to find peers with that directory Retrieve it and verify with the key Read contents and repeat recursively Start with a root directory id and its owner’s public key Look up that id in the DHT to find peers with that directory Retrieve it and verify with the key Read contents and repeat recursively /mondo: 5ab9217e /mondo/info.txt: 8cd349a3 DHT Contents: info.txt photo.jpeg

Potential Difficulties Syncing changes efficiently Variable TTL? Availability of unpopular files Bogus DHT announcements Changes in file ownership Merging parallel changes Syncing changes efficiently Variable TTL? Availability of unpopular files Bogus DHT announcements Changes in file ownership Merging parallel changes P Δ ? Signed, Alice File 7ce5ab92 Owner: Alice … Signed, ??? File 7ce5ab92 Owner: Bob … chown ???

Applications Location-independent files without dedicated servers Making better use of existing resources Sharing mutable files with a large audience Distributing files on failure-prone networks Location-independent files without dedicated servers Making better use of existing resources Sharing mutable files with a large audience Distributing files on failure-prone networks

What Mondo Provides Scalable and secure distribution of mutable files among untrusted computers Advantages of DFS without dedicated servers Web of trust in directory hierarchy Effective distribution over normally-partitioned networks Scalable and secure distribution of mutable files among untrusted computers Advantages of DFS without dedicated servers Web of trust in directory hierarchy Effective distribution over normally-partitioned networks

References Adya, Atul, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, and Roger P. Wattenhofer. “FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment” Bolosky, William J., John R. Douceur, David Ely, and Marvin Theimer. “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs” Cohen, Bram. “Incentives Build Robustness in BitTorrent” Howard, John H., Michael L. Kazar, Sherri G. Menees, David A. Nichols, M. Satyanarayanan, Robert N. Sidebotham, and Michael J. West. “Scale and Performance in a Distributed File System” Kon, Fabio. "Distributed File Systems Past, Present, and Future: A Distributed File System for 2006" Maymounkov, Petar and David Mazières. “Kademlia: A Peer-to-peer Information System Based on the XOR Metric” Muthitacharoen, Athicha, Robert Morris, Thomer M. Gil, and Benjie Chen. “Ivy: A Read/Write Peer-to-Peer File System” Stoica, Ion, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications” Adya, Atul, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, and Roger P. Wattenhofer. “FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment” Bolosky, William J., John R. Douceur, David Ely, and Marvin Theimer. “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs” Cohen, Bram. “Incentives Build Robustness in BitTorrent” Howard, John H., Michael L. Kazar, Sherri G. Menees, David A. Nichols, M. Satyanarayanan, Robert N. Sidebotham, and Michael J. West. “Scale and Performance in a Distributed File System” Kon, Fabio. "Distributed File Systems Past, Present, and Future: A Distributed File System for 2006" Maymounkov, Petar and David Mazières. “Kademlia: A Peer-to-peer Information System Based on the XOR Metric” Muthitacharoen, Athicha, Robert Morris, Thomer M. Gil, and Benjie Chen. “Ivy: A Read/Write Peer-to-Peer File System” Stoica, Ion, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”. 2001