公开(公告)号：US20210218688A1

公开(公告)日：2021-07-15

申请号：US17216094

申请日：2021-03-29

Applicant: Huawei Technologies Co., Ltd.

Inventor： Xiaozhong Wang ,  Wan Lam ,  Guang Li ,  Sai Yuan

IPC: H04L12/801 ,  H04L12/851 ,  H04L12/911 ,  H04L12/803 ,  H04L12/741

Abstract: A method for load balancing and packet re-sequencing on a network includes an ingress node that determines an identifier of a destination chip based on a destination address of a packet flow and a forwarding table, allocates, based on the identifier of the destination chip, a channel identifier and a sequence number of each packet that is in the packet flow and that enters a channel, to generate an updated packet flow, where each packet in the updated packet flow includes a packet in a corresponding packet flow, a sequence number of the packet, and the channel identifier, and the updated packet flow is sent in a per-packet load sharing manner.

公开(公告)号：US20230164078A1

公开(公告)日：2023-05-25

申请号：US18157690

申请日：2023-01-20

Applicant: Huawei Technologies Co., Ltd.

Inventor： Guang Li ,  Xiaozhong Wang ,  Sai Yuan ,  Yu Bai ,  Wenwu Zhang

IPC: H04L47/12 ,  H04L47/10 ,  H04L47/2425 ,  H04L47/26

CPC classification number: H04L47/12 ,  H04L47/29 ,  H04L47/2433 ,  H04L47/26

Abstract: A congestion control method and apparatus is disclosed. The method includes, when usage information of a buffer in a device satisfies a preset first condition, determining at least one first queue from the buffer, and performing congestion control on the at least one first queue, where the first condition includes a first threshold corresponding to the usage information of the buffer, and the at least one first queue is a queue whose queue delay is greater than or equal to a queue delay threshold or whose queue length is greater than or equal to a queue length threshold in a plurality of queues in the buffer. In this way, the device triggers a condition of congestion control based on a buffer status.

公开(公告)号：US20210392092A1

公开(公告)日：2021-12-16

申请号：US17408057

申请日：2021-08-20

Applicant: Huawei Technologies Co., Ltd.

Inventor： Sai Yuan ,  Xiaozhong Wang ,  Guang Li ,  Yu Bai

IPC: H04L12/861

Abstract: A memory management method includes: determining that available storage space of a first memory in a network device is less than a first threshold, where the first threshold is greater than 0 and the first memory stores a first packet queue; and deleting at least one packet at the tail of the first packet queue from the first memory based on the available storage space of the first memory being less than the first threshold. When the available storage space of the first memory is less than the first threshold, a packet queue, namely, the first packet queue, is selected and a packet at the tail of the packet queue is deleted from the first memory.

公开(公告)号：US11736407B2

公开(公告)日：2023-08-22

申请号：US17216094

申请日：2021-03-29

Applicant: Huawei Technologies Co., Ltd.

Inventor： Xiaozhong Wang ,  Wan Lam ,  Guang Li ,  Sai Yuan

IPC: H04L12/801 ,  H04L47/34 ,  H04L45/745 ,  H04L47/125 ,  H04L47/2483 ,  H04L47/70 ,  H04L12/851

CPC classification number: H04L47/34 ,  H04L45/745 ,  H04L47/125 ,  H04L47/2483 ,  H04L47/82

Abstract: A method for load balancing and packet re-sequencing on a network includes an ingress node that determines an identifier of a destination chip based on a destination address of a packet flow and a forwarding table, allocates, based on the identifier of the destination chip, a channel identifier and a sequence number of each packet that is in the packet flow and that enters a channel, to generate an updated packet flow, where each packet in the updated packet flow includes a packet in a corresponding packet flow, a sequence number of the packet, and the channel identifier, and the updated packet flow is sent in a per-packet load sharing manner.

公开(公告)号：US11695710B2

公开(公告)日：2023-07-04

申请号：US17408057

申请日：2021-08-20

Applicant: Huawei Technologies Co., Ltd.

Inventor： Sai Yuan ,  Xiaozhong Wang ,  Guang Li ,  Yu Bai

IPC: H04L12/861 ,  H04L49/90

CPC classification number: H04L49/9084

Abstract: A memory management method includes: determining that available storage space of a first memory in a network device is less than a first threshold, where the first threshold is greater than 0 and the first memory stores a first packet queue; and deleting at least one packet at the tail of the first packet queue from the first memory based on the available storage space of the first memory being less than the first threshold. When the available storage space of the first memory is less than the first threshold, a packet queue, namely, the first packet queue, is selected and a packet at the tail of the packet queue is deleted from the first memory.

公开(公告)号：US11646970B2

公开(公告)日：2023-05-09

申请号：US17171250

申请日：2021-02-09

Applicant: Huawei Technologies Co., Ltd.

Inventor： Sai Yuan ,  Xiaozhong Wang

IPC: H04L47/25 ,  H04L43/08 ,  H04L43/16 ,  H04L47/28 ,  H04L47/10 ,  H04L47/32 ,  H04L49/9005

CPC classification number: H04L47/25 ,  H04L43/08 ,  H04L43/16 ,  H04L47/28 ,  H04L47/29 ,  H04L47/32 ,  H04L49/9005

Abstract: A method for determining a packet dequeue rate includes allocating a plurality of consecutive blocks in a first memory to a first packet, storing the first packet and a first length in the plurality of blocks, where the first length is of a first packet queue and is obtained when the first packet is enqueued into the first packet queue, and determining, based on a first span and the first length stored, a first rate at which a packet in the first packet queue is dequeued, where the first span is equal to a difference between a second time and a first time, the first time is when the first packet is enqueued into the first packet queue, and the second time is when the first packet is dequeued from the first packet queue.

公开(公告)号：US20210176182A1

公开(公告)日：2021-06-10

申请号：US17171250

申请日：2021-02-09

Applicant: Huawei Technologies Co., Ltd.

Inventor： Sai Yuan ,  Xiaozhong Wang

IPC: H04L12/825 ,  H04L12/861 ,  H04L12/26 ,  H04L12/801 ,  H04L12/841 ,  H04L12/823

Abstract: A method for determining a packet dequeue rate includes allocating a plurality of consecutive blocks in a first memory to a first packet, storing the first packet and a first length in the plurality of blocks, where the first length is of a first packet queue and is obtained when the first packet is enqueued into the first packet queue, and determining, based on a first span and the first length stored, a first rate at which a packet in the first packet queue is dequeued, where the first span is equal to a difference between a second time and a first time, the first time is when the first packet is enqueued into the first packet queue, and the second time is when the first packet is dequeued from the first packet queue.