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.

Slides:



Advertisements
Similar presentations
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
Advertisements

Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts control and improve performance detect changes of network state.
Computer Networking Lecture 20 – Queue Management and QoS.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Modeling Differentiated Services -- the first step Martin May Jean-Chrysostome Bolot Alain Jean-Marie Christophe Diot.
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Multimedia Streaming Gateway With Jitter Detection Siu-Ping Chan, Chi-Wah Kok Albert K. Wong IEEE TRANSACTIONS ON MULTIMEDIA, June 2005.
Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
CS 268: Lecture 8 (Router Support for Congestion Control) Ion Stoica February 19, 2002.
Modeling TCP in Small-Buffer Networks
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Active Queue Management Rong Pan Cisco System EE384y Spring Quarter 2006.
Random Early Detection Gateways for Congestion Avoidance
Estimating Congestion in TCP Traffic Stephan Bohacek and Boris Rozovskii University of Southern California Objective: Develop stochastic model of TCP Necessary.
Module 2.0: Modeling of Network Components. Queueing theory  Basics : average number of packets 1/  : mean service time per packet [s] arriving per.
Routers with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Lightweight Active Router-Queue Management for Multimedia Networking M. Parris, K. Jeffay, and F.D. Smith Department of Computer Science University of.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Buffer requirements for TCP: queueing theory & synchronization analysis Gaurav RainaDamon Wischik CambridgeUCL.
1 Chapters 9 Self-SimilarTraffic. Chapter 9 – Self-Similar Traffic 2 Introduction- Motivation Validity of the queuing models we have studied depends on.
Open Issues in Buffer Sizing Amogh Dhamdhere Constantine Dovrolis College of Computing Georgia Tech.
An End-to-end Approach to Increase TCP Throughput Over Ad-hoc Networks Sarah Sharafkandi and Naceur Malouch.
Link Scheduling & Queuing COS 461: Computer Networks
Advanced Computer Networking
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
1 Aggregate Traffic Performance with Active Queue Management and Drop from Tail Christophe Diot, Gianluca Iannaccone, Martin May Sprint ATL, Università.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
1 1 July 28, Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
Winter 2008CS244a Handout 81 CS244a: An Introduction to Computer Networks Handout 8: Congestion Avoidance and Active Queue Management Nick McKeown Professor.
Spring 2015© CS 438 Staff - University of Illinois1 Next Topic: Vacation Planning UIUC Chicago Monterey San Francisco Chicago to San Francisco: ALL FLIGHTS.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
1 Network Simulation and Testing Polly Huang EE NTU
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Queueing theory for TCP Damon Wischik, UCL Gaurav Raina, Cambridge.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
1 Tuning RED for Web Traffic SIGCOMM 2000 Paper by M. Christiansen, K. Jeffray, D. Ott, F.D. Smith, UNC – Chapel Hill CS 590 F Fall 2000 Paper presentation.
Chapter 6 Congestion Avoidance
Buffer Management in a Switch
Experiment with LBE Quality of Service on GÉANT
Congestion Control: The Role of the Routers
EE 122: Router Support for Congestion Control: RED and Fair Queueing
Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis
Random Early Detection Gateways for Congestion Avoidance
Other Methods of Dealing with Congestion
Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

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 by increasing loss of less bursty traffic RED results in higher number of consecutive packet drops, which may lead to global TCP synchronization RED reduces average delay, but increases delay jitter of less bursty flows Thus, applications such as audio may suffer more with RED than Tail Drop Also, loss rate seen by a flow proportional to flow intensity is only true for Poisson arrivals

Bias Against Bursty Traffic Assume bursts (batches) of B packets arriving as Poisson Lower bound on difference between smooth traffic and more bursty (e.g. LRD) traffic Use PASTA (Poisson Arrival See Time Averages) Compute drop probability for TD Assume instantaneous queue size measurements (weight = 1) Approximation 1: same drop probability used on all packets in same burst Lower bound on drop rate Accurate for small min_thresh, high maxP, B << buffer size K Drop probability is always higher with RED than TD For high load, loss probability for RED almost equals that of M/M/1/K Tail Drop

RED with Bursty and Smooth Traffic Bias against bursty traffic with TD RED distributes drops among both types of traffic Both drop rates are equal to average TD drop rate for high load

With Queue Size Averaging With small weight to instantaneous measurement (as recommended), average varies slowly ==> makes approximation 1 valid Drop rate for bursty traffic decreases only when it is a small fraction For a large fraction of bursty traffic (the case in practice), loss rate for non-bursty traffic increases significantly Without PASTA, drop probability for Pareto traffic is different from that for smooth traffic, even for RED

Synchronization of TCP Flows Mainly observed in simulation! Assume Poisson traffic Compute distribution of number of consecutive losses Approximation 2: consecutively dropped packets are dropped with same probability Upper bound on number of consecutive drops Accurate for smooth drop function and high load Mean and variance of number of consecutive drops are lower with RED than TD With queue size averaging, small weight, approximation 2 valid No of consecutive drops is infinite with positive probability RED results in higher mean and variance, which may lead to global synchronization

Queueing Delay For small weight and high offered load, estimated average queue size slowly oscillate around max_thresh RED reduces mean delay, but also add jitter Audio quality will suffer

Simulation Loss probability for TCP does not change between RED and TD Loss rate for UDP increases significantly when going from TD to RED Total TCP throughput does not increase with RED With 100 TCP flows and different RTTs, no global synchronization is observed Average queue with RED stays close to max_thresh Instantaneous queue size varies heavily with time compared to TD Observations hold independent of number of flows TD even has higher throughput when number of flows is small