AQM Description (2008-07-30)

RAN
Active Queue Management
Issue 02
Date 2008-07-30
Huawei Proprietary and Confidential

Copyright © Huawei Technologies Co., Ltd
Huawei Technologies Co., Ltd. provides customers with comprehensive technical support and service. For
any assistance, please contact our local office or company headquarters.
Huawei Technologies Co., Ltd.

Address: Huawei Industrial Base
Bantian, Longgang
Shenzhen 518129
People's Republic of China
Website: http://www.huawei.com
Email: support@huawei.com
Copyright © Huawei Technologies Co., Ltd. 2008. All rights reserved.

No part of this document may be reproduced or transmitted in any form or by any means without prior
written consent of Huawei Technologies Co., Ltd.
Trademarks and Permissions
and other Huawei trademarks are trademarks of Huawei Technologies Co., Ltd.
All other trademarks and trade names mentioned in this document are the property of their respective
holders.
Notice
The information in this document is subject to change without notice. Every effort has been made in the
preparation of this document to ensure accuracy of the contents, but all statements, information, and
recommendations in this document do not constitute the warranty of any kind, express or implied.
Huawei Proprietary and Confidential

RAN
Active Queue Management Contents
Contents
1 AQM Change History ...............................................................................................................1-1

2 AQM Introduction .....................................................................................................................2-1
3 AQM Algorithms .......................................................................................................................3-1
3.1 Buffer Usage Monitoring ..............................................................................................................................3-1
3.2 Packet Discarding..........................................................................................................................................3-2
4 AQM Parameters ........................................................................................................................4-1

5 Reference Documents ...............................................................................................................5-1
Issue 02 (2008-07-30) Huawei Proprietary and Confidential iii

RAN
Active Queue Management 1 AQM Change History
1 AQM Change History
AQM (Active Queue Management) Change History provides information on the changes
between different document versions.
Document and Product Versions
Table 1-1 Document and product versions

Document Version RAN Version RNC Version NodeB Version
02 (2008-07-30) 10.0 V200R010C01B061 V100R010C01B050
V200R010C01B041
01 (2008-05-30) 10.0 V200R010C01B051 V100R010C01B049
V200R010C01B040
Draft (2008-03-20) 10.0 V200R010C01B050 V100R010C01B045
There are two types of changes, which are defined as follows:

z Feature change: refers to the change in the AQM feature of a specific product version.
z Editorial change: refers to the change in the information that was inappropriately
described or the addition of the information that was not described in the earlier version.
02 (2008-07-30)
This is the document for the second commercial release of RAN10.0.
Compared with 01 (2008-05-30) of RAN10.0, issue 02 (2008-07-30) of RAN10.0
incorporates the changes described in the following table.
Change Type Change Description Parameter Change
Feature change The switch of AQM algorithms is added. For None

detail, see 3 AQM Algorithms.
Editorial The APDC algorithm flow chart is optimized. None.
change See Figure 3-1.
Issue 02 (2008-07-30) Huawei Proprietary and Confidential 1-1

RAN
1 AQM Change History Active Queue Management
01 (2008-05-30)
This is the document for the first commercial release of RAN10.0.
Compared with draft (2008-03-20) of RAN10.0, issue 01 (2008-05-30) of RAN10.0
incorporates the changes described in the following table.
Change Type Change Description Parameter Change

Feature change None. The parameters that are
changed to be
non-configurable are listed as
follows:
z PDCP Buffer Occupying
Threshold
z Ratio for TARth and
MINth
z Ratio for MAXth and
MINth
z Initial Packet Discard
Interval
z Lower Bound for Packet
Discard Interval
z Upper Bound for Packet
Discard Interval
z Refreshing Frequency of
Value N
z Filtering Coefficient for
Queue Length
Editorial General documentation change: None.
change z The AQM Parameters is removed
because of the creation of RAN10.0
parameter Reference.
z The structure is optimized.
Draft (2008-03-20)
This is the draft of the document for first commercial release of RAN10.0.
1-2 Huawei Proprietary and Confidential Issue 02 (2008-07-30)

RAN
Active Queue Management 2 AQM Introduction
2 AQM Introduction
Active Queue Management (AQM) is a mechanism in which active detection and active
packet discard are applied to increase the buffer usage and avoid congestion.
The main purpose of AQM is to improve the method of using the buffer, reduce the delay in
buffering the interactive service data, enhance the equity between data streams, and increase
the link usage.
Currently, most communications system uses the TCP protocol to guarantee the reliability of
data services. When TCP is applied on the WCDMA network, one radio bearer (RB) can use
multiple TCP connections and data packets may wait in the buffered queue, which leads to a
high queuing delay. The possible problems are as follows:
z When a queue is long, the round trip time (RTT) of the synchronization packet of a new
connection is also long, whereas the initial value of the retransmission timeout (RTO)
timer is relatively small. Therefore, the RTT may be longer than the RTO time, that is,
the RTO timer for requesting the setup of the new connection may expire.
z When a queue is long and a dominant stream is existent, web packets are delayed greatly
and, accordingly, the user experience in browsing web pages is degraded greatly. In
addition, the user may frequently close a page from which a download is incomplete yet
and switch to another. For a bottleneck link with low bandwidth, however, it may take a
long time to clear the data on the closed page. The situation even deteriorates if the
queue is very long.
z When there are multiple data streams, the ones of higher priorities occupy most of the
buffer. In this case, it is difficult for other streams to occupy the required bandwidth, and
as a result their data packets are likely to be discarded due to buffer overflow.
z When consecutive packet losses occur due to buffer overflow, multiple TCP streams
cannot be started immediately. It takes a long time to increase the data rate. The link
cannot be fully used.
To reduce the impacts of these problems, AQM is introduced to implement active packet
discards based on buffer size and packet interval.
Impact
z Impact on System Performance
None.
z Impact on Other Features
None.
z Miscellaneous

RAN
2 AQM Introduction Active Queue Management
− The AQM algorithm applies to data transmission in the downlink rather than the
uplink. Therefore, it does not need the support from other NEs.
− The AQM algorithm must be implemented before the PDCP header compression
algorithm.
− The AQM algorithm discards a packet regardless of the packet type. Therefore, it
may discard the handshake packet used in the setup of a TCP link, which may lead to
a failure in the setup.
Network Elements Involved

Table 2-1 lists the NEs involved in AQM.
Table 2-1 NEs involved in AQM
UE NodeB RNC MSC Server MGW SGSN GGSN HLR
– – √ – – – – –
Note:
z –: not involved
z √: involved
UE = User Equipment, RNC = Radio Network Controller, MSC Server = Mobile Service Switching
Center Server, MGW = Media Gateway, SGSN = Serving GPRS Support Node, GGSN = Gateway GPRS
Support Node, HLR = Home Location Register

RAN
Active Queue Management 3 AQM Algorithms
3 AQM Algorithms
The AQM algorithm is implemented through buffer usage monitoring and packet discarding.
When the AQM algorithm detects that the buffer usage exceeds a preset threshold, it uses a
packet discard scheme to avoid congestion and buffer overflow.
z The current WCDMA network supports the DCH and HSPA bearers. The current AQM algorithm
works only on the R99 DL DCH.
z The maximum rate on the DCH is 384 kbit/s. The telecom operator can decide whether to use AQM.
z The AQM algorithm applies to only the best effort (BE) service because TCP connections are carried
on the BE radio bearers.
z The switch of AQM algorithms can be set by Channel Class Algorithm Switch parameter through
SET CORRMALGOSWITCH command.
3.1 Buffer Usage Monitoring

The buffer usage mentioned in this document refers to the total buffer usage of RNC PDCP
and RLC. During data transmission in the downlink, the PDCP continually receives data from
the upper layer while the RLC continually sends the buffered data to the MAC layer. As a
result, the buffer usage changes continually.
To eliminate the change, the buffer usage monitoring algorithm uses the following α filtering
mechanism:
Fn = (1 -α) Fn-1 +α Mn
− α = 1 / 2(k/2)
− Mn = instantaneous buffer usage measured this time
− Fn-1 = buffer usage filtered last time
− Fn = buffer usage filtered this time
For different buffer usages, the algorithm uses different methods, as introduced below:
z If the buffer usage is low, the algorithm discards packets at a low frequency or does not
discard any packet at all.
z If the buffer usage is high, the algorithm discards packets at a high frequency to reduce
the sending rate and avoid buffer overflow and congestion.

RAN
3 AQM Algorithms Active Queue Management
z In the case of congestion or buffer overflow, the algorithm discards packets at a high
frequency.
3.2 Packet Discarding

When the buffer usage exceeds the threshold, the AQM algorithm discards packets in a
controlled manner and dynamically adjusts the discard interval based on the buffer usage.
Such an algorithm is called Adaptive Packet Discard Counter (APDC) algorithm.
If the discard interval is N, then one packet is discarded every N packets.
The APDC algorithm has the following three buffer usage thresholds:
z Congestion threshold for PDCP buffer occupancy: indicates the buffer usage at the
moment the link is congested. If the buffer usage is higher than or equal to this threshold,
the algorithm discards packets in a controlled manner to relieve the congestion.
z Target threshold: indicates the buffer usage in the case of severe congestion. If the buffer
usage is higher than or equal to this threshold, the algorithm discards packets at a higher
frequency than before.
z The maximum threshold indicates the maximum buffer usage. If the buffer usage is
higher than or equal to this threshold, the algorithm discards the subsequent packets.
Congestion threshold for PDCP buffer occupancy < target threshold < maximum threshold.
The setting of these thresholds should be based on the RB rates.
Every time a packet arrives, the algorithm takes a discard policy based on the area into which
the buffer usage falls:
z Area 1: buffer usage < congestion threshold for PDCP buffer occupancy
The link is not congested, and therefore there is no need to discard any packet.
z Area 2: congestion threshold for PDCP buffer occupancy ≤ buffer usage < target
threshold
− The link is congested. The algorithm discards packets to relieve the congestion.
− One packet is discarded every N packets.
− If the buffer usage enters area 3 from area 4, the algorithm increases the discard
interval.
− If the buffer usage enters area 3 from area 1 or 2, the algorithm keeps the current
discard interval.
z Area 3: Target threshold ≤ buffer usage < maximum threshold
This link is congested seriously. The algorithm decreases the discard interval gradually to
relieve the congestion.
One packet is discarded every N packets.
z Area 4: buffer usage ≥ maximum threshold
The link is congested seriously. The algorithm discards subsequent packets until the
buffer usage is lower than the maximum threshold.
The discard interface has an upper limit and a lower limit. When N_INC_FLAG is set to
TRUE, the discard interval can be increased. When it is set to FALSE, the discard interval
cannot be increased.
Figure 3-1 shows the APDC algorithm.

RAN
Active Queue Management 3 AQM Algorithms
Figure 3-1 APDC algorithm
The variables used by the algorithm are described as follows:

z MINth: congestion threshold for PDCP buffer occupancy
z MAXth: maximum threshold
z TARth: target threshold, that is, target queue length threshold
z N: discard interval, indicating that one packet is discarded every N
packetsN_LOWER_BOUND ≤ N ≤ N_UPPER_BOUND
z N_LOWER_BOUND: minimum discard interval, that is, the lower bound of packet
discard interval

RAN
3 AQM Algorithms Active Queue Management
z N_UPPER_BOUND: maximum discard interval, that is, the upper bound of packet
discard interval
z N_INC_FLAG: boolean variable, indicating whether the discard interval (N) can be
increased
z N_INIT: the initial value of packet discard interval, indicating that one packet is
discarded every N_INIT packets
z PKT_SIZE: packet size
z Q_SIZE_LAST: buffer size before a new packet arrives
z C1: discard interval counter 1;
z C2: discard interval counter 2;
z M: update frequency of the discard interval.

RAN
Active Queue Management 4 AQM Parameters
4 AQM Parameters
None.

RAN
Active Queue Management 5 Reference Documents
5 Reference Documents
None.


AQM Description (2008-07-30)

Uploaded by

Copyright:

Available Formats

You might also like

AQM Description (2008-07-30)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AQM Description (2008-07-30)

Uploaded by

Copyright:

Available Formats

RAN

Active Queue Management

Huawei Proprietary and Confidential

Huawei Technologies Co., Ltd.

Copyright © Huawei Technologies Co., Ltd. 2008. All rights reserved.

Trademarks and Permissions

Huawei Proprietary and Confidential

1 AQM Change History ...............................................................................................................1-1

4 AQM Parameters ........................................................................................................................4-1

Issue 02 (2008-07-30) Huawei Proprietary and Confidential iii

1 AQM Change History

Document and Product Versions

Table 1-1 Document and product versions

There are two types of changes, which are defined as follows:

Change Type Change Description Parameter Change

Feature change The switch of AQM algorithms is added. For None

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 1-1

Change Type Change Description Parameter Change

1-2 Huawei Proprietary and Confidential Issue 02 (2008-07-30)

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 2-1

Network Elements Involved

Table 2-1 NEs involved in AQM

UE NodeB RNC MSC Server MGW SGSN GGSN HLR

2-2 Huawei Proprietary and Confidential Issue 02 (2008-07-30)

3.1 Buffer Usage Monitoring

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 3-1

3.2 Packet Discarding

If the discard interval is N, then one packet is discarded every N packets.

3-2 Huawei Proprietary and Confidential Issue 02 (2008-07-30)

Figure 3-1 APDC algorithm

The variables used by the algorithm are described as follows:

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 3-3

3-4 Huawei Proprietary and Confidential Issue 02 (2008-07-30)

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 4-1

Issue 02 (2008-07-30) Huawei Proprietary and Confidential 5-1

You might also like