1 EE 627 Lecture 11 Review of Last Lecture UDP & Multimedia TCP & UDP Interaction.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 16: Congestion control II Slides used with.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #05: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: TCP Shiv Kalyanaraman:
Network Congestion Gabriel Nell UC Berkeley. Outline Background: what is congestion? Congestion control – End-to-end – Router-based Economic insights.
Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.
1 Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley, Jitendra Padhye & Jorg Widmer August 2000, ACM SIGCOMM Computer.
TDC365 Spring 2001John Kristoff - DePaul University1 Internetworking Technologies Transmission Control Protocol (TCP)
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
EE689 Lecture 5 Review of last lecture More on HPF RED.
1 EE 689 Lecture 3 Review of Last Lecture UDP & Multimedia TCP & UDP Interaction.
1 689 Lecture 2 Review of Last Lecture Networking basics TCP/UDP review.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 EE689 Lecture 4 Review of Last Lecture UDP-based delivery TCP-modifications.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
EE689 Lecture 14 Review of Last lecture Receiver-driven Layered Multicast.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Data Communication and Networks
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
1 Manpreet Singh, Prashant Pradhan* and Paul Francis * MPAT: Aggregate TCP Congestion Management as a Building Block for Internet QoS.
Lecture 5: Congestion Control l Challenge: how do we efficiently share network resources among billions of hosts? n Last time: TCP n This time: Alternative.
L13: Sharing in network systems Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
CS :: Fall 2003 TCP Friendly Streaming Ketan Mayer-Patel.
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
1 EE 122: Advanced TCP Ion Stoica TAs: Junda Liu, DK Moon, David Zats (Materials with thanks to Vern Paxson,
MulTFRC: TFRC with weighted fairness draft-welzl-multfrc-00 Michael Welzl, Dragana Damjanovic 75th IETF Meeting Stockholm, Sweden 29 July 2009.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Transport Layer3-1 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
CSE679: Prioritized Delivery in UDP and TCP r Prioritized Delivery in UDP r Prioritized Delivery in TCP.
CSE679: Computer Network Review r Review of the uncounted quiz r Computer network review.
Transport Layer3-1 Announcements r Collect homework r New homework: m Ch3#3,4,7,10,12,16,18-20,25,26,31,33,37 m Due Wed Sep 24 r Reminder: m Project #1.
EE 122: Congestion Control and Avoidance Kevin Lai October 23, 2002.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Lecture 9 – More TCP & Congestion Control
What is TCP? Connection-oriented reliable transfer Stream paradigm
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE-ACAM Transactions on Networking, 馬儀蔓.
Network Protocols: Design and Analysis Polly Huang EE NTU
Computer Networking Lecture 18 – More TCP & Congestion Control.
Transport Layer 3- Midterm score distribution. Transport Layer 3- TCP congestion control: additive increase, multiplicative decrease Approach: increase.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
CIS679: TCP and Multimedia r Review of last lecture r TCP and Multimedia.
CIS679: UDP and Multimedia r Review of last lecture r UDP and multimedia.
Chapter 9: Transport Layer
Instructor Materials Chapter 9: Transport Layer
Chapter 3 outline 3.1 transport-layer services
Chapter 6 TCP Congestion Control
Chapter 3 outline 3.1 Transport-layer services
CSE679: Multimedia and Networking
Lecture 19 – TCP Performance
CIS679: Prioritized Delivery in UDP and TCP
Chapter 6 TCP Congestion Control
CS640: Introduction to Computer Networks
TCP Throughput Modeling
TCP Congestion Control
Chapter 3 outline 3.1 Transport-layer services
Presentation transcript:

1 EE 627 Lecture 11 Review of Last Lecture UDP & Multimedia TCP & UDP Interaction

2 UDP Provides multiplexing and demultiplexing of sources. No reliability, flow control, congestion control. Sends data in a burst. Most multimedia applications using UDP

3 UDP & Multimedia Put flow control, congestion control into application. Retransmit if packet deadline not past Move on if packet deadline is past Don’t respond to Congestion Not a “nice” citizen. Possible to cause congestion collapse

4 TCP/UDP Summary TCP not well suited to multimedia. TCP is a well understood, ‘nice’ protocol. Multiplicative decrease/additive increase allows fair sharing of BW and avoids congestion collapse. UDP is being used by multimedia developers.

5 UDP Consequences Most applications today use TCP Stability of network relies on congestion response of applications Large scale use of UDP could lead to problems - no congestion response Large number of multimedia applications expected - move larger amounts of data

6 Unfairness When UDP and TCP compete, UDP wins by pushing TCP into congestion

7 Unfairness - FIFO

8 Unfairness - WRR

9 Loss of goodput -FIFO Packets dropped later in network

10 Loss of goodput -WRR

11 Multimedia Delivery Even when using UDP, applications should respond to congestion end-to-end. Need to promote “nice” behavior or “TCP- friendly” behavior. Emerging applications shouldn’t kill the performance of “nice” applications.

12 TCP-Friendly Throughput of a TCP connection Limit flows to TCP-style BW Don’t know RTT exactly Why should everyone follow this exactly? Monitoring individual flows difficult

13 Equation-based control Don’t have to respond to congestion exactly like TCP –As long as steady-state BW is about the same Design a protocol that claims on an average the same BW as TCP RTT is available to end-host, try to estimate drop probability –Adjust rate based on the BW using the equation

14 Drop Probability Don’t want to use instantaneous drop probability - varies too much, noisy. Use some kind of averaging –Tends to dampen response to congestion –Important to respond quickly in times of heavy congestion –Uses a limited history -remember last 8 events –Weigh the more recent ones higher

15 Equation-based control Shown to work well when competing with TCP –Lower variance in flow’s BW than TCP –Fairer distribution than TCP A little complicated Spurred a lot of interest in new protocols.

16 Binomial congestion control Generalize congestion response Showed that these protocols are TCP- friendly if l+k = 1, through analysis Varying l and k, keeping l+k = 1 -- can get multiple protocols.

17 Binomial Congestion control Showed that steady-state analysis did not tell the complete picture –Depending on congestion response, the drop rates could be different for different protocols –Could respond to congestion in a TCP-friendly way, but may force TCP do have more drops –Conjecture: RED is better than droptail to make drop probabilities equal across flows

18 Open Issues Much interest in this area of research Not clear at what time scales, a flow needs to be TCP-friendly –clearly steady state analysis not sufficient. –Instantaneous TCP like response not needed. Other possible mechanisms simpler?

19 Other Mechanisms Multiple connections - seem to respond to congestion, but claim larger BW. –Used in web browsers Pricing - make user pay more when sending more bits. Adjust pricing based on congestion.

20 Rate-based adaptation Have a notion of allowed rate -adjust rate to avoid congestion - reduce rate before packet loss. Packet-pair: Send a pair of packets, watch the time separation of acks The delay between acks gives an indication of bottleneck BW

21 Packet-pair

22 Packet-pair Technique Ack compression leads to incorrect BW estimation. Timestamp packets on receipt - t1, t2 Inform sender d = t2 - t1, bottleneck BW = (d)/P, P = size of first packet. Need to send multiple times and use min d. Hard to get an estimate of available BW

23 Packet-pair With parallel transfers, both packets may arrive simultaneously at the receiver - inflating available BW Can be improved by sending more packets Possible to decouple rate adaptation and reliable delivery

24 Hop-by-Hop Possible to do flow control hop-by-hop Send backward pressure to reduce rate when queues are building up Tough to control individual flows Every network element need to implement - not just endpoints.