Nicolas Schiper Fernando Pedone University of Lugano Switzerland

Slides:



Advertisements
Similar presentations
PLATO: Predictive Latency- Aware Total Ordering Mahesh Balakrishnan Ken Birman Amar Phanishayee.
Advertisements

Chen Zhang Hans De Sterck University of Waterloo
Database Replication in WAN Yi Lin McGill University Distributed Information Systems.
Reliable Communication in the Presence of Failures Kenneth Birman, Thomas Joseph Cornell University, 1987 Julia Campbell 19 November 2003.
High throughput chain replication for read-mostly workloads
Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Failure Detection The ping-ack failure detector in a synchronous system satisfies – A: completeness – B: accuracy – C: neither – D: both.
Scalable On-demand Media Streaming with Packet Loss Recovery Anirban Mahanti Department of Computer Science University of Calgary Calgary, AB T2N 1N4 Canada.
Reliability on Web Services Presented by Pat Chan 17/10/2005.
Virtual Synchrony Jared Cantwell. Review Multicast Causal and total ordering Consistent Cuts Synchronized clocks Impossibility of consensus Distributed.
Database Replication techniques: a Three Parameter Classification Authors : Database Replication techniques: a Three Parameter Classification Authors :
Secure Multicast (II) Xun Kang. Content Batch Update of Key Trees Reliable Group Rekeying Tree-based Group Diffie-Hellman Recent progress in Wired and.
Secure Multicast Xun Kang. Content Why need secure Multicast? Secure Group Communications Using Key Graphs Batch Update of Key Trees Reliable Group Rekeying.
Group Communications Group communication: one source process sending a message to a group of processes: Destination is a group rather than a single process.
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints 晏廷.
Bogdan Tanasa, Unmesh D. Bordoloi, Petru Eles, Zebo Peng Department of Computer and Information Science, Linkoping University, Sweden December 3, 2010.
Low-Latency Multi-Datacenter Databases using Replicated Commit
1 A Framework for Highly Available Services Based on Group Communication Alan Fekete Idit Keidar University of Sidney MIT.
CS603 Communication Mechanisms 14 January Types of Communication Shared Memory Message Passing Stream-oriented Communications Remote Procedure Call.
CS 603 Data Replication February 25, Data Replication: Why? Fault Tolerance –Hot backup –Catastrophic failure Performance –Parallelism –Decreased.
New Protocols for Remote File Synchronization Based on Erasure Codes Utku Irmak Svilen Mihaylov Torsten Suel Polytechnic University.
Reliable Communication in the Presence of Failures Based on the paper by: Kenneth Birman and Thomas A. Joseph Cesar Talledo COEN 317 Fall 05.
Byzantine fault-tolerance COMP 413 Fall Overview Models –Synchronous vs. asynchronous systems –Byzantine failure model Secure storage with self-certifying.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
Group Communication A group is a collection of users sharing some common interest.Group-based activities are steadily increasing. There are many types.
Totally Ordered Broadcast in the face of Network Partitions [Keidar and Dolev,2000] INF5360 Student Presentation 4/3-08 Miran Damjanovic
Chap 7: Consistency and Replication
A Multiversion Update-Serializable Protocol for Genuine Partial Data Replication Sebastiano Peluso, Pedro Ruivo, Paolo Romano, Francesco Quaglia and Luís.
Replication (1). Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
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.
Systems Research Barbara Liskov October Replication Goal: provide reliability and availability by storing information at several nodes.
Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.
PROCESS RESILIENCE By Ravalika Pola. outline: Process Resilience  Design Issues  Failure Masking and Replication  Agreement in Faulty Systems  Failure.
EEC 688/788 Secure and Dependable Computing Lecture 10 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Exercises for Chapter 11: COORDINATION AND AGREEMENT
Replication & Fault Tolerance CONARD JAMES B. FARAON
Scalable Load-Distance Balancing
a journey from the simple to the optimal
Advanced Operating System
Introduction to NewSQL
Lecture 5 Time and synchronization
8.2. Process resilience Shreyas Karandikar.
A Survey of Routing Techniques for Mobile Communication Networks
Reliable group communication
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)
DRIFT: Efficient Message Ordering in Ad Hoc Networks
R*: An Overview of the Architecture
Fault and Energy Aware Communication Mapping with Guaranteed Latency for Applications Implemented on NoC Sorin Manolache, Petru Eles, Zebo Peng {sorma,
Outline Distributed Mutual Exclusion Distributed Deadlock Detection
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.
Agreement Protocols CS60002: Distributed Systems
Distributed Systems, Consensus and Replicated State Machines
Consistent Data Replication: Is it feasible in WANs?
Kevin Lee & Adam Piechowicz 10/10/2009
Distributed Systems CS
Architectures of distributed systems Fundamental Models
EEC 688/788 Secure and Dependable Computing
Architectures of distributed systems Fundamental Models
EEC 688/788 Secure and Dependable Computing
EEC 688/788 Secure and Dependable Computing
Architectures of distributed systems
EEC 688/788 Secure and Dependable Computing
EEC 688/788 Secure and Dependable Computing
Architectures of distributed systems Fundamental Models
EEC 688/788 Secure and Dependable Computing
CIS 720 Replication 1.
Last Class: Naming Name distribution: use hierarchies DNS
Sisi Duan Assistant Professor Information Systems
Presentation transcript:

Nicolas Schiper Fernando Pedone University of Lugano Switzerland Optimal Atomic Broadcast and Multicast Algorithms for Wide Area Networks Nicolas Schiper Fernando Pedone University of Lugano Switzerland

Atomic Broadcast and Multicast Atomic Multicast: Atomic Broadcast: m2 m3 m1 m1 server 4 server 1 server 2 server 3 server 5 server 6 g1 AMCast m2 to g2, g3 ABCast m1 AMCast m1 to g1, g2 m2 m1 ABCast m2 g2 m2 m1 m2 AMCast m3 to all groups ABCast m3 m2 m1 g3 m2 m1 m1 < m2 <=> ∃p : p A-Delivers m1 before m2 The relation < is acyclic m2 m1

Problem (2) Atomic multicast is reducible to atomic broadcast: Every multicast msg. is broadcast, only addresses of the msg. deliver it Solution of no practical interest: Communication among processes unrelated to msg. Genuine atomic multicast: Only processes addressed by the message take part in the protocol

Context Wide Area Networks: Toronto Melbourne Lugano Beijing Fast and cheap Toronto Lugano Beijing Melbourne Slow and expensive Repl locally for locality and globally to tolerate catastrophic failures

Goal Minimize number of inter-group msg. delays between multicast and deliver A-Del(m) A-XCast(m) Database sites should only handle transactions that touch data items they replicate => 2 inter-group msg. delays for delivery

In The Full Paper (1) … Genuine atomic multicast lower bound: Minimum 2 inter-group msg. delay We present an algorithm that achieves this lower bound Based on Skeen’s multicast algorithm (not fault-tolerant) Optimized version of Fritzke et al’s. (SRDS’98)

In The Full Paper (2) … Atomic Broadcast: We present an atomic broadcast algorithm that needs only 1 inter-group msg. delay The algorithm is proactive, nevertheless quiescent Msg. broadcast after algo. quiescent => 2 inter-group msg. delay for delivery Quiescence has an inherent cost: Our algorithm is optimal

Final Remarks Latency degree vs. msg. complexity tradeoff for data replication: Update data item A Optimize latency => atomic broadcast … but high msg. complex. Optimize msg. complex. => atomic multicast … but at least 2 inter-group msg. delays A B, C A,B A, B D, B