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.

Slides:



Advertisements
Similar presentations
Advanced Computer Networks: RED Tuning Paper 1 Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC, Chapel Hill.
Advertisements

1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, F.Donelson Smith University of North Carolina at Chapel Hill Department of Computer.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
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.
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
The Power of Explicit Congestion Notification Aleksandar Kuzmanovic Northwestern University
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.
Networks: Congestion Control1 Congestion Control.
Advanced Computer Networks - RED Tuning Paper 1 Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC at Chapel Hill.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Improving Adaptability and Fairness in Internet Congestion Control May 30, 2001 Seungwan Ryu PhD Student of IE Department University at Buffalo.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
ACN: RED Tuning Paper1 Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC at Chapel Hill SIGCOMM 2000 Stockholm.
ACN: RED Tuning Paper1 Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC at Chapel Hill SIGCOMM 2000 Stockholm.
Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.
Random Early Detection Gateways for Congestion Avoidance
17/10/2003TCP performance over ad-hoc mobile networks. 1 LCCN – summer 2003 Uri Silbershtein Roi Dayagi Nir Hasson.
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Lightweight Active Router-Queue Management for Multimedia Networking M. Parris, K. Jeffay, and F.D. Smith Department of Computer Science University of.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
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,
Internet Traffic Management. Basic Concept of Traffic Need of Traffic Management Measuring Traffic Traffic Control and Management Quality and Pricing.
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.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
The Effects of Active Queue Management on Web Performance SICOMM 2003 Long Le, Jay Aikat, Kevin Jeffay, F.Donelson Smith 29 th January, 2004 Presented.
1 Congestion Control Computer Networks. 2 Where are we?
CSE 561 – Congestion Control with Network Support David Wetherall Spring 2000.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
A Self-Configuring RED Gateway Wu-chang Feng, Dilip Kandlur, Debanjan Saha, Kang Shin INFOCOM ‘99.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
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.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
CS 268: Computer Networking
Blue: An Alternative Approach to Active Queue Management
Topics discussed in this section:
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Network Performance and Quality of Service
Chapter 6 Congestion Avoidance
Queue Management Jennifer Rexford COS 461: Computer Networks
Congestion Control: The Role of the Routers
Router-Assisted Congestion Control
TCP Congestion Control
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
CONGESTION CONTROL.
Advance Computer Networking
Random Early Detection Gateways for Congestion Avoidance
Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.
COS 461: Computer Networks
Max Min Fairness How define fairness?
The War Between Mice & Elephants by, Matt Hartling & Sumit Kumbhar
Javad Ghaderi, Tianxiong Ji and R. Srikant
Congestion Control (from Chapter 05)
Project-2 (20%) – DiffServ and TCP Congestion Control
Congestion Control (from Chapter 05)
Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented by:
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

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 by Vadim Gorbach

2 Overview What is RED and its goals Alternatives RED parameters Web Traffic: Optimizing RED Results of the experiments

3 What is RED? Random Early Detection (Drop, Discard) Proposed by Sally Floyd and Van Jacobson (IEEE Transactions on Networking, August 1993) Aimed to reduce negative effects of Tail-Drop (FIFO) Policy in routers Claim: Improves congestion avoidance, end- to-end delay by controlling the average queue size

4 Tail-Drop (FIFO) Queue Mgmt Discard a datagram that arrives, if the queue is filled If traffic is multiplexed (it commonly is), TD drops segments from many sources, causing Global Synchronization Effect (especially in 4.3 BSD TCP Tahoe) High average queue size, leading to higher average delay through the network Optimal queue size: 1-2 bandwidth-delay products

5 RED: Motivation Floyd and Jacobson: Gateway-centric view Need for high throughput and low queue occupancy (low end-to-end delay) Plaguing synchronization (synchronous slow start) effect Dynamic queue size management with preventive drops, allowances for bursty traffic Compatibility with installed client and server base

6 RED Parameters and Queue Management Policy Qlen, minth, maxth, wq, maxp Qavg – average queue length Qavg < minth, add the datagram Qavg > maxth, discard the datagram – forced drop minth < Qavg < maxth, random discard according to probability p – early drop test RED Modifications and Alternatives: BLUE, SRED, ARED, FRED, BRED, RED w/ ECN (see paper for references)

7 Optimizing RED Optimal minth, maxth, maxp minth: chosen large enough to ensure output link has high utilization maxth: If Qlen  maxth, close to tail-drop behavior; maxth > 2 x minth is recommended p: depends on current queue size, e.g. linearly with increase from minth to maxth; but traffic is bursty, that is why weighted queue size is used in practice; S.Floyd, V.Jacobson: weighted average queue size Early drop probability p = maxp x (avg – minth) / (maxth – minth), where avg depends on wq

8 Focus of the Paper Web traffic, which makes 70% of all TCP/IP traffic Worst case considered: Web traffic, based on HTTP 1.0, for highly- variable and bursty demands on the network dynamically changing number of TCP connections Main criterion is a user-visible measure: End-to-end response time

9 Experimental Network Browsers (clients): PCs with Web request generator software, 10 Mbps Servers: Web response generator software, 10 Mbps 2 router PCs: ALTQ software for FIFO, RED, CBQ and WFQ queue management 2 stacks of switches (Cisco Catalyst 5000) to concentrate Web request and Web response traffic Static routes to separate Requests and Responses into different Ethernet segments

10 Web-like Traffic Generation 230 hours of traces from UC-Berkeley campus, 1.6 million HTTP protocol packets HTTP model: HTTP request length in bytes HTTP reply length in bytes Number of embedded file references per page Time between retrieval of two successive pages (user “think” time) Number of consecutive pages requested from server HTTP version 1.0

11 Experiments Calibrations to make sure: CPUs and network interfaces are not resource constraints (Fig. 1) FreeBSD limitation of 64 sockets per process is not constraint Whether generated loads merge successfully (Fig. 2) Experimental Procedures: Offered loads: 50, 70, 80, 90, 98, 110% (120% exhausts sockets) 90 minutes, first 20 minutes ignored (Fig. 5)

12 FIFO vs RED FIFO: Fixed offered load, varying queue length (Fig.7) Utilization above 90% seriously impacts response time (Fig.8) RED: Fixing RED parameters per guidelines (Fig.9) Varying minth and maxth: guidelines fail to impress (Fig. 10) What about minth, wq and maxp for bursty traffic (Fig. 11, 12) Utilization and Response Time trade-off (Fig. 13) Pitfalls: Reasonable parameters but poor results (Fig.14)

13 Conclusions Comparing at different loads: Contrary to expectations, compared to TD(FIFO), RED has a minimal effect on HTTP response times for offered loads up to 90% of link capacity Response times at loads in this range are not substantially effected by RED parameters Between 90% and 100% load, RED can be carefully tuned to superior performance, however response times are quite sensitive Trade-off: in such heavily congested networks, RED parameters that provide the best link utilization produce poorer response times