公开(公告)号：US11929915B2

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

申请号：US17401101

申请日：2021-08-12

Applicant: Huawei Technologies Co., Ltd.

Inventor： Chuang Chen ,  Zhibo Hu ,  Jie Dong ,  Junda Yao

IPC: G06F15/16 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16

CPC classification number: H04L45/16 ,  H04L45/02 ,  H04L45/124 ,  H04L45/127

Abstract: A path calculation method, apparatus, and device, to implement network slicing. The path calculation method includes: obtaining an algorithm constraint supported by each of a plurality of network devices, where the algorithm constraint is a constraint of a forwarding path algorithm, and the forwarding path algorithm is used to calculate, for the network device, a forwarding path that meets the algorithm constraint; performing network topology division on the plurality of network devices, where network devices in a same network topology support a same algorithm constraint; and calculating a forwarding path between network devices in each network topology based on the algorithm constraint, of the forwarding path algorithm, corresponding to the network topology.

公开(公告)号：US12250142B2

公开(公告)日：2025-03-11

申请号：US17355951

申请日：2021-06-23

Applicant: Huawei Technologies Co., Ltd.

Inventor： Ruqin Lan ,  Guoqi Xu ,  Chuang Chen ,  Guoquan Liu ,  Zuliang Wang

IPC: H04L45/02 ,  H04L45/00 ,  H04L45/24 ,  H04L45/44

Abstract: A method is applied to a network comprising a first area and a second area. A first node in the first area obtains aggregated routing information, where the aggregated routing information is obtained by aggregating a plurality of pieces of original routing information, the plurality of pieces of original routing information correspond to N nodes in a network segment, the N nodes in the network segment have a same flexible algorithm flex-algo, and the aggregated routing information carries an algorithm identifier used to indicate the flex-algo and a network segment identifier used to indicate the network segment. The first node sends the aggregated routing information to the second area, where the aggregated routing information is used to indicate a node in the second area to send a packet to the N nodes in the network segment based on the aggregated routing information.

公开(公告)号：US20210409310A1

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

申请号：US17355951

申请日：2021-06-23

Applicant: Huawei Technologies Co., Ltd.

Inventor： Ruqin Lan ,  Guoqi Xu ,  Chuang Chen ,  Guoquan Liu ,  Zuliang Wang

IPC: H04L12/709 ,  H04L12/721 ,  H04L12/751

Abstract: A method is applied to a network comprising a first area and a second area. A first node in the first area obtains aggregated routing information, where the aggregated routing information is obtained by aggregating a plurality of pieces of original routing information, the plurality of pieces of original routing information correspond to N nodes in a network segment, the N nodes in the network segment have a same flexible algorithm flex-algo, and the aggregated routing information carries an algorithm identifier used to indicate the flex-algo and a network segment identifier used to indicate the network segment. The first node sends the aggregated routing information to the second area, where the aggregated routing information is used to indicate a node in the second area to send a packet to the N nodes in the network segment based on the aggregated routing information.

公开(公告)号：US20210377155A1

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

申请号：US17401101

申请日：2021-08-12

Applicant: Huawei Technologies Co., Ltd.

Inventor： Chuang Chen ,  Zhibo Hu ,  Jie Dong ,  Junda Yao

IPC: H04L12/761 ,  H04L12/721 ,  H04L12/751

Abstract: A path calculation method, apparatus, and device, to implement network slicing. The path calculation method includes: obtaining an algorithm constraint supported by each of a plurality of network devices, where the algorithm constraint is a constraint of a forwarding path algorithm, and the forwarding path algorithm is used to calculate, for the network device, a forwarding path that meets the algorithm constraint; performing network topology division on the plurality of network devices, where network devices in a same network topology support a same algorithm constraint; and calculating a forwarding path between network devices in each network topology based on the algorithm constraint, of the forwarding path algorithm, corresponding to the network topology.