Traffic shaping method and apparatus

Patent metadata

Field	Value
Publication number	US-12425345-B2
Application number	US-202318192063-A
Country	US
Kind code	B2
Filing date	Mar 29, 2023
Priority date	Sep 30, 2020
Publication date	Sep 23, 2025
Grant date	Sep 23, 2025

Abstract

A traffic shaping method and a traffic shaping apparatus are disclosed. The method includes: A packet marking apparatus receives a first packet; the packet marking apparatus determines an enqueuing queue of the first packet; and the packet marking apparatus marks a queue identifier of the first packet as a queue identifier of the enqueuing queue of the first packet, and then sends the queue identifier of the first packet to a packet output apparatus, where the packet output apparatus is configured to send, based on the queue identifier of the first packet, the first packet to a corresponding queue for outputting. Therefore, the packet output time after traffic shaping can be determined.

First claim

What is claimed is:

1. A traffic shaping method, comprising:
receiving, by a packet marking apparatus, a packet in a first flow among a plurality of flows;
determining, by the packet marking apparatus, an enqueuing queue of the packet;
marking, by the packet marking apparatus, a queue identifier of the packet as a queue identifier of the enqueuing queue of the packet; and
after marking the queue identifier of the packet, sending, by the packet marking apparatus, the queue identifier of the packet to a packet output apparatus, wherein the packet output apparatus is configured to use the received queue identifier of the packet to send the packet to a corresponding queue for outputting,
wherein the determining, by the packet marking apparatus, an enqueuing queue of the packet comprises:
determining, by the packet marking apparatus based on an arrival time of the packet, queues to which the packet can enqueue; and
determining, by the packet marking apparatus, the enqueuing queue of the packet from the determined queues to which the packet can enqueue, wherein the enqueuing queue is one queue in a group of gating queues, the group of gating queues comprise N queues, T is a duration in which each queue in the N queues is continuously enabled, and the N queues are cyclically enabled in a preset order,
wherein the determining, by the packet marking apparatus based on an arrival time of the packet, queues to which the packet can enqueue comprises:
calculating, by the packet marking apparatus based on the arrival time t 0 of the packet and t max , a latest moment t 1 =t 0 +t max at which the packet arrives at the packet output apparatus, and
calculating, by the packet marking apparatus based on the arrival time t 0 of the packet and t min , an earliest moment t 1′ =t 0 +t min at which the packet arrives at the packet output apparatus; and
determining, by the packet marking apparatus based on a first queue that is enabled at the latest moment t 1 and a second queue that is enabled at the earliest moment t 1′ , the queues to which the packet can enqueue,
wherein the determined queues to which the packet can enqueue are queues in the N queues other than the first queue and the second queue.

2. The method according to claim 1 , wherein the determining, by the packet marking apparatus based on a first queue that is enabled at the latest moment t 1 and a second queue that is enabled at the earliest moment t 1′ , the queues to which the packet can enqueue comprises:
when the first queue and the second queue are a same queue in the N queues, determining, by the packet marking apparatus, that the queues to which the packet can enqueue are N−1 queues in the N queues other than the first queue;
when the first queue and the second queue are two adjacent queues in the N queues, determining, by the packet marking apparatus, that the queues to which the packet can enqueue are N−2 queues in the N queues other than the first queue and the second queue; or
when there are J queues between the first queue and the second queue in the N queues, determining, by the packet marking apparatus, that the queues to which the packet can enqueue are N−J−2 queues in the N queues other than the first queue, the second queue, and the J queues between the first queue and the second queue.

3. The method according to claim 1 , wherein a total length of multiple packets, in each flow, that can be enqueued in each of the N queues is less than or equal to a threshold, or a total length of multiple packets, in each flow, that can be enqueued in each of the N queues is less than or equal to a sum of a threshold and a maximum packet length of the respective flow, wherein N is an integer greater than 1, and
wherein the determining, by the packet marking apparatus, the enqueuing queue of the packet from the queues to which the packet can enqueue comprises:
determining, by the packet marking apparatus, that a total length B add of unqueued packets of the first flow in the queues to which the packet can enqueue is less than a maximum buffer size of the first flow in the queues to which the packet can enqueue, wherein the packet belongs to the first flow; or determining, by the packet marking apparatus, that a sum of B add and the packet is less than or equal to the maximum buffer size; and
determining, by the packet marking apparatus based on B add and the threshold, the enqueuing queue of the packet from the queues to which the packet can enqueue.

4. The method according to claim 3 , wherein the determining, by the packet marking apparatus based on B add and the threshold, the enqueuing queue of the packet from the queues to which the packet can enqueue comprises:
when B add is greater than or equal to M−1 times the threshold and less than M times the threshold, determining, by the packet marking apparatus, that the enqueuing queue of the packet is an M th queue following the first queue in the queues to which the packet can enqueue, wherein M is a positive integer greater than or equal to 1.

5. The method according to claim 3 , wherein the determining, by the packet marking apparatus based on B add and the threshold, the enqueuing queue of the packet from the queues to which the packet can enqueue comprises:
when a total length of multiple packets that are of the first flow and that are currently enqueued in a 1 st queue following the first queue is less than the threshold, determining, by the packet marking apparatus, that the enqueuing queue of the packet is the 1 st queue following the first queue; or
when a total length of multiple packets that are of the first flow and that are currently enqueued in a 1 st queue following the first queue is greater than or equal to the threshold, determining, by the packet marking apparatus, that the enqueuing queue of the packet is a K th queue following the first queue in the queues to which the packet can enqueue, wherein K is a positive integer greater than or equal to 2, and a total length of currently enqueued packets in the K th queue is less than the threshold.

6. The method according to claim 5 , wherein the determining, by the packet marking apparatus, that the enqueuing queue of the packet is a K th queue following the first queue in the queues to which the packet can enqueue comprises:
starting from a 2 nd queue following the first queue, determining, by the packet marking apparatus from the queues to which the packet can enqueue, a 1 st queue in which the total length of currently enqueued packets of the first flow is less than the threshold; and determining, as the K th queue, the 1 st queue in which the total length of the currently enqueued packets of the first flow is less than the threshold.

7. The method according to claim 3 , wherein the determining, by the packet marking apparatus based on B add and the threshold, the enqueuing queue of the packet from the queues to which the packet can enqueue comprises:
when a sum of a total length of multiple packets that are of the first flow and that are currently enqueued in a 1 st queue following the first queue and a length of the packet is less than or equal to the threshold, determining, by the packet marking apparatus, that the enqueuing queue of the packet is the 1 st queue following the first queue; or
when a sum of a total length of multiple packets that are of the first flow and that are currently enqueued in a 1 st queue following the first queue and a length of the packet is greater than the threshold, determining, by the packet marking apparatus, that the enqueuing queue of the packet is a K th queue following the first queue in the queues to which the packet can enqueue, wherein K is a positive integer greater than or equal to 2, and a sum of a total length of currently enqu

Assignees

• Huawei Tech Co Ltd

Inventors

• Meng Rui
• Ren Shoushou
• Wang Chuang

Classifications

• H04L47/621

  Individual queue per connection or flow, e.g. per VC · CPC title

• H04L47/30

  in combination with information about buffer occupancy at either end or at transit nodes · CPC title

• H04L47/2483 Primary

  involving identification of individual flows · CPC title

• H04L47/283

  in response to processing delays, e.g. caused by jitter or round trip time [RTT] · CPC title

• H04L47/22 Primary

  Traffic shaping · CPC title