No relevant resource is found in the selected language.

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies. Read our privacy policy>Search

Reminder

To have a better experience, please upgrade your IE browser.

upgrade

S12700 V200R012C00 Configuration Guide - QoS

This document describes the configurations of QoS functions, including MQC, priority mapping, traffic policing, traffic shaping, interface-based rate limiting, congestion avoidance, congestion management, packet filtering, redirection, traffic statistics, ACL-based simplified traffic policy, and HQoS.
Rate and give feedback :
Huawei uses machine translation combined with human proofreading to translate this document to different languages in order to help you better understand the content of this document. Note: Even the most advanced machine translation cannot match the quality of professional translators. Huawei shall not bear any responsibility for translation accuracy and it is recommended that you refer to the English document (a link for which has been provided).
Overview of Congestion Avoidance and Congestion Management

Overview of Congestion Avoidance and Congestion Management

Congestion avoidance prevents a network from being overloaded using a packet discarding policy. Congestion management ensures that high-priority services are preferentially processed based on the specified packet scheduling sequence.

On a traditional network, quality of service (QoS) is affected by network congestion. Congestion means the low data forwarding rate and delay resulting from insufficient network resources. Congestion results in delay of packet transmission, low throughput rate, and high resource consumption. Congestion frequently occurs in a complex networking environment where packet transmission and provision of various services are both required.

Congestion avoidance and congestion management are two flow control mechanisms for resolving congestion on a network.

Congestion Avoidance

Congestion avoidance is a flow control mechanism. A system configured with congestion avoidance monitors network resources such as queues and memory buffers. When congestion occurs or aggravates, the system discards packets.

The device supports the following congestion avoidance features:

  • Tail drop

    Tail drop is the traditional congestion avoidance mechanism that processes all packets equally without classifying the packets into different types. When congestion occurs, packets at the end of a queue are discarded until the congestion problem is solved.

    Tail drop causes global Transmission Control Protocol (TCP) synchronization. In tail drop mechanism, all newly arrived packets are dropped when congestion occurs, causing all TCP sessions to simultaneously enter the slow start state and the packet transmission to slow down. Then all TCP sessions restart their transmission at roughly the same time and congestion occurs again, causing another burst of packet drops, and all TCP sessions enter the slow start state again. The behavior cycles constantly, severely reducing the network resource usage.

    By default, an interface uses tail drop.

  • WRED

    Weighted Random Early Detection (WRED) randomly discards packets based on drop parameters. WRED defines different drop policies for packets of different services. WRED discards packets based on packet priorities, so the drop probability of packets with higher priorities is low. In addition, WRED randomly discards packets so that rates of TCP connections are reduced at different times. This prevents global TCP synchronization.

    WRED defines upper and lower thresholds for the length of each queue. The packet drop policy is as follows:

    • When the length of a queue is shorter than the lower threshold, no packet is discarded.

    • When the length of a queue exceeds the upper threshold, all received packets are discarded.

    • When the length of a queue ranges from the lower threshold to the upper threshold, incoming packets are discarded randomly. Random Early Detection (RED) generates a random number for each incoming packet and compares it with the drop probability of the current queue. If the random number is smaller than the drop probability, the packet is discarded. A longer queue indicates a higher drop probability.

Congestion Management

When a network is congested intermittently and delay-sensitive services require higher bandwidth than other services, congestion management adjusts the scheduling order of packets.

The device supports the following congestion management features:
  • PQ scheduling

    Priority queuing (PQ) schedules packets in descending order of priority. Packets in queues with a low priority can be scheduled only after all packets in queues with a high priority have been scheduled.

    By using PQ scheduling, the device puts packets of delay-sensitive services into queues with higher priorities and packets of other services into queues with lower priorities so that packets of delay-sensitive services are preferentially scheduled.

    The disadvantage of PQ scheduling is that the packets in lower-priority queues are not processed until all the higher-priority queues are empty. As a result, a congested higher-priority queue causes all lower-priority queues to starve out.

  • WRR scheduling

    Weighted Round Robin (WRR) ensures that packets in all the queues are scheduled in turn.

    For example, eight queues are configured on an interface. Each queue is configured with a weight, namely, w7, w6, w5, w4, w3, w2, w1, and w0. The weight value represents the percentage of resources that a queue can obtain. This example assumes that the weights of queues on a 100M interface are 50, 50, 30, 30, 10, 10, 10, and 10, which correspond to w7, w6, w5, w4, w3, w2, w1, and w0 respectively. The queue with the lowest priority can obtain at least 5 Mbit/s bandwidth. This ensures that packets in all the queues can be scheduled.

    In addition, WRR can dynamically change the time of scheduling packets in queues. For example, if a queue is empty, WRR ignores this queue and starts to schedule the next queue. This ensures efficient use of bandwidth.

    WRR scheduling has two disadvantages:

    • WRR schedules packets based on the number of packets, whereas users concern the bandwidth. When the average packet length in each queue is the same or known, users can obtain the required bandwidth by setting WRR weight values. When the average packet length in each queue is variable, users cannot obtain the required bandwidth by setting WRR weight values.

    • Delay-sensitive services, such as voice services, cannot be scheduled in a timely manner.

    NOTE:

    X series cards do not support WRR.

  • WDRR scheduling

    Weighted Deficit Round Robin (WDRR) implementation is similar to WRR implementation.

    The difference between WDRR and WRR is as follows: WRR schedules packets based on the number of packets, whereas WDRR schedules packets based on the packet length. If the packet length is too long, WDRR allows a negative weight value so that long packets can be scheduled. In the next round, the queue with the negative weight value is not scheduled until its weight value becomes positive.

    WDRR offsets the disadvantages of PQ scheduling and WRR scheduling. That is, in PQ scheduling, packets in queues with lower priorities cannot be scheduled for a long time if congestion occurs; in WRR scheduling, bandwidth is allocated improperly when the packet length of each queue is different or variable.

    WDRR cannot schedule delay-sensitive services such as voice services in a timely manner.

    When all the queues participating in WDRR scheduling have the same weights, the result of WDRR scheduling is the same as that of DRR scheduling.

  • WFQ scheduling

    Fair Queuing (FQ) ensures that network resources are allocated evenly to optimize the delay and jitter of all flows. Weighted FQ (WFQ) schedules packets based on priorities, and schedules more packets with higher priorities than packets with lower priorities.

    WFQ can automatically classify flows based on the session information, including the protocol type, source and destination TCP or UDP port numbers, source and destination IP addresses, and precedence in the ToS field. In addition, WFQ provides a large number of queues and evenly puts flows into queues to smooth out the delay. When flows leave queues, WFQ allocates the bandwidth on the outbound interface for each flow based on the precedence of each flow. Flows with the lowest priorities obtain the least bandwidth.

  • PQ+WRR/PQ+WDRR/PQ+WFQ scheduling

    PQ, WRR, WDRR, and WFQ have their own advantages and disadvantages. If only PQ scheduling is used, packets in the queues with a low priority may not obtain bandwidth for a long time. If only WRR, WDRR, or WFQ scheduling is used, delay-sensitive services, such as voice services, cannot be scheduled in a timely manner. PQ+WRR, PQ+WDRR, or PQ+WFQ scheduling integrates the advantages of PQ scheduling and WRR, WDRR, or WFQ scheduling and can avoid their disadvantages.

    By using PQ+WRR, PQ+WDRR, or PQ+WFQ scheduling, the device puts important packets such as protocol packets and packets of delay-sensitive services to the queue using PQ scheduling, and allocates bandwidth to the queue. Then, the device can put other packets into the queues using WRR, WDRR, or WFQ scheduling based on the packet priority. Packets in queues using WRR, WDRR, or WFQ scheduling can be scheduled based on weight values in turn.
    NOTE:

    X series cards do not support PQ+WRR.

Translation
Download
Updated: 2019-01-18

Document ID: EDOC1100038410

Views: 17618

Downloads: 24

Average rating:
This Document Applies to these Products
Related Documents
Related Version
Share
Previous Next