Slide title In CAPITALS 50 pt Slide subtitle 32 pt Active Queue Management for LTE uplink in eNodeB Yifeng Tan Supervisor: Professor Riku Jäntti Instructor:

Slides:



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

Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
Lecturer: Namratha Vedire
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Ericsson satsning på Public Safety - National Security HIØ Personalseminar – 9. mai 06 - Ed.
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 ATP: A Reliable Transport Protocol for Ad-hoc Networks Sundaresan, Anantharam, Hseih, Sivakumar.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
17/10/2003TCP performance over ad-hoc mobile networks. 1 LCCN – summer 2003 Uri Silbershtein Roi Dayagi Nir Hasson.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
TCP. Learning objectives Reliable Transport in TCP TCP flow and Congestion Control.
TCP Congestion Control
Junxian Huang 1 Feng Qian 2 Yihua Guo 1 Yuanyuan Zhou 1 Qiang Xu 1 Z. Morley Mao 1 Subhabrata Sen 2 Oliver Spatscheck 2 1 University of Michigan 2 AT&T.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
Link-Level Flow and Error Control
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
HUAWEI TECHNOLOGIES CO., LTD. Huawei Confidential Security Level: Slide title :40-47pt Slide subtitle :26-30pt Color::white Corporate Font : FrutigerNext.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (
COMT 4291 Communications Protocols and TCP/IP COMT 429.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt HANDOVER Overview.
1 Chapter 16 Protocols and Protocol Layering. 2 Protocol  Agreement about communication  Specifies  Format of messages (syntax)  Meaning of messages.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
1 WAP Downlink Performance Evaluation in UMTS Network / / Pertti Hakkarainen HELSINKI UNIVERSITY OF TECHNOLOGY WAP Downlink Performance Evaluation.
Copyright 2002, S.D. Personick. All Rights Reserved.1 Telecommunications Networking II Topic 20 Transmission Control Protocol (TCP) Ref: Tanenbaum pp:
Link Scheduling & Queuing COS 461: Computer Networks
The Transmission Control Protocol (TCP) Application Services (Telnet, FTP, , WWW) Reliable Stream Transport (TCP) Connectionless Packet Delivery.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt POWER CONTROL UMTS Seminar.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Dynamic and Persistent Scheduling for Voice over IP Traffic in the Long-Term Evolution Uplink Master’s.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
Copyright © Lopamudra Roychoudhuri
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
Explicit Congestion Notification (ECN) RFC 3168
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Transport Layer: Sliding Window Reliability
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Capacity Management in WCDMA.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Peer-to-Peer Networks 13 Internet – The Underlay Network
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.
Computer Networking Lecture 16 – Reliable Transport.
1 COMP 431 Internet Services & Protocols The Transport Layer Pipelined Transport Protocols Jasleen Kaur March 29, 2016.
Slide title In CAPITALS 50 pt Slide subtitle 32 pt Multi-component KPI:s ETSI/STQ_Mobile(08)18TD10.
Streaming Video over TCP with Receiver-based Delay Control
Data Link Layer Flow Control.
Sliding Window Protocol | Go-Back-N
Topics discussed in this section:
Approaches towards congestion control
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
PUSH Flag A notification from the sender to the receiver to pass all the data the receiver has to the receiving application. Some implementations of TCP.
Advanced Computer Networks
TCP Congestion Control
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Radio Link Layer tuning in HSPA Evolution Laura Kneckt Supervisor : Professor Jyri Hämäläinen Instructor: M. Sc. Stefan Wager.
Lecture 6, Computer Networks (198:552)
Presentation transcript:

Slide title In CAPITALS 50 pt Slide subtitle 32 pt Active Queue Management for LTE uplink in eNodeB Yifeng Tan Supervisor: Professor Riku Jäntti Instructor: D.Sc. Riikka Susitaival

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Long-Term Evolution (LTE)  Evolved 3G Radio Access Network  Provides high data rate –Downlink: up to 300 Mbps –Uplink: 50 Mbps  ”Mobile Internet” –TCP/IP over wireless R99Rel4Rel5Rel6 4 Rel7Rel8 WCDMAHSDPAHSPAHSPA evolution LTE

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential TCP basics  One of the core protocols of the Internet  Provides reliable transmission –Automatic Repeat reQuest (ARQ): Receiver sends ACKs to indicate the reception of segments.  TCP sender’s window: How many packets are ”in flight” –Ideally: Sender’s window = Pipe Capacity (Bandwidth ∙ RTT) –Smaller: under-utilization of the link –Bigger: queuing of packets. When queue exceeds buffer limit, some packets have to be discard → congestion

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential TCP Congestion Control  TCP sender tries to ”probe” optimal send-window –ACK received →Increase send-window ”More bandwidth available” –Packet loss → Decrease send-window ”Light congestion” –Time-outs → Start probing from scratch ”Serious congestion”

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential TCP Congestion Control example

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Queue Management  Passive Queue Management –Drop packets when the buffer is full –We can only decide ”which” but not ”when” –Drop-tail, drop-front, random-drop –PQM may cause some problems  Significant end-to-end delay  Unfair sharing  Viscous web browsing  Active Queue Management –Drop packets even there is space –We can decide both ”which” and ”when”

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Advantages of AQM  Maintains lower average queue size as well as end-to- end delay than PQM –Important when e.g. Web browsing  Prevents lock-out –Avoid the situation where one or a few TCP flows dominate the link  Reduce the number of packet drops –There is enough space to accommodate the packets in burst

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Data transmission in LTE uplink  Buffer Status Report (BSR): created by UE and sent to eNodeB to indicate the queue size in UE’s buffer UE BSR Data

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Example: PDCP discard  Specified in 3GPP TS V8.2.1 for each outgoing packet (PDCP SDU) if (delay > delayThreshold ) discard packet else transmit packet  Suffer throughput degradation UE BSR Data PDCP discard

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Transmitter-AQM Algorithm for each outgoing packet if(size <= lowerDropThreshold) transmit packet else if (delay > minAgeThreshold AND (now-previousDropTime > minInterDropTime)) OR (delay >maxAgeThreshold)) discard packet previousDropTime=now else transmit packet UE channel RLC eNodeB Drop triggered? No Yes PDCP PDUs RLC SDU RLC PDU  Improve the throughput of PDCP discard  Maintains congestion window bigger than PC –> minAgeThreshold  Prevent from consecutive packet drops -> minInterDropTime  Prevent from drop when queue size is small -> lowerDropThreshold  Drain buffer fast -> maxAgeThreshold

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Implement in eNodeB?  Why? –Transmitter-AQM was suggested to be standardized but not accepted –UE with or without AQM may have quite different performance –We may control the UE buffer from eNodeB by Receiver-AQM so that all the UEs can have improved throughputs  We need to know – queue size (BSR) – packet delay -> How? UE BSR Data R-AQM

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential A method to estimate queuing delay  The method estimate the delay of headmost data in a queue  some assumptions 1.We can monitor the queue length (Q i ) discontinuously with small time intervals 2.The amount of data left the queue in each time interval is known (L i ) 3.The length of time interval is known (∆t i )  The amount of new incoming data (R i ) in each time interval can be calculated by R i = Q i + L i – Q i-1

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Waiting time Queue size ∆t 1 /2 0Q1 Time t0 0 Time t1 Time t2 Q1 + R2R2 ∆t 1 /4+∆t 2 ∆t2∆t2 Q2 ∆t 1 /2+∆t 2 At the beginning...

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Waiting time Queue size 0 0 RnRn ∆tn∆tn ∙∙∙∙∙∙ At Time tn Q n-1 + R s QnQn

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential How to implement in eNodeB  Queue length (Q i ) -> BSR  ∆t i -> time interval of receiving BSRs  Leaving data (L i ) -> the data delivered to higher layer in eNodeB during each ∆t i

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Estimated delay vs. Real delay

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Receiver-AQM Algorithm for each outgoing packet if(BsrSize <= lowerDropThreshold) transmit packet else if (estimatedDelay > minAgeThreshold AND (now - previousDropTime> minInterDropTime)) discard packet previousDropTime=now else transmit packet Drop triggered? RLC UE eNodeB PDCP PDUs RLC SDU No Yes channel UE BSR Data R-AQM  Drop packets in eNodeB  The algorithm is similar to T-AQM –Queue size reported by BSR -> real queue size –Estimated delay -> real delay

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Performance comparison with one TCP flow

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Performance comparison with multiple TCP flows

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Performance if both AQM implemented (Bandwidth = 3 Mbps)

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential Some conclusions  Using AQM can efficiently reduce the end-to-end delay in LTE uplink.  PDCP discard may cause considerable throughput reduction in some situations.  R-AQM and T-AQM can maintain small delay as well as high throughput in most situations.  R-AQM is a good option to enhance the performance of UE from network side, no matter if the UE has implemented any AQM itself.

Top right corner for field-mark, customer or partner logotypes. See Best practice for example. Slide title 40 pt Slide subtitle 24 pt Text 24 pt Bullets level pt Ericsson Confidential