公开(公告)号：US20220123994A1

公开(公告)日：2022-04-21

申请号：US17563691

申请日：2021-12-28

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L41/0816 ,  H04L43/12

Abstract: Various systems and methods for migrating a zone to a pseudo node are described herein including a method performed by a zone edge node. In an embodiment, the method includes receiving, by the zone edge node, an execution request to initiate migration from the zone to the pseudo node. The method also includes sending, by the zone edge node, at least one Hello packet to a zone external node adjacent to the zone edge node for requesting the zone external node to create an adjacency between the pseudo node and the zone external node on the zone external node. The method further includes creating, by the zone edge node, the adjacency between the pseudo node and the zone external node on the zone edge node.

公开(公告)号：US11277329B2

公开(公告)日：2022-03-15

申请号：US17068465

申请日：2020-10-12

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen ,  Dean Cheng

IPC: H04L12/28 ,  H04L45/021 ,  H04L45/00

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

公开(公告)号：US20210203562A1

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

申请号：US17192019

申请日：2021-03-04

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L12/24 ,  H04L12/721 ,  H04L12/703

Abstract: The disclosure relates to recovering from a failure in a network. A flooding topology, represented by links between nodes in the network, is computed. Alternative connections for the links and the nodes on the flooding topology are also computed. A change in the flooding topology is detected, where the change indicates the failure in the network and results in a split of the flooding topology. A link state message is flooded to each of the nodes in a remaining part of the flooding topology and to the alternative connections, such that the link state message identifies the failure in the network. The failure in the network is resolved by connecting the split flooding topology using the remaining part of the flooding topology and the alternative connections as identified in the link state message.

公开(公告)号：US20250158915A1

公开(公告)日：2025-05-15

申请号：US19022426

申请日：2025-01-15

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen ,  Donald Eggleston Eastlake, III

IPC: H04L45/03

Abstract: A method performed by a routing device. The method comprises determining that a size of a payload of a type-length-value (TLV) of a first type in a link state protocol data unit exceeds a maximum value, splitting the payload into n pieces, wherein n is an integer larger than 1, and encoding a first piece of the payload in a first TLV of the first type. The first TLV of the first type includes a first type field indicating the first type, a first value field including the first piece of the payload and a first length field indicating a length of the first value field. The method includes encoding one or more second pieces of the payload in one or more container TLVs of a second type.

公开(公告)号：US12170613B2

公开(公告)日：2024-12-17

申请号：US18149514

申请日：2023-01-03

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen ,  Donald Eggleston Eastlake, III

IPC: H04L45/50 ,  H04L45/122 ,  H04L45/16 ,  H04L45/24 ,  H04L12/28

Abstract: Disclosed is a mechanism implemented by an ingress node in a network. The mechanism comprises receiving a packet in Multiprotocol Label Switching (MPLS) format. A first segment list is pushed onto the packet. The first segment list describes a segment routing point to multipoint (SR P2MP) path as a list of multicast segment identifiers (SIDs) each comprising a multicast adjacency label. The packet is transmitted from a downstream interface along the SR P2MP path.

公开(公告)号：US20240259293A1

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

申请号：US18615379

申请日：2024-03-25

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen

IPC: H04L45/02 ,  H04L45/00 ,  H04L45/12

CPC classification number: H04L45/04 ,  H04L45/12 ,  H04L45/32

Abstract: A method for reducing flooding in a Border Gateway Protocol-Shortest Path First (BGP-SPF) domain implemented by a network node. The network node obtains a flooding topology (FT) of the BGP-SPF domain. When there is a link change, the network node transmits Network Layer Reachability Information (NLRI) in a BGP update message indicating the link change to network nodes that are directly connected to the network node on the FT.

公开(公告)号：US20240223497A1

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

申请号：US18519747

申请日：2023-11-27

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L45/00 ,  H04L45/02 ,  H04L45/42 ,  H04L47/6275

CPC classification number: H04L45/32 ,  H04L45/02 ,  H04L45/42 ,  H04L47/6275

Abstract: Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.

公开(公告)号：US20240163200A1

公开(公告)日：2024-05-16

申请号：US18391217

申请日：2023-12-20

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L45/036 ,  H04L45/02 ,  H04L45/741

CPC classification number: H04L45/036 ,  H04L45/04 ,  H04L45/741

Abstract: A method implemented by a controller configured to implement a border gateway protocol (BGP) and control a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain. The method includes generating an update message comprising a BIER-TE path subsequent address family indicator (SAFI), a network layer reachability information (NLRI) including a distinguisher, and an attribute including a type length value (TLV) having a tunnel type and a path bit positions sub-TLV. The method further includes distributing the update message to a bit forwarding router (BFR) in the BIER-TE domain.

公开(公告)号：US11962491B2

公开(公告)日：2024-04-16

申请号：US17177776

申请日：2021-02-17

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen

IPC: H04L45/00

CPC classification number: H04L45/34 ,  H04L45/22

Abstract: A network node including a processor coupled to a memory. The processor is configured to receive instructions from the memory which, when executed by the processor, cause the network node to receive a path computation request, calculate a first path from a first ingress node to an egress node, calculate a second path from a second ingress node to a destination node, transmit a first message comprising the first path to the first ingress node, and transmit a second message comprising the second path to the second ingress node.

公开(公告)号：US11949594B2

公开(公告)日：2024-04-02

申请号：US18341554

申请日：2023-06-26

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L45/17 ,  H04L45/42 ,  H04L45/745

CPC classification number: H04L45/745 ,  H04L45/17 ,  H04L45/42

Abstract: A method implemented by a network node in a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain is used to avoid duplicate packets. The method includes generating an improved bit index forwarding table (BIFT) containing a forwarding entry for a local area network (LAN)-connected adjacency from the network node to a pseudo node; and a secondary BIFT including a forwarding entry for a forward connected adjacency from the pseudo node to each of the pseudo node's next hop nodes except the network node; sending a packet containing a point to multipoint (P2MP) path with a bit position for the LAN-connected adjacency to the pseudo node according to the forwarding entry for the LAN-connected adjacency in the improved BIFT; and sending the packet to each of the pseudo node's next hop nodes on the P2MP path based on the secondary BIFT.