EE689 Lecture 13 Review of Last Lecture Reliable Multicast.

Slides:



Advertisements
Similar presentations
Reliable Multicasting –IP-multicast is unreliable. Need a reliable multicast layer to simplify the software design. –Like in reliable unicast (PAR), we.
Advertisements

Fault Tolerance CSCI 4780/6780. Reliable Group Communication Reliable multicasting is important for several applications Transport layer protocols rarely.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
1 Transport Protocols & TCP CSE 3213 Fall April 2015.
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Router Buffer Sizing and Reliability Challenges in Multicast Aditya Akella 02/28.
15-744: Computer Networking L-17 Multicast Reliability and Congestion Control.
Go-Back-N Improve Stop-and-Wait by not waiting!
L-21 Multicast. L -15; © Srinivasan Seshan, Overview What/Why Multicast IP Multicast Service Basics Multicast Routing Basics DVMRP Overlay.
1 TCP CSE May TCP Services Flow control Connection establishment and termination Congestion control 2.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
A Reliable Multicast Framework For Light-Weight Sessions and Application Level Framing Sally Floyd, Van Jacobson, Ching-Gung Liu, Steven McCanne, Lixia.
Network Congestion Gabriel Nell UC Berkeley. Outline Background: what is congestion? Congestion control – End-to-end – Router-based Economic insights.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 OSI Transport Layer Network Fundamentals – Chapter 4.
Scalable Team Multicast in Wireless Ad hoc networks Exploiting Coordinated Motion Mario Gerla University of California, Los Angeles.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CSE 561 – Multicast Applications David Wetherall Spring 2000.
Department of Computer Engineering University of California at Santa Cruz Networking Systems (1) Hai Tao.
A loss detection Service for Active Reliable Multicast Protocols Moufida MAIMOUR & C. D. PHAM INRIA-RESO RESAM UCB-Lyon – ENS Lyon INC’02, Plymouth Tuesday,
588 Section 6 Neil Spring May 11, Schedule Notes – (1 slide) Multicast review –(3slides) RLM (the paper you didn’t read) –(3 slides) ALF & SRM –(8.
1 EE689 Lecture 4 Review of Last Lecture UDP-based delivery TCP-modifications.
Network Multicast Prakash Linga. Last Class COReL: Algorithm for totally-ordered multicast in an asynchronous environment, in face of network partitions.
Computer Networking Lecture 24 – Multicast.
EE689 Lecture 14 Review of Last lecture Receiver-driven Layered Multicast.
1 Lecture 6: Multicast l Challenge: how do we efficiently send messages to a group of machines? n Need to revisit all aspects of networking n Last time.
Streaming Video Gabriel Nell UC Berkeley. Outline Scalable MPEG-4 video – Layered coding method – Integrated transport-decoder buffer model RAP streaming.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Transport Protocols Slide 1 Transport Protocols.
On Multicast CS614 - March 7, 2000 Tibor Jánosi ?.
1 Reliability & Flow Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
CS 268: Multicast Transport Kevin Lai April 24, 2001.
An analysis of a router-based loss detection service for active reliable multicast protocols ICON’02, Singapor M. Maimour, C. Pham RESAM UCB Lyon - INRIA.
1 Transport Layer goals: r understand principles behind transport layer services: m multiplexing/demultiplexing m reliable data transfer m flow control.
An Active Reliable Multicast Framework for the Grids M. Maimour & C. Pham ICCS 2002, Amsterdam Network Support and Services for Computational Grids Sunday,
Multicast Transport Protocols: A Survey and Taxonomy Author: Katia Obraczka University of Southern California Presenter: Venkatesh Prabhakar.
CSE679: Multicast and Multimedia r Basics r Addressing r Routing r Hierarchical multicast r QoS multicast.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
What Can IP Do? Deliver datagrams to hosts – The IP address in a datagram header identify a host IP treats a computer as an endpoint of communication Best.
Streaming Video over the Internet Dapeng Wu Electrical & Computer Engineering University of Florida.
Dec 4, 2007 Reliable Multicast Group Neelofer T. CMSC 621.
1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.
CSCI 465 D ata Communications and Networks Lecture 27 Martin van Bommel CSCI 465 Data Communications & Networks 1.
CIS679: Multicast and Multimedia (more) r Review of Last Lecture r More about Multicast.
Video Multicast over the Internet Presented by: Liang-Yuh Wu Lung-Yuan Wu Hao-Hsiang Ku 12 / 6 / 2001 Bell Lab. And Georgia Institute of Technologies IEEE.
CS603 Fault Tolerance - Communication April 17, 2002.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
ECE 4110 – Internetwork Programming
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
15-744: Computer Networking L-15 Multicast Address Allocation and Reliability.
Data Link Layer Flow and Error Control. Flow Control Flow Control Flow Control Specifies the amount of data can be transmitted by sender before receiving.
4343 X2 – The Transport Layer Tanenbaum Ch.6.
Building A Network: Cost Effective Resource Sharing
Reliable Adaptive Lightweight Multicast Protocol Ken Tang, Scalable Network Technologies Katia Obraczka, UC Santa Cruz Sung-Ju Lee, Hewlett-Packard Laboratories.
Computer Networking Lecture 16 – Reliable Transport.
TCP over Wireless PROF. MICHAEL TSAI 2016/6/3. TCP Congestion Control (TCP Tahoe) Only ACK correctly received packets Congestion Window Size: Maximum.
CMPE 252A: Computer Networks
Sliding Window Protocol | Go-Back-N
CIS, University of Delaware
Limited Transmit & Early Retransmit for TCP
Video Multicast over the Internet (IEEE Network, March/April 1999)
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Reliable Multicast Group
Building A Network: Cost Effective Resource Sharing
Low-Latency Adaptive Streaming Over TCP
Seminar Mobilkommunikation Reliable Multicast in Wireless Networks
The Transport Layer Reliability
Computer Networks Protocols
Presentation transcript:

EE689 Lecture 13 Review of Last Lecture Reliable Multicast

In unicast, receiver ACKs give feedback --- Sender takes responsibility in transmitting data In Multicast, many receivers -- too difficult for sender to keep track of every receiver’s status ACK Implosion

Receiver-driven Multicast Sender keeps no information of receivers’ status Receivers send NAKs to reduce ACK implosion problem Several receivers may not get a packet on a loss - still possible to get many replies from receivers

Receiver-driven Multicast Unicast NAKs to sender –Reduces overhead when packet losses are isolated and rare –Packet loss early in the tree will result in too many NAKs Multicast NAKs to sender –Others missing packets need not send NAKs –Could cause burden on receivers if only one receiver doesn’t get the packet

Receiver-driven Multicast Multicasting NAKs –if every receiver, sends a NAK immediately after getting an out-of-sequence packet, too many NAKS at once! –Wait for a random time, send a NAK –If some one else sends a NAK, suppress your NAK –Getting random timers tricky business

Receiver-driven Multicast More scalable than sender-driven Loss recovery times may be larger –Receiver may not know if last packet is lost –Realizes packet loss after receiving an out-of- sequence packet –Has to send a NAK and then reply from sender –May be faster if sender times out if ACK is not received in time

Loss Recovery Sender remulticasts packet to everyone Possible to organize packet retransmissions into another multicast group Receivers listen to the loss-multicast groups only on packet losses –could be more scalable

Hierarchical Multicast Organize multicast into a number of groups One Designated Receiver takes responsibility for reliability On packet loss, NAK propagated to DR If DR has data, retransmits or remulticasts with limited scope to the group If DR doesn’t have data, sends NAK to sender

Hierarchical Multicast More scalable than other multicast protocols Need mechanisms to find out DR Need mechanisms to delegate DR function to another node as primary DR node leaves multicast Specially useful when multicast over wide geographic boundaries, keep one DR in each country for example

Hierarchical Multicast RMTP: Reliable Multicast Transport Protocol - Bell Labs DR nodes may need more power than other receivers Extra overhead in protocol Quicker recovery times when losses are local

Token-ring Multicast Pass a token around a local group Have token => DR for that packet/segment Distribute responsibility over time Need protocol for passing token around Need protocol for associating a receiver with data segments Again more scalable than flat multicast

Heterogeneous Receivers Not all the receivers may have same Bandwidth connectivity Normally would result in sending data at the lowest quality that everyone can receive At higher qualities –Too many packets dropped – Too much load on sender on retransmissions –everyone suffers delays or loss in quality

Heterogeneous Receivers Send video in multiple layers Base layer and enhancement layers Base layer provides the least quality –For example, at 28.8 kbs Enhancement layers can be added if higher BW connectivity available –Higher quality video for some

Heterogeneous Receivers Layered video - use multiple multicast groups Subscribe to all of them or some of them based on BW connectivity This strategy works well with dynamic network conditions –congestion ( or BW availability) changes over time

Network dynamics -multicast When BW is plentiful (low loss rate), subscribe to all layers As loss rate increases, subscribe to few layers Sender transmits at the maximum level subscribed by the receiver group Different layers will have different trees of distribution

Multicast - Compression Multi layer video coding popular Some applications adjust rates on the layers dynamically RLM - UC Berkeley, Café Mocha - TAMU Vxtreme, RealVideo Number of other tools

Multicast Summary Reliability poses interesting challenges Receiver-driven multicast more scalable Hierarchical multicast more scalable Receiver Heterogenity forces video multicast to be layered –allows flexible QOS /distribution of video