Cross SR / SRv6 Path Distribution Method and Apparatus, Storage Medium, and Electronic Device

Abstract

An embodiment of the present invention provides a method and apparatus for cross-SR / SRv6 path distribution, a storage medium, and an electronic device. The method includes: a path calculation unit negotiates with a path calculation client to support the ability of cross-SR / SRv6 paths; the path calculation unit calculates the cross-SR / SRv6 paths; the path calculation unit distributes the cross-SR / SRv6 paths to the path calculation client. Through the present invention, the problem of being unable to open services due to not knowing the outgoing interface and incoming interface of a node is solved, and thus the effect of improving the service opening efficiency is achieved.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of communications, and in particular, to a method and device for cross-SR / SRv6 path distribution, a storage medium, and an electronic device. Background Art

[0002] With the emergence of FlexE (Flexible Ethernet) technology, in a packet switching network based on Ethernet technology, it is also possible to provide a TDM service forwarding path similar to that of an ASON network, which is the MTN Channel forwarding path proposed in G.mtn. Such forwarding paths are also implemented in a cross manner. However, in the context of extremely simplified network deployment, in the MTN network, usually only the IGP protocol needs to be deployed to create an SR tunnel path, and the label distribution protocol will no longer be deployed. Therefore, a more concise and efficient way is needed to create such a cross path of MTN Channel. Since the cross relationship requires knowledge of the ingress port and ingress, unlike the existing southbound interface for distributing SR-TE / TP paths, only the egress interface Adj-SID representation of the node can be distributed. In this way, the next-hop node cannot obtain the ingress port information and cannot implement service activation. Summary of the Invention

[0003] The embodiments of the present invention provide a method and device for cross-SR / SRv6 path distribution, a storage medium, and an electronic device, so as to at least solve the problem in the related art that services cannot be activated due to the lack of knowledge of the egress and ingress interfaces of nodes.

[0004] According to an embodiment of the present invention, a method for cross-SR / SRv6 path distribution is provided, including: a path calculation unit negotiates with a path calculation client about the ability to support cross-SR / SRv6 paths; the path calculation unit calculates the cross-SR / SRv6 paths; the path calculation unit distributes the cross-SR / SRv6 paths to the path calculation client.

[0005] In an exemplary embodiment, the path calculation unit negotiating with the path calculation client about the ability to support cross-SR / SRv6 paths includes: the path calculation unit and the path calculation client exchange the ability to support cross-SR / SRv6 paths by sending a target object, where the target object is an object under a newly defined cross-SR / SRv6 path establishment type ability.

[0006] In an exemplary embodiment, the path calculation unit calculating the cross-SR / SRv6 paths includes: calculating the cross-SR / SRv6 paths according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.

[0007] In an exemplary embodiment, calculating the cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology includes: calculating the cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology according to the minimum-hop strategy or the lowest-latency strategy.

[0008] In an exemplary embodiment, the path calculation unit calculating the cross-SR / SRv6 path includes: after the path calculation unit negotiates with the path calculation client on the ability to support the cross-SR / SRv6 path, the path calculation unit actively calculates the cross-SR / SRv6 path.

[0009] In an exemplary embodiment, the path calculation unit calculating the cross-SR / SRv6 path includes: after the path calculation unit negotiates with the path calculation client on the ability to support the cross-SR / SRv6 path, the path calculation unit receives a request from the path calculation client to calculate the cross-SR / SRv6 path; the path calculation unit responds to the request and calculates the cross-SR / SRv6 path.

[0010] In an exemplary embodiment, the path calculation unit receiving a request from the path calculation client to calculate the cross-SR / SRv6 path includes: the path calculation unit receiving a request from the path calculation client that includes an RP object or an SRP object with a cross-SR / SRv6 path establishment type capability length type value.

[0011] In an exemplary embodiment, the path calculation unit sending the cross-SR / SRv6 path to the path calculation client includes: sending the cross-SR / SRv6 path using a newly defined cross-SR ERO or an extended SR ERO.

[0012] In an exemplary embodiment, the path calculation unit sending the cross-SR / SRv6 path to the path calculation client includes: the path calculation unit sending the identification code of the outgoing port of the cross-SR / SRv6 path and the identification code of the incoming port of the cross-SR / SRv6 path to the path calculation client.

[0013] In an exemplary embodiment, the above-mentioned path calculation unit sends the identification code of the egress port of the above-mentioned cross SR / SRv6 path and the identification code of the ingress port of the above-mentioned cross SR / SRv6 path to the above-mentioned path calculation client, including: when the above-mentioned path calculation client is an ingress node, the above-mentioned path calculation unit sends the identification code of the egress port of the above-mentioned cross SR / SRv6 path; when the above-mentioned path calculation client is an egress node, the above-mentioned path calculation unit sends the identification code of the ingress port of the above-mentioned cross SR / SRv6 path; when the above-mentioned path calculation client is an intermediate node, the above-mentioned path calculation unit sends the identification code of the egress port of the above-mentioned cross SR / SRv6 path and the identification code of the ingress port of the above-mentioned cross SR / SRv6 path at the same time.

[0014] In an exemplary embodiment, the above-mentioned path calculation unit sends the above-mentioned cross SR / SRv6 path to the above-mentioned path calculation client, including: the above-mentioned path calculation unit sends the above-mentioned cross SR / SRv6 path to the above-mentioned path calculation client through the BGP protocol.

[0015] According to another embodiment of the present invention, there is provided a cross SR / SRv6 path sending device, including: a negotiation module, configured to negotiate with a path calculation client about the ability to support cross SR / SRv6 paths; a calculation module, configured to calculate the above-mentioned cross SR / SRv6 paths; a sending module, configured to send the above-mentioned cross SR / SRv6 paths to the above-mentioned path calculation client.

[0016] In an exemplary embodiment, the above-mentioned negotiation module includes: a sending unit, configured to exchange the ability of cross SR / SRv6 paths with a target object by sending, where the above-mentioned target object is an object under a defined new cross SR / SRv6 path establishment type ability.

[0017] In an exemplary embodiment, the above-mentioned calculation module includes: a first calculation unit, configured to calculate the above-mentioned cross SR / SRv6 paths according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.

[0018] In an exemplary embodiment, the above-mentioned first calculation unit includes: a calculation subunit, configured to calculate the above-mentioned cross SR / SRv6 paths according to the required bandwidth of the above-mentioned forwarding path and the remaining bandwidth of each link in the above-mentioned routing topology according to the minimum hop count strategy or the minimum delay strategy.

[0019] In an exemplary embodiment, the above-mentioned calculation module includes: a second calculation unit, configured to actively calculate the above-mentioned cross SR / SRv6 paths after the above-mentioned path calculation unit negotiates with the above-mentioned path calculation client about the ability to support cross SR / SRv6 paths.

[0020] In an exemplary embodiment, the above-mentioned computing module includes: a receiving unit, configured to receive a request for calculating the cross SR / SRv6 path sent by the path calculation client after negotiating with the path calculation unit and the path calculation client on the ability to support the cross SR / SRv6 path; a third calculation unit, configured to calculate the cross SR / SRv6 path in response to the request.

[0021] In an exemplary embodiment, the above-mentioned receiving unit includes: a receiving subunit, configured to receive a request of an RP object or an SRP object including a cross SR / SRv6 path establishment type capability length type value sent by the path calculation client.

[0022] In an exemplary embodiment, the above-mentioned distribution module includes: a first distribution unit, configured to distribute the cross SR / SRv6 path by using a newly defined cross SR ERO or an extended SR ERO.

[0023] In an exemplary embodiment, the above-mentioned distribution module includes: a second distribution unit, configured to distribute the identification code of the outgoing port of the cross SR / SRv6 path and the identification code of the incoming port of the cross SR / SRv6 path.

[0024] In an exemplary embodiment, the above-mentioned second distribution unit includes: a first distribution subunit, configured to distribute the identification code of the outgoing port of the cross SR / SRv6 path when the path calculation client is an incoming node; a second distribution subunit, configured to distribute the identification code of the incoming port of the cross SR / SRv6 path when the path calculation client is an outgoing node; a third distribution subunit, configured to distribute the identification code of the outgoing port of the cross SR / SRv6 path and the identification code of the incoming port of the cross SR / SRv6 path simultaneously when the path calculation client is an intermediate node.

[0025] In an exemplary embodiment, the above-mentioned distribution module includes: a third distribution unit, configured to distribute the cross SR / SRv6 path to the path calculation client through the BGP protocol.

[0026] According to another embodiment of the present invention, there is also provided a computer-readable storage medium, in which a computer program is stored, and the computer program is configured to execute the steps in any one of the above method embodiments when running.

[0027] According to another embodiment of the present invention, there is also provided an electronic device, including a memory and a processor, 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.

[0028] With the present invention, after the path calculation unit negotiates with the path calculation client on the ability to support cross-SR / SRv6 paths, the path calculation unit can calculate cross-SR / SRv6 paths and finally distribute cross-SR / SRv6 paths. Therefore, the problem of not being able to activate services due to not knowing the outgoing interface and incoming interface of nodes can be solved, and the effect of improving service activation efficiency can be achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 is a hardware structure diagram of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0030] Figure 2 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0031] Figure 3 is a network topology diagram of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0032] Figure 4 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0033] Figure 5 is a schematic diagram of the format of an extended cross-SR ERO of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0034] Figure 6 is a schematic diagram of the format of an extended cross-SRV6ERO of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0035] Figure 7 is a schematic diagram of the content distributed by a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0036] Figure 8 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0037] Figure 9 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0038] Figure 10 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0039] Figure 11 is a flowchart of a method for distributing cross-SR / SRv6 paths according to an embodiment of the present invention;

[0040] Figure 12 It is a structural block diagram of a cross - SR / SRv6 path distribution device according to an embodiment of the present invention. Specific embodiments

[0041] In the following, embodiments of the present invention will be described in detail with reference to the accompanying drawings and in conjunction with the embodiments.

[0042] It should be noted that the terms "first", "second", etc. in the description and claims of the present invention and the above - mentioned drawings are used to distinguish similar objects, and do not necessarily need to be used to describe a specific order or sequence.

[0043] The method embodiments provided in the embodiments of the present application can be executed on a mobile terminal, a computer terminal, or a similar computing device. Taking running on a mobile terminal as an example, Figure 1 It is a hardware structural block diagram of a mobile terminal of a cross - SR / SRv6 path distribution method according to an embodiment of the present invention. As Figure 1 shown, the mobile terminal may include one or more ( Figure 1 only one is shown in Figure 1 the 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. Among them, the above - mentioned mobile terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those of ordinary skill in the art can understand that Figure 1 the structure shown in Figure 1 is only schematic and does not limit the structure of the above - mentioned mobile terminal. For example, the mobile terminal may further include more or fewer components than

[0044] shown in

[0045] The transmission device 106 is used to receive or send data via a network. Specific examples of the above network may include a wireless network provided by a communication provider of a mobile terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, abbreviated as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a Radio Frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0046] In this embodiment, a method for cross-SR / SRv6 path distribution is provided. Figure 2 It is a flowchart of the method for cross-SR / SRv6 path distribution according to an embodiment of the present invention, as Figure 2 shown, and the process includes the following steps:

[0047] Step S202, the path calculation unit negotiates with the path calculation client the ability to support cross-SR / SRv6 paths;

[0048] Step S204, the above path calculation unit calculates the above cross-SR / SRv6 path;

[0049] Step S206, the above path calculation unit distributes the above cross-SR / SRv6 path to the above path calculation client.

[0050] Among them, the execution subject of the above steps can be a base station, a terminal, etc., but is not limited thereto.

[0051] In an exemplary embodiment, the path calculation unit negotiating with the path calculation client the ability to support cross-SR / SRv6 paths includes: the path calculation unit and the path calculation client exchange the ability of cross-SR / SRv6 paths by sending a target object, where the target object is an object under a defined new cross-SR / SRv6 path establishment type ability.

[0052] In an exemplary embodiment, the path calculation unit calculating the above cross-SR / SRv6 path includes: calculating the above cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.

[0053] In an exemplary embodiment, the calculating the above cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology includes: calculating the above cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology according to the minimum hop count strategy or the lowest latency strategy.

[0054] In an exemplary embodiment, the above-mentioned path calculation unit calculates the above-mentioned cross-SR / SRv6 path as follows: After the path calculation unit negotiates with the path calculation client on the ability to support the cross-SR / SRv6 path, the path calculation unit actively calculates the above-mentioned cross-SR / SRv6 path.

[0055] In an exemplary embodiment, the above-mentioned path calculation unit calculates the above-mentioned cross-SR / SRv6 path as follows: After the path calculation unit negotiates with the path calculation client on the ability to support the cross-SR / SRv6 path, the path calculation unit receives a request from the path calculation client to calculate the above-mentioned cross-SR / SRv6 path; the path calculation unit calculates the above-mentioned cross-SR / SRv6 path in response to the request.

[0056] In an exemplary embodiment, the above-mentioned path calculation unit receives a request from the path calculation client to calculate the above-mentioned cross-SR / SRv6 path, including: The path calculation unit receives a request from the path calculation client that includes an RP object or an SRP object with a cross-SR / SRv6 path establishment type capability length type value.

[0057] In an exemplary embodiment, the above-mentioned path calculation unit distributes the above-mentioned cross-SR / SRv6 path to the path calculation client, including: Distributing the above-mentioned cross-SR / SRv6 path using a newly defined cross-SR ERO or an extended SR ERO.

[0058] In an exemplary embodiment, the above-mentioned path calculation unit distributes the above-mentioned cross-SR / SRv6 path to the path calculation client, including: Distributing the identification code of the egress port of the above-mentioned cross-SR / SRv6 path and the identification code of the ingress port of the above-mentioned cross-SR / SRv6 path.

[0059] In an exemplary embodiment, the above-mentioned path calculation unit distributes the identification code of the egress port of the above-mentioned cross-SR / SRv6 path and the identification code of the ingress port of the above-mentioned cross-SR / SRv6 path, including: When the path calculation client is an ingress node, the path calculation unit distributes the identification code of the egress port of the above-mentioned cross-SR / SRv6 path; when the path calculation client is an egress node, the path calculation unit distributes the identification code of the ingress port of the above-mentioned cross-SR / SRv6 path; when the path calculation client is an intermediate node, the path calculation unit distributes both the identification code of the egress port of the above-mentioned cross-SR / SRv6 path and the identification code of the ingress port of the above-mentioned cross-SR / SRv6 path.

[0060] In an exemplary embodiment, the above path calculation unit distributes the above cross-SR / SRv6 path to the above path calculation client, including: the path calculation unit distributes the above cross-SR / SRv6 path to the above path calculation client through the BGP protocol.

[0061] The following explains the above cross-SR / SRv6 path distribution method in combination with specific examples.

[0062] By extending the southbound interface protocol (PCE / BGP Policy / NETCONF), the distribution of cross-service paths is realized, thereby completing the creation of end-to-end cross paths. Optionally, a node can configure the cross relationship of the nodes involved in the forwarding path through the IGP protocol.

[0063] In this embodiment, it is assumed that there is a Slicing Packet Network (SPN) or IP Radio Access Network (IP RAN) network that adopts the FlexE technology, which supports the cross-service forwarding path of the above MTN Channel in the transport network standard system G.mtn. Optionally, the network topology is as Figure 3 shown. The controller calculates a cross path of A->B->C->D->Z with a bandwidth of 30 megabytes (M) (occupying 3 time slots), and distributes the path to the ingress node A. Figure 3 In, A-E and Z are nodes respectively, 101-108 are the identifiers of the nodes, and 18001-18016 and 18019-18024 are the port identification codes (Adj-SID) of the nodes.

[0064] Figure 4 is a flowchart of PCEP messages of the PCEP protocol between the path calculation client PCC and the path calculation unit PCE according to Embodiment 1 of the present invention. As Figure 4 shown, it includes the following steps:

[0065] Step S402, negotiate the ability to support cross paths between the PCC and the PCE.

[0066] Define a new path establishment type capability TLV format to identify that the path to be established is a cross path. The PCC and the PCE exchange the ability of cross paths by sending open objects carrying this path establishment type capability TLV.

[0067] Step S404, the path calculation client PCC requests the path calculation element PCE (path calculation unit) to calculate a cross path.

[0068] The PCC requests the establishment of a cross - path from the PCE by carrying the RP or SRP object of the cross - path establishment type capability length type value TLV in the PCEP protocol in the request path message.

[0069] Step S406: The PCE calculates the cross - path of the path according to the path request information. If the path calculation is successful, the PCE sends the calculated cross - path to the PCC.

[0070] The cross - path sent by the PCE to the PCC is carried by extending the ERO of the PCEP protocol. Define a new cross - SR ERO or extend the existing SR ERO. This is not limited here, but the information carried by the SR ERO includes: the Adj - SID of the ingress and egress ports. When sending, the Adj - SID of the egress port identification code, the Adj - SID of the ingress port or the Adj - SIDs of both the ingress and egress ports can be selected according to needs. See the format of the extended cross - SR ERO in Figure 5 See the format of the extended SRV6 ERO in Figure 6 。

[0071] Specifically, the content sent by the PCE to the PCC can be referred to in Figure 7 。For the P node, it includes the node identification SID and the Adj - SIDs of the ingress / egress ports, while the head and tail nodes only contain the one - way Adj - SIDs of the ingress or egress.

[0072] As another example, as Figure 8 shown:

[0073] Step S802: Negotiate the ability to support cross - paths between the PCC and the PCE.

[0074] Define a new path establishment type capability TLV to identify that the path to be established is a cross - path. The PCC and the PCE exchange the ability of cross - paths by sending open objects carrying this path establishment type capability TLV.

[0075] Step S804: The controller actively calculates the path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology, using a certain path calculation strategy (minimum number of hops, minimum delay, etc.);

[0076] Step S806: If the path calculation is successful, the PCE sends the calculated cross - path to the PCC.

[0077] The cross - paths sent from the PCE to the PCC are carried by extending the ERO of PCEP. Define a new cross - SR ERO or extend it in the existing SR ERO, which is not limited here. However, the information carried by the SR ERO includes: the Adj - SIDs of the ingress and egress ports. When sending, according to the need, you can choose to send the Adj - SID of the egress port, the Adj - SID of the ingress port, or send the Adj - SIDs of both ingress and egress ports simultaneously. The format of the extended cross - SR ERO is shown in Figure 5 The format of the extended SRV6 ERO is shown in Figure 6 .

[0078] Specifically, when the PCE sends to the PCC, for the P node, it includes the node SID and the Adj - SIDs of the ingress / egress ports, while the head and tail nodes only contain the unidirectional Adj - SIDs of ingress or egress.

[0079] As another example, as Figure 9 shown:

[0080] Step S902, negotiate the ability to support cross - SRv6 paths between the PCC and the PCE.

[0081] Define a new path - establishment type capability TLV to identify that the path to be established is a cross - path. The PCC and the PCE exchange the ability of cross - paths by sending open objects carrying this path - establishment type capability TLV.

[0082] Step S904, the path - calculation client PCC requests the path - calculation element PCE to calculate the cross - SRv6 path.

[0083] The PCC requests to establish a cross - path from the PCE by carrying the RP or SRP object with the cross - SRv6 path - establishment type capability length type value TLV in the request - path message.

[0084] Step S906, the PCE calculates the cross - SRv6 path according to the path - request information. After the path calculation is successful, the PCE sends the calculated cross - SRv6 path to the PCC.

[0085] The cross - paths sent from the PCE to the PCC are carried by extending the ERO of PCEP. Define a new cross - SRv6 ERO or extend it in the existing SRv6 ERO, which is not limited here. However, the information carried by the SRv6 ERO includes: the End.X SIDs of the ingress and egress ports. When sending, according to the need, you can choose to send the Adj - SID of the egress port, the Adj - SID of the ingress port, or send the Adj - SIDs of both ingress and egress ports simultaneously. The format of the extended cross - SR ERO is shown in Figure 5 The format of the extended SRV6 ERO is shown in Figure 6 .

[0086] Specifically, it can be carried by expanding the ERO of PCEP. The bits of the flags field of the SRv6 ERO can be expanded to identify whether the SID is outgoing or incoming.

[0087] As another example, as Figure 10 shown:

[0088] Step S1002: Negotiate the ability to support cross SRv6 paths between the PCC and the PCE.

[0089] Step S1004: The controller actively calculates the path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology, using a certain path calculation strategy (such as the minimum number of hops, the lowest delay, etc.).

[0090] Step S1006: When the path calculation is successful, the PCE sends the calculated cross SRv6 path to the PCC.

[0091] The cross path sent by the PCE to the PCC is carried by expanding the ERO of PCEP. A new cross SRv6 ERO can be defined or the existing SRv6 ERO can be expanded. There is no limitation here. However, the information carried by the SRv6 ERO includes: the End.X SID of the ingress and egress ports. When sending, the Adj-SID of the egress port, the Adj-SID of the ingress port or the Adj-SIDs of both the ingress and egress ports can be selected according to needs.

[0092] Specifically, it can be carried by expanding the ERO of PCEP. The bits of the flags field of the SRv6 ERO can be expanded to identify whether the SID is outgoing or incoming.

[0093] After calculating the cross path using the above extended PCE, the specific path can be sent to the network device through the BGP protocol.

[0094] As Figure 11 shown, after steps S1102 - S1104, execute step S1102 to send the cross path using the BGP protocol.

[0095] It is necessary to expand the BGP protocol to carry the information of the ingress and egress port adjacency SIDs of the node. For SR-MPLS, the Adj-SIDs of the ingress and egress ports of the node need to be carried. For SRv6, the End.X SIDs of the ingress and egress ports of the node are carried. The format of the extended cross SR ERO is shown in Figure 5 . The format of the extended SRV6 ERO is shown in Figure 6 .

[0096] The embodiment of this application expands the southbound interface protocol to send the SR cross service path.

[0097] The ability to negotiate the support for cross-SR / SRv6 paths between the PCC and the PCE is enabled. The path computation client PCC requests the path computation element PCE to compute a cross-SR / SRv6 path, and the PCE computes the cross-SR / SRv6 path according to the path request information.

[0098] After the PCE computes the cross-SR / SRv6 path according to the path request information, it sends the computed cross-SRv6 path to the PCC through the PCE.

[0099] After the PCE computes the cross-SR / SRv6 path according to the path request information, it sends the computed cross-SRv6 path to the network devices through the BGP protocol.

[0100] A new path establishment type capability TLV is defined to identify that the path to be established is a cross path. The ability to exchange cross paths between the PCC and the PCE is achieved by sending open objects carrying this path establishment type capability TLV.

[0101] The PCC requests to establish a cross path from the PCE by carrying the RP or SRP object of the cross path establishment type capability length type value TLV in the request path message.

[0102] The cross path sent by the PCE to the PCC is carried by extending the ERO of PCEP. A new cross-SR ERO is defined to carry the SIDs of the neighbor nodes of the ingress and egress ports.

[0103] The content to be sent is selected according to the attributes of the actual nodes. The Adj-SID of the egress port is sent to the ingress node, the Adj-SID of the ingress port and the Adj-SIDs of both the ingress and egress ports are sent to the intermediate nodes.

[0104] From the description of the above implementation manners, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by means of software plus a necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is a better implementation manner. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disc) and includes several instructions for causing a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in the above embodiments of the present invention.

[0105] In this embodiment, a cross-SR / SRv6 path distribution device is further provided. This device is used to implement the above-mentioned embodiments and preferred implementation manners, and those that have been described will not be repeated here. As used hereinafter, the term "module" can be a combination of software and / or hardware that realizes a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware is also possible and contemplated.

[0106] Figure 12 is a structural block diagram of a cross-SR / SRv6 path distribution device according to an embodiment of the present invention. As Figure 12 shown, the device includes:

[0107] A negotiation module 1202, configured to negotiate with a path calculation client the ability to support cross-SR / SRv6 paths;

[0108] A calculation module 1204, configured to calculate the above-mentioned cross-SR / SRv6 paths;

[0109] A distribution module 1206, configured to distribute the above-mentioned cross-SR / SRv6 paths to the above-mentioned path calculation client.

[0110] In an exemplary embodiment, the above-mentioned negotiation module 1202 includes: a sending unit, configured to exchange with a target object the ability of cross-SR / SRv6 paths, where the above-mentioned target object is an object under a defined new cross-SR / SRv6 path establishment type ability.

[0111] In an exemplary embodiment, the above-mentioned calculation module 1204 includes: a first calculation unit, configured to calculate the above-mentioned cross-SR / SRv6 paths according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.

[0112] In an exemplary embodiment, the above-mentioned first calculation unit includes: a calculation subunit, configured to calculate the above-mentioned cross-SR / SRv6 paths according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the above-mentioned routing topology according to the minimum hop count strategy or the lowest latency strategy.

[0113] In an exemplary embodiment, the above-mentioned calculation module 1204 includes: a second calculation unit, configured to actively calculate the above-mentioned cross-SR / SRv6 paths after the above-mentioned path calculation unit negotiates with the above-mentioned path calculation client the ability to support cross-SR / SRv6 paths.

[0114] In an exemplary embodiment, the above-mentioned computing module 1204 includes: a receiving unit, configured to receive a request for calculating the cross-SR / SRv6 path sent by the path calculation client after the path calculation unit negotiates with the path calculation client the ability to support the cross-SR / SRv6 path; a third calculation unit, configured to calculate the cross-SR / SRv6 path in response to the request.

[0115] In an exemplary embodiment, the above-mentioned receiving unit includes: a receiving subunit, configured to receive a request sent by the path calculation client, the request including an RP object or an SRP object of a length type value of the cross-SR / SRv6 path establishment type capability.

[0116] In an exemplary embodiment, the above-mentioned distribution module 1206 includes: a first distribution unit, configured to distribute the cross-SR / SRv6 path by using a newly defined cross-SR ERO or an extended SR ERO.

[0117] In an exemplary embodiment, the above-mentioned distribution module 1206 includes: a second distribution unit, configured to distribute the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path.

[0118] In an exemplary embodiment, the above-mentioned second distribution unit includes: a first distribution subunit, configured to distribute the identification code of the egress port of the cross-SR / SRv6 path when the path calculation client is an ingress node; a second distribution subunit, configured to distribute the identification code of the ingress port of the cross-SR / SRv6 path when the path calculation client is an egress node; a third distribution subunit, configured to distribute the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path simultaneously when the path calculation client is an intermediate node.

[0119] In an exemplary embodiment, the above-mentioned distribution module 1206 includes: a fifth distribution unit, configured to distribute the cross-SR / SRv6 path to the path calculation client through the BGP protocol.

[0120] It should be noted that the above-mentioned respective modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited thereto: all the above-mentioned modules are located in the same processor; or, the above-mentioned respective modules are separately located in different processors in any combination form.

[0121] For other examples of this embodiment, please refer to the above examples and will not be elaborated here.

[0122] Embodiments of the present invention also provide a computer-readable storage medium storing a computer program, wherein the computer program is configured to execute the steps in any of the above method embodiments when running.

[0123] In an exemplary embodiment, the above computer-readable storage medium may include, but is not limited to: various media capable of storing computer programs such as USB flash drives, read-only memories (ROM), random access memories (RAM), mobile hard disks, magnetic disks, or optical discs.

[0124] Embodiments of the present invention also provide an electronic device including a memory and a processor, where the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any of the above method embodiments.

[0125] In an exemplary embodiment, the above electronic device may further include a transmission device and input / output devices, where the transmission device is connected to the above processor, and the input / output devices are connected to the above processor.

[0126] Specific examples in this embodiment may refer to the examples described in the above embodiments and exemplary embodiments, and will not be elaborated herein.

[0127] Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device. They can be concentrated on a single computing device or distributed on a network composed of multiple computing devices. They can be implemented by program codes executable by the computing device, so that they can be stored in a storage device and executed by the computing device. And in some cases, the steps shown or described can be executed in a different order than here, or they can be separately fabricated into individual integrated circuit modules, or multiple modules or steps among them can be fabricated into a single integrated circuit module to implement. Thus, the present invention is not limited to any specific combination of hardware and software.

[0128] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. For those skilled in the art, the present invention can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for distributing cross - SR / SRv6 paths, characterized in that, including: The path calculation unit negotiates with the path calculation client the ability to support cross-SR / SRv6 paths; The path calculation unit calculates the cross-SR / SRv6 path; The path calculation unit distributes the cross-SR / SRv6 path to the path calculation client; wherein, the path calculation unit calculates the cross-SR / SRv6 path including: calculating the cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology; wherein, the path calculation unit distributes the cross-SR / SRv6 path to the path calculation client including: the path calculation unit distributes the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path to the path calculation client.

2. The method according to claim 1, characterized in that, The path calculation unit negotiates with the path calculation client the ability to support cross-SR / SRv6 paths including: The path calculation unit and the path calculation client exchange the ability to support cross-SR / SRv6 paths by sending a target object, wherein the target object is an object under the newly defined cross-SR / SRv6 path establishment type ability.

3. The method according to claim 1, characterized in that, The calculating the cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology includes: Calculating the cross-SR / SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology according to the minimum hop count strategy or the lowest latency strategy.

4. The method according to claim 1, characterized in that, The path calculation unit calculates the cross-SR / SRv6 path including: After the path calculation unit negotiates with the path calculation client the ability to support cross-SR / SRv6 paths, the path calculation unit actively calculates the cross-SR / SRv6 path.

5. The method according to claim 1, characterized in that, The path calculation unit calculates the cross-SR / SRv6 path including: After the path calculation unit negotiates with the path calculation client the ability to support cross-SR / SRv6 paths, the path calculation unit receives a request from the path calculation client to calculate the cross-SR / SRv6 path; The path calculation unit responds to the request to calculate the cross-SR / SRv6 path.

6. The method according to claim 5, characterized in that, The path calculation unit receives a request from the path calculation client to calculate the cross-SR / SRv6 path including: The path calculation unit receives a request from the path calculation client including an RP object or an SRP object with the length type value of the cross-SR / SRv6 path establishment type ability.

7. The method according to claim 1, characterized in that, The path calculation unit distributes the cross-SR / SRv6 path to the path calculation client including: Distributing the cross-SR / SRv6 path using the newly defined cross-SR ERO or the extended SR ERO.

8. The method according to claim 1, characterized in that, The path calculation unit distributes the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path to the path calculation client including: When the path calculation client is an ingress node, the path calculation unit issues the identification code of the egress port of the cross-SR / SRv6 path; When the path calculation client is an egress node, the path calculation unit issues the identification code of the ingress port of the cross-SR / SRv6 path; When the path calculation client is an intermediate node, the path calculation unit issues the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path simultaneously.

9. The method according to any one of claims 1 to 7, characterized in that, The path calculation unit issuing the cross-SR / SRv6 path to the path calculation client includes: The path calculation unit issues the cross-SR / SRv6 path to the path calculation client through the BGP protocol.

10. A device for distributing cross - SR / SRv6 paths, characterized in that, Including: A negotiation module for negotiating with the path calculation client the ability to support the cross-SR / SRv6 path; A calculation module for calculating the cross-SR / SRv6 path; A distribution module for distributing the cross-SR / SRv6 path to the path calculation client; Wherein, the device is further configured to calculate the cross-SR / SRv6 path according to the bandwidth required by the forwarding path and the remaining bandwidth of each link in the routing topology; Wherein, the device is further configured to the path calculation unit issues the identification code of the egress port of the cross-SR / SRv6 path and the identification code of the ingress port of the cross-SR / SRv6 path to the path calculation client.

11. A computer-readable storage medium, characterized in that, A computer program is stored in the computer-readable storage medium, wherein when the computer program is executed by a processor, the steps of the method described in any one of claims 1 to 9 are implemented.

12. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the computer program, the steps of the method described in any one of claims 1 to 9 are implemented.

Images