1 A Framework for Highly Available Services Based on Group Communication Alan Fekete Idit Keidar University of Sidney MIT.

Slides:



Advertisements
Similar presentations
Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Advertisements

Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
Replication Management. Motivations for Replication Performance enhancement Increased availability Fault tolerance.
EEC 688/788 Secure and Dependable Computing Lecture 12 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
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
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Algorithm for Virtually Synchronous Group Communication Idit Keidar, Roger Khazan MIT Lab for Computer Science Theory of Distributed Systems Group.
Group Communications Group communication: one source process sending a message to a group of processes: Destination is a group rather than a single process.
EEC 688/788 Secure and Dependable Computing Lecture 12 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Group Communication Phuong Hoai Ha & Yi Zhang Introduction to Lab. assignments March 24 th, 2004.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 5: Synchronous Uniform.
1 Principles of Reliable Distributed Systems Lecture 5: Failure Models, Fault-Tolerant Broadcasts and State-Machine Replication Spring 2005 Dr. Idit Keidar.
Abstractions for Fault-Tolerant Distributed Computing Idit Keidar MIT LCS.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 12 Wenbing Zhao Department of Electrical and Computer Engineering.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
EEC 688/788 Secure and Dependable Computing Lecture 13 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
Distributed Systems 2006 Group Membership * *With material adapted from Ken Birman.
Multicast Communication
Distributed Systems 2006 Virtual Synchrony* *With material adapted from Ken Birman.
Optimistic Virtual Synchrony Jeremy Sussman - IBM T.J.Watson Idit Keidar – MIT LCS Keith Marzullo – UCSD CS Dept.
Transis 1 Fault Tolerant Video-On-Demand Services Tal Anker, Danny Dolev, Idit Keidar, The Transis Project.
Presented by: Alvaro Llanos E.  Motivation and Overview  Frangipani Architecture overview  Similar DFS  PETAL: Distributed virtual disks ◦ Overview.
Database Replication. Replication Replication is the process of sharing information so as to ensure consistency between redundant resources, such as software.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
What is Architecture  Architecture is a subjective thing, a shared understanding of a system’s design by the expert developers on a project  In the.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
Fault Tolerance via the State Machine Replication Approach Favian Contreras.
Managing Service Metadata as Context The 2005 Istanbul International Computational Science & Engineering Conference (ICCSE2005) Mehmet S. Aktas
Othman Othman M.M., Koji Okamura Kyushu University 1.
Slides for Chapter 14: Replication From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 3, © Addison-Wesley 2001.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Replication with View Synchronous Group Communication Steve Ko Computer Sciences and Engineering.
Consistent and Efficient Database Replication based on Group Communication Bettina Kemme School of Computer Science McGill University, Montreal.
VICTORIA UNIVERSITY OF WELLINGTON Te Whare Wananga o te Upoko o te Ika a Maui SWEN 432 Advanced Database Design and Implementation MongoDB Architecture.
Toward Fault-tolerant P2P Systems: Constructing a Stable Virtual Peer from Multiple Unstable Peers Kota Abe, Tatsuya Ueda (Presenter), Masanori Shikano,
The Replica Location Service The Globus Project™ And The DataGrid Project Copyright (c) 2002 University of Chicago and The University of Southern California.
Fast Crash Recovery in RAMCloud. Motivation The role of DRAM has been increasing – Facebook used 150TB of DRAM For 200TB of disk storage However, there.
IM NTU Distributed Information Systems 2004 Replication Management -- 1 Replication Management Yih-Kuen Tsay Dept. of Information Management National Taiwan.
Replication (1). Topics r Why Replication? r System Model r Consistency Models – How do we reason about the consistency of the “global state”? m Data-centric.
Copyright © George Coulouris, Jean Dollimore, Tim Kindberg This material is made available for private study and for direct.
Distributed Systems CS Consistency and Replication – Part IV Lecture 21, Nov 10, 2014 Mohammad Hammoud.
November NC state university Group Communication Specifications Gregory V Chockler, Idit Keidar, Roman Vitenberg Presented by – Jyothish S Varma.
Totally Ordered Broadcast in the face of Network Partitions [Keidar and Dolev,2000] INF5360 Student Presentation 4/3-08 Miran Damjanovic
Fault Tolerant Services
Scalable Group Communication for the Internet Idit Keidar MIT Lab for Computer Science Theory of Distributed Systems Group.
Replication (1). Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
V1.7Fault Tolerance1. V1.7Fault Tolerance2 A characteristic of Distributed Systems is that they are tolerant of partial failures within the distributed.
Replication and Group Communication. Management of Replicated Data FE Requests and replies C Replica C Service Clients Front ends managers RM FE RM Instructor’s.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Replication Improves reliability Improves availability ( What good is a reliable system if it is not available?) Replication must be transparent and create.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
1 Roie Melamed, Technion AT&T Labs Araneola: A Scalable Reliable Multicast System for Dynamic Wide Area Environments Roie Melamed, Idit Keidar Technion.
Distributed Computing Systems Replication Dr. Sunny Jeong. Mr. Colin Zhang With Thanks to Prof. G. Coulouris,
Replication Chapter Katherine Dawicki. Motivations Performance enhancement Increased availability Fault Tolerance.
Second-hand Trading Web Service Group Member: Jingwei Hao Xiaofeng Yuan Yanjun Liu.
Ethernet Packet Filtering - Part1 Øyvind Holmeide Jean-Frédéric Gauvin 05/06/2014 by.
Replication & Fault Tolerance CONARD JAMES B. FARAON
Algorithm for Virtually Synchronous Group Communication
Always on HA SQL Server Always ON feature is the new comprehensive high availability and disaster recovery solution which increases application availability.
CHAPTER 3 Architectures for Distributed Systems
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)
Providing Secure Storage on the Internet
Active replication for fault tolerance
PERSPECTIVES ON THE CAP THEOREM
Slides for Chapter 15: Replication
Presentation transcript:

1 A Framework for Highly Available Services Based on Group Communication Alan Fekete Idit Keidar University of Sidney MIT

2 Highly Available Services Availability through replication Dynamic set of servers –For load-balancing, adding new servers –For fault-tolerance, when servers fail / detach Clients connect to ‘abstract’ service Preemptive migration: client can be migrated in on-going session / transaction

3 Inspired by Highly available Video-on-Demand (VoD) [ Anker, Keidar, Dolev ICDCS 99] Uses group communication Server written in 2500 C++ code lines, including all availability logic Use of group communication not obvious

4 Framework Servers store content units –Partially replicated among servers –Static: no updates to content Client-service interaction in sessions Service is stateful during session –Service stores changing context for client Content served according to client context

5 Examples VoD –Content unit = movie, partially replicated –Context: location in movie, transmission rate,... –Movie frames sent to client depend on context –Client can random access -- changes context Courseware Interactive queries

6 Design Goals Client request leads to appropriate response Availability in face of failures –Need replication (can be partial) –Need preemptive migration Availability for varying number of clients –Need to vary number of servers Simple clients, flexible service –Availability is servers’ responsibility

7 Possible Problems at Migration Lost request (sent to dead server) –“Stale” context –Irrelevant responses Lost response (sent by dying server) Duplicate response Study what failure patterns cause problems, costs of minimizing them

8 Our Solution: The Basics Framework, not service Configurable in several parameters –Support for different policies Primary server assigned to session Preemptive migration to backup server Backups mirror session context –Context freshness at backup – configurable –3 levels

9 Replication of Context Info: Three levels of Freshness Unit database per content unit –Replicated among all servers of content unit –Periodic updates, frequency configurable Context reflecting all client requests –at primary and 1 st level backups Context reflecting server responses too –at primary

10 Group Communication (GC) Processes organized in groups, communication addressed to group Groups are dynamic (join, leave, crash,..) Groups can partition (“partitionable GC”) G Send(G)

11 GC Service Interface Input send( group, message ) Output receive( message ) Input join( group ) Input leave( group ) Output view( group, members, id ) view id is increasing Multicast Membership

12 Semantics: “Virtual Synchrony” [ Birman et al. 87] Group members that remain connected see events in same order –events: messages, views (totally ordered mcast) Framework for “state-machine” replication with fault tolerance, local consistency –Connected members go through same states –New members get state transfer Use to replicated unit database

13 Highly-Available Service: Multicast Groups Service Group Content Group Crouchin g Content Group Gladiator Content Group Spy Kids Session Group Session Group Session Group

14 Messages to Groups Content? start control update

15 Server Session Setup When start-session arrives, use local unit database to choose primary and 1 st backups Primary and 1 st level backups join session group (thus creating it) Primary sends session group name to client, serves content to client

16 Migration Triggered by view in content group State transfer to new members Use local unit database to choose new primary and backups per client –Choose 1 st level backup as primary if possible –By virtual synchrony, same decision made Chosen primaries and backups join session group, primary sends content,...

17 Configurable Parameters Replicas per content unit 1 st level backups Periodic updates frequency

18 Availability Analysis: Bad Scenarios Membership service not live, or does not give servers consistent views –Consistent migration decisions not made –Can lead to no service or duplicate service All content unit replicas crash –No service possible Context lost in migration –Risk depends on configurable parameters

19 Conclusions High availability by replication of content and context Group communication facilitates context replication Risk vs. load tradeoff –3 levels of freshness –Configurable freshness