WO2023147884A1 - Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau - Google Patents

Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau Download PDF

Info

Publication number
WO2023147884A1
WO2023147884A1 PCT/EP2022/052887 EP2022052887W WO2023147884A1 WO 2023147884 A1 WO2023147884 A1 WO 2023147884A1 EP 2022052887 W EP2022052887 W EP 2022052887W WO 2023147884 A1 WO2023147884 A1 WO 2023147884A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
network device
destination node
hop
message
Prior art date
Application number
PCT/EP2022/052887
Other languages
English (en)
Inventor
Sébastien MARTIN
Jeremie Leguay
Youcef MAGNOUCHE
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to PCT/EP2022/052887 priority Critical patent/WO2023147884A1/fr
Publication of WO2023147884A1 publication Critical patent/WO2023147884A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/128—Shortest path evaluation for finding disjoint paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H04L45/243—Multipath using M+N parallel active paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing

Definitions

  • the exclusion set of links and/or nodes of the network may indicate for which links and/or nodes a load balancing is not to be done.
  • the network device may be configured to ignore disjoint shortest paths that comprise a link and/or node of the exclusion set.
  • the first set of one or more destination nodes of the network may activate multi-path routing (load balancing) for specific destination nodes.
  • the second set of one or more pairs of a source node and a destination node of the network may activate multi-path routing (load balancing) for specific source-destination flows (may be referred to as origin-destination flows).
  • the third set of one or more source nodes of the network may activate multi-path routing (load balancing) for specific source nodes of the network or specific source-destination flows.
  • the integer number K may indicate the number of disjoint shortest paths to be computed for a destination node.
  • the LBR message comprises at least one of an active flag, and a third set comprising one or more source nodes of the network.
  • the network device 2 of Fig. 1 A is a network device for a network 1.
  • the network device 2 is configured to compute, based on a topology of the network 1, K disjoint shortest paths for a hop-by-hop routing to a destination node of the network 1.
  • K is an integer number greater or equal to two.
  • the memory circuitry may comprise a non-transitory storage medium storing executable software code which, when executed by the processor or the processing circuitry, causes the various operations of the network device 2 to be performed.
  • the processing circuitry may comprise one or more processors and a non-transitory memory connected to the one or more processors.
  • the non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the network device 2 to perform, conduct or initiate the operations or methods described herein.
  • Fig- 4 shows an example of a network device according to an embodiment of the present disclosure and a network manager according to an embodiment of the present disclosure.
  • the network device of Fig. 4 is an example of the network device according to the first aspect of the present disclosure.
  • the network device of Fig. 4 is an implementation form of the network device of Fig. 1A.
  • the above description with regard to the network device according to the first aspect and the network device of Fig. 1 A is valid for the network device of Fig. 4.
  • the network manager of Fig. IB is an example of the network manager according to the second aspect of the present disclosure.
  • the network manager of Fig. 4 is an implementation form of the network manager of Fig. IB.
  • the above description with regard to the network manager according to the second aspect and the network manager of Fig. IB is valid for the network manager of Fig. 4.
  • the network device 2 (and the other nodes of the network) may be configured to use or consider the information comprise by the LBR message and the information comprised by the LBD message for computing (and maintaining) K disjoint shortest paths for a hop-by-hop routing to a respective destination.
  • the LBR message and optionally the LBD message may comprise an authorization to duplicate paths or not.
  • the LBR message and optionally the LBD message may comprise a parameter to authorize or not duplicated paths in the data plane (e.g. duplicated rules or entries in a forwarding table, such as a Forwarding Information Base (FIB)).
  • FIB Forwarding Information Base
  • the network device 2 (and the other nodes of the network) may be configured to use hash-based splitting.
  • the network device 2 may be configured to use duplicated entries to give more weights to some paths.
  • the selection of each path may be realized using a header field (e.g. Tree ID) in addition to an IP address.
  • a header field e.g. Tree ID
  • K 3
  • Fig- 8 shows an example of an algorithm that may be used by a network device according to an embodiment of the present disclosure for computing disjoint shortest paths for a hop-by-hop routing to a destination node of a network.
  • the network device may be the network device 2 of the Figs. 1 and 3 to 5.
  • Fig. 9 (B) shows an example of performing the step S84 a first time, i.e. in a second iteration of the algorithm of Fig. 8.
  • the network device may update link weights of the topology of the network by increasing the weight of each link of the first GADAG of the previous iteration (i.e. the first GADAG of Fig. 9 (A)) by a first value and, when considered in the opposite direction, by a second value smaller than the first value.
  • the initial weights of the network are zero (o)
  • the first value is one (1)
  • the second value is a half (0.5).
  • Fig. 9 (B) shows the network with the updated link weights.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente divulgation concerne un dispositif réseau (2) pour un réseau (1). Le dispositif réseau (2) est configuré pour calculer, d'après une topologie du réseau (1), K trajectoires séparées les plus courtes pour un routage saut par saut vers un nœud de destination du réseau (1). De plus, la présente divulgation concerne un gestionnaire de réseau (3) pour un réseau (1), le gestionnaire de réseau (3) étant configuré pour transmettre un message de demande d'équilibrage de charge (message LBR) à au moins un nœud du réseau (1). Le message LBR est configuré pour amener le(s) nœud(s) réseau (1) à calculer, d'après une topologie du réseau (1), K trajectoires séparées les plus courtes pour un routage saut par saut vers un nœud de destination du réseau (1). K est un nombre entier supérieur ou égal à deux. De plus, la présente divulgation concerne des procédés d'équilibrage de charge dans un réseau.
PCT/EP2022/052887 2022-02-07 2022-02-07 Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau WO2023147884A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2022/052887 WO2023147884A1 (fr) 2022-02-07 2022-02-07 Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2022/052887 WO2023147884A1 (fr) 2022-02-07 2022-02-07 Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau

Publications (1)

Publication Number Publication Date
WO2023147884A1 true WO2023147884A1 (fr) 2023-08-10

Family

ID=80628812

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2022/052887 WO2023147884A1 (fr) 2022-02-07 2022-02-07 Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau

Country Status (1)

Country Link
WO (1) WO2023147884A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021197617A1 (fr) * 2020-04-03 2021-10-07 Huawei Technologies Co., Ltd. Dispositif, système et procédé de réseau pour l'équilibrage de charge basé sur un cycle

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021197617A1 (fr) * 2020-04-03 2021-10-07 Huawei Technologies Co., Ltd. Dispositif, système et procédé de réseau pour l'équilibrage de charge basé sur un cycle

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
ALVIZU RODOLFO ET AL: "Can open flow make transport networks smarter and dynamic? An overview on transport SDN", 2014 INTERNATIONAL CONFERENCE ON SMART COMMUNICATIONS IN NETWORK TECHNOLOGIES (SACONET), IEEE, 18 June 2014 (2014-06-18), pages 1 - 6, XP032626186, DOI: 10.1109/SACONET.2014.6867771 *
BISWAS R ET AL: "Parallel processing of adaptive meshes with load balancing", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, IEEE, USA, vol. 12, no. 12, 1 December 2001 (2001-12-01), pages 1269 - 1279, XP011093964, ISSN: 1045-9219, DOI: 10.1109/71.970562 *
JERRY ASH (AT&T) EDITOR J L LE ROUX (FRANCE TELECOM) EDITOR: "Path Computation Element (PCE) Communication Protocol Generic Requirements; draft-ietf-pce-comm-protocol-gen-reqs-07.txt", PATH COMPUTATION ELEMENT (PCE) COMMUNICATION PROTOCOL GENERIC REQUIREMENTS; DRAFT-IETF-PCE-COMM-PROTOCOL-GEN-REQS-07.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZE, vol. pce, no. 7, 1 June 2006 (2006-06-01), XP015045411 *
QUINTIN ZHAO ROBIN LI BORIS KHASANOV HUAWEI TECHNOLOGIES KING KE TENCENT HOLDINGS LTD LUYUAN FANG MICROSOFT CHAO ZHOU CISCO SYSTEM: "The Use Cases for Using PCE as the Central Controller(PCECC) of LSPs; draft-zhao-teas-pcecc-use-cases-01.txt", THE USE CASES FOR USING PCE AS THE CENTRAL CONTROLLER(PCECC) OF LSPS; DRAFT-ZHAO-TEAS-PCECC-USE-CASES-01.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, 8 July 2016 (2016-07-08), pages 1 - 29, XP015114335 *
SELCUK CEVHER ET AL: "Trade-off analysis of multi topology routing based IP fast reroute mechanisms", INFOCOM, 2013 PROCEEDINGS IEEE, IEEE, 14 April 2013 (2013-04-14), pages 3447 - 3452, XP032441138, ISBN: 978-1-4673-5944-3, DOI: 10.1109/INFCOM.2013.6567179 *

Similar Documents

Publication Publication Date Title
US20210083940A1 (en) Method and apparatus for creating network slices
US9660897B1 (en) BGP link-state extensions for segment routing
EP3249865B1 (fr) Procédé et appareils pour construire une étiquette et pour transférer un paquet d'étiquette
US9019865B2 (en) Advertising traffic engineering information with the border gateway protocol
US10382321B1 (en) Aggregate link bundles in label switched paths
US11743166B2 (en) Provisioning non-colored segment routing label switched paths via segment routing policies in border gateway protocol
US8174967B2 (en) Method to reduce routing convergence at the edge
US10581723B2 (en) PCEP extension for PCECC support of distributed computing, multiple services, and inter-domain routing
Giorgetti et al. Path encoding in segment routing
US11431618B2 (en) Flexible path encoding in packet switched networks
US10469360B1 (en) Reverse metric advertisement for border gateway protocol route reflection inhierarchical networks
US20040039839A1 (en) Connectionless internet traffic engineering framework
US8576720B2 (en) Global provisioning of zero-bandwidth traffic engineering label switched paths
CN101536375A (zh) 域间路径计算技术
US10630581B2 (en) Dynamic tunnel report for path computation and traffic engineering within a computer network
US9590845B1 (en) Inter-area LDP node protection
US20120124238A1 (en) Prioritization of routing information updates
US11695688B2 (en) Computing segment identifier lists for multipaths in a segment routing-enabled network
US11516114B2 (en) Bandwidth constraint for multipath segment routing
US11418428B2 (en) Recomputation of multipaths in a segment routing-enabled network
CN114631293A (zh) 利用灵活算法的标签推导
WO2023147884A1 (fr) Dispositif réseau et gestionnaire de réseau pour un réseau et procédés d'équilibrage de charge dans un réseau
CN102685004A (zh) 一种gmpls/obs网络中实现流量工程的方法
WO2022214164A1 (fr) Équilibrage de charge distribuée dans un réseau à domaines multiple
Xi et al. ESCAP: Efficient scan for alternate paths to achieve IP fast rerouting

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22707654

Country of ref document: EP

Kind code of ref document: A1