公开(公告)号：US20240275716A1

公开(公告)日：2024-08-15

申请号：US18643583

申请日：2024-04-23

Applicant: Huawei Technologies Co., Ltd.

Inventor： Rongfeng Hong ,  Shixing Liu ,  Zhigang Ji ,  Ling Li ,  Kaokao Yan ,  Jie Li ,  Huafeng Wen ,  Songlin Wang

IPC: H04L45/28 ,  H04L45/03 ,  H04L45/74

CPC classification number: H04L45/28 ,  H04L45/03 ,  H04L45/74

Abstract: A first network device receives a first data packet through an ingress port, and when a first forwarding path corresponding to the first data packet is faulty and there is no redundant path of the first forwarding path on the first network device, sends, through the ingress port of the first data packet, a first notification packet notifying that the first forwarding path is faulty. The first notification packet is generated by a data plane of the first network device, and the first notification packet is a data plane packet. Therefore, a network device that receives the first notification packet processes the first notification packet through a data plane. Then the network device can process a received data packet based on obtained fault information.

公开(公告)号：US09075533B2

公开(公告)日：2015-07-07

申请号：US13864887

申请日：2013-04-17

Applicant: Huawei Technologies Co., Ltd.

Inventor： Yi Yi ,  Rongfeng Hong ,  Jian Wang

IPC: G06F13/12 ,  G06F3/06 ,  G06F12/02 ,  G06F9/50 ,  G06F17/30

CPC classification number: G06F3/0644 ,  G06F9/5016 ,  G06F12/0284 ,  G06F17/30961

Abstract: The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages.

Abstract translation: 本发明适用于计算机技术领域，并提供二叉树存储方法和系统。 该方法包括：将二叉树分为根树和多个子树，其中多个子树被分层并存储在N个级别的存储中; 根据预设规则将多个子树划分为M种类型，使得多个子树被划分成N×M个数据块; 以及调整存储器中的N×M数据块的存储位置，使得每个级别的存储器占用相同数量的存储单元。 在本发明中，作为不均匀尺寸的空间的每个级别的节点的存储空间被标准化为相同尺寸的空间，从而增加了存储空间利用率。