公开(公告)号：US12010013B2

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

申请号：US17396367

申请日：2021-08-06

Applicant: Huawei Technologies Co., Ltd.

Inventor： Stefano Paris ,  Jeremie Leguay ,  Wei Chen ,  Qian Cao ,  Davide Sanvito ,  Antonio Capone ,  Ilario Filippini

IPC: H04L45/00 ,  H04L45/02 ,  H04L47/125

CPC classification number: H04L45/38 ,  H04L45/02 ,  H04L45/04 ,  H04L45/46 ,  H04L47/125

Abstract: A device for controlling network routing configurations is configured to obtain a predicted traffic matrix and a plurality of traffic matrices, and to determine, from a plurality of clusters, arranged in a hierarchical structure over the predicted traffic matrix and the plurality of traffic matrices, a first cluster allocated to a lower hierarchy level that contains the predicted traffic matrix. Each of the clusters is associated with a routing configuration, and the plurality of clusters are allocated to at least two different hierarchy levels. The device selects, from the plurality of clusters, a second cluster allocated to a higher hierarchy level that includes at least the first cluster and a third cluster allocated to the lower hierarchy level that contains a current traffic matrix, determine a second routing configuration associated with the second cluster; and activate the second routing configuration as a network routing configuration.

公开(公告)号：US10708169B2

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

申请号：US15906821

申请日：2018-02-27

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Paolo Medagliani ,  Stefano Paris ,  Jeremie Leguay ,  Ioannis Steiakogiannakis

IPC: H04L12/735 ,  H04L12/721 ,  H04L12/707 ,  H04L12/717

Abstract: A method, an apparatus and a non-transitory computer-readable storage medium for determining multiple disjoint constrained paths in a communications network are disclosed. The method includes selecting upper bounds QoS metrics for each path in a disjoint combination of paths having two or more disjoint paths between a source node and a destination node; determining a minimum-cost disjoint path combination, and a minimum-QoS metric disjoint path combination; computing a maximum QoS metric by summing the QoS metrics of each minimum-cost path in the minimum-cost disjoint path combination, and computing a minimum QoS metric by summing the QoS metrics of each minimum-QoS metric path in the minimum-QoS metric disjoint path combination.