公开(公告)号：US20210226882A1

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

申请号：US17222280

申请日：2021-04-05

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L12/715 ,  H04L12/717 ,  H04L12/703

Abstract: A method for controlling a network that includes encoding, by a central controller, control instructions using an extended Border Gateway Protocol-Link State (BGP-LS) protocol. The central controller is a BGP-LS supported node. The method transmits, by the central controller, the control instructions to nodes in the network that are identified as intended recipients of the control instructions by the central controller and that have established a BGP session with the central controller.

公开(公告)号：US20210168039A1

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

申请号：US17172725

申请日：2021-02-10

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L12/24 ,  H04W40/24

Abstract: The disclosure relates to path computation and setup of one or more nodes in a network. Connectivity information is received at a local node of the nodes in the network, and a processor of the local node computes a flooding topology based on the received connectivity information, where the flooding topology is represented by links between nodes in the network. The links are encoded between the local node and remote nodes and between remote nodes on the flooding topology, and a link state message is flooded to the remote nodes from the local node in the network, where the link state message includes each of the encoded links in the flooding topology.

公开(公告)号：US20210029017A1

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

申请号：US17068465

申请日：2020-10-12

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen ,  Dean Cheng

IPC: H04L12/755 ,  H04L12/721

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.

公开(公告)号：US12231288B2

公开(公告)日：2025-02-18

申请号：US17890088

申请日：2022-08-17

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L41/0654 ,  H04L45/02 ,  H04L45/58 ,  H04L67/141

Abstract: A method implemented by a first controller in a network comprising a cluster of controllers including the first controller and a second controller, the method comprises transmitting, to a network element (NE), a first BGP message comprising a first controllers network layer reachability information (NLRI), the first controllers NLRI carrying a position of the first controller relative to other controllers in the cluster of controllers, receiving, from the NE, a second BGP message comprising a second controllers NLRI, the second controllers NLRI carrying a position of the second controller relative to the other controllers in the cluster of controllers, and determining the primary controller from the cluster of controllers based on the position of the first controller and the position of the second controller, with the primary controller being responsible for controlling the network.

公开(公告)号：US12219005B2

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

申请号：US18303747

申请日：2023-04-20

Applicant: Huawei Technologies Co., Ltd.

Inventor： Linda Dunbar ,  Huaimo Chen

IPC: H04L67/1004 ,  H04L45/02 ,  H04L45/12

Abstract: A method used by an egress router is disclosed. The egress router obtains a capacity index of an application server attached to the egress router. The egress router further obtains a load index describing a load measurement between the egress router and the application server during a certain time period. The egress router encodes the capacity index and the load index into a packet. The egress router transmits the packet to one or more routers in an Internet protocol (IP) network.

公开(公告)号：US12192097B2

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

申请号：US18519747

申请日：2023-11-27

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L45/00 ,  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.

公开(公告)号：US20240356835A1

公开(公告)日：2024-10-24

申请号：US18305157

申请日：2023-04-21

Applicant: Huawei Technologies Co., Ltd.

Inventor： Huaimo Chen

IPC: H04L45/00 ,  H04L45/02 ,  H04L45/18

CPC classification number: H04L45/22 ,  H04L45/02 ,  H04L45/18

Abstract: A method implemented by a network node in a Bit Index Explicit Replication (BIER) domain is used to provide fast reroute protection. The method includes copying a bit index routing table (BIRT) of the network node, changing a neighbor node in the copied BIRT to one of a plurality of backup neighbor nodes to generate a backup BIRT, deriving a backup bit index forwarding table (BIFT) from the backup BIRT, and forwarding a packet in accordance with the backup BIFT when the neighbor node has failed.

公开(公告)号：US12021742B2

公开(公告)日：2024-06-25

申请号：US17967430

申请日：2022-10-17

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen

IPC: G06F15/16 ,  H04L45/00 ,  H04L45/42 ,  H04L45/741

CPC classification number: H04L45/42 ,  H04L45/566 ,  H04L45/741

Abstract: A method implemented by a first node in a segment routing (SR) network domain includes receiving, from a second node of another network domain, a packet that is to pass through the SR network domain in accordance with segment identifiers (SIDs). The method also includes obtaining compressed SIDs corresponding to some of the SIDs. The method includes generating, by the first node, a segment routing header (SRH) having a list of segments and a segment left (SL) field. The method finally includes adding the SRH to the packet, and forwarding the packet with the SRH to a third node in the SR network domain.

公开(公告)号：US20240146642A1

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

申请号：US18408160

申请日：2024-01-09

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaimo Chen

IPC: H04L45/16

CPC classification number: H04L45/16

Abstract: A method implemented by a BFR in a BIER-TE domain. The method includes receiving a packet with a BIER-TE header, where the BIER-TE header includes an indicator indicating a number of the bitstrings in the BIER-TE header, and a set identifier for each of the bitstrings; checking whether a bitstring identified by the set identifier in the BIER-TE header and a bitstring identified by the set identifier in a top level BIFT each contain an adjacency bit position of the BFR with a same value; and processing the packet using a second level BIFT that a pointer for the set identifier in the top level BIFT points to when the two bitstrings each contain the adjacency bit position of the BFR with the same value.

公开(公告)号：US11855883B2

公开(公告)日：2023-12-26

申请号：US17569177

申请日：2022-01-05

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.