2/18/2004 Challenges in Building Internet Services February 18, 2004.

Slides:



Advertisements
Similar presentations
PHANI VAMSI KRISHNA.MADDALI. BASIC CONCEPTS.. FILE SYSTEMS: It is a method for storing and organizing computer files and the data they contain to make.
Advertisements

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Scalable Content-Addressable Network Lintao Liu
Peer-to-Peer (P2P) Distributed Storage 1Dennis Kafura – CS5204 – Operating Systems.
Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
PNUTS: Yahoo’s Hosted Data Serving Platform Jonathan Danaparamita jdanap at umich dot edu University of Michigan EECS 584, Fall Some slides/illustrations.
Choose the right picture
Distributed components
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
A Dependable Auction System: Architecture and an Implementation Framework
Features Scalability Availability Latency Lifecycle Data Integrity Portability Manage Services Deliver Features Faster Create Business Value.
2/25/2004 The Google Cluster Architecture February 25, 2004.
1 Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Robert Morris Ion Stoica, David Karger, M. Frans Kaashoek, Hari Balakrishnan.
2/23/2004 Load Balancing February 23, /23/2004 Assignments Work on Registrar Assignment.
Distributed Systems and the WWW Extending the Capability of Massively Multiplayer Online Games by Introducing Distributed Systems as World Servers Jason.
2/11/2004 Internet Services Overview February 11, 2004.
A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:
Distributed Lookup Systems
OSD Metadata Management
Rethinking Dynamo: Amazon’s Highly Available Key-value Store --An Offense Shih-Chi Chen Hongyu Gao.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
Lesson 1: Configuring Network Load Balancing
Two-Tier Architecture of OSD Metadata Management Xianbo Zhang, Keqiang Wu 11/11/2002.
DISTRIBUTED COMPUTING
Microsoft Load Balancing and Clustering. Outline Introduction Load balancing Clustering.
Inexpensive Scalable Information Access Many Internet applications need to access data for millions of concurrent users Relational DBMS technology cannot.
PETAL: DISTRIBUTED VIRTUAL DISKS E. K. Lee C. A. Thekkath DEC SRC.
Distributed Data Stores – Facebook Presented by Ben Gooding University of Arkansas – April 21, 2015.
Module 12: Designing an AD LDS Implementation. AD LDS Usage AD LDS is most commonly used as a solution to the following requirements: Providing an LDAP-based.
Module 12: Designing High Availability in Windows Server ® 2008.
Consistency and Replication CSCI 4780/6780. Chapter Outline Why replication? –Relations to reliability and scalability How to maintain consistency of.
Build High-availability Real-time SigTran Applications with DDP --- An Architectural Overview (Motorola) Qiaobing Xie, Randy Stewart March, 2000.
Molecular Transactions G. Ramalingam Kapil Vaswani Rigorous Software Engineering, MSRI.
Introduction. Readings r Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3 m Note: All figures from this book.
FireProof. The Challenge Firewall - the challenge Network security devices Critical gateway to your network Constant service The Challenge.
CollabDraw Real-time Collaborative Drawing Board Shishir Prasad Prashant Saxena Prakhar Panwaria.
GLOBE DISTRIBUTED SHARED OBJECT. INTRODUCTION  Globe stands for GLobal Object Based Environment.  Globe is different from CORBA and DCOM that it supports.
Scalable Group Communication for the Internet Idit Keidar MIT Lab for Computer Science Theory of Distributed Systems Group.
Distributed systems [Fall 2015] G Lec 1: Course Introduction.
Replication (1). Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Distributed Computing Systems CSCI 4780/6780. Scalability ConceptExample Centralized servicesA single server for all users Centralized dataA single on-line.
Google File System Robert Nishihara. What is GFS? Distributed filesystem for large-scale distributed applications.
Scalable Data Scale #2 site on the Internet (time on site) >200 billion monthly page views Over 1 million developers in 180 countries.
Microsoft Cloud Solution.  What is the cloud?  Windows Azure  What services does it offer?  How does it all work?  How to go about using it  Further.
Features Scalability Manage Services Deliver Features Faster Create Business Value Availability Latency Lifecycle Data Integrity Portability.
CSE 486/586 CSE 486/586 Distributed Systems Consistency Steve Ko Computer Sciences and Engineering University at Buffalo.
1 CEG 2400 Fall 2012 Network Servers. 2 Network Servers Critical Network servers – Contain redundant components Power supplies Fans Memory CPU Hard Drives.
Peer-to-Peer (P2P) File Systems. P2P File Systems CS 5204 – Fall, Peer-to-Peer Systems Definition: “Peer-to-peer systems can be characterized as.
Choose the right picture Choose the right word. 5.
Distributed databases A brief introduction with emphasis on NoSQL databases Distributed databases1.
1 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Network Architecture Characteristics  Explain four characteristics that are addressed by.
SCALABILITY AND SECURITY Presentation. 01 Scalability.
PERFORMANCE MANAGEMENT IMPROVING PERFORMANCE TECHNIQUES Network management system 1.
Lecture 17 Page 1 CS 188,Winter 2015 A Design Problem in Distributed Systems CS 188 Distributed Systems March 10, 2015.
Cluster-Based Scalable
Services DFS, DHCP, and WINS are cluster-aware.
CyberSKA: Global Federated e-Infrastructure
CSE 486/586 Distributed Systems Consistency --- 1
Introduction to Networks
Chapter 19: Distributed Databases
Consistent Data Access From Data Centers
Introduction There are many situations in which we might use replicated data Let’s look at another, different one And design a system to work well in that.
Distributed P2P File System
CSE 486/586 Distributed Systems Consistency --- 1
Consistency and Replication
Fault-Tolerant CORBA By, Srinivas Seshu.
Network management system
CSE 486/586 Distributed Systems Consistency --- 1
Fault-Tolerant CORBA By, Srinivas Seshu.
Presentation transcript:

2/18/2004 Challenges in Building Internet Services February 18, 2004

2/18/2004 Assignments Due – Project 1 Start work on Registrar Assignment

2/18/2004 Design Goals Fast service (low latency) Service all users (scalability) Always available (fault tolerance)

2/18/2004 A Registration Website Fast service –Assume users on campus Service all users –Only need to service MHC students Always available –Can tolerate some failure

2/18/2004 Pieces of the Puzzle Load Balancing Servers Data Store

2/18/2004 Design Goals Fast service (low latency) Service all users (scalability) Always available (fault tolerance) How does the picture change?

2/18/2004 Pieces of the Puzzle Servers Data Store

2/18/2004 Issues How does my client choose a server? Do all servers do the same thing? Do all data stores have the same information?

2/18/2004 Pieces of the Puzzle Load Balancing Servers Data Store

2/18/2004 Issues How does my client choose a server? –Transparency –Maintaining client state –Geographic location

2/18/2004 Issues Do all servers do the same thing? – Do all data stores have the same information? –Replication –Partitioning

2/18/2004 Issues Do all servers do the same thing? – Do all data stores have the same information? –Replication Consistency –Partitioning Finding correct server/data store

2/18/2004 Fault Handling What happens if a server/data store fails?