WO2022184100A1 - 路径建立方法、装置、存储介质及电子装置 - Google Patents

路径建立方法、装置、存储介质及电子装置 Download PDF

Info

Publication number
WO2022184100A1
WO2022184100A1 PCT/CN2022/078843 CN2022078843W WO2022184100A1 WO 2022184100 A1 WO2022184100 A1 WO 2022184100A1 CN 2022078843 W CN2022078843 W CN 2022078843W WO 2022184100 A1 WO2022184100 A1 WO 2022184100A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
policy
tlv
strategy
client
Prior art date
Application number
PCT/CN2022/078843
Other languages
English (en)
French (fr)
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 WO2022184100A1 publication Critical patent/WO2022184100A1/zh

Links

Images

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/74—Address processing for 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/24—Multipath

Definitions

  • Embodiments of the present disclosure relate to the field of communications, and in particular, to a path establishment method, device, storage medium, and electronic device.
  • Path Computation Element is a centralized path computation technology.
  • MPLS-TE and ASON/GMPLS networks in order to implement traffic engineering, it is necessary to implement constrained path computation.
  • constrained path computation In the large network environment and multi-layer and multi-domain networks, the constrained path calculation is more complicated, and there are many functional and performance limitations when applying the traditional distributed path calculation model.
  • centralized path computation can overcome the shortcomings of the distributed model and more effectively solve the problem of constrained path computation.
  • PCE technology can be applied to any TE network to provide path calculation services for the network.
  • a node in the network or a network management system may send a path calculation request message to the PCE, requesting to calculate a path that satisfies the constraint condition.
  • the PCEP protocol is used as the communication protocol [RFC 5440] between the PCE and the Path Computation Client (Path Computation Client, PCC for short), which is used by the PCC to request the PCE to calculate the path, and the PCE to return the calculation result to the PCC.
  • the PCE can be stateful or stateless.
  • the stateful PCE not only stores the network topology and resource information, but also stores the related attributes of the existing TE LSPs in the network, including the path information and priority information of each TE LSP.
  • the stateless PCE does not store TE LSP-related attribute information in the network. Stateful PCE can better calculate business optimization paths.
  • SR Policy Segment Routing Policy, segment routing policy
  • SR Policy provides a flexible forwarding path selection method to meet the different forwarding needs of users.
  • rational use of SR Policy to select the forwarding path can not only facilitate the administrator to manage and plan the network, but also effectively reduce the forwarding pressure on network devices.
  • An SR Policy is identified by a (headend, color, endpoint) triplet. On a given head node, the SR Policy is identified by a (color, endpoint) 2-tuple.
  • Candidate paths for an SR Policy represent specific ways of delivering traffic from a corresponding SR Policy headend to an endpoint.
  • Each candidate path (Candidate Path) has a preference value (Preference). The higher the preference value of the path, the more preferred it is.
  • An SR Policy has at least one candidate path, where the valid candidate path with the highest preference value is the active candidate path.
  • Each candidate path of SR Policy can be a list of one or more Segments, or it can be a composite candidate path of a set of colored SR policies. As follows:
  • the PCEP calculates multiple multi-policy paths, issues them independently through the PCEP, and then issues the multi-policy path configuration commands to the device through NETCONF , which binds multiple multi-policy paths previously issued by PCEP to one SR policy, which requires the cooperation of the two protocols, PCE and NETCONF, to realize a multi-policy path of a set of SR policies, which is complicated to implement.
  • Embodiments of the present disclosure provide a path establishment method, device, storage medium, and electronic device, so as to at least solve the problem of complicated path establishment in the related art.
  • a path establishment method including: a path calculation unit negotiating with a path calculation client to support the ability to establish a multi-strategy path; and both the path calculation unit and the path calculation client support In the case of establishing the multi-policy path, the association relationship of the multi-policy path is determined; the path calculation unit delivers the association relationship to the path calculation client.
  • a path establishment device comprising: a negotiation module, configured to negotiate a capability of supporting the establishment of a multi-strategy path between the path calculation unit and the path calculation client; When both the computing unit and the path computing client support the establishment of the multi-strategy path, determine the association relationship of the multi-strategy path; the sending module is configured to send the path computing unit to the path computing client the associated relationship.
  • a computer-readable storage medium where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute any one of the above methods when running steps in the examples.
  • an electronic device comprising a memory and a processor, wherein the memory stores a computer program, the processor is configured to run the computer program to execute any of the above Steps in Method Examples.
  • the path calculation unit and the path calculation client negotiate the ability to support the establishment of multi-strategy paths, and in the case that both the path calculation unit and the path calculation client support the establishment of multi-strategy paths, determine the association relationship of the multi-strategy paths, and pass
  • the path calculation unit delivers the association relationship to the path calculation client. Since the path calculation unit and the path calculation client both support the establishment of multi-strategy paths, a multi-strategy path can be established directly with the path calculation client without the coordination of other protocols. Therefore, the implementation path existing in the related art can be solved. Establish more complex problems to achieve the effect of simplifying the path establishment process.
  • FIG. 1 is a block diagram of a hardware structure of a mobile terminal according to a path establishment method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a path establishment method according to an embodiment of the present disclosure
  • FIG. 3 is an expanded schematic diagram of a MULTIPATH-CAP TLV according to an exemplary embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of a format of carrying a multi-strategy path association relationship in a PATH-ATTRIB Objec according to an exemplary embodiment of the present disclosure
  • FIG. 5 is a structural block diagram of a path establishment apparatus according to an embodiment of the present disclosure.
  • FIG. 1 is a hardware structural block diagram of a mobile terminal according to a path establishment method according to an embodiment of the present disclosure.
  • the mobile terminal may include one or more (only one is shown in FIG. 1 ) processor 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, wherein the above-mentioned mobile terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA
  • a memory 104 for storing data
  • the above-mentioned mobile terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • FIG. 1 is only a schematic diagram, which does not limit the structure of the above-mentioned mobile terminal.
  • the mobile terminal may also include more or fewer components than those shown in FIG. 1 , or have a different configuration than that shown in FIG. 1 .
  • the memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as computer programs corresponding to the path establishment method in the embodiments of the present disclosure. A functional application and data processing are implemented, namely, the above-mentioned method is implemented.
  • Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory located remotely from the processor 102, and these remote memories may be connected to the mobile terminal through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • Transmission device 106 is used to receive or transmit data via a network.
  • the specific example of the above-mentioned network may include a wireless network provided by a communication provider of the mobile terminal.
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), which can be connected to other network devices through a base station so as to communicate with the Internet.
  • the transmission device 106 may be a radio frequency (Radio Frequency, RF for short) module, which is used to communicate with the Internet in a wireless manner.
  • RF Radio Frequency
  • FIG. 2 is a flowchart of a method for establishing a path according to an embodiment of the present disclosure. As shown in FIG. 2 , the flowchart includes the following steps:
  • Step S202 the path calculation unit negotiates with the path calculation client to support the ability to establish a multi-strategy path;
  • Step S204 in the case that both the path calculation unit and the path calculation client support the establishment of the multi-strategy path, determine the association relationship of the multi-strategy path;
  • Step S206 the path calculation unit delivers the association relationship to the path calculation client.
  • the path calculation client may be the first node included in the PCC nodes of multiple path calculation clients in the network.
  • the negotiation support between the head node (PCC) and the PCE has the ability to establish.
  • the association relationship of the multi-policy paths can be determined. After the association relationship of the multi-strategy paths is determined, the association relationship can be sent to the path calculation client through the path calculation unit.
  • the association relationship of the multi-strategy paths can be determined by the path calculation unit, and the association relationship of the multi-strategy paths can also be determined by the path calculation client.
  • the execution body of the above steps may be a path calculation unit PCE, etc., but is not limited thereto.
  • the PCE may be a separate deployment entity or a controller embedded module.
  • the path calculation unit and the path calculation client negotiate the ability to support the establishment of multi-strategy paths, and in the case that both the path calculation unit and the path calculation client support the establishment of multi-strategy paths, determine the association relationship of the multi-strategy paths, and pass
  • the path calculation unit delivers the association relationship to the path calculation client. Since both the path calculation unit and the path calculation client support the establishment of multi-strategy paths, they can directly establish a multi-strategy path with the target path calculation client without the coordination of other protocols. Therefore, the implementation paths existing in the related art can be solved. Establish more complex problems to achieve the effect of simplifying the path establishment process.
  • the negotiating between the path calculation unit and the path calculation client to support the ability to establish a multi-strategy path includes: the path calculation unit and the path calculation client negotiate with the path calculation client to establish a multi-strategy path by sending a target object, wherein, The target object carries indication information used to indicate the capability of supporting the establishment of a multi-policy path.
  • the path calculation unit and the path calculation client can negotiate and establish a multi-strategy path by sending the target object.
  • the target object may be an OPEN object and/or an LSP object. It should be noted that the OPEN object may be the object carried in the OPEN message, and the LSP object may be the object carried in PCRpt, PCUpd, PCReq and PCRep.
  • the negotiation between the path calculation unit and the path calculation client to establish a multi-strategy path by sending a target object includes: defining a path calculation unit and/or the path calculation client to support A multi-policy path TLV capable of establishing a multi-policy path, carrying the multi-policy path TLV in the target object, and the path calculation unit and the path calculation client are based on the The target object negotiates to establish a multi-strategy path; or, a new bit is defined in the multipath type length value MULTIPATH-CAP TLV included in the target object, wherein the bit is used to identify the path calculation unit and/or Or the path calculation client supports the capability of establishing a multi-policy path, and the path calculation unit and the path calculation client negotiate and establish a multi-policy path based on the bits defined in the MULTIPATH-CAP TLV.
  • a multi-policy path TLV that identifies the capability of the multi-policy path may be established in the PCC and/or the PCE, and the multi-policy path TLV is borne in the target object.
  • the target object is an OPEN object
  • the PCE and the PCC can identify whether the other party supports the ability to establish a multi-policy path by sending an OPEN message. That is, the capability of establishing a multi-policy path can be carried in the OPEN message.
  • a bit can also be extended through the MULTIPATH-CAP TLV in the OPEN message to identify the TLV that supports the multi-policy path, so that the negotiation between the PCC and the PCE can support the ability to establish a multi-policy path.
  • the PCE When the PCE receives the OPEN message, it can identify whether a bit is extended in the MULTIPATH-CAP TLV in the OPEN message. When a bit is extended in the MULTIPATH-CAP TLV, it establishes a multi-policy path with the PCC.
  • the specific process is as follows:
  • the PCE may send an OPEN message to PCC(1) to PCC(n), where the OPEN message carries the MULTIPATH-CAP TLV of the extended Cbit.
  • the extended schematic diagram of the MULTIPATH-CAP TLV can be seen in Fig. 3.
  • the C bit is defined in the MULTIPATH-CAP TLV, and the C bit is used to declare whether the capability of the multi-strategy path TLV is supported.
  • Both PCE and PCC need to check the MULTIPATH-CAP TLV in the received OPEN message, and further confirm that it includes the C bit. Only when both parties support the multi-policy path function, the negotiation result allows the establishment of multi-policy between PCE and PCC. path.
  • determining the association relationship of the multi-policy paths includes: carrying the path information of the parent policy path in the SRPOLICY-POL-ID TLV; carrying the path information of the child policy path in the policy path TLV extended in the target message Path information; wherein the association relationship includes the parent policy path and the child policy path, and the parent policy path includes at least one of the child policy paths.
  • the creation and modification of the multi-policy path is initiated through the PCE.
  • the target message is a PCInitiate message and the controller or the upper-layer application needs to create a multi-policy path
  • the PCE can initiate the creation and modification of the multi-policy path through the extended PCEP message. create.
  • PCC(1) is the head node (A endpoint) of the SR multi-strategy path
  • PCC(n) is the tail node (Z endpoint) of the SR multi-strategy path.
  • the PCE can send the association relationship of the multi-policy path to the PCC through the PCInitiate message, and bind multiple SR POLICYs into a group. Embed the information of each SR POLICY and the information of the groups bound by multiple SR POLICYs into the PCInitiate message.
  • the SRPOLICY-POL-ID TLV may carry parent SR policy path information, and one SR policy may include at least one child policy path.
  • Sub-SR policy information can be carried in PATH ATTRIB OBJECT.
  • the target message may also be a PCRpt message.
  • the path calculation client may send to the PCE a PCRpt message that carries the association relationship of the PCC multi-strategy path, and the association relationship of the PCC multi-strategy path
  • the purpose is to bind multiple SR POLICYs in a group.
  • the identity of this group is that the parent SR POLICY can be carried in the SRPOLICY-POL-ID TLV, and a new Compositepath TLV can be extended in the PATH-ATTRIB Object.
  • the Composite path TLV is used to identify multiple child SR policies (sub-policy paths).
  • the method further includes: if the parent policy path includes multiple child policy paths, determining weight information corresponding to the multiple child policy paths; The weight information is carried in the expanded weight TLV in the message, where the weight TLV is adjacent to the policy path TLV.
  • a new Composite path TLV can be extended in the PATH-ATTRIB Object.
  • the Composite path TLV is used to identify multiple sub-SR-policies, and one path-attrib object carries one or more sub-SR-policy and related weights information.
  • the target message is a PCInitiate message
  • the expanded PCInitiate message is as follows:
  • a new Composite path TLV can be extended in the existing PATH-ATTRIB Object.
  • the Composite path TLV is used to identify multiple sub-SR-policy, and a path-attrib object carries one or more sub-SR-policy and related weight information.
  • the weight information may be carried in the weight TLV, which is immediately followed by the multi-policy path TLV (corresponding to the policy path TLV).
  • the schematic diagram of the association format of carrying multi-policy paths in PATH-ATTRIB Objec can be seen in Figure 4. As shown in Figure 4, ⁇ source, color, endpoint> in Figure 4 is used to identify a sub-SR policy path. If there are multiple sub-SR policy paths, TLVs that carry multiple policy paths are required.
  • the parent SR-policy information can be carried in the SRPOLICY-POL-ID TLV, which does not require protocol extension.
  • the method further includes: when it is determined that the sub-policy path includes a protection path, carrying a B bit in the policy path TLV, where the B bit is used for Identifying that the sub-policy path is a protection path, and protecting the main policy path corresponding to the sub-policy path.
  • the Bbit bit in the multi-policy path TLV i.e., the policy path TLV, can carry the B bit to identify the sub-SR policy path as a protection path, and to protect the main policy path corresponding to the protection sub-SR policy path.
  • the target message includes at least one of the following: a PCInitiate message, a PCRpt message, and a PC update message.
  • the target message may be a PCInitiate message, a PCRpt message, or a PC update message, but not limited to this.
  • the stateful PCE can actively establish and delete an LSP.
  • the PCE delivers the deletion of the association relationship of the multi-policy path to the PCC through the PCInitiate message with the Rbit bit (deletion flag) set.
  • the ability to create an SR multi-policy path can be negotiated through the extended PCE protocol, and the creation, modification and deletion of the multi-policy path can be initiated.
  • the ability to create SR multi-policy paths through open message negotiation.
  • the ability to establish a multi-strategy path is negotiated by carrying the multi-strategy path information in the open message; the flag bit in the MULTIPATH-CAP TLV in the open message can be extended to identify the ability to support the multi-strategy path.
  • the creation, modification and deletion of multi-policy paths can also be initiated through the PCE protocol.
  • the extended multi-policy path TLV carries one or more sub-SR policy messages.
  • Multi-policy path TLV can be carried in PCInitiate message, PCRpt message, PC update and other messages.
  • the identity of this group is carried by the parent SR POLICY in the SRPOLICY-POL-ID TLV, and a new Composite path TLV can be extended in the PATH-ATTRIB Object.
  • the Composite path TLV is used to identify multiple child SR-policy, and each child SR policy path requires There is relevant weight information, the weight information is carried in the weight TLV, and the weight TLV follows the multi-strategy path TLV.
  • the Bbit bit in the TLV of the multi-policy path is used to identify whether the sub-SR policy path can be used to protect the sub-SR policy path.
  • a path establishment apparatus is also provided, and the apparatus is used to implement the above-mentioned embodiments and preferred implementation manners, and what has been described will not be repeated.
  • the term "module” may be a combination of software and/or hardware that implements a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, implementations in hardware, or a combination of software and hardware, are also possible and contemplated.
  • FIG. 5 is a structural block diagram of an apparatus for establishing a path according to an embodiment of the present disclosure. As shown in FIG. 5 , the apparatus includes:
  • the negotiation module 52 is configured to negotiate the capability of supporting the establishment of multi-strategy paths between the path calculation unit and the path calculation client;
  • the determining module 54 is configured to determine the association relationship of the multi-strategy paths when both the path computing unit and the path computing client support the establishment of the multi-strategy paths;
  • the sending module 56 is configured for the path calculation unit to deliver the association relationship to the path calculation client.
  • the negotiation module 52 includes: a negotiation unit, configured to negotiate the path calculation unit and the path calculation client to establish a multi-strategy path by sending a target object, wherein the target object carries Indication information used to indicate the ability to support the establishment of multi-policy paths.
  • the negotiation module 52 includes: a first negotiation sub-unit, configured to define a multiplicity of parameters for identifying the capability of the path computation unit and/or the path computation client to support the establishment of multi-policy paths a policy path TLV, which carries the multi-policy path TLV in the target object, and the path calculation unit and the path calculation client negotiate to establish a multi-policy path based on the target object carrying the multi-policy path TLV; Or, a second negotiation subunit, used to define a new bit in the multipath type length value MULTIPATH-CAP TLV included in the target object, wherein the bit is used to identify the path calculation unit and/or Or the path calculation client supports the capability of establishing a multi-policy path, and the path calculation unit and the path calculation client negotiate and establish a multi-policy path based on the bits defined in the MULTIPATH-CAP TLV.
  • a first negotiation sub-unit configured to define a multiplicity of parameters for identifying the capability of the path computation unit and/or the path computation client
  • the determining module 54 includes: a first carrying unit configured to carry the path information of the parent policy path in the SRPOLICY-POL-ID TLV; a first extension unit configured to extend the target message
  • the TLV of the policy path carries the path information of the child policy path; wherein the association relationship includes the parent policy path and the child policy path, and the parent policy path includes at least one of the child policy paths.
  • the determining module 54 further includes: a determining unit, configured to determine the corresponding sub-policy paths under the condition that the parent policy path includes multiple sub-policy paths. weight information; a second extension unit, configured to carry the weight information in the weight TLV extended in the target message, wherein the weight TLV is adjacent to the policy path TLV.
  • the determining module 54 further includes: a second carrying unit, configured to carry a B bit in the policy path TLV when it is determined that the sub-policy path includes a protection path, Wherein, the B bit is used to identify that the sub-policy path is a protection path, and protect the main policy path corresponding to the sub-policy path.
  • the target message includes at least one of the following: a PCInitiate message, carried in a PCRpt message, and PC update.
  • the above modules can be implemented by software or hardware, and the latter can be implemented in the following ways, but not limited to this: the above modules are all located in the same processor; or, the above modules can be combined in any combination The forms are located in different processors.
  • Embodiments of the present disclosure also provide a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute the steps in any one of the above method embodiments when running.
  • the above-mentioned computer-readable storage medium may include, but is not limited to, a USB flash drive, a read-only memory (Read-Only Memory, referred to as ROM for short), and a random access memory (Random Access Memory, referred to as RAM for short) , mobile hard disk, magnetic disk or CD-ROM and other media that can store computer programs.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • An embodiment of the present disclosure also provides an electronic device, including a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
  • the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.
  • modules or steps of the present disclosure can be implemented by a general-purpose computing device, and they can be centralized on a single computing device or distributed in a network composed of multiple computing devices
  • they can be implemented in program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, can be performed in a different order than shown here.
  • the described steps, or they are respectively made into individual integrated circuit modules, or a plurality of modules or steps in them are made into a single integrated circuit module to realize.
  • the present disclosure is not limited to any particular combination of hardware and software.

Landscapes

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

Abstract

本公开实施例提供了一种路径建立方法、装置、存储介质及电子装置，其中，该方法包括：路径计算单元与路径计算客户端协商支持建立多策略路径的能力；在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；所述路径计算单元向所述路径计算客户端下发所述关联关系。通过本公开，解决了相关技术中存在的实现路径建立较为复杂的问题，达到简化路径建立过程的效果。

Description

路径建立方法、装置、存储介质及电子装置
相关申请的交叉引用
本公开基于2021年03月04日提交的发明名称为“路径建立方法、装置、存储介质及电子装置”的中国专利申请CN202110242097.7，并且要求该专利申请的优先权，通过引用将其所公开的内容全部并入本公开。
技术领域
本公开实施例涉及通信领域，具体而言，涉及一种路径建立方法、装置、存储介质及电子装置。
背景技术
路径计算单元(Path Computation Element，简称为PCE)是一种集中式路径计算技术，在MPLS-TE和ASON/GMPLS网络中，为了实现流量工程，需要实现约束路径计算。在大网环境以及多层、多域的网络中，约束路径计算比较复杂，在应用传统的分布式路径计算模型时，存在较多的功能和性能限制。在这种场景下，集中式路径计算可以克服分布式模型的缺点，更有效地解决约束路径计算的问题。
PCE技术可应用于任何TE网络中，为网络提供路径计算服务。网络中的节点或者网管系统可以向PCE发送路径计算请求消息，请求计算满足约束条件的路径。PCE和路径计算客户(Path Computation Client，简称PCC)之间采用PCEP协议作为通信协议[RFC 5440]，用于PCC请求PCE计算路径，以及PCE返回计算结果给PCC。
PCE可以是有状态的，也可以是无状态的。有状态的PCE上不仅保存了网络拓扑和资源信息，还保存了网络中的现有TE LSP的相关属性，包括每条TE LSP的路径信息、优先级信息等。无状态的PCE上没有保存网络中的TE LSP相关属性信息。有状态的PCE，可以更好的计算业务优化路径。
SR Policy(Segment Routing Policy，段路由策略)提供了灵活的转发路径选择方法，满足用户不同的转发需求。当Segment Routing网络的源节点和目的节点之间存在多条路径时，合理利用SR Policy选择转发路径，不仅可以方便管理员对网络进行管理和规划，还可以有效地减轻网络设备的转发压力。
SR Policy由(头端，颜色，端点)三元组标识。在给定的头端节点上，SR Policy由(颜色，端点)二元组标识。SR Policy的候选路径代表将流量从相应SR Policy头端传送到端点的特定方式。每条候选路径(Candidate Path)有一个偏好值(Preference)。路径的偏好值越高则越优选。SR Policy具有至少一条候选路径，其中具有最高偏好值的有效候选路径是活动候选路径。SR Policy的每条候选路径可以是一个或者多个Segment列表，也可以是一组带有颜色的SR策略的复合候选路径。如下面：
Figure PCTCN2022078843-appb-000001
当SR Policy的候选路径是带有颜色的SR策略的复合候选路径时，在相关技术中，PCEP计算多条多策略路径，通过PCEP独自下发，再通过NETCONF给设备下发多策略路径配置命令，将之前PCEP下发的多个多策略路径绑定到一个SR policy中,这样需要PCE和NETCONF两个协议进行协同两种协议配合才能实现一组SR策略的多策略路径，实现较为复杂。
由此可知，相关技术中存在实现路径建立较为复杂的问题。
针对相关技术中存在的上述问题，目前尚未提出有效的解决方案。
发明内容
本公开实施例提供了一种路径建立方法、装置、存储介质及电子装置，以至少解决相关技术中存在实现路径建立较为复杂的问题。
根据本公开的一个实施例，提供了一种路径建立方法，包括：路径计算单元与路径计算客户端协商支持建立多策略路径的能力；在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；所述路径计算单元向所述路径计算客户端下发所述关联关系。
根据本公开的另一个实施例，提供了一种路径建立装置，包括：协商模块，设置为路径计算单元与路径计算客户端协商支持建立多策略路径的能力；确定模块，设置为在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；发送模块，设置为所述路径计算单元向所述路径计算客户端下发所述关联关系。
根据本公开的又一个实施例，还提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本公开的又一个实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述任一项方法实施例中的步骤。
通过本公开，路径计算单元与路径计算客户端协商支持建立多策略路径的能力，在路径计算单元与路径计算客户端均支持建立多策略路径的情况下，确定多策略路径的关联关系，并通过路径计算单元向路径计算客户端下发关联关系。由于可以在路径计算单元与路径计算客户端均支持建立多策略路径的情况下，直接与路径计算客户端建立多策略路径，无需其他协议的配和，因此，可以解决相关技术中存在的实现路径建立较为复杂的问题，达到简化路径建立过程的效果。
附图说明
图1是本公开实施例的一种路径建立方法的移动终端的硬件结构框图；
图2是根据本公开实施例的路径建立方法的流程图；
图3是根据本公开示例性实施例的MULTIPATH-CAP TLV的扩展示意图；
图4是根据本公开示例性实施例的在PATH-ATTRIB Objec中携带多策略路径关联关系格式示意图；
图5是根据本公开实施例的路径建立装置的结构框图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开的实施例。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例中所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。以运行在移动终端上为例，图1是本公开实施例的一种路径建立方法的移动终端的硬件结构框图。如图1所示，移动终端可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)和用于存储数据的存储器104，其中，上述移动终端还可以包括用于通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述移动终端的结构造成限定。例如，移动终端还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可用于存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的路径建立方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输设备106用于经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端的通信供应商提供的无线网络。在一个实例中，传输设备106包括一个网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输设备106可以为射频(Radio Frequency，简称为RF)模块，其用于通过无线方式与互联网进行通讯。
在本实施例中提供了一种路径建立方法，图2是根据本公开实施例的路径建立方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，路径计算单元与路径计算客户端协商支持建立多策略路径的能力；
步骤S204，在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；
步骤S206，所述路径计算单元向所述路径计算客户端下发所述关联关系。
在上述实施例中路径计算客户端可以为网络中多个路径计算客户端PCC节点中包括的首节点。首节点(PCC)与PCE之间协商支持具有建立的能力，在路径计算单元PCE和路径计算客户端PCC均支持建立多策略路径的情况下，可以确定出多策略路径的关联关系。在确定多策略路径的关联关系后，可以通过路径计算单元将关联关系发送给路径计算客户端。
在上述实施例中，可以由路径计算单元确定多策略路径的关联关系，也可以由路径计算 客户端确定出多策略路径的关联关系。
其中，上述步骤的执行主体可以为路径计算单元PCE等，但不限于此。当上述步骤的执行主体为PCE时，PCE可以为单独部署实体或者控制器内嵌模块。
通过本公开，路径计算单元与路径计算客户端协商支持建立多策略路径的能力，在路径计算单元与路径计算客户端均支持建立多策略路径的情况下，确定多策略路径的关联关系，并通过路径计算单元向路径计算客户端下发关联关系。由于在路径计算单元与路径计算客户端均支持建立多策略路径的情况下，直接与目标路径计算客户端建立多策略路径，无需其他协议的配和，因此，可以解决相关技术中存在的实现路径建立较为复杂的问题，达到简化路径建立过程的效果。
在一个示例性实施例中，路径计算单元与路径计算客户端协商支持建立多策略路径的能力包括：所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径，其中，所述目标对象中携带用于指示支持建立多策略路径的能力的指示信息。在本实施例中，路径计算单元与路径计算客户端可以通过发送目标对象来协商建立多策略路径。其中，目标对象可以为OPEN对象和/或LSP对象，需要说明的是，OPEN对象可以是携带在OPEN消息中的对象，LSP对象可以是携带在PCRpt,PCUpd,PCReq和PCRep中的对象。
在一个示例性实施例中，所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径包括：定义用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力的多策略路径TLV，将所述多策略路径TLV承载在所述目标对象中，所述路径计算单元与所述路径计算客户端基于承载所述多策略路径TLV的所述目标对象协商建立多策略路径；或者，在所述目标对象中包括的多路径类型长度值MULTIPATH-CAP TLV中定义新的bit位，其中，所述bit位用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力，所述路径计算单元与所述路径计算客户端基于所述MULTIPATH-CAP TLV中定义的所述bit位协商建立多策略路径。在本实施例中，可以在PCC和/或PCE中建立标识多策略路径的能力的多策略路径TLV，将多策略路径TLV承载在目标对象中。例如，当目标对象为OPEN对象时，PCE与PCC可以通过发送OPEN消息识别对方是否支持建立多策略路径的能力。即可以在OPEN消息中携带建立多策略路径的能力。当然，还可以通过OPEN消息中的MULTIPATH-CAP TLV扩展一个bit位用于标识支持多策略路径TLV，从而实现PCC与PCE之间协商支持具有建立多策略路径的能力。PCE在接收到OPEN消息的情况下，可以识别OPEN消息中的MULTIPATH-CAP TLV中是否扩展了一个bit位，当MULTIPATH-CAP TLV中扩展了一个bit位的情况下，与PCC建立多策略路径。具体过程如下：
PCE可以向PCC(1)～PCC(n)发出OPEN消息，其中，OPEN消息中携带扩展Cbit的MULTIPATH-CAP TLV。该MULTIPATH-CAP TLV的扩展示意图可参见附图3，如图3所示，MULTIPATH-CAP TLV中定义了C位，C位用于声明是否支持多策略路径TLV的能力。PCE和PCC都需要检查接收到的OPEN消息中的MULTIPATH-CAP TLV，并且进一步确认其中包括C位，只有当双方都支持多策略路径功能时，协商结果才允许在PCE和PCC之间建立多策略路径。
在一个示例性实施例中，确定所述多策略路径的关联关系包括：在SRPOLICY-POL-ID TLV中携带父策略路径的路径信息；在目标消息中扩展的策略路径TLV中携带子策略路径的路径信息；其中，所述关联关系中包括所述父策略路径以及所述子策略路径，所述父策略路径下包括至少一个所述子策略路径。在本实施例中，通过PCE发起多策略路径的创建和修改，当 目标消息为PCInitiate消息，且控制器或者上层应用程序需要创建多策略路径时，PCE可以通过扩展的PCEP消息发起多策略路径的创建。例如，PCC(1)为SR多策略路径的头节点(A端点)，PCC(n)为SR多策略路径的尾节点(Z端点)。PCE可以通过PCInitiate消息下发给PCC多策略路径的关联关系，将多个SR POLICY绑定在一个组里。将各个SR POLICY的信息以及多个SR POLICY绑定的组的信息嵌入至PCInitiate消息中。例如，可以在SRPOLICY-POL-ID TLV中携带父SR policy路径信息，一个SR policy中可以包括至少一个子策略路径。子SR policy信息可以携带在PATH ATTRIB OBJECT中。
在上述实施例中，目标消息还可以为PCRpt消息，当目标消息为PCRpt消息时，可以由路径计算客户端向PCE发送携带PCC多策略路径的关联关系的PCRpt消息，PCC多策略路径的关联关系的目的是将多个SR POLICY绑定在一个组里。这个组的标识是父SR POLICY可以在SRPOLICY-POL-ID TLV中携带，可以在PATH-ATTRIB Object中扩展新的Compositepath TLV，Composite path TLV用于标识多个子SR policy(子策略路径)。
在一个示例性实施例中，所述方法还包括：在所述父策略路径下包括多个所述子策略路径的情况下，确定多个所述子策略路径对应的权重信息；在所述目标消息中扩展的权重TLV中携带所述权重信息，其中，所述权重TLV与所述策略路径TLV相邻。在本实施例中，可以在的PATH-ATTRIB Object中扩展新的Composite path TLV，Composite path TLV用于标识多个子SR-policy，一个path-attrib object携带一个或者多个子SR-policy及相关的权重信息。当目标消息为PCInitiate消息时，扩展后的的PCInitiate消息如下：
Figure PCTCN2022078843-appb-000002
Figure PCTCN2022078843-appb-000003
即可以现有的PATH-ATTRIB Object中扩展新的Composite path TLV，Composite path TLV用于标识多个子SR-policy，一个path-attrib object携带一个或者多个子SR-policy及相关的权重信息。权重信息可以在权重TLV中携带，权重TLV紧跟着多策略路径TLV(对应于策略路径TLV)。其中，在PATH-ATTRIB Objec中携带多策略路径关联关系格式示意图可参见附图4，如图4所示，图4中的<source,color,endpoint>用于标识一条子SR policy路径，如果有多个子SR policy路径，那么需要携带多个策略路径的TLV。需要说明的是，父SR-policy信息可以携带在SRPOLICY-POL-ID TLV中携带，这部分不需要协议扩展。
在一个示例性实施例中，所述方法还包括：在确定所述子策略路径中包括保护路径的情况下，在所述策略路径TLV中携带B bit位，其中，所述B bit位用于标识所述子策略路径是保护路径，并保护所述子策略路径对应的主策略路径。在本实施例中，可以在多策略路径TLV中的Bbit位，即策略路径TLV中携带B bit位，以标识子SR policy路径是保护路径，并保护保护子SR policy路径对应的主策略路径。
在一个示例性实施例中，所述目标消息包括以下至少之一：PCInitiate消息，PCRpt消息，PC update消息。在本实施例中，目标消息可以为PCInitiate消息，也可以为PCRpt消息，还可以为PC update消息，但不限于此。
在一个示例性实施例中，当PCE为有状态PCE的情况下，有状态PCE可以主动建立与删除LSP的场景下。该场景下PCE通过设置Rbit位(删除标识)的PCInitiate消息向PCC下发多策略路径的关联关系的删除。
在前述实施例中，PCC与PCE建立会话的过程中，可以通过扩展的PCE协议协商创建SR多策略路径的能力并发起多策略路径的创建和修改及删除操作。例如，通过open消息协商创建SR多策略路径的能力。通过open消息携带多策略路径信息来协商建立多策略路径的能力；可以扩展open消息中的MULTIPATH-CAP TLV中的flag标识位用于标识支持多策略路径的能力。还可以通过PCE协议发起多策略路径的创建和修改及删除操作。例如，扩展多策略路径TLV携带一个或多个子SR policy消息。多策略路径TLV可以在PCInitiate消息，PCRpt消息中携带，PC update等消息中携带。这个组的标识是父SR POLICY在SRPOLICY-POL-ID TLV中携带，可以在PATH-ATTRIB Object中扩展新的Composite path TLV，Composite path TLV用于标识多个子SR-policy，每个子SR policy路径需要有相关的权重信息，权重信息的携带在权重TLV中携带，权重TLV紧跟着多策略路径TLV。另外，多策略路径的TLV中的Bbit位用于标识此子SR policy路径是否是可以用于保护子SR policy路径。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡 献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
在本实施例中还提供了一种路径建立装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图5是根据本公开实施例的路径建立装置的结构框图，如图5所示，该装置包括：
协商模块52，设置为路径计算单元与路径计算客户端协商支持建立多策略路径的能力；
确定模块54，设置为在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；
发送模块56，设置为所述路径计算单元向所述路径计算客户端下发所述关联关系。
在一个示例性实施例中，所述协商模块52包括：协商单元，设置为所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径，其中，所述目标对象中携带用于指示支持建立多策略路径的能力的指示信息。
在一个示例性实施例中，所述协商模块52包括：第一协商子单元，设置为定义用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力的多策略路径TLV，将所述多策略路径TLV承载在所述目标对象中，所述路径计算单元与所述路径计算客户端基于承载所述多策略路径TLV的所述目标对象协商建立多策略路径；或者，第二协商子单元，用于在所述目标对象中包括的多路径类型长度值MULTIPATH-CAP TLV中定义新的bit位，其中，所述bit位用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力，所述路径计算单元与所述路径计算客户端基于所述MULTIPATH-CAP TLV中定义的所述bit位协商建立多策略路径。
在一个示例性实施例中，所述确定模块54包括：第一携带单元，设置为在SRPOLICY-POL-ID TLV中携带父策略路径的路径信息；第一扩展单元，设置为在目标消息中扩展的策略路径TLV中携带子策略路径的路径信息；其中，所述关联关系中包括所述父策略路径以及所述子策略路径，所述父策略路径下包括至少一个所述子策略路径。
在一个示例性实施例中，所述确定模块54还包括：确定单元，设置为在所述父策略路径下包括多个所述子策略路径的情况下，确定多个所述子策略路径对应的权重信息；第二扩展单元，设置为在所述目标消息中扩展的权重TLV中携带所述权重信息，其中，所述权重TLV与所述策略路径TLV相邻。
在一个示例性实施例中，所述确定模块54还包括：第二携带单元，设置为在确定所述子策略路径中包括保护路径的情况下，在所述策略路径TLV中携带B bit位，其中，所述B bit位用于标识所述子策略路径是保护路径，并保护所述子策略路径对应的主策略路径。
在一个示例性实施例中，所述目标消息包括以下至少之一：PCInitiate消息，PCRpt消息中携带，PC update。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合 的形式分别位于不同的处理器中。
本公开的实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (16)

  1. 一种路径建立方法，包括：
    路径计算单元与路径计算客户端协商支持建立多策略路径的能力；
    在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；
    所述路径计算单元向所述路径计算客户端下发所述关联关系。
  2. 根据权利要求1所述的方法，其中，路径计算单元与路径计算客户端协商支持建立多策略路径的能力包括：
    所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径，其中，所述目标对象中携带用于指示支持建立多策略路径的能力的指示信息。
  3. 根据权利要求2所述的方法，其中，所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径包括：
    定义用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力的多策略路径TLV，将所述多策略路径TLV承载在所述目标对象中，所述路径计算单元与所述路径计算客户端基于承载所述多策略路径TLV的所述目标对象协商建立多策略路径；或者，
    在所述目标对象中包括的多路径类型长度值MULTIPATH-CAP TLV中定义新的bit位，其中，所述bit位用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力，所述路径计算单元与所述路径计算客户端基于所述MULTIPATH-CAP TLV中定义的所述bit位协商建立多策略路径。
  4. 根据权利要求1所述的方法，其中，确定所述多策略路径的关联关系包括：
    在SRPOLICY-POL-ID TLV中携带父策略路径的路径信息；
    在目标消息中扩展的策略路径TLV中携带子策略路径的路径信息；
    其中，所述关联关系中包括所述父策略路径以及所述子策略路径，所述父策略路径下包括至少一个所述子策略路径。
  5. 根据权利要求4所述的方法，其中，所述方法还包括：
    在所述父策略路径下包括多个所述子策略路径的情况下，确定多个所述子策略路径对应的权重信息；
    在所述目标消息中扩展的权重TLV中携带所述权重信息，其中，所述权重TLV与所述策略路径TLV相邻。
  6. 根据权利要求4所述的方法，其中，所述方法还包括：
    在确定所述子策略路径中包括保护路径的情况下，在所述策略路径TLV中携带B bit位，其中，所述B bit位用于标识所述子策略路径是保护路径，并保护所述子策略路径对应的主策略路径。
  7. 根据权利要求4所述的方法，其中，所述目标消息包括以下至少之一：PCInitiate消息，PCRpt消息，PC update消息。
  8. 一种路径建立装置，包括：
    协商模块，设置为路径计算单元与路径计算客户端协商支持建立多策略路径的能力；
    确定模块，设置为在所述路径计算单元与所述路径计算客户端均支持建立所述多策略路径的情况下，确定所述多策略路径的关联关系；
    发送模块，设置为所述路径计算单元向所述路径计算客户端下发所述关联关系。
  9. 根据权利要求8所述的装置，其中，所述协商模块包括：
    协商单元，设置为所述路径计算单元与所述路径计算客户端通过发送目标对象协商建立多策略路径，其中，所述目标对象中携带用于指示支持建立多策略路径的能力的指示信息。
  10. 根据权利要求9所述的装置，其中，所述协商单元包括：
    第一协商子单元，设置为定义用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力的多策略路径TLV，将所述多策略路径TLV承载在所述目标对象中，所述路径计算单元与所述路径计算客户端基于承载所述多策略路径TLV的所述目标对象协商建立多策略路径；或者，
    第二协商子单元，设置为在所述目标对象中包括的多路径类型长度值MULTIPATH-CAP TLV中定义新的bit位，其中，所述bit位用于标识所述路径计算单元和/或所述路径计算客户端支持建立多策略路径的能力，所述路径计算单元与所述路径计算客户端基于所述MULTIPATH-CAP TLV中定义的所述bit位协商建立多策略路径。
  11. 根据权利要求8所述的装置，其中，所述确定模块包括：
    第一携带单元，设置为在SRPOLICY-POL-ID TLV中携带父策略路径的路径信息；
    第一扩展单元，设置为在目标消息中扩展的策略路径TLV中携带子策略路径的路径信息；
    其中，所述关联关系中包括所述父策略路径以及所述子策略路径，所述父策略路径下包括至少一个所述子策略路径。
  12. 根据权利要求11所述的装置，其中，所述确定模块还包括：
    确定单元，设置为在所述父策略路径下包括多个所述子策略路径的情况下，确定多个所述子策略路径对应的权重信息；
    第二扩展单元，设置为在所述目标消息中扩展的权重TLV中携带所述权重信息，其中，所述权重TLV与所述策略路径TLV相邻。
  13. 根据权利要求11所述的装置，其中，所述确定模块还包括：
    第二携带单元，设置为在确定所述子策略路径中包括保护路径的情况下，在所述策略路径TLV中携带B bit位，其中，所述B bit位用于标识所述子策略路径是保护路径，并保护所述子策略路径对应的主策略路径。
  14. 根据权利要求11所述的装置，其中，所述目标消息包括以下至少之一：PCInitiate消息，PCRpt消息，PC update消息。
  15. 一种计算机可读存储介质，其中，所述计算机可读存储介质中存储有计算机程序， 其中，所述计算机程序被处理器执行时实现所述权利要求1至7任一项中所述的方法的步骤。
  16. 一种电子装置，包括存储器、处理器以及存储在所述存储器上并可在所述处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现所述权利要求1至7任一项中所述的方法的步骤。
PCT/CN2022/078843 2021-03-04 2022-03-02 路径建立方法、装置、存储介质及电子装置 WO2022184100A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110242097.7A CN115022240A (zh) 2021-03-04 2021-03-04 路径建立方法、装置、存储介质及电子装置
CN202110242097.7 2021-03-04

Publications (1)

Publication Number Publication Date
WO2022184100A1 true WO2022184100A1 (zh) 2022-09-09

Family

ID=83064891

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/078843 WO2022184100A1 (zh) 2021-03-04 2022-03-02 路径建立方法、装置、存储介质及电子装置

Country Status (2)

Country Link
CN (1) CN115022240A (zh)
WO (1) WO2022184100A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116319508B (zh) * 2023-05-15 2023-08-18 新华三技术有限公司 一种路径检测方法、装置、网络设备及存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150249591A1 (en) * 2014-03-03 2015-09-03 Cisco Technology, Inc. Opaque profile identifiers for path computation element protocol
CN110140331A (zh) * 2017-01-27 2019-08-16 华为技术有限公司 路径计算方法和装置

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150249591A1 (en) * 2014-03-03 2015-09-03 Cisco Technology, Inc. Opaque profile identifiers for path computation element protocol
CN110140331A (zh) * 2017-01-27 2019-08-16 华为技术有限公司 路径计算方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
M. KOLDYCHEV CISCO SYSTEMS, INC. S. SIVABALAN CIENA CORPORATION T. SAAD V. BEERAM JUNIPER NETWORKS, INC. H. BIDGOLI NOKIA B. YADAV: "PCEP Extensions for Signaling Multipath Information; draft-koldychev-pce-multipath-03.txt", PCEP EXTENSIONS FOR SIGNALING MULTIPATH INFORMATION; DRAFT-KOLDYCHEV-PCE-MULTIPATH-03.TXT; INTERNET-DRAFT: PCE WORKING GROUP, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SW, no. 03, 6 July 2020 (2020-07-06), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland , pages 1 - 15, XP015140415 *

Also Published As

Publication number Publication date
CN115022240A (zh) 2022-09-06

Similar Documents

Publication Publication Date Title
US11362940B2 (en) Method and apparatus for determining identification information about cross-domain path, and storage medium
US9647929B2 (en) Opaque profile identifiers for path computation element protocol
EP2584743B1 (en) Method, apparatus and system for accessing virtual private network by virtual private cloud
WO2017137008A1 (zh) 一种虚拟网络设备及相关方法
EP2996287B1 (en) Method for notifying information of pe device and pe device
US20140376371A1 (en) Method and Device for Conveying Data Across at Least Two Domains
CN107181691B (zh) 一种网络中实现报文路由的方法、设备和系统
JP2014534782A (ja) ホストが仮想プライベートネットワークに参加／離脱するための境界ゲートウェイプロトコルの拡張
US11588725B2 (en) Method and apparatus for path computation
JP6395867B2 (ja) ＯｐｅｎＦｌｏｗ通信方法及びシステム、制御部、並びにサービスゲートウェイ
CN106789637B (zh) 一种跨域业务互通的路径建立方法、控制器及系统
WO2019184653A1 (zh) 链路配置方法和控制器
US11290394B2 (en) Traffic control in hybrid networks containing both software defined networking domains and non-SDN IP domains
EP3229413B1 (en) Cross-domain cooperative method, cooperative device and control device for network as a service business
CN108964961A (zh) 一种管理传输网切片的方法、装置及系统
WO2009094924A1 (fr) Procédé, système et équipement d&#39;établissement de connexion de service
US20220321453A1 (en) Path computation method, storage medium and electronic apparatus
WO2016202224A1 (zh) 一种传输层参数调整方法和装置
WO2022184100A1 (zh) 路径建立方法、装置、存储介质及电子装置
WO2022083422A1 (zh) 交叉SR/SRv6路径下发方法和装置、存储介质及电子装置
WO2008154848A1 (fr) Procédé d&#39;acquisition des informations de capacité d&#39;un nœud de réseau entre des domaines, nœud de réseau et système de communication
WO2014183657A1 (zh) 一种确定下一跳、发布路由信息的方法和装置
CN104348744B (zh) 一种路径计算方法及路径计算单元
WO2018095438A1 (zh) 等价多路径ecmp处理方法及装置
WO2018077313A1 (zh) 连接能力的通告方法及装置

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 24/01/2024)