Computing power service traffic engineering release method, and storage medium and electronic apparatus

Abstract

Provided in the embodiments of the present disclosure are a computing power service traffic engineering release method, and a storage medium and an electronic apparatus. The method comprises: a first node receiving computing power service traffic engineering information from a controller, wherein the computing power service traffic engineering information is used for indicating a mapping relationship between a service identifier and an SRv6 policy; and on the basis of the computing power service traffic engineering information, the first node determining a second node and a forwarding path for forwarding computing power service traffic to the second node, so as to implement computing power service traffic engineering release.

Description

Computing power service traffic engineering publishing method, storage medium and electronic device

[0001] Cross-reference of related disclosures

[0002] The present disclosure is based on Chinese Patent Publication 202410443401.8 with the invention name of "Computing power service traffic engineering publishing method, storage medium and electronic device" filed on April 12, 2024, and claims priority to the patent publication, the disclosure of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] Embodiments of the present disclosure relate to the field of communication, in particular to a computing power service traffic engineering publishing method, a storage medium and an electronic device. BACKGROUND

[0004] In the traditional network side, the Segment Routing IPv6 (SRv6) technology based on the IPv6 forwarding plane has strong programmable ability. SRv6 has three-layer programmable space of network path, service and forwarding behavior, which enables it to support different demands of a large number of different services, and meets the trend of service-driven network. SRv6 is completely based on the Software-Defined Networking (SDN) architecture, which can bridge the gap between APP and network, bring the application information of APP into the network, and perform network scheduling and optimization based on global information.

[0005] Therefore, applying the SRv6 technology to the computing power routing problem to solve the computing power routing problem and as one of the solutions to the data plane of the computing power network has become an important research focus in the industry for the computing power routing problem. However, in related technologies, fine computing network integrated path calculation and arrangement cannot be achieved. SUMMARY

[0006] Embodiments of the present disclosure provide a computing power service traffic engineering publishing method, a storage medium and an electronic device.

[0007] According to one embodiment of the present disclosure, a computing power service traffic engineering publishing method is provided, comprising: a first node receiving computing power service traffic engineering information from a controller, wherein the computing power service traffic engineering information is used to indicate the mapping relationship between a service identifier and an SRv6 policy; and the first node determining a second node and a forwarding path for forwarding computing power service traffic to the second node according to the computing power service traffic engineering information, so as to realize computing power service traffic engineering publishing.

[0008] According to still another embodiment of the present disclosure, a computer readable storage medium is also provided, in which a computer program is stored, wherein the computer program is configured to perform the steps of any of the above method embodiments when executed.

[0009] According to still another embodiment of the present disclosure, an electronic device is also provided, comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the computer program to perform the steps of any of the above method embodiments.

[0010] According to still another embodiment of the present disclosure, a computer program product is also provided, comprising computer programs / instructions, wherein the computer programs / instructions are executed by a processor to implement the steps of any of the above method embodiments. BRIEF DESCRIPTION OF DRAWINGS

[0011] FIG. 1 is a hardware structure block diagram of a computer terminal of a computing power service traffic engineering publishing method according to an embodiment of the present disclosure;

[0012] FIG. 2 is a flowchart of a computing power service traffic engineering publishing method according to an embodiment of the present disclosure;

[0013] FIG. 3 is a schematic diagram of a computing power service traffic engineering publishing method according to an embodiment of the present disclosure;

[0014] FIG. 4 is a schematic diagram of a computing power service traffic engineering publishing method according to another embodiment of the present disclosure;

[0015] FIG. 5 is another schematic diagram of a computing power service traffic engineering publishing method according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0016] Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0017] It should be noted that the terms “first”, “second”, and the like in the specification and claims of the present disclosure and the above-described drawings are used to distinguish similar objects, and do not necessarily have to describe a specific order or sequence.

[0018] In the related art, 5G drives edge computing to become a hot spot. In the future, for emerging businesses such as industrial Internet, network-side edge computing, and even on-site edge computing will provide users with flexible access nearby and provide extreme user experience. Therefore, computing power is sinking from the center, and distributed resources, computing power, and distributed services have become a trend. On the other hand, with the development of container technology and micro-service architecture, applications are gradually decomposed into functions and services, and the demand for networks is gradually changing from host-oriented addressing to service-oriented, computing power-oriented, and resource-oriented addressing. In the above background, the computing power network, a new technology and operation mode, emerges as the times require. Based on the integrated computing network facility, it provides Internet common services, which is conducive to accelerating innovation, reducing deployment costs, improving resource utilization, and promoting social digital economic development. Unlike traditional networks, the computing power network requires service addressing and routing based on the integrated computing network perspective, and combines the traffic engineering capabilities of the network to provide service protection for computing power services. The computing power routing technology emerges as the times require, which enhances the utilization of computing network resources, and enhances the experience protection capabilities of the computing network system for services with higher than best effort (BE) requirements. From the network perspective, the programmable space of IPv4 and multi-protocol label switching (MPLS) is limited, and the decoupling of the current application and bearer network makes it difficult to optimize the network itself and improve the value of the network. Segment Routing IPv6 (SRv6) based on the IPv6 forwarding plane is a new generation of IP bearer protocol. It uses existing IPv6 forwarding technology to realize network programmability through flexible IPv6 extension headers, and gives the network flexible and intelligent traffic engineering capabilities. Correspondingly, for differentiated and diversified computing power and computing network services, how to select, map, and schedule network capabilities, and combine existing network traffic engineering mechanisms to achieve fine-grained computing network integrated service protection is a problem that needs to be solved.

[0019] Applying SRv6 technology to the computing power routing problem to solve the computing power routing problem and as one of the solutions to the data plane of the computing power network has become an important research focus in the industry for the computing power routing problem.

[0020] In the related art, based on the Border Gateway Protocol (BGP), the attributes in the Path Attribute are extended, so that the BGP Update message can announce information related to computing power services and computing power resources. The above is described as a metadata attribute (Metadata Attribute). The Metadata Attribute TLV can correspondingly carry information such as RTT delay and site priority.

[0021] In related technologies, an extension scheme of BGP link state protocol (Border Gateway Protocol-Link State, BGP-LS) and BGP flow specification (Border Gateway Protocol-Flow Specification, BGP-FS) is also proposed. Among them, the extended BGP-LS protocol is used to upload the relevant computing resource information collected and perceived by the device to the controller. The extended BGP-FS proposes to download the related metrics of computing resources to the device as the key value of the SRv6 Policy diversion strategy. The device makes decisions according to the resource metric value, and then guides the computing service traffic to the corresponding SRv6 Policy according to the diversion strategy. However, the above scheme has the following problems: (1) It cannot meet the scenario of going to a certain computing routing gateway, while needing to share and protect traffic among multiple SRv6 Policies. (2) The centralized control plane calculates and arranges a number of possible SRv6 policies SRv6 Policy, but the calculation of SRv6 Policy is not based on the computing service demand, nor does it make computing routing decisions; the distributed device does not directly execute the diversion strategy, and needs to make decisions based on the downloaded metrics. This complicates the decision-making of computing routing logically, increases the burden of the control plane, and the arrangement of SRv6 Policy is not associated with the computing service demand and computing network resource state, which is not fine-grained in arrangement and scheduling. (3) Several non-overlapping diversion strategies are issued for the same service as the key value, and then the device makes decisions, which does not conform to the traditional BGP-FS diversion strategy issuing principle and logic, and greatly changes the existing control plane protocol logic and forwarding plane behavior. (4) The forwarding plane of the current device can generally support a maximum of 32k number of BGP-FS diversion entry numbers, and at most 96k number. For a 16-bit length service identifier (Service ID), there will be a possible 64k number of computing service diversion entries. Therefore, based on the BGP-FS, the Service ID and the diversion strategy of SRv6 Policy are issued, which puts a certain pressure on the capacity of BGP-FS diversion table entries.

[0022] The method embodiments provided in the embodiments of the present application can be executed in a mobile terminal, a computer terminal or similar computing device. Taking the case of running on a computer terminal, FIG. 1 is a hardware structure block diagram of a computer terminal of the computing power service traffic engineering publishing method according to the embodiments of the present disclosure. As shown in FIG. 1, the computer terminal can include one or more (only one is shown in FIG. 1) processors 102 (the processor 102 can include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 configured to store data, wherein the computer terminal can further include a transmission device 106 configured to have a communication function and an input and output device 108. Those skilled in the art can understand that the structure shown in FIG. 1 is only schematic, which does not limit the structure of the computer terminal. For example, the computer terminal can include more or fewer components than those shown in FIG. 1, or have a different configuration from that shown in FIG. 1.

[0023] The memory 104 can be configured to store computer programs, for example, software programs of application software and modules, such as the computer program corresponding to the computing power service traffic engineering publishing method in the embodiments of the present disclosure. The processor 102 executes various functional applications and data processing by running the computer programs stored in the memory 104, that is, implements the above-mentioned method. The memory 104 can include a high-speed random access memory, and can further include a non-volatile memory such as one or more magnetic storage devices, flash memories, or other non-volatile solid-state memories. In some examples, the memory 104 can further include a memory remotely arranged with respect to the processor 102, which can be connected to the computer terminal through a network. Examples of the above-mentioned network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0024] The transmission device 106 is configured to receive or send data via a network. Specific examples of the above-mentioned network can include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, 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 (Radio Frequency, RF) module, which is configured to communicate with the Internet in a wireless manner.

[0025] The embodiments of the present disclosure provide a computing power service traffic engineering publishing method, and FIG. 2 is a flowchart of the computing power service traffic engineering publishing method according to the embodiments of the present disclosure. As shown in FIG. 2, the flow includes the following steps:

[0026] In the step S202, the first node receives the computing power service traffic engineering information from the controller, wherein the computing power service traffic engineering information is used to indicate a mapping relationship between a service identifier and an SRv6 policy.

[0027] In the embodiments of the present disclosure, the first node can be a head node in an access-side computing power routing gateway, and the second node can be a terminal node Endpoint in a cloud-side computing power routing gateway.

[0028] In the embodiments of the present disclosure, the first node receives the computing power service traffic engineering information from the controller by extending a BGP or extending a PCEP protocol.

[0029] In one example embodiment, the first node receives the computing power service traffic engineering information from the controller, comprising: the first node receives the computing power service traffic engineering information from the controller by extending a BGP.

[0030] In the embodiments of the present disclosure, the computing power service traffic engineering information is forwarded by carrying a new Sub-TLV in a data packet of the extended BGP protocol.

[0031] In one example embodiment, the first node receives the computing power service traffic engineering information from the controller by extending a BGP, comprising: the first node receives a first data packet of the extended BGP from the controller, wherein a tunnel encapsulation attribute field of the first data packet carries a first Sub-TLV, the first Sub-TLV at least includes a service identifier field and a weight field, wherein the service identifier field is used to indicate a service identifier, and the weight field is used to indicate a weight allocated to the service identifier on a candidate path of a corresponding SRv6 policy; and the first node obtains the computing power service traffic engineering information according to the first data packet.

[0032] In the embodiments of the present disclosure, the Sub-TLV described above can include a type field, a length field, a reserved field, etc. in addition to the service identifier field and the weight field.

[0033] In one example embodiment, the first node receives the computing power service traffic engineering information from the controller, comprising: the first node receives the computing power service traffic engineering information from the controller by extending a Path Computation Element Protocol (PCEP).

[0034] In the embodiments of the present disclosure, the computing power service traffic engineering information is forwarded by carrying a new sub-object in a data packet of the extended PCEP protocol.

[0035] In an example embodiment, the first node receives the computing power service traffic engineering information from the controller through the extended PCEP, including: the first node receives a second data packet of an extended PCEP protocol from the controller, wherein a first sub-object is carried in a SRv6-ERO (SRv6-Explicit Route Object) of the second data packet, and a second sub-object is carried in a SRv6-RRO (SRv6-Record Route Object) of the second data packet, the first sub-object at least includes a service identifier field and a weight field, and the second sub-object at least includes the service identifier field and the weight field, wherein the service identifier field is used to indicate a service identifier, and the weight field is used to indicate a weight of the service identifier allocated on a candidate path of a corresponding SRv6 policy; and the first node obtains the computing power service traffic engineering information according to the second data packet.

[0036] In the embodiments of the present disclosure, the first sub-object and the second sub-object can further include a type field, a length field, a reserved field, etc. in addition to the service identifier field and the weight field.

[0037] In an example embodiment, the service identifier field and the weight field are carried in a path calculation message of the first sub-object or the second sub-object, and the path calculation message includes at least one of the following: a PCRep (Path Computation Reply) message; a PCInitiate (Path Computation Initiate) message; a PCUpd (Path Computation Update) message; and a PCRpt (Path Computation Report) message.

[0038] In an example embodiment, the number of the second nodes is one or more.

[0039] In step S204, the first node determines the second nodes and a forwarding path of forwarding the computing power service traffic to the second nodes according to the computing power service traffic engineering information, so as to implement the computing power service traffic engineering publishing.

[0040] In an example embodiment, the first node determines the second node and the forwarding path of the computing power service traffic to the second node according to the computing power service traffic engineering information to implement the computing power service traffic engineering publishing, including at least one of the following: the first node determines one second node according to the computing power service information, and the first node determines the forwarding path to the target second node according to the computing power service traffic engineering information, wherein the computing power service traffic engineering information is calculated by the controller by calculating the load sharing strategy of the multiple SRv6 policies for the determined second node and publishing; the first node determines multiple second nodes according to the computing power service information, and the first node determines the forwarding path to the multiple target second nodes according to the computing power service traffic engineering information, wherein the computing power service traffic engineering information is calculated by the controller by calculating the load sharing strategy of the multiple SRv6 policies for the determined multiple second nodes and publishing, and the SRv6 policy group includes the multiple SRv6 policies; the first node discovers multiple second nodes according to the computing power service information, and the first node determines one or more target second nodes according to the computing power service traffic engineering information published by the controller, wherein the computing power service traffic engineering information is calculated by the controller by confirming the mapping relationship between the service identifier and the SRv6 policy group of any one or more second nodes according to the service identifier by the first node, and calculating the load sharing strategy of the multiple SRv6 policies and publishing.

[0041] In the embodiment of the present disclosure, the first node first discovers multiple second nodes according to the computing power service information, and then the controller publishes the computing power service traffic engineering information, and the first node determines one or more target second nodes from the multiple second nodes according to the computing power service traffic engineering information. Wherein, the computing power service traffic engineering information published by the controller is used to indicate the mapping relationship between the service identifier and the SRv6 policy, and in the embodiment of the present disclosure, the computing power service traffic engineering information published by the controller can also be used to indicate the mapping relationship between the service identifier and the SRv6 policy group, and the SRv6 policy group includes multiple SRv6 policies. Wherein, the computing power service traffic engineering information published by the controller is based on the load sharing of the multiple SRv6 policies.

[0042] Through the embodiment of the present disclosure, a computing power service traffic engineering publishing method is provided, which receives the computing power service traffic engineering information from the controller by the first node, wherein the computing power service traffic engineering information is used to indicate the mapping relationship between the service identifier and the SRv6 policy; the first node determines the second node and the forwarding path of the computing power service traffic to the second node according to the computing power service traffic engineering information to implement the computing power service traffic engineering publishing. The problem that the fine algorithm network integrated path calculation and arrangement cannot be implemented in the related technology is solved, and the effect of implementing the fine algorithm network integrated service guarantee is achieved.

[0043] Those skilled in the art can clearly understand that the method according to the above-mentioned embodiments can be realized by means of software and necessary general hardware platforms, of course, it can also be realized by hardware, but in many cases, the former is a better implementation. Based on such understanding, the technical solutions of the present disclosure can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes a plurality of instructions for making a terminal device (which can be a mobile phone, computer, server, or network device, etc.) execute the methods described in various embodiments of the present disclosure.

[0044] In the embodiments of the present disclosure, an algorithm service traffic engineering publishing device is also provided, which is configured to implement the above-mentioned embodiments and preferred embodiments, and will not be described again. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware is also possible and contemplated.

[0045] The algorithm service traffic engineering publishing device provided by the embodiments of the present disclosure can be arranged in a head node and can include a receiving module configured to receive algorithm service traffic engineering information from a controller, wherein the algorithm service traffic engineering information is used to indicate a mapping relationship between a service identifier and an SRv6 policy. The device further includes a forwarding module configured to determine a second node and a forwarding path for forwarding algorithm service traffic to the second node according to the algorithm service traffic engineering information, so as to implement algorithm service traffic engineering publishing.

[0046] It should be noted that the above-mentioned modules can be realized by software or hardware, and for the latter, the following implementation methods can be used, but are not limited thereto: all the above-mentioned modules are located in the same processor; or the above-mentioned modules are located in different processors in any combination. In actual implementation, the functions of the above-mentioned modules and the naming method can be adopted in different ways, and are not specifically limited, as long as the steps in any one of the above-mentioned method embodiments can be realized.

[0047] The embodiments of the present disclosure also provide a computer-readable storage medium, which stores a computer program, wherein the computer program is configured to execute the steps in any one of the above-mentioned method embodiments when running.

[0048] In an example embodiment, the computer readable storage medium described above can include, but is not limited to, a U disk, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store computer programs.

[0049] Embodiments of the present disclosure also provide an electronic device including a memory and a processor, the memory storing a computer program, and the processor being configured to execute the computer program to perform the steps in any of the method embodiments described above.

[0050] In an example embodiment, the electronic device described above can further include a transmission device connected to the processor and an input / output device connected to the processor.

[0051] Embodiments of the present disclosure also provide a computer program product including computer programs / instructions, which, when executed by a processor, implement the steps in any of the method embodiments described above.

[0052] The specific examples in the present embodiment can refer to the examples described in the above embodiments and example implementations, which will not be described here again.

[0053] Obviously, those skilled in the art should understand that each module or each step of the embodiments of the present disclosure described above can be realized by a general computing device, which can be concentrated on a single computing device or distributed on a network composed of multiple computing devices, and can be realized by program codes executable by a computing device, so that they can be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described can be executed in different order, or they can be manufactured into individual integrated circuit modules, or multiple modules or steps among them can be manufactured into a single integrated circuit module. Therefore, the present disclosure is not limited to any specific hardware and software combination.

[0054] In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the following will be described in combination with specific scene embodiments.

[0055] Embodiment One

[0056] FIG. 3 is a schematic diagram of the principle of the computing power service traffic engineering publishing method of Embodiment One of the present disclosure, as shown in FIG. 3, the computing power service traffic engineering publishing method based on BGPSRv6 Policy extension includes the following steps:

[0057] Step S301, the service instance or the cloud gateway or load balancer (LB) or other service agent infrastructure of the edge cloud where the service instance is located publishes service state information to the computing power routing gateway on the cloud side through, for example, IGP protocol, BGP protocol, or other application layer protocol. The computing power routing gateway on the cloud side is Egress 1 and Egress 2 in FIG. 1.

[0058] Step S302, the computing power routing gateway on the cloud side converts the service state information and calculates a service metric value to represent the ability of a service instance to provide a type of service. The computing power routing gateway on the cloud side also generates a local routing information base (RIB) table item and a forwarding information base (FIB) table item.

[0059] Step S303, at a computing power routing gateway on the cloud side, multiple cloud resource pools or multiple service instances can be connected, that is, multiple service instances can all provide a type of service with a certain service capability. The computing power routing gateway on the cloud side obtains an aggregated Service Metric value through an aggregation algorithm to represent the service providing capability of a group of cloud resource pools or service instances behind the computing power routing gateway on the cloud side (for example, the minimum value of Service Metric).

[0060] Step S304, the computing power routing gateway on the cloud side advertises or reports the computing power service information, that is, the aggregated Service Metric value, to the network (bearer network) or to a controller.

[0061] Step S305, the computing power routing gateway on the cloud side (optionally) advertises the computing power routing information to the access side computing power routing gateway, that is, Ingress in FIG. 1.

[0062] Step S306, the centralized control plane (controller) combines the computing power service information reported by the network side devices (for example, gateways, routers, etc.) and the network topology information collected by the network side to calculate and arrange the corresponding computing power service, that is, the SRv6 policy of the Service ID, and to issue the SRv6 policy to the head node through an extended BGP protocol or PCEP protocol, etc., to declare the mapping relationship between the SRv6 policy and the Service ID.

[0063] Step S307, the head node combines the computing power routing information (that is, the computing power routing information described above) diffused in the network, and forms a computing power routing table item according to the mapping relationship between the issued SRv6 policy and the Service ID to guide forwarding. The computing power routing table item includes but is not limited to:

[0064] The head node collects the diffused computing power routing information, discovers multiple possible next hops, combines the one-to-one mapping relationship of the Service ID and the SRv6 Policy (group) of a certain Endpoint, decides the next hop, and performs load sharing in the possible multiple SRv6 Policies;

[0065] The head node collects the diffused computing power routing information, discovers multiple possible next hops, combines the one-to-one mapping relationship of the Service ID and the SRv6 Policy (group) of a certain Endpoint, decides the next hop, and performs load sharing in the possible multiple SRv6 Policies;

[0066] The head node directly decides the next hop according to the one-to-one mapping relationship of the Service ID and the SRv6 Policy (group) of a certain Endpoint, depends on the result of centralized calculation, and performs load sharing in the possible multiple SRv6 Policies.

[0067] In the embodiment of the present disclosure, the first node (head node) first discovers multiple second nodes (Endpoints) according to the computing power service information, and then the controller issues computing power service traffic engineering information, and the first node determines one or more target second nodes from the multiple second nodes according to the computing power service traffic engineering information. Wherein, the computing power service traffic engineering information issued by the controller is used to indicate the mapping relationship between the service identifier and the SRv6 policy, and in the embodiment of the present disclosure, the computing power service traffic engineering information issued by the controller can also be used to indicate the mapping relationship between the service identifier and the SRv6 policy group, and the SRv6 policy group includes multiple SRv6 policies. Wherein, the computing power service traffic engineering information issued by the controller is based on load sharing of multiple SRv6 policies.

[0068] Embodiment two

[0069] In the embodiment of the present disclosure, the computing power service traffic engineering information from the controller is received or forwarded by extending BGP or extending PCEP, and in embodiment two, how to receive or forward the computing power service traffic engineering information from the controller by extending BGP or extending PCEP is described.

[0070] First, the BGP SRv6 Policy protocol extension is introduced.

[0071] In the embodiments of the present disclosure, in order to publish the SRv6 Policy, the BGP protocol extends the sub-address family identifier (SAFI) and corresponding network layer reachability information (NLRI) and tunnel encapsulation attribute (Tunnel Encaps Attribute) and the like. After the controller calculates the SRv6 Policy, the SRv6 Candidate Path can be published to the SRv6 network head node in the form of publishing route information through the BGP neighbor relationship.

[0072] In the embodiments of the present disclosure, the BGP adds a definition of the SR Policy SAFI, and the SAFI code is 73. The SRv6 Policy SAFI uses a new NLRI format to describe a Candidate Path of the SRv6 Policy. Table 1 is an example table of the format of the Candidate Path. As shown in Table 1, the format of the Candidate Path provided by the embodiments of the present disclosure is as follows:

[0073] Table 1 is an example table of the format of the Candidate Path.

[0074] In the embodiments of the present disclosure, the BGP defines a new tunnel type, and the code is 15. The corresponding tunnel encapsulation attribute is 23. The Tunnel Encaps Attribute contains the unique identifier (Binding SID) of the specified network segment, the priority (Preference) of a certain route, the priority selection (Priority) in the case of the same Preference value, and the segment list (Segment List) and the like Sub-TLV.

[0075] In the embodiments of the present disclosure, a new sub-type length value (Sub-TLV) carried in the Tunnel Encaps Attribute is extended, which is the first Sub-TLV in the above embodiments, that is, the Service ID Sub-TLV. Table 2 is an example table of the format of the Service ID Sub-TLV. As shown in Table 2, the Service ID Sub-TLV includes a service identifier field and a weight field. The service identifier field is used to indicate the service identifier, and the weight field is used to indicate the weight of the service identifier allocated on the corresponding Candidate Path of the SRv6 Policy. The format of the Service ID Sub-TLV is as follows:

[0076] Table 2 Format example table of Service ID Sub-TLV

[0077] As shown in Table 2, wherein Type represents type, the value is agreed upon by IANA. Length represents length, the sum of the lengths of all Service IDs and corresponding weights. Reserved represents a reserved field, which must be set to 0 when sent; Service ID represents service identification, 16 bits. Weight represents weight, 16 bits, indicating the weight of the Service ID allocated on the Candidate Path of the SRv6 Policy.

[0078] The PCEP SRv6 protocol extension is then introduced.

[0079] In the embodiments of the present disclosure, the extension of the PCEP protocol for SRv6 mainly includes three parts: a new PATH-SETUP-TYPE type supporting SRv6, an SRv6-PCE-CAPABILITY Sub-TLV for announcing SRv6 capability, and an SRv6 ERO and SRv6 RRO Subobject for carrying SRv6 SID.

[0080] In the embodiments of the present disclosure, after completing path computation, the PCE sends path information to the PCC head node through the ERO in the PCUpd message. The PCC head node then receives the path information issued by the PCE and installs the corresponding path. After the PCC head node installs the path, it sends a PCRpt message to the PCE to report SRv6 Policy state information, uses the RRO to carry the actual forwarding path of the PCC, and uses the ERO object to carry the path information calculated by the PCE.

[0081] In the embodiments of the present disclosure, a new subobject, i.e., the first subobject in the above embodiments, is defined in the SRv6-ERO, namely SRv6-SID-ERO Subobject. The SRv6-SID-ERO Subobject is consistent with the SRv6-ERO Subobject and can be carried in the PCRep / PCInitiate / PCUpd / PCRpt message. Table 3 is a format example diagram of the SRv6-SID-ERO Subobject. As shown in Table 3, the first subobject includes at least a service identification field and a weight field. The service identification field is used to indicate service identification, and the weight field is used to indicate the weight of the service identification allocated on the Candidate Path of the corresponding SRv6 policy. The format of the SRv6-SID-ERO Subobject is as follows:

[0082] Table 3 Format example table of SRv6-SID-ERO Subobject

[0083] As shown in Table 3, Type indicates the type, the value is confirmed after negotiation with IANA. Length indicates the length, the sum of the lengths of all Service ID and corresponding Weight. Reserved indicates a reserved field, which must be set to 0 when sent. Service ID indicates service identification, 16 bits. Weight indicates weight, 16 bits, indicating the weight of the Service ID allocated on the path of the SRv6 Policy.

[0084] In the embodiments of the present disclosure, in addition to the SRv6-RRO Subobject, a new subobject SRv6-SID-RRO Subobject, i.e., the second subobject in the above embodiments, is defined. Table 4 is a format example diagram of SRv6-SID-RRO Subobject. As shown in Table 4, the second subobject at least includes a service identification field and a weight field. The service identification field is used to indicate service identification, and the weight field is used to indicate the weight of the service identification allocated on the candidate path of the corresponding SRv6 policy. The format of SRv6-SID-RRO Subobject is the same as that of SRv6-SID-ERO Subobject, and the format of SRv6-SID-RRO Subobject is as follows:

[0085] Table 4 Format example table of SRv6-SID-RRO Subobject

[0086] As shown in Table 3, Type indicates the type, the value is confirmed after negotiation with IANA. Length indicates the length, the sum of the lengths of all Service ID and corresponding Weight. Reserved indicates a reserved field, which must be set to 0 when sent. Service ID indicates service identification, 16 bits. Weight indicates weight, 16 bits, indicating the weight of the Service ID allocated on the path of the SRv6 Policy.

[0087] Embodiment three

[0088] After receiving or forwarding the computing power service traffic engineering information from the controller by extending BGP or extending PCEP, computing power service traffic engineering publishing needs to be performed.

[0089] Figure 4 is a schematic diagram of the computing power service traffic engineering publishing method of the third embodiment of the present disclosure. As shown in Figure 4, for the load sharing of multiple SRv6 Policies of the same SRv6 Endpoint, the controller calculates the CP X of SRv6 Policy 1 and the CP Y of SRv6 Policy 2, and SRv6 Policy 1 and 2 have the same Endpoint, i.e. CATS Egress 1. In the BGP Update message corresponding to the CP X of SRv6 Policy 1 and the CP Y of SRv6 Policy 2, the Service ID Sub-TLV defined in the Tunnel Encaps Attribute declares the Weight of Service ID 1 as 100 and 200 respectively. The traffic of the corresponding Service 1 can be load shared in different forwarding paths (SRv6 Policy Candidate Path) in the ratio of 2:1.

[0090] Figure 5 is another schematic diagram of the computing power service traffic engineering publishing method of the third embodiment of the present disclosure. As shown in Figure 5, for the session-level balancing of multiple SRv6 Endpoints and the load sharing of multiple SRv6 Policies, the controller calculates the CP X of SRv6 Policy 1 and the CP Y of SRv6 Policy 2, and SRv6 Policy 1 and 2 have the same Endpoint, i.e. CATS Egress 1; the controller also calculates the CP P of SRv6 Policy 3 and the CP Q of SRv6 Policy 4, and SRv6 Policy 3 and 4 have the same Endpoint, i.e. CATS Egress 2. In the corresponding BGP Update message, the Service ID Sub-TLV defined in the Tunnel Encaps Attribute declares the Weight of Service ID 1 as 100 and 200, 200 and 200 respectively. The traffic of the corresponding Service 1 can be balanced in the session granularity, such as session 1 is diverted to CATS Egress 1 and session 2 is diverted to CATS Egress 2, and the load sharing is realized in the corresponding different forwarding paths in the ratio of 2:1 and 1:1 respectively.

[0091] To sum up, the computing service traffic engineering publishing method provided by the embodiments of the present disclosure provides the computing network traffic engineering publishing capability and mechanism of the SRv6 Policy Candidate Path and the computing service identifier Service ID by extending the BGPSRv6 Policy. The computing network traffic engineering publishing capability and mechanism of the SRv6 path information and the computing service identifier Service ID are provided by extending the PCEP SRv6 Policy. The load sharing publishing of the multiple SRv6 Policies supporting the same computing service session is met, and the session-level balanced traffic engineering policy publishing of the computing service session is supported. Meanwhile, the distributed and centralized computing routing control plane solutions are supported, and the path calculation and orchestration of the computing network are better supported.

[0092] The above merely describes the preferred embodiments of the present disclosure and is not intended to limit the present disclosure. For those skilled in the art, the present disclosure can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. within the principles of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A method for publishing a computing power service traffic engineering, comprising: The first node receives computing power service traffic engineering information from the controller, wherein the computing power service traffic engineering information is used to indicate a mapping relationship between a service identifier and an SRv6 policy; The first node determines the second node and the forwarding path for forwarding the computing power service traffic to the second node based on the computing power service traffic engineering information, so as to realize the computing power service traffic engineering release.

2. The method according to claim 1, wherein The first node receives computing power service traffic engineering information from the controller, including: The first node receives the computing power service traffic engineering information from the controller via the extended Border Gateway Protocol BGP.

3. The method according to claim 2, wherein: The first node receives the computing power service traffic engineering information from the controller through the extended BGP protocol, including: The first node receives a first data packet of the extended BGP protocol from the controller, wherein a tunnel encapsulation attribute field of the first data packet carries a first subtype length value Sub-TLV, and the first Sub-TLV includes at least a service identifier field and a weight field, wherein the service identifier field is used to indicate the service identifier, and the weight field is used to indicate a weight allocated to the service identifier on a candidate path of the corresponding SRv6 policy; The first node obtains the computing power service traffic engineering information according to the first data message.

4. The method according to claim 1, wherein the first node receives computing power service traffic engineering information from the controller, comprising: The first node receives the computing power service traffic engineering information from the controller through an extended path computation unit communication protocol (PCEP).

5. The method according to claim 4, wherein The first node receives the computing power service traffic engineering information from the controller through the extended PCEP protocol, including: The first node receives a second data packet of the extended PCEP protocol from the controller, wherein the SRv6 explicit route object SRv6-ERO of the second data packet carries a first sub-object, and the SRv6 record route object SRv6-RRO of the second data packet carries a second sub-object, the first sub-object includes at least a service identification field and a weight field, and the second sub-object includes at least the service identification field and the weight field, wherein the service identification field is used to indicate the service identification, and the weight field is used to indicate the weight assigned to the service identification on the candidate path of the corresponding SRv6 policy; The first node obtains the computing power service traffic engineering information according to the second data message.

6. The method according to claim 5, wherein: The service identifier field and the weight field are carried in a path calculation message of the first sub-object or the second sub-object, and the path calculation message includes at least one of the following: Path calculation reply message PCRep; Path calculation startup message PCInitiate; Path calculation update message PCUpd; Path calculation report message PCRpt.

7. The method according to claim 1, wherein The number of the second nodes is one or more.

8. The method according to claim 7, wherein: The first node determines, based on the computing power service traffic engineering information, a second node and a forwarding path for forwarding computing power service traffic to the second node, so as to implement computing power service traffic engineering release, including at least one of the following: The first node determines a second node according to the computing power service information, and the first node determines a forwarding path to the target second node according to the computing power service traffic engineering information, wherein the computing power service traffic engineering information is calculated by the controller through multiple SRv6 policy load sharing policies for the determined second node and published; The first node determines a plurality of second nodes based on the computing power service information, and the first node determines a forwarding path to a plurality of target second nodes based on the computing power service traffic engineering information, wherein the computing power service traffic engineering information is calculated by the controller for the plurality of determined second nodes by calculating and publishing a load sharing strategy of a plurality of SRv6 strategies, and the SRv6 strategy group includes the plurality of SRv6 strategies; The first node discovers multiple second nodes based on the computing power service information, and the first node determines one or more target second nodes based on the computing power service traffic engineering information published by the controller, wherein the computing power service traffic engineering information is confirmed by the controller through centralized calculation, and the mapping relationship between the first node and the SRv6 policy group of any one or more second nodes based on the service identifier is confirmed, and the load sharing strategy of multiple SRv6 policies is calculated and published.

9. A computer-readable storage medium having a computer program stored therein, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to any one of claims 1 to 8 when executing the computer program.

11. A computer program product comprising a computer program / instruction, wherein when the computer program / instruction is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.

Images