17: Queue Management. Queuing. Mark Handley



Similar documents
Congestion Control Review Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?

Active Queue Management

Active Queue Management (AQM) based Internet Congestion Control

Passive Queue Management

Performance improvement of active queue management with per-flow scheduling

Protagonist International Journal of Management And Technology (PIJMT) Online ISSN Vol 2 No 3 (May-2015) Active Queue Management

Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow

Active Queue Management and Wireless Networks

Improving our Evaluation of Transport Protocols. Sally Floyd Hamilton Institute July 29, 2005

Packet Queueing Delay

Master s Thesis. A Study on Active Queue Management Mechanisms for. Internet Routers: Design, Performance Analysis, and.

18: Enhanced Quality of Service

Active Queue Management A router based control mechanism

Requirements for Simulation and Modeling Tools. Sally Floyd NSF Workshop August 2005

Analysis of Internet Transport Service Performance with Active Queue Management in a QoS-enabled Network

Robust Router Congestion Control Using Acceptance and Departure Rate Measures

Analyzing Marking Mod RED Active Queue Management Scheme on TCP Applications

1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

TCP/IP Over Lossy Links - TCP SACK without Congestion Control

Lecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage

15-441: Computer Networks Homework 2 Solution

Using median filtering in active queue management for telecommunication networks

Seamless Congestion Control over Wired and Wireless IEEE Networks

Novel Approach for Queue Management and Improvisation of QOS for Communication Networks

Question: 3 When using Application Intelligence, Server Time may be defined as.

Delay-Based Early Congestion Detection and Adaptation in TCP: Impact on web performance

Internet Quality of Service

Comparative Analysis of Congestion Control Algorithms Using ns-2

TCP, Active Queue Management and QoS

TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)

Lecture Objectives. Lecture 07 Mobile Networks: TCP in Wireless Networks. Agenda. TCP Flow Control. Flow Control Can Limit Throughput (1)

Rate-Based Active Queue Management: A Green Algorithm in Congestion Control

Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks

Why Congestion Control. Congestion Control and Active Queue Management. Max-Min Fairness. Fairness

Requirements of Voice in an IP Internetwork

Active Queue Management

Mobile Communications Chapter 9: Mobile Transport Layer

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation

Modeling Active Queue Management algorithms using Stochastic Petri Nets

Lecture 16: Quality of Service. CSE 123: Computer Networks Stefan Savage

Performance Evaluation of Active Queue Management Using a Hybrid Approach

TCP and Wireless Networks Classical Approaches Optimizations TCP for 2.5G/3G Systems. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme

TCP for Wireless Networks

Survey on AQM Congestion Control Algorithms

REM: Active Queue Management

Transport layer issues in ad hoc wireless networks Dmitrij Lagutin,

Achieving QoS for TCP traffic in Satellite Networks with Differentiated Services

CS551 End-to-End Internet Packet Dynamics [Paxson99b]

Parallel TCP Data Transfers: A Practical Model and its Application

GREEN: Proactive Queue Management over a Best-Effort Network

Fuzzy Active Queue Management for Assured Forwarding Traffic in Differentiated Services Network

Improving Internet Quality of Service through Active Queue Management in Routers

A Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman

Outline. TCP connection setup/data transfer Computer Networking. TCP Reliability. Congestion sources and collapse. Congestion control basics

On the Evolution of End-to-end Congestion Control in the Internet: An Idiosyncratic View

Distributed Systems 3. Network Quality of Service (QoS)

Performance Analysis Of Active Queue Management (AQM) In VOIP Using Different Voice Encoder Scheme

Quality of Service. Traditional Nonconverged Network. Traditional data traffic characteristics:

The network we see so far. Internet Best Effort Service. Is best-effort good enough? An Audio Example. Network Support for Playback

Network congestion, its control and avoidance

TCP over Wireless Networks

An Adaptive RIO (A-RIO) Queue Management Algorithm

TCP Pacing in Data Center Networks

Practical Appraisal of Distinguish Active Queue Management Algorithms

Chapter 6 Congestion Control and Resource Allocation

Lecture 8 Performance Measurements and Metrics. Performance Metrics. Outline. Performance Metrics. Performance Metrics Performance Measurements

The Interaction of Forward Error Correction and Active Queue Management

Nonlinear RED: A simple yet efficient active queue management scheme q

Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT:

Equation-Based Congestion Control for Unicast Applications

Per-Flow Queuing Allot's Approach to Bandwidth Management

AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS

TCP in Wireless Mobile Networks

NEW ACTIVE QUEUE MANAGEMENT MECHANISM FOR REDUCING PACKET LOSS RATE

Router-based Congestion Control through Control Theoretic Active Queue Management

16/5-05 Datakommunikation - Jonny Pettersson, UmU 2. 16/5-05 Datakommunikation - Jonny Pettersson, UmU 4

RBA-RIO Rate Based Adaptive Red With In and Out. Algorithm for DiffServ AF PHB

CS/ECE 438: Communication Networks. Internet QoS. Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE

A Survey on Congestion Control Mechanisms for Performance Improvement of TCP

Quality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?


On Packet Marking Function of Active Queue Management Mechanism: Should It Be Linear, Concave, or Convex?

Optimization of Communication Systems Lecture 6: Internet TCP Congestion Control

Aggregate Traffic Performance with Active Queue Management and Drop from Tail

Real-time apps and Quality of Service

Transcription:

17: Queue Management Mark Handley Queuing The primary purpose of a queue in an IP router is to smooth out bursty arrivals, so that the network utilization can be high. But queues add delay and cause jitter. Delay is the enemy of real-time network traffic. Jitter is turned into delay at the receiver s playout buffer. Understanding and controlling network queues is key to getting good performance from networked multimedia. 1

TCP Throughput and Queue Size Window (Packets) Time (RTTs) TCP and Queues TCP needs one delay-bandwidth product of buffer space at the bottleneck link for a TCP flow to fill the link and achieve 100% utilization. Thus, when everything is configured correctly, the peak delay is twice the underlying network delay. Links are often overbuffered, because the actual RTT is unknown to the link operator. Real-time applications see the difference between peak and min as jitter, and smooth to peak delay. 2

Two TCP Flows (Effects of Phase) Multiple TCP flows and Queues If multiple flows all back-off in phase, the router still needs a delay-bandwidth product of buffering. If multiple flows back-off out of phase, high utilization can be maintained with smaller queues. How to keep the flows out of phase? 3

Active Queue Management Goals of Active Queue Management The primary goal: Controlling average queuing delay, while still maintaining high link utilization. Secondary goals: Improving fairness (e.g., by reducing biases against bursty low-bandwidth flows). Reducing unnecessary packet drops. Reducing global synchronization (i.e., for environments with small-scale statistical multiplexing). Accommodating transient congestion (lasting less than a round-trip time). 4

Random Early Detection (RED) As queue builds up, randomly drop or mark packets with increasing probability (before queue gets full). Advantages: Lower average queuing delay. Avoids penalizing streams with large bursts. Desynchronizes co-existing flows. RED Algorithm for each packet arrival calculate the new average queue size q avg if min th < q avg < max th calculate probability p a with probability p a : mark/drop the arriving packet else if max th < q avg drop the arriving packet Variables: q avg : average queue size p a : packet marking or dropping probability Parameters: min th : minimum threshold for queue max th : maximum threshold for queue 5

RED Drop Probabilities Drop Probability 1 max p 0 min th max th Average Queue Size The argument for using the average queue size in AQM To be robust against transient bursts: When there is a transient burst, to drop just enough packets for end-to-end congestion control to come into play. To avoid biases against bursty low-bandwidth flows. To avoid unnecessary packet drops from the transient burst of a TCP connection slow-starting. 6

The problem with RED Parameter sensitivity How to set min th, max th and max p? Goal is to maintain mean queue size below the midpoint between min th and max th in times of normal congestion. max th needs to be significantly below the maximum queue size, because short-term transients peak well above the average. max p primarily determines the drop rate. Needs to be significantly higher than the drop rate rfequired to keep the flows under control. In reality it s hard to set the parameters robustly, even if you know what you re doing. RED Drop Probabilities (Gentle Mode) Drop Probability 1 max p 0 min th max th 2*max th Average Queue Size 7

Other AQM schemes. Adaptive RED (ARED) Proportional Integral (PI) Virtual Queue (VQ) Random Exponential Marking (REM) Dynamic-RED (DRED) Blue Many other variants... (a lot of PhDs in this area!) Explicit Congestion Notification 8

Explicit Congestion Notification (ECN) Standard TCP: Losses needed to detect congestion Wasteful and unnecessary ECN: Routers mark packets instead of dropping them. Receiver returns marks to sender in ACK packets. Sender adjusts it s window as it would have done if the packet had been dropped. Advantages: Bandwidth up to bottleneck not wasted. No delay imposed by retransmission. ECN: Backwards Compatibility When congestion experienced, a bit in the IP header indicates if both hosts implement ECN. If they do, router marks packet. If they don t, router drops packet. 9

Explicit Congestion Notification Codepoints +-----+-----+ ECN FIELD +-----+-----+ ECT CE The ECT and CE bits defined in RFC 2481. 0 0 Not-ECT 0 1 ECT(1) (used as an ECN nonce) 1 0 ECT(0) 1 1 CE The ECN Field in the IP Header. ECT: ECN-Capable Transport CE: Congestion Experienced. ECN and AQM ECN is only useful if the queue isn t full. Otherwise the router has to drop the packet whether it wants to or not. An active queue management scheme like RED is needed to set the ECN Congestion Experienced bit before the queue fills up. 10

Summary Multimedia traffic has tight delay constraints. Droptail queuing gives unnecessarily large queuing delays if good utiilization is needed. Packet loss as a signal of congestion hurts real-time traffic much more than it hurts file transfer. No time to retransmit. AQM combined with ECN can give low loss, low-ish delay, moderate jitter service. No admission control or charging needed. But no guarantees either - it s still best-effort. References S. Floyd and V. Jacobson, Random Early Detection gateways for Congestion Avoidance, IEEE/ACM Transactions on Networking, V.1 N.4, August 1993, p. 397-413. B. Braden et al, Recommendations on Queue Management and Congestion Avoidance in the Internet, April 1998, RFC 2309. S. Floyd, TCP and Explicit Congestion Notification, ACM Computer Communication Review, V. 24 N. 5, October 1994, p. 10-23. D. Wetherall, D. Ely, and N. Spring,Robust ECN Signaling with Nonces, RFC 3540, June 2003 11