1 1 July 28, 2012. 2 Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design.

Slides:



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

Streaming Video over the Internet
1 Improving TCP Performance over Mobile Networks HALA ELAARAG Stetson University Speaker : Aron ACM Computing Surveys 2002.
Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
01. Apr INF-3190: Congestion Control Congestion Control Foreleser: Carsten Griwodz
Computer Networks Transport Layer. Topics F Introduction (6.1)  F Connection Issues ( ) F TCP (6.4)
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
Measurements of Congestion Responsiveness of Windows Streaming Media (WSM) Presented By:- Ashish Gupta.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
CS 268: Project Ideas Kevin Lai Feb 6, Announcements  Summary submission method -cp laik.jac88.html ~cs268/reviews -chmod.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #07 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
Networks: Congestion Control1 Congestion Control.
Internet and Intranet Protocols and Applications Section V: Network Application Performance Lecture 11: Why the World Wide Wait? 4/11/2000 Arthur P. Goldberg.
Adaptive Delay Aware Error Control for Internet telephony Catherine Boutremans Jean-Yves Le Boudec IP Telephony Workshop’2001 Institute for computer Communication.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
L13: Sharing in network systems Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans.
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Rigorous fair Queueing requires per flow state: too costly in high speed core routers.
Wireless TCP February 22, 2002 © 2002 Yongguang Zhang CS 395T - Mobile Computing and Wireless Networks Department of Computer SciencesTHE UNIVERSITY OF.
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.
Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
1 1 July 28, Absent changes to the network can we actually do something? Yes Is there work in the area of measurements that can we do to create.
CS332 Ch. 28 Spring 2014 Victor Norman. Access delay vs. Queuing Delay Q: What is the difference between access delay and queuing delay? A: I think the.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (
Kamal Singh, Árpád Huszák, David Ros, César Viho and Jeney Gábor
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
CING-YU CHU INFOCOM Outline  Introduction  Measurement  Measurement Results  Modeling Skype Behaviors  Analysis on TCP-friendly.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.
1 TCP-BFA: Buffer Fill Avoidance September 1998 Amr A. Awadallah Chetan Rai Computer Systems.
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Data and Computer Communications Chapter 11 – Asynchronous Transfer Mode.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen, Mohammad Malli, Chadi Barakat PLANETE group, INRIA.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
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.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Low Latency Adaptive Streaming over TCP Authors Ashvin Goel Charles Krasic Jonathan Walpole Presented By Sudeep Rege Sachin Edlabadkar.
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
TCP. TCP ACK generation [RFC 1122, RFC 2581] Event at Receiver Arrival of in-order segment with expected seq #. All data up to expected seq # already.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04, 2004 Presented by Alok Rakkhit, Ionut Trestian.
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
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.
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
Masaki Hirabaru (NICT) and Jin Tanaka (KDDI) Impact of Bottleneck Queue on Long Distant TCP Transfer August 25, 2005 NOC-Network Engineering Session Advanced.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
Topics discussed in this section:
Chapter 3 outline 3.1 transport-layer services
Congestion Control: The Role of the Routers
Congestion Control, Internet transport protocols: udp
Jiyong Park Seoul National University, Korea
TCP Congestion Control
Transport Layer: Congestion Control
Presentation transcript:

1 1 July 28, 2012

2 Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design solutions Want to increase understanding of topics like: Latency we see on networks Impact waiting for congestion to happen on latency What happens when TCP competes with Voice/Video Impact on retransmissions vs forward error correction

3 Commercial LTE networks have: Near-infinite queue (no losses until >5 seconds) Poisson-distributed packet arrivals Quickly-varying link speed Highly long-tailed delays (RTCP jitter estimate is bad) Operators do not (yet) believe this. Open question: How much throughput would transport forfeit if it wanted to cap queue at 100 ms?

4 Simulation of ECN on LTE shows significantly less packet loss initiating the rate adaptation in advance of actual congestion better sharing the cost of congestion a very significant reduction in latency better quality for all users Load Delay Implicit methods react only when damage done eNB can sense congestion and signal ECN before it becomes severe Congestion problem detected ~6s before ! Implicit method Explicit (ECN) method

5 Single short TCP flow impacts voice on startup but six short TCP flows destroy voice quality on high speed cellular network (2 mbps) Drops are due to the jitter, not losses

6 What bandwidth would be safe relative to 1 TCP connection?

7 What bandwidth would be safe relative to 4 TCP connection?

8 Not so fair … Adaption takes time …

9 Better to user experience with lower bit rate + fec Better latency than ARQ based schemes

10 Self-fairness - Problems 1000 kbps 2000 kbps A B C N1N2 N3 N4 Flow A and B are controlled by RRTCC. Flow C is constant at 1.3 Mbps. Flow A is "noisier" than B due to C. We expect that flow A and B will share the 1 Mbps bottleneck fairly, i.e., 500 kbps each. RRTCC Simulations – Paper 6

11 Self-fairness - Problems Different amount of cross traffic. o Flow A is more noisy than B due to significant cross traffic at N1. o Noisier signal means more filtering and slower detection. o Flow B loses against flow A. Other problems: Self-aware burstiness.

12 Under the Hood

13 Self-fairness - Possible solution Fixed noise variance. Additive Increase, Multiplicative Decrease. Send-side smoothing.