WO2023186104A1 - Procédé et appareil de traitement d'optimisation de trajet, et dispositif et support de stockage lisible - Google Patents

Procédé et appareil de traitement d'optimisation de trajet, et dispositif et support de stockage lisible Download PDF

Info

Publication number
WO2023186104A1
WO2023186104A1 PCT/CN2023/085525 CN2023085525W WO2023186104A1 WO 2023186104 A1 WO2023186104 A1 WO 2023186104A1 CN 2023085525 W CN2023085525 W CN 2023085525W WO 2023186104 A1 WO2023186104 A1 WO 2023186104A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
metric
link
algorithm
sub
Prior art date
Application number
PCT/CN2023/085525
Other languages
English (en)
Chinese (zh)
Inventor
龚立艳
程伟强
姜文颖
Original Assignee
中国移动通信有限公司研究院
中国移动通信集团有限公司
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 中国移动通信有限公司研究院, 中国移动通信集团有限公司 filed Critical 中国移动通信有限公司研究院
Publication of WO2023186104A1 publication Critical patent/WO2023186104A1/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/14—Routing performance; Theoretical aspects
    • 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
    • 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/124—Shortest path evaluation using a combination of metrics

Definitions

  • the present disclosure relates to the field of communication technology, and specifically to a path optimization processing method, device, equipment and readable storage medium.
  • FlexAlgo allows the Interior Gateway Protocol (Interior Gateway Protocol, IGP) to calculate paths based on constraints.
  • FlexAlgo is used in the segment routing (Segment Routing, SR) data plane (SR-MPLS, SRv6). ) and the applications in the native Internet Protocol version 4 (Internet Protocol version 4, IPv4) and Internet Protocol version 6 (Internet Protocol version 6, IPv6) data plane are described in detail.
  • FlexAlgo combines the metric type (MetricType), calculation type (CalcType) and link color (LinkColor) to perform shortest path first (SPF) calculations separately.
  • Each FlexAlgo forms an independent routing and forwarding table item, which can flexibly realize network topology. Dynamic programming and isolation.
  • Embodiments of the present disclosure provide a path optimization processing method, device, equipment and readable storage medium to solve the problem of how to improve the accuracy of optimal path calculation.
  • a path optimization processing method including:
  • the sending end publishes the first information
  • the first information includes at least one of the following:
  • the metric information related to the algorithm includes at least one of the following:
  • the method also includes:
  • the sending end determines the metric information related to the algorithm.
  • the algorithm identifier is set to a first value. If the first value is a value outside the specified range, the link corresponding to the metric information does not participate in the basic topology routing calculation;
  • the link corresponding to the metric information does not participate in the basic topology routing calculation.
  • the algorithm-related metric information is carried in the first information in the form of a first sub-type length value sub-TLV.
  • the first sub-type length value sub-TLV is an algorithm-related generic metric sub-type length value Algorithm-Associated Generic Metric sub-TLV, an algorithm-specific indicator sub-type length value Algorithm-Specific Metric sub-TLV, or based on Algorithm-Based Metric sub-TLV.
  • the link information is carried in the first information in the form of a second sub-type length value sub-TLV.
  • the second subtype length value is a Link Excluding subtype length value Link Excluding sub-TLV.
  • the link information is used to indicate that the first link participates in basic topology route calculation, and/or does not participate in basic topology route calculation.
  • the first information when the first information includes link information, it means that the link corresponding to the first information does not participate in basic topology routing calculation; and/or when the first information does not include link information. , indicating that the link corresponding to the first information participates in the basic topology.
  • the first information is carried in Interior Gateway Protocol IGP message information.
  • the second aspect provides a transmission processing method, including:
  • the receiving end receives the first information
  • the receiving end calculates a path based on the first information
  • the first information includes at least one of the following:
  • the link corresponding to the metric information does not participate in the basic topology routing calculation.
  • the algorithm-related metric information is carried in the first information in the form of a first sub-type length value sub-TLV.
  • the first subtype length value sub-TLV is Algorithm-Associated Generic Metric sub-TLV, Algorithm-Specific Metric sub-TLV, or Algorithm-Based Metric sub-TLV.
  • the link information is carried in the first information in the form of a second sub-type length value sub-TLV.
  • the link information is used to indicate whether the first link participates in basic topology route calculation.
  • the link information includes an indication bit.
  • the indication bit is a second value, it indicates that the first link participates in basic topology routing calculation.
  • the indication bit is a third value, it indicates that the first link participates in basic topology routing calculation. The first link mentioned above does not participate in the basic topology routing calculation.
  • the first information is carried in Interior Gateway Protocol IGP message information.
  • a path optimization processing device applied to the sending end, including:
  • the first sending module is used to publish the first information
  • the first information includes at least one of the following:
  • a transmission processing device applied to the receiving end, including:
  • the first receiving module is used to receive the first information
  • a second processing module configured to calculate a path based on the first information
  • the first information includes at least one of the following:
  • a communication device including a processor, a memory, and a program or instructions stored on the memory and executable on the processor.
  • the program or instructions When the program or instructions are executed by the processor, the following is implemented: The steps of the method described in the first aspect or the second aspect.
  • a readable storage medium In a sixth aspect, a readable storage medium is provided. Programs or instructions are stored on the readable storage medium. When the programs or instructions are executed by a processor, the steps of the method described in the first aspect or the second aspect are implemented.
  • the sending end publishes the first information used to calculate the path.
  • the first information includes algorithm-related metric information and/or link information.
  • the receiving end calculates the path based on different Metrics. , get different calculation results, and exclude links that do not participate in the IGP basic topology routing calculation based on link information to avoid the link affecting the basic topology function, thereby realizing the integration of the basic topology and FlexAlgo topology without changing the basic topology configuration. Complete isolation to improve the accuracy of optimal path calculation.
  • Figure 2a is a schematic diagram of the basic topology
  • Figure 2b is a schematic diagram of the basic topology after Flex-Algo128;
  • Figure 2c is a schematic diagram of the Flex-Algo128 topology
  • Figure 3 is one of the flow charts of the path optimization processing method provided by the embodiment of the present disclosure.
  • Figure 4 is the second flow chart of the path optimization processing method provided by the embodiment of the present disclosure.
  • Figure 5 is the third flowchart of the path optimization processing method provided by the embodiment of the present disclosure.
  • Figure 6 is a schematic diagram of the first sub-TLV format provided by an embodiment of the present disclosure.
  • Figure 7 is a schematic diagram of the second sub-TLV format provided by an embodiment of the present disclosure.
  • Figure 8 is a schematic diagram of P bits provided by an embodiment of the present disclosure.
  • Figure 9 is one of the schematic diagrams of a path optimization processing device provided by an embodiment of the present disclosure.
  • Figure 10 is a second schematic diagram of a path optimization processing device provided by an embodiment of the present disclosure.
  • Figure 11 is a schematic diagram of a communication device provided by an embodiment of the present disclosure.
  • words such as “exemplary” or “such as” are used to represent examples, illustrations or explanations. Any embodiment or design described as “exemplary” or “such as” in the present disclosure is not intended to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the words “exemplary” or “such as” is intended to present the concept in a concrete manner.
  • an embodiment of the present disclosure provides a path optimization processing method. Specific steps include:
  • Step 301 The sending end publishes the first information
  • Metric information is related to algorithms (such as flexible algorithms, etc.), and there can be multiple ways of association, such as related to algorithm type, or related to algorithm identification (Identity Document, ID).
  • Metric information related to an algorithm can be called an algorithm-specific metric, an algorithm-based metric or a dedicated metric for algorithm.
  • the algorithm-related metric information may include at least one of a metric-Type field, a metric field, and an algorithm (Algorithm) field.
  • metric information can also contain other fields.
  • both the metric-Type field and the metric field are related to the algorithm (for example, they can be related to the algorithm field), and these two fields together serve as one of the basis for calculation of the corresponding algorithm path.
  • the correlation between the metric-Type field and the metric field and the Algorithm can be implemented in various ways: for example, the metric-Type field can have a one-to-one correspondence with the Algorithm. In this case, only one of the metric type field and the Algorithm field can be retained. field.
  • the metric-Type field can have a many-to-one relationship with Algorithm. In this case, both the metric-Type field and the Algorithm field need to be retained.
  • the link information is used to indicate that the first link participates in basic topology route calculation, and/or the link information is used to indicate that the first link does not participate in basic topology route calculation.
  • ASLA Application-Specific Link Attribute
  • Figure 1b and Figure 1c are respectively sub-topologies with Metric-Type IGP Metric divided from the basic topology shown in Figure 1a, Flex-Algo128 and Flex-Algo129.
  • the required deployment effect in actual applications is that the traffic between the two Flex-Algos is dispersedly distributed, and at the same time, path failure backup can be implemented inside the Flex-Algo: Flex-Algo128, main path A--B--D, backup path A--C --D; Flex-Algo129, main path A--C--D--F, backup path A--B--D--F.
  • the sending end determines the Metric value based on a specific flexible algorithm (Flex-Algo), and the receiving end calculates based on different Metric values during calculation to obtain different calculation results.
  • a specific flexible algorithm Flex-Algo
  • the method further includes: the sending end determines the Metric value according to a flexible algorithm.
  • the algorithm-related Metric information includes at least one of the following: (1) algorithm identification (such as Flex-Algo ID); (2) Metric type (Metric-Type); (3) )Metric value.
  • the link corresponding to the Metric information does not participate in basic topology routing.
  • the first value is 0, but of course it is not limited to this;
  • the specified range can be 128 to 255. This is an example.
  • the specified range mainly describes the legal range of algorithm identification, and this range may change.
  • the first value may also be within a specified range, where the specified range is an illegal range.
  • the link corresponding to the metric information does not participate in the basic topology routing calculation.
  • the link corresponding to the Metric information does not participate in the basic topology routing calculation, such as Intermediate system to intermediate system (Intermediate system to intermediate system, ISIS) protocol can be set to 2 ⁇ 24-1, Open Shortest Path First (OSPF) can be set to 2 ⁇ 32-1.
  • ISIS Intermediate system to intermediate system
  • OSPF Open Shortest Path First
  • the algorithm-related metric information is carried in the first information in the form of a first sub-type length value (first sub-TLV (Type Length Value)).
  • first sub-TLV Type Length Value
  • a universal Metric sub-type length value (Type Length Value, TLV) based on a flexible algorithm is proposed.
  • the first sub-TLV supports specifying Flex-Algo to publish the Metric value.
  • IGP publishes the first information, it carries it and sends it to other devices.
  • the receiving end parses the Metric information corresponding to Flex-Algo and calculates it according to the relevant algorithm to obtain the final path.
  • the first information is carried in IGP message information.
  • (a) Type indicates: the first sub-TLV type
  • Metric-Type means: Define the corresponding Metric type, including but not limited to one or more of the following: IGP Metric, Traffic Engineering (TE) Metric, Delay;
  • Algorithm represents: Flex-Algo ID, value range 1-255;
  • Metric means: Metric value, ranging from 1-16, 777, 215;
  • the first sub-TLV is carried in an Application-Specific Link Attribute (ASLA) defined in related technologies (eg, [RFC8919]).
  • ASLA Application-Specific Link Attribute
  • Flex-Algo128 and Flex-Algo 129 are planned according to Figure 1a ⁇ Figure 1c, the calculation type Clac-Type is set to SPF, and the Metric-Type is set to IGP Metric;
  • Link Metric sets different values according to Flex-Algo. For example, in Flex-Algo128, the A--B, B--D, and C--D links set the Metric to 1, and the A--C link sets the Metric to 2. . In Flex-Algo129, the link Metric of A--C, C--D, and B--D is set to 1, and the link Metric of A--B is set to 2.
  • Flex-Algo128 uses the metric calculation with Algorithm 128, and Flex-Algo129 uses the metric calculation with Algorithm 129.
  • the final calculated results are: Flex-Algo128 main path A--B--D, backup path A--C--D; Flex-Algo129 main path A--C--D--F, backup path A- -B--D--F, meets the deployment requirements.
  • FIG. 2a shows the original networking topology.
  • the IGP protocol is deployed in this topology, and the optimal path is obtained through the shortest path calculation.
  • Figure 2a add sub-links to the four ABCD device links, and plan the sub-links into Flex-Algo 128 (as shown in Figure 2b), thus obtaining Flex-Algo 128 as shown in Figure 2c topology.
  • Flex-Algo sets the flag (link exclusion information) through the flag bit when publishing the first information. This link does not participate in the IGP basic topology routing calculation to avoid adding new links from affecting the basic Topological functions.
  • the link information is carried in the first information in the form of a second subtype length value.
  • the second subtype length value is a link excluding subtype length value (Link Excluding sub-TLV).
  • the link information is used to indicate whether the first link participates in basic topology routing calculation, and the information of the first link is included in the first link determined by the sending end according to a flexible algorithm.
  • One message One message.
  • the first information when the first information includes link information, it means that the link corresponding to the first information does not participate in basic topology routing calculation; and/or, when the first information When link information is not included, it means that the link corresponding to the first information participates in basic topology routing calculation.
  • new link exclusion information (or simply referred to as link information) is carried in the Link Excluding sub-TLV to publish the first information in FlexAlgo It identifies whether the link can participate in the basic topology routing calculation. The receiving end determines whether the first information needs to be calculated based on the Link Excluding sub-TLV. This achieves complete isolation between the basic topology and FlexAlgo topology without changing the basic topology configuration.
  • the link exclusion information is carried when the IGP protocol releases the first information, and is applicable to all IGP protocols.
  • the ISIS protocol as an example, the second sub-TLV format is shown in Figure 7.
  • P-Flag set to 1 means that the link will not participate in the IGP basic topology routing calculation, and set to 0 means to participate in the IGP basic topology routing calculation.
  • the second sub-TLV is carried as a sub-TLV in the following ISIS TLV:
  • TLV-223 Multiple Topology Intermediate System Neighbor Attribute (MT IS Neighbor Attribute));
  • TLV-141 (inter-AS reachability information).
  • the second sub-TLV can also be carried as a sub-TLV in other TLVs.
  • the receiving end After receiving the Link Excluding sub-TLV, the receiving end checks the P bit setting and finds that the P bit Set to 1, the link will be excluded from calculation and route calculation will be performed normally. In this way, the newly added sub-link will not become the shortest path of the IGP basic topology.
  • the sending end publishes the first information used to calculate the path.
  • the first information includes algorithm-related Metric information and/or link information.
  • the receiving end obtains different results based on different Metric calculations. Calculation results, based on the link information, exclude links that do not participate in the IGP basic topology routing calculation to avoid the link affecting the basic topology function, thereby achieving complete isolation of the basic topology and FlexAlgo topology without changing the basic topology configuration. Improve the accuracy of optimal path calculation.
  • an embodiment of the present disclosure provides a transmission processing method. Specific steps include: step 401 and step 402.
  • Step 401 The receiving end receives the first information
  • Step 402 The receiving end calculates a path based on the first information
  • the first information includes at least one of the following: (1) algorithm-related metric information; (2) link information.
  • the algorithm-related metric information includes at least one of the following: (1) algorithm identification; (2) metric type; (3) metric value.
  • the algorithm identifier is set to a first value.
  • the first value is a value outside the specified range, the link corresponding to the Metric information does not participate in the basic topology routing calculation. , for example, the first value is 0, but of course it is not limited to this;
  • the link corresponding to the metric information does not participate in the basic topology routing calculation.
  • the ISIS protocol can be set to 2 ⁇ 24-1
  • the OSPF can be set to 2 ⁇ 32-1.
  • the algorithm-related metric information is carried in the first information in the form of a first subtype length value.
  • the first subtype length value is Algorithm-Associated Generic Metric sub-TLV, Algorithm-Specific Metric sub-TLV, or Algorithm-Based Metric sub-TLV.
  • the receiving end calculates a path based on the first information, include:
  • the receiving end calculates a path based on the algorithm corresponding to the algorithm identifier, as well as the metric type and metric value.
  • the link information is carried in the first information in the form of a second subtype length value.
  • the second subtype length value is Link Excluding sub-TLV.
  • the link information is used to indicate whether the first link participates in basic topology routing calculation, and the information of the first link is included in the first link determined by the sending end according to a flexible algorithm.
  • One message One message.
  • the link information includes an indication bit.
  • the indication bit is a second value, it indicates that the first link participates in the basic topology routing calculation.
  • the indication bit is a third value, Indicates that the first link participates in basic topology routing calculations.
  • the first information when the first information includes link information, it means that the link corresponding to the first information does not participate in basic topology routing calculation; and/or, when the first information When link information is not included, it means that the link corresponding to the first information participates in basic topology routing calculation.
  • Step 501 The sending end publishes first information; wherein the first information includes at least one of the following: algorithm-related metric information; link information.
  • Step 502 The receiving end calculates a path based on the first information.
  • an embodiment of the present disclosure provides a path optimization processing device, which is applied to the sending end.
  • the device 900 includes:
  • the first sending module 901 is used to publish first information, the first information is used by the receiving end Calculate path;
  • the first information includes at least one of the following:
  • the algorithm-related metric information includes at least one of the following:
  • the algorithm identifier is set to a first value.
  • the first value is a value outside the specified range, the link corresponding to the Metric information does not participate in the basic topology routing calculation. , for example, the first value is 0, but of course it is not limited to this;
  • the link corresponding to the metric information does not participate in the basic topology routing calculation.
  • the ISIS protocol can be set to 2 ⁇ 24-1
  • the OSPF can be set to 2 ⁇ 32-1.
  • the first subtype length value is an Algorithm-Associated Generic Metric sub-TLV.
  • the device further includes:
  • the first processing module is used to determine flexible related Metric values.
  • the link information is carried in the first information in the form of a second subtype length value.
  • the second subtype length value is Link Excluding sub-TLV.
  • the link information is used to indicate that the first link participates in the basic topology, and/or does not participate in the basic topology routing calculation, and the information of the first link is included in the The first information determined by the sending end according to the flexible algorithm.
  • the link information includes an indication bit.
  • the indication bit is a second value (such as 0)
  • it indicates that the first link participates in the basic topology routing calculation.
  • the indication bit is the second value.
  • a triple value (such as 1) indicates that the first link does not participate in basic topology routing calculations.
  • the first information is carried in Interior Gateway Protocol IGP message information.
  • the first receiving module 1001 is used to receive the first information
  • the second processing module 1002 is used to calculate a path according to the first information
  • the first information includes at least one of the following:
  • the algorithm-related metric information includes at least one of the following:
  • the algorithm identifier is set to a first value. If the first value is a value outside the specified range, the link corresponding to the metric information does not participate in the basic topology routing calculation;
  • the second processing module 1002 is further configured to calculate a path according to the algorithm corresponding to the algorithm identifier, as well as the metric type and metric value.
  • the second subtype length value is Link Excluding sub-TLV.
  • the link information is used to indicate whether the first link participates in basic topology routing calculation, and the information of the first link is included in the first link determined by the sending end according to a flexible algorithm.
  • One message One message.
  • the first information when the first information includes link information, it means that the link corresponding to the first information does not participate in basic topology routing calculation; and/or when the first information does not include link information. , indicating that the link corresponding to the first information participates in basic topology routing calculation.
  • the device provided by the embodiment of the present disclosure can implement each process implemented by the method embodiment shown in Figure 4 and achieve the same technical effect. To avoid duplication, the details will not be described here.
  • an embodiment of the present disclosure also provides a communication device 1100, including a processor 1101, a memory 1102, and a program or instruction stored on the memory 1102 and executable on the processor 1101.
  • the program or instruction When executed by the processor 1101, each process of the above method embodiment in Figure 3 or Figure 4 is implemented, and the same technical effect can be achieved. To avoid repetition, they will not be repeated here.
  • Embodiments of the present disclosure also provide a readable storage medium, with programs or instructions stored on the readable storage medium.
  • program or instructions When the program or instructions are executed by a processor, each process of the method embodiment shown in Figure 3 or Figure 4 is implemented. , and can achieve the same technical effect, so to avoid repetition, they will not be described again here.
  • the processor is the processor in the terminal described in the above embodiment.
  • the readable storage media includes computer-readable storage media, such as computer read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disks or optical disks, etc.
  • embodiments of the present disclosure may be provided as methods, systems, or computer program products. Accordingly, embodiments of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, embodiments of the present disclosure may employ computer-usable storage media (including but not limited to magnetic disk storage, Compact Disc Read-Only Memory (CD-ROM), optical disks) embodying computer-usable program code therein. The form of a computer program product implemented on a memory, etc.).
  • CD-ROM Compact Disc Read-Only Memory
  • Embodiments of the disclosure are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It should be understood that this can be implemented by computer program instructions Each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams are presented. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing device produce a use A device for realizing the functions specified in one process or multiple processes of the flowchart and/or one block or multiple blocks of the block diagram.
  • These computer program instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction means, the instructions
  • the device implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram.
  • These computer program instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device.
  • Instructions provide steps for implementing the functions specified in a process or processes of a flowchart diagram and/or a block or blocks of a block diagram.

Landscapes

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

Abstract

Les modes de réalisation de la présente divulgation concernent un procédé et un appareil de traitement d'optimisation de trajet, et un dispositif et un support de stockage lisible. Le procédé comprend les étapes suivantes : une extrémité d'envoi publie des premières informations, les premières informations comprenant des informations métriques associées à un algorithme, et/ou des informations de liaison.
PCT/CN2023/085525 2022-04-01 2023-03-31 Procédé et appareil de traitement d'optimisation de trajet, et dispositif et support de stockage lisible WO2023186104A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210348021.7A CN116938785A (zh) 2022-04-01 2022-04-01 路径优化处理方法、装置、设备及可读存储介质
CN202210348021.7 2022-04-01

Publications (1)

Publication Number Publication Date
WO2023186104A1 true WO2023186104A1 (fr) 2023-10-05

Family

ID=88199492

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/085525 WO2023186104A1 (fr) 2022-04-01 2023-03-31 Procédé et appareil de traitement d'optimisation de trajet, et dispositif et support de stockage lisible

Country Status (2)

Country Link
CN (1) CN116938785A (fr)
WO (1) WO2023186104A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090285208A1 (en) * 2008-05-15 2009-11-19 Wenhu Lu Method and Apparatus for Performing a Constraint Shortest Path First Computation
CN109831382A (zh) * 2019-02-13 2019-05-31 华为技术有限公司 一种路径计算方法、装置及设备

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090285208A1 (en) * 2008-05-15 2009-11-19 Wenhu Lu Method and Apparatus for Performing a Constraint Shortest Path First Computation
CN109831382A (zh) * 2019-02-13 2019-05-31 华为技术有限公司 一种路径计算方法、装置及设备

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
C. LIN M. CHEN NEW H3C TECHNOLOGIES W. CHENG L. GONG CHINA MOBILE: "Advertisement of Dedicated Metric for Flexible Algorithm in IGP draft-lin-lsr-flex-algo-metric-00; draft-lin-lsr-flex-algo-metric-00.txt", ADVERTISEMENT OF DEDICATED METRIC FOR FLEXIBLE ALGORITHM IN IGP DRAFT-LIN-LSR-FLEX-ALGO-METRIC-00; DRAFT-LIN-LSR-FLEX-ALGO-METRIC-00.TXT; INTERNET-DRAFT: NETWORK WORKING GROUP, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOC, no. 00, 4 March 2022 (2022-03-04), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland, pages 1 - 7, XP015150571 *
CHEN R., L. GONG, W. CHEN: "Advertising Exclusive Links for Flex-Algorithm in IGP draft-gong-lsr-exclusive-link-for-flex-algo-00", IEFT. NETWORK WORKING GROUP, 8 April 2022 (2022-04-08), pages 1 - 11, XP093093842 *

Also Published As

Publication number Publication date
CN116938785A (zh) 2023-10-24

Similar Documents

Publication Publication Date Title
JP7419510B2 (ja) Ｂｉｅｒ転送項目構築方法、装置、およびシステム
CN106063203B (zh) 软件定义网络(sdn)特定拓扑信息发现
US11323366B2 (en) Path determining method, apparatus, and system
EP3414874A1 (fr) Protocole de passerelle frontière destiné à la communication parmi des unités de commande de réseau défini de logiciel
CN109729012B (zh) 一种单播报文传输方法和装置
WO2016065763A1 (fr) Procédé de synchronisation inter-domaine d'horloge, appareil et système, et support d'informations informatiques
WO2022041916A1 (fr) Procédé et appareil de traitement d'en-tête de messages, support de stockage et dispositif électronique
CN104079486A (zh) 一种网关及其传送数据的方法
WO2016188502A1 (fr) Procédé et dispositif pour fournir une notification d'informations d'ingénierie de trafic dans un réseau bier
WO2017211164A1 (fr) Procédé, appareil et système de détermination de tunnel de chemin à commutation d'étiquettes entre systèmes autonomes
US20220224631A1 (en) Routing Control Method and Apparatus
WO2021196717A1 (fr) Procédé et appareil de transmission de trafic de multidiffusion, nœud de communication et support de stockage
US20210409310A1 (en) Routing Information Sending Method, Packet Sending Method, and Related Apparatus
WO2015154427A1 (fr) Procédé de calcul de routage, et dispositif is-is trill
WO2018177273A1 (fr) Procédé et appareil de traitement sur la base d'informations de bier
WO2023186104A1 (fr) Procédé et appareil de traitement d'optimisation de trajet, et dispositif et support de stockage lisible
CN107231249B (zh) 转发节点的物理拓扑信息的获取方法、控制器和转发节点
WO2020063765A1 (fr) Procédé de création de tunnel bidirectionnel entre domaines, procédé et appareil de communication ainsi que support d'informations
CN112350936A (zh) 一种内部网关协议泛洪优化方法及装置、存储介质
WO2022228090A1 (fr) Procédé et dispositif d'apprentissage de trajet, nœud de service et support de stockage
CN111464441A (zh) 一种通信方法及装置
KR20190039596A (ko) Sfc 네트워크에서 토폴로지 정보를 동기화하기 위한 방법, 및 라우팅 네트워크 엘리먼트
US9876736B2 (en) Dual stack root based mLDP tree merge
WO2023098703A1 (fr) Procédé de notification de trajet, procédé de génération de combinaison d'algorithmes de topologie, procédé de calcul de trajet, procédé de transmission de données, dispositif électronique, et support de stockage lisible par ordinateur
WO2022267083A1 (fr) Procédés et appareil de détermination de trajet

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: 23778468

Country of ref document: EP

Kind code of ref document: A1