Transis 1 Fault Tolerant Video-On-Demand Services Tal Anker, Danny Dolev, Idit Keidar, The Transis Project.

Slides:



Advertisements
Similar presentations
Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
Advertisements

High Speed Total Order for SAN infrastructure Tal Anker, Danny Dolev, Gregory Greenman, Ilya Shnaiderman School of Engineering and Computer Science The.
Q-MPEG V.2: A MPEG Video System with Quality of Service Control in Human Perspective Nature and Significance of the Project Q-MPEG is a Windows-based client-server.
Distributed System Structures Network Operating Systems –provide an environment where users can access remote resources through remote login or file transfer.
X stream Project proposal. Project goals: Students Students: Academic Supervisor Academic Supervisor: Advisors: Developing and Implementing a large scale.
Distributed Multimedia Systems
A Server-less Architecture for Building Scalable, Reliable, and Cost-Effective Video-on-demand Systems Jack Lee Yiu-bun, Raymond Leung Wai Tak Department.
Using DSVM to Implement a Distributed File System Ramon Lawrence Dept. of Computer Science
Distributed components
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Virtual Synchrony Jared Cantwell. Review Multicast Causal and total ordering Consistent Cuts Synchronized clocks Impossibility of consensus Distributed.
Technical Architectures
Notes to the presenter. I would like to thank Jim Waldo, Jon Bostrom, and Dennis Govoni. They helped me put this presentation together for the field.
Algorithm for Virtually Synchronous Group Communication Idit Keidar, Roger Khazan MIT Lab for Computer Science Theory of Distributed Systems Group.
Other File Systems: LFS and NFS. 2 Log-Structured File Systems The trend: CPUs are faster, RAM & caches are bigger –So, a lot of reads do not require.
Transis Efficient Message Ordering in Dynamic Networks PODC 1996 talk slides Idit Keidar and Danny Dolev The Hebrew University Transis Project.
Revision Week 13 – Lecture 2. The exam 5 questions Multiple parts Read the question carefully Look at the marks as an indication of how much thought and.
Chapter 25 Internet Routing Internetworking Technology How routing tables are built initially How routing software updates the tables as needed. Propagation.
1 On-Demand Multicast Routing and Its Applications.
OCT1 Principles From Chapter One of “Distributed Systems Concepts and Design”
Scalable Group Communication for the Internet Idit Keidar MIT Lab for Computer Science Theory of Distributed Systems Group The main part of this talk is.
Abstractions for Fault-Tolerant Distributed Computing Idit Keidar MIT LCS.
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Distributed Information Systems - The Client server model
1 Idit Keidar MIT Lab for Computer Science Theory of Distributed Systems Group Paradigms for Building Distributed Systems: Performance Measurements and.
16: Distributed Systems1 DISTRIBUTED SYSTEM STRUCTURES NETWORK OPERATING SYSTEMS The users are aware of the physical structure of the network. Each site.
1 A Framework for Highly Available Services Based on Group Communication Alan Fekete Idit Keidar University of Sidney MIT.
Microsoft ® Application Virtualization 4.5 Infrastructure Planning and Design Series.
Presented by : Ran Koretzki. Basic Introduction What are VM’s ? What is migration ? What is Live migration ?
Presented by: Alvaro Llanos E.  Motivation and Overview  Frangipani Architecture overview  Similar DFS  PETAL: Distributed virtual disks ◦ Overview.
Vs. Object-Process Methodology Written by Linder Tanya Rubinshtein Leena Nazaredko Anton Research Report Work Flow Management System.
Computer Measurement Group, India Reliable and Scalable Data Streaming in Multi-Hop Architecture Sudhir Sangra, BMC Software Lalit.
CS 149: Operating Systems April 23 Class Meeting Department of Computer Science San Jose State University Spring 2015 Instructor: Ron Mak
E0262 MIS - Multimedia Playback Systems Anandi Giridharan Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India.
1 WHY NEED NETWORKING? - Access to remote information - Person-to-person communication - Cooperative work online - Resource sharing.
The Next Generation Root File Server Andrew Hanushevsky Stanford Linear Accelerator Center 27-September-2004
1 Module 15: Network Structures n Topology n Network Types n Communication.
ARMADA Middleware and Communication Services T. ABDELZAHER, M. BJORKLUND, S. DAWSON, W.-C. FENG, F. JAHANIAN, S. JOHNSON, P. MARRON, A. MEHRA, T. MITTON,
Unit – I CLIENT / SERVER ARCHITECTURE. Unit Structure  Evolution of Client/Server Architecture  Client/Server Model  Characteristics of Client/Server.
SPREAD TOOLKIT High performance messaging middleware Presented by Sayantam Dey Vipin Mehta.
Distributed Data Mining System in Java Group Member D 王春笙 D 林俊甫 D 王慧芬.
What is a Distributed File System?? Allows transparent access to remote files over a network. Examples: Network File System (NFS) by Sun Microsystems.
Introduction. Readings r Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3 m Note: All figures from this book.
Group Communication Group oriented activities are steadily increasing. There are many types of groups:  Open and Closed groups  Peer-to-peer and hierarchical.
Dealing with open groups The view of a process is its current knowledge of the membership. It is important that all processes have identical views. Inconsistent.
Dealing with open groups The view of a process is its current knowledge of the membership. It is important that all processes have identical views. Inconsistent.
1 Presented By: Eyal Enav and Tal Rath Eyal Enav and Tal Rath Supervisor: Mike Sumszyk Mike Sumszyk.
Lecture (Mar 23, 2000) H/W Assignment 3 posted on Web –Due Tuesday March 28, 2000 Review of Data packets LANS WANS.
Hwajung Lee. A group is a collection of users sharing some common interest.Group-based activities are steadily increasing. There are many types of groups:
November NC state university Group Communication Specifications Gregory V Chockler, Idit Keidar, Roman Vitenberg Presented by – Jyothish S Varma.
CS603 Fault Tolerance - Communication April 17, 2002.
Scalable Group Communication for the Internet Idit Keidar MIT Lab for Computer Science Theory of Distributed Systems Group.
Open System Interconnection Describe how information from a software application in one computer moves through a network medium to a software application.
Chapter 11 Fault Tolerance. Topics Introduction Process Resilience Reliable Group Communication Recovery.
December 4, 2002 CDS&N Lab., ICU Dukyun Nam The implementation of video distribution application using mobile group communication ICE 798 Wireless Mobile.
A Fully Automated Fault- tolerant System for Distributed Video Processing and Off­site Replication George Kola, Tevfik Kosar and Miron Livny University.
March 2001 CBCB The Holy Grail: Media on Demand over Multicast Doron Rajwan CTO Bandwiz.
CHAPTER 7 CLUSTERING SERVERS. CLUSTERING TYPES There are 2 types of clustering ; Server clusters Network Load Balancing (NLB) The difference between the.
6.894: Distributed Operating System Engineering Lecturers: Frans Kaashoek Robert Morris
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Ethernet Virtual LANs Hubs versus Switches –Hubs broadcast bits out all ports –Switches usually send a frame out a one port More fundamentally –In unicasting,
Seminar On Rain Technology
DISTRIBUTED FILE SYSTEM- ENHANCEMENT AND FURTHER DEVELOPMENT BY:- PALLAWI(10BIT0033)
Reliable multicast Tolerates process crashes. The additional requirements are: Only correct processes will receive multicasts from all correct processes.
Replication & Fault Tolerance CONARD JAMES B. FARAON
Scaling Network Load Balancing Clusters
Algorithm for Virtually Synchronous Group Communication
Network Load Balancing
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)
Charlotte: Metacomputing on the Web
Presentation transcript:

Transis 1 Fault Tolerant Video-On-Demand Services Tal Anker, Danny Dolev, Idit Keidar, The Transis Project

Transis 2 VoD Service VoD: Full VCR control 1 video stream per client Client C 1 VoD Service provider Requests Video Stream Movies disk(s)

Transis 3 High Availability Multiple servers –at different sites Fault tolerance: –servers can crash Managing the load: –new servers can be brought up / down –load should be re-distributed “on the fly”  migration of clients

Transis 4 The challenges Low overhead Transparency –How do clients know whom to connect to?  “abstract” service –Clients should be unaware of migration server VoD Service Client C 1 Client C 2 server Client C 1 Client C 2 server VoD Service server Failed Server

Transis 5 Buffer Management and Flow Control Overcome jitter, message re-ordering and migration periods Re-fill buffers quickly after migration –avoid buffer overflow Minimize buffers –minimize pre-fetch bandwidth Dynamically adjust transmission rate to client capabilities –Re-negotiation of QoS

Transis 6 Features of our solution Use group communication in the control plane –connection establishment –fault tolerance and migration Flow control explicitly handles migration Low overhead –~1/1000 of the bandwidth –Negligible memory and CPU overhead Commodity hardware and publicly available network technologies

Transis 7 Environment Implementation –UDP/IP over 10 Mbit/s switched ethernet –Transis –Sun Sparc and BSDI PC’s as video servers –Win NT machines as video clients –MPEG1 & 2 hardware decoders Machine and Network Failures

Transis 8 Implementing the abstract service Use group communication –clients communicate with a well known group name (logical entity) –unaware of the number and identity of the servers in the group Servers periodically share information about clients (every 1/2sec) If a server crashes (or is overloaded), another server transparently takes over

Transis 9 Group Communication Reliable Group Multicast (Group Abstraction) Message Ordering Dynamic Reconfiguration Membership with Strong Semantics (Virtual Synchrony) Systems: Transis, Horus, Ensemble, Totem, Newtop, RMP, ISIS, Psync, Relacs

Transis 1010 The group layout of the VoD service

Transis 11 Transis Allows Simple Design Group abstraction for connection establishment and transparent migration Reliable group multicast allows servers to consistently share information Membership services detects conditions for migration Reliable messages for control –Server takes ~2500 C++ code lines –Client takes ~4000 C code lines (excluding GUI and display)

Transis 1212 VoD Client: Multi Threaded Design Client buffer accounts for jitter period when migration occurs Obviously, Flow-Control and Buffer management were needed

Transis 1313 Flow Control Feedback based flow-control (sparse): –FC messages are sent to the logical server (session group) –Clients determines the changes in the flow:

Transis 1414 Emergency Flow Control When the server receives an emergency message: –The server change the fps rate: fps = latest-known-fps + emergency quantity The emergency quantity decays every second (by a factor) –While the quantity is above zero, the server ignores FC messages from the client

Transis 1515 Performance Measurements On HUJI Network (LAN) Servers at TAU and clients at HUJI (WAN) The measurements show the system is robust and support our transparency claims

Transis 1616 Software Buffers

Transis 1717 Hardware Buffers

Transis 1818 Skipped Frames on LAN

Transis 1919 Skipped Frames on WAN

Transis 2020 Summary Scalable VoD service Load balancing Tolerating machine and network failure All the above are achieved practically for free: –~1/1000 of the total bandwidth –Negligible memory and CPU overhead

Transis 2121 Thanks to... Gregory Chockler The other members of the Transis project