Calculation network scheduling method, network domain, cloud side node, computing power gateway, system and medium

Abstract

The invention provides a computing network scheduling method, a network domain, a cloud side node, a computing power gateway, a system and a medium. The method comprises: generating a service identifier according to a service registration request; according to a resource state of a service instance corresponding to the service identifier, determining a calculation amount index; issuing the service identifier and the SLA information accessed by the corresponding user to a computing power gateway; and calculating a computing power route according to the computing power quantity index, the computing power information announced by the computing power gateway and the SLA information.

Description

Technical Field

[0001] The present application relates to the field of communication technology, for example, to a computing network scheduling method, network domain, cloud-side node, computing power gateway, system and medium. Background Art

[0002] The development goal of computing power network is to flexibly meet the integrated needs of various businesses for computing resources and network connections. For different demand scenarios, the focus of integrated scheduling is usually different. For example, it may be experience, that is, service level agreement (SLA) indicators related to quality of service (Quality Of Service, QOS); it may be cost, that is, the cost / energy consumption of service resources; it may be resource, that is, the usage or status of service resources. Taking edge computing as an example, the business is usually scheduled to the nearest node, but it is not necessarily the optimal node. Especially for extremely sensitive businesses such as latency, service instances are often selected only based on computing power, and the best choice cannot be found. Due to the inability to achieve integrated computing power perception and computing network scheduling, it cannot meet different types of scheduling needs, and the equipment resource consumption and cost are high. Summary of the invention

[0003] The present application provides a computing network scheduling method, network domain, cloud-side node, computing power gateway, system and medium.

[0004] The embodiment of the present application provides a computing network scheduling method, which is applied to a network domain node, including:

[0005] Generate a service identifier according to a service registration request;

[0006] Determine a computing power measurement indicator according to the resource status of the service instance corresponding to the service identifier;

[0007] Send the service ID and the corresponding user access SLA information to the computing power gateway;

[0008] The computing power route is calculated according to the computing power measurement indicator, the computing power information announced by the computing power gateway, and the SLA information.

[0009] The embodiment of the present application also provides a computing network scheduling method, which is applied to a cloud-side node, including:

[0010] Send a service registration request to the domain node according to the managed service type;

[0011] If the service registration is successful, the resource status of the service instance corresponding to the service identifier is collected;

[0012] The computing power information is notified to the computing power egress gateway (EGW) according to the resource status information, and the computing power information is diffused by the computing power egress gateway to the upstream gateway.

[0013] The embodiment of the present application also provides a computing network scheduling method, which is applied to a computing power ingress gateway (IGW), including:

[0014] Obtain the computing power information announced by the computing power export gateway, as well as the service identifier issued by the network domain node and the service level agreement SLA information accessed by the corresponding user;

[0015] Calculate the computing power route corresponding to the specific service identifier according to the computing power measurement indicator, the computing power information and the SLA information;

[0016] The service request message is forwarded to the corresponding computing power export gateway according to the computing power routing.

[0017] The embodiment of the present application also provides a computing network scheduling method, which is applied to a computing power egress gateway, including:

[0018] Get the resource status of the service instance;

[0019] Determine a computing power measurement indicator and a local service route according to the resource status;

[0020] Install the virtual link and link attribute information corresponding to the virtual node, where the virtual link and link attribute information are obtained by the computing power egress gateway selecting a service instance from a specific service identifier according to the local service routing surface;

[0021] Spread the computing power information notified by the cloud side to the computing power entry gateway.

[0022] An embodiment of the present application also provides a network domain node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned computing network scheduling method when executing the program.

[0023] An embodiment of the present application also provides a cloud-side node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned computing network scheduling method when executing the program.

[0024] An embodiment of the present application also provides a computing power entry gateway, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned computing network scheduling method when executing the program.

[0025] An embodiment of the present application also provides a computing power export gateway, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned computing network scheduling method when executing the program.

[0026] The embodiment of the present application also provides a computing network scheduling system, including: a network domain node and the above-mentioned cloud side node;

[0027] The network domain node includes the computing network brain, packet network equipment, the above-mentioned computing power entry gateway and the above-mentioned computing power exit gateway.

[0028] The embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned computing network scheduling method is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 A schematic diagram of a computing power network provided by an embodiment;

[0030] Figure 2 A flowchart of a computing network scheduling method provided by an embodiment;

[0031] Figure 3 A schematic diagram of a computing network operation process based on a service identifier provided by an embodiment;

[0032] Figure 4 A flowchart of another computing network scheduling method provided by an embodiment;

[0033] Figure 5 A flowchart of another computing network scheduling method provided by an embodiment;

[0034] Figure 6 A flowchart of another computing network scheduling method provided by an embodiment;

[0035] Figure 7 A schematic diagram of an implementation of a computing power perception and computing network integrated scheduling system provided by an embodiment;

[0036] Figure 8 A schematic diagram of implementing a control plane provided by an embodiment;

[0037] Fig. 9 A schematic diagram of a local service routing table provided by an embodiment;

[0038] Fig.10 A schematic diagram of a global service routing table provided by an embodiment;

[0039] Fig.11 A schematic diagram of an implementation of a forwarding plane provided by an embodiment;

[0040] Fig.12 A schematic diagram of the structure of a computing network scheduling device provided by an embodiment;

[0041] Fig.13 A schematic diagram of the structure of another computing network scheduling device provided by an embodiment;

[0042] Fig.14 A schematic diagram of the structure of another computing network scheduling device provided by an embodiment;

[0043] Fig.15 A schematic diagram of the structure of another computing network scheduling device provided by an embodiment;

[0044] Fig.16 A schematic diagram of the hardware structure of a network domain node provided by an embodiment;

[0045] Fig.17 A schematic diagram of the hardware structure of a cloud-side node provided by an embodiment;

[0046] Fig.18 A schematic diagram of the hardware structure of a computing power entry gateway provided by an embodiment;

[0047] Fig.19 A schematic diagram of the hardware structure of a computing power export provided by an embodiment;

[0048] Fig. 20 A schematic diagram of the structure of a computing network scheduling system provided in an embodiment. DETAILED DESCRIPTION

[0049] The present application is described below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present application, rather than to limit the present application. It should be noted that, in the absence of conflict, the embodiments in the present application and the features in the embodiments can be combined with each other arbitrarily. It should also be noted that, for ease of description, only the parts related to the present application rather than all structures are shown in the accompanying drawings.

[0050] Figure 1 FIG. 1 is a schematic diagram of a computing power network provided by an embodiment. Figure 1As shown, the operational computing network usually includes the end side, the network side (also referred to as the network domain) and the cloud side. The network domain nodes mainly include the computing network brain. The computing network brain can be a software defined network (SDN) controller. In the embodiment of the present application, the computing network brain can also be understood as a centralized management and orchestration node, which can be used for service registration, service related information issuance, and path calculation in the scenario of centralized computing. The nodes in the network domain can also include computing power gateways, specifically including IGW and EGW. IGW can be used to maintain the global service routing table and perform path calculation in the scenario of distributed computing. EGW can be used to notify computing power information, maintain local service routing tables, and select service instances. The process of sensing computing power can be achieved by the computing network brain directly connecting to the cloud management platform, or by the EGW directly connecting to the perception module deployed in the cloud resource pool to realize computing power perception. These two perception methods are not essentially different for the integrated scheduling and perception resource model of computing network. The subsequent embodiments mainly take the latter as an example to illustrate.

[0051] In order to realize the integrated scheduling of computing and network, the embodiments of the present application can solve the following problems: (1) It supports centralized and distributed computing at the same time, and the two can be switched flexibly. It is necessary to design a scheduling method to realize the integration of computing power perception and computing network scheduling, and complete the routing request and delivery of computing power; (2) The dimensions of computing domain quality (health score, average processing delay, economic cost) and network domain quality (bandwidth, delay, jitter, packet loss) are not unified. It is often necessary to clarify a preferred factor based on the focus, and other factors are used as constraints. The increase of constraints increases the computing time, consumes CPU resources, and cannot be deployed on a large scale; (3) From I From the perspective of GW, different EGWs may be attached to the same type of service instance resources, and the same EGW may also be attached to multiple service instance resources of the same type. Usually, EGW needs to continuously update the computing power information to the upstream IGW. For example, if there are 100 services and each service is attached to 100 service instances, and the computing power information is refreshed every 10 seconds, the IGW needs to process at least 60,000 update messages per minute. In fact, the routing system itself requires a lot of resources to handle IGP / BGP protocol maintenance and updates. The number and frequency of computing power information updates put tremendous pressure on the control plane of network equipment and even cause it to crash.

[0052] Figure 2 The flowchart of a computing network scheduling method provided in an embodiment is applied to a network domain node. The network domain node mainly includes the computing network brain in the computing network, such as an SDN controller. Some of the steps can also be implemented by a computing power gateway. Figure 2 As shown, the method provided in this embodiment includes:

[0053] In step 110, a service identifier is generated according to the service registration request.

[0054] In step 120, a computing power measurement indicator is determined according to the resource status of the service instance corresponding to the service identifier.

[0055] In step 130, the service identifier and the SLA information of the corresponding user access are sent to the computing power gateway.

[0056] In step 140, the computing power route is calculated according to the computing power measurement indicator, the computing power information announced by the computing power gateway, and the SLA information.

[0057] In this embodiment, a service registration request can be initiated by a cloud-side node to the computing network brain, and the computing network brain can generate a corresponding service identifier for each type of service, which can also be called a service-aware network identifier (SAN-ID); the computing network brain can issue SAN-ID and corresponding SLA information to each computing power gateway based on the registered service, which is used for the conversion and mapping of service quality requirements within each computing power gateway. The computing power network supports centralized computing. For this application, the computing network brain can calculate the traffic engineering calculation path based on the computing power measurement index, the computing power information announced by the computing power gateway, and the SLA information; it also supports distributed computing, that is, the IGW can calculate the traffic engineering calculation path based on the computing power measurement index, the computing power information announced by the computing power gateway, and the SLA information.

[0058] In this embodiment, different types of services are distinguished by service identifiers, and similar services connected to each EGW can be abstracted into a virtual node, reducing the computing power routing problem to a network traffic engineering problem. When calculating the computing power routing, on the one hand, the reachable path from the head node to the virtual node can be determined to clearly determine which EGW to reach, and on the other hand, the EGW can determine which specific service instance to reach. Among them, in the scenario of centralized computing, the reachable path (traffic engineering calculation path) can be determined by the computing network brain, and in the scenario of distributed computing, the reachable path can be determined by the IGW. In addition, the specific service instance can be determined by the EGW.

[0059] In this embodiment, the computing power measurement index mainly includes indicators used to perceive or measure computing network resources, which correspond to the network; while the SLA information mainly corresponds to user access. The SLA information can be flexibly set to meet the multi-factor scheduling requirements of the computing network, thereby meeting the scheduling goals of experience, cost, and resource scenarios. By integrating computing power perception and computing network scheduling, equipment resource consumption and investment can be reduced, and the pressure on the control and forwarding planes caused by the expansion of computing power information scale can be solved, with good feasibility and scalability. By uniformly sending the SAN-ID and the mapped SLA information to the computing power gateway, a basis is provided for realizing computing network joint traffic engineering (Traffic Engineering, TE) and computing power routing optimization.

[0060] The computing power information can be obtained by the computing power perception module of the EGW connected to the cloud side. The relevant information elements of computing power perception include but are not limited to SAN-ID, service instance IP, latency (cloud service latency), physical bandwidth (total cloud capacity), occupied bandwidth (cloud occupied capacity), cost (cloud cost), etc. Among them, physical bandwidth and occupied bandwidth can be obtained by comprehensive scoring based on relevant cloud side indicators (such as CPU utilization and storage resource occupancy, etc.).

[0061] In this embodiment, the computing network resources are jointly modeled and perceived based on the SLA information corresponding to the SAN-ID, and the computing network joint TE problem can be transformed into: solving the path from the head node to the virtual node of the service instance that meets the requirements of the SLA information. According to the TE configuration, you can choose to use the Path Computation Element Communication Protocol (PCEP) to initiate a centralized computing request (applicable to cross-domain scenarios) and a distributed head node IGW computing request (applicable to single-domain fast convergence scenarios).

[0062] In one embodiment, the service registration request includes a service domain name, a service IP and port, SLA information, and resource information.

[0063] In one embodiment, the metrics of the SLA information include: delay, cost, bandwidth, jitter and reliability; the computing power metrics include network delay obtained by converting the computing delay, network cost obtained by converting the resource cost, interface bandwidth obtained by converting the total amount of resources, and interface bandwidth occupancy obtained by converting the resource occupancy.

[0064] In this embodiment, the SLA information is unified into five key metrics: end-to-end access delay, cost, available bandwidth, jitter, and reliability. Depending on the scheduling objectives, the metrics of the SLA information may include experience categories, such as delay, jitter, and reliability; cost categories, such as cost or energy consumption, i.e., cost; and resource categories, such as resource usage or status, such as converting the remaining resources on the cloud side into available bandwidth. In addition, the computing delay, resource cost, total resource amount, and resource occupancy are converted into network delay, network cost, interface bandwidth, and interface bandwidth occupancy, respectively, to obtain the computing power metric, and the computing power perception results can be converted into network factors to achieve computing network integration.

[0065] In one embodiment, computing power routing includes global service routing and local service routing; computing power routing is calculated according to computing power measurement indicators, computing power information announced by computing power gateways, and SLA information, including: determining a traffic engineering calculation path from a computing power entry gateway to a virtual node mapped to a specific service identifier according to computing power measurement indicators, computing power information announced by computing power gateways, and SLA information; matching the traffic engineering calculation path with a global service routing table to obtain a global service routing; determining a service instance corresponding to a specific service identifier according to a resource status of the service instance to obtain a local service routing; wherein, the second-to-last node of the traffic engineering calculation path corresponds to the computing power exit gateway IP, and the end node of the traffic engineering calculation path corresponds to the virtual node mapped to the service identifier.

[0066] In this embodiment, the specific service identifier can be understood as the service identifier that needs to calculate the computing power routing, such as the service identifier corresponding to the current service request message. The computing network brain or IGW head node can first determine the traffic engineering calculation path between the computing power entry gateway and the virtual node mapped by the service identifier according to the computing power measurement index, network TE index and the requirements of the SLA information corresponding to the SAN-ID, and obtain the reachable path between the virtual node S-VIP connected from the IGW to the EGW, and then match it with the global service routing table to obtain the global service routing. The matching principle is that the penultimate node in the traffic engineering calculation path is the EGW gateway selected by the corresponding SAN-ID, and the last node is the virtual node mapped by the SAN-ID, where the global service routing table can be generated by the IGW after the computing power information is diffused to the IGW. In addition, the EGW can determine the service instance corresponding to the specific service identifier according to the resource status of the service instance to obtain the local service route. On this basis, the calculation of the service route and the computing network path can be separated, and the arbitrary deployment of the computing resources public network and private network can be realized.

[0067] In one embodiment, the virtual link and link attribute information corresponding to the virtual node are obtained by the computing power export gateway selecting the service instance to the specific service identifier according to the local service routing surface; wherein the local service routing table includes the virtual routing forwarding identifier, the service identifier, the service instance IP and the corresponding computing power measurement information; the virtual link and link attribute information are diffused by the Interior Gateway Protocol (IGP) protocol.

[0068] In this embodiment, the EGW can maintain the relevant information of a specific service identifier through a local service routing table, and can optimize the relevant service instances, and decide whether to notify and revoke the computing power information to the upstream according to the existence of the optimization result.

[0069] In one embodiment, the global service route includes: virtual private network information, service identifier, service color, computing power export gateway IP, computing power export gateway segment identifier, virtual private network segment identifier; the global service route is formed by diffusing computing power information from the computing power export gateway to the computing power import gateway; the bearer protocol of the global service route information is based on the BGP protocol family extension.

[0070] In this embodiment, the same type of service can be abstracted into a virtual node in a virtual private network. The information elements of computing power routing include but are not limited to VPN information, SAN-ID, service color (COLOR), computing power export gateway IP (GW-IP local node IP), computing power export gateway segment identifier (GW-SID local node SID), and the corresponding segment identifier of the virtual private network in virtual routing forwarding (VPN-SID, local node identifier VRF SID). The information bearer protocol of computing power routing is implemented using the Border Gateway Protocol (Border Gateway Protocol, BGP) family extension, such as the BGP multi-protocol extension (MultIProtocolBorder Gateway Protocol, MP-BGP).

[0071] In one embodiment, the computing power information does not include information about the service instance and preferred entry corresponding to the specific service identifier; the computing power information is decided by the computing power export gateway whether to announce and revoke it based on whether the corresponding preferred entry exists locally; the computing power information uses the virtual routing forwarding identifier and the service identifier as key indexes; the computing power information is spread from the computing power export gateway to the computing power import gateway and is uniformly processed by the computing power import gateway.

[0072] In this embodiment, a local (or partial) service routing table (Service Routing Information Base, SRIB) can be constructed in the EGW. As long as there is a preferred entry for the local SRIB facing the SAN-ID, the computing power information related to the VPN can be formed for diffusion. In principle, the EGW can process the computing power information perceived by the cloud side to obtain the preferred entry of the computing power instance. For example, after receiving the computing power information, the EGW uses the VRF-ID and SAN-ID as key indexes according to the VPN information deployed by the computing power resources, and combines the load calculation delay, available bandwidth and cost of the service instance IP to maintain the corresponding entry in the SRIB, and implement local optimization for each entry according to the requirements of the SLA information corresponding to the SAN-ID. For example, for a certain type of service, the SLA information indicates that the delay is concerned, then the EGW can locally optimize each entry according to the delay of the service instance, and the obtained preferred entry can be sent to the forwarding plane as a service forwarding table (Service Forwarding Information Base, SFIB) to guide the forwarding of service request messages. By establishing a two-level service routing model and allowing EGW to flexibly select service instances locally, the pressure on the forwarding plane and control plane can be reduced.

[0073] In one embodiment, the notified computing power information may not be updated with the change of the optimization result, thereby effectively reducing the pressure on the control plane. In addition, the notified computing power information is revoked only when the optimization entry corresponding to the specific SAN-ID is zero.

[0074] In one embodiment, each SAN-ID is planned with a public network service virtual node IP (referred to as S-VIP), a service virtual node segment identifier (referred to as S-NODE-SID) and a service COLOR, which has a globally unique and one-to-one mapping relationship. Based on the local SRIB, the EGW can use the latency, bandwidth and cost of the computing power corresponding to the virtual node and the preferred entry as the link attributes connecting the EGW and the S-VIP node for the preferred entry corresponding to a specific SAN-ID and the public network service virtual node IP (S-VIP) corresponding to the SAN-ID, and install them together in the traffic engineering database (Traffic Engineering DataBase, TEDB), and perform flooding diffusion in the IGP domain. That is, TEDB installation and IGP diffusion can be performed on the basis of implementing local optimization, thereby effectively reducing the scale of control plane information diffusion. In some embodiments, EGW can perform TEDB installation and IGP diffusion directly based on the local SRIB without local optimization. By abstracting the computing power information of network resources into a computing power measurement indicator Metric, installing virtual nodes and links into the IGP, the computing network integrated path calculation is transformed into a network problem. In addition, since an independent service routing layer is established, the EGW does not need to publish routing information containing the service instance network segment to the IGW.

[0075] In one embodiment, in a distributed computing scenario, according to the TE configuration of the IGW, the TE computing component of the IGW can calculate the path between the virtual node S-VIP connected from the IGW to the EGW based on the local TEDB and the SLA information corresponding to the SAN-ID, and generate the segment routing policy (SR-POLICY) information corresponding to the TE, whose key value (KEY) includes COLOR and S-VIP. The SIDs of each node and link along the path form a segment list (SEGMENT LIST), where the second to last SID represents the EGW gateway (EGW-SID) selected by the corresponding SAN-ID, and the last SID represents the virtual node.

[0076] In one embodiment, the IGW can receive computing power routing from different EGWs to form SRIBs to different EGWs, whose elements include but are not limited to VRF-ID, SAN-ID, EGW-IP, COLOR, EGW-SID, VPN-SID, etc., wherein VRF-ID and SAN-ID are used as KEYs. In the case of the same KEY, entries of information related to different EGWs (including EGW-IP / EGW-SID / VPNSID) can be managed as multiple next hops, and each SR-POLICY entry is matched based on the COLOR and S-VIP of each entry in the SRIB. If the EGW-SID in the SRIB is equal to the penultimate SID in the SR-POLICY segment list, the SRIB entry can be set as the preferred one, that is, a next hop and a clear reachable path are selected in the global service routing table, and a global SFIB can be generated and sent to the forwarding plane for guiding the forwarding of service request messages.

[0077] Figure 3 The following is a schematic diagram of a computing network operation process based on a service identifier provided by an embodiment. Figure 3 As shown in the figure, the operation process of the computing network includes:

[0078] 1) Service registration: The cloud-side operation and management system registers with the computing network brain according to the type of service to be managed. The registration elements include the service domain name, service IP and port, and the SLA information corresponding to the service. The SLA information includes but is not limited to latency, bandwidth (also known as available bandwidth), reliability (such as packet loss), jitter, cost (also known as cost), resource utilization (link occupancy or cloud resource pool occupancy) and their combination. The purpose of this process is to enable the computing network brain to generate a service identifier (SAN-ID);

[0079] 2) SAN-ID and SLA issuance: The computing network brain sends SAN-ID and corresponding SLA information to each computing power gateway based on the registered services, which is used for conversion and mapping of service quality requirements within the gateway;

[0080] 3) Start service perception: After receiving the response message of successful service registration, the cloud side can start the service perception module to collect cloud side resource status information;

[0081] 4) Collection and notification of computing power status information: The service perception module notifies the computing power information to the EGW (BGP can be used), the EGW spreads the computing power information upstream (local optimization can be implemented and the preferred items can be spread), and the IGW or the EGW as the BGP link state (BGP Link-state, BGP-LS) announcer (Speaker) notifies the computing power information to the computing network brain;

[0082] 5) Centralized path calculation request: In scenarios involving cross-domain or IGW resource limitations that are not suitable for or do not support distributed head node calculation, the IGW can initiate a PCEP request for the network brain to centrally calculate the traffic engineering calculation path to the virtual node; for scenarios involving distributed head node calculation, the IGW can calculate the traffic engineering calculation path, on this basis, the centralized and distributed path calculation can be unified;

[0083] 6) Sending down the calculation results: For centralized computing scenarios, after the network brain completes the traffic engineering calculation path calculation, it can use the PCEP channel or BGP-SR-POLICY channel to send the calculation results to IGW; for distributed scenarios, IGW can complete the traffic engineering calculation path calculation and send it down locally.

[0084] 7) Terminal service identification acquisition: The terminal initiates domain name resolution based on the original service domain name to obtain the service identification for service initiation;

[0085] 8) Service initiation: After the terminal obtains the service identifier, the terminal protocol stack can select different encapsulation methods to send the service request message according to the different service identifier selections. For example, if the Anycast IP representation service is used, the service identifier can be directly placed in the destination IP; if a digital service identifier is used, it is often necessary to carry the service identifier through an IP extension header or other extension methods; the destination IP of the service request message is the IGW IP. Regardless of the encapsulation method, the purpose is to allow the service request message to penetrate the access network route to the IGW and resolve the service identifier to achieve service access;

[0086] 9) Traffic Scheduling: After the service request message reaches IGW, IGW parses the service identifier and searches for computing power routing, selects different tunnel strategies and encapsulates the tunnel header message for hop-by-hop forwarding. After reaching EGW, EGW can find the corresponding service instance based on the service identifier and forward the message to the service instance node to provide the service.

[0087] It should be noted that the embodiments of the present application are mainly described based on a network based on source routing technology over IPv6 (Segment Routing Over IPv6, SRv6), and in some embodiments are also applicable to a network based on SR multi-protocol label switching (Multi-Protocol Label Switching, MPLS). For the computing power perception component, in order to simplify the description, although this solution takes the docking of the cloud-side computing power perception module as an example to obtain computing power, in actual deployment, the computing network brain can be docked with the cloud-side operation and management system and notified to the computing power gateway or the computing power perception components of each device in the computing power network, and the preferred items can be notified after the local optimization is implemented to reduce the pressure on the control plane and the scale of information diffusion.

[0088] The computing network scheduling method of the above embodiment aims at the problem that multiple factors affect the efficiency of the scheduling algorithm, unifies the computing power related factors (experience, cost and resources, etc.) into the same dimension modeling as the network factors, reduces the number of factors, and in specific scenarios, such as scenarios where the focus is on cost, it is usually not necessary to jointly calculate the computing network, only the service instance of the computing power needs to be optimized, and the network factor is relatively unimportant. The computing power factor-dominated optimization can be achieved by increasing the range of the original modeling computing power COST (making the range of COST exceed the maximum sum of the computing power network), and the adaptability is extremely strong. By abstracting the computing power service into a virtual node, the corresponding computing power instance is abstracted into a link connecting the EGW and the virtual node, the state of the computing power instance is used as the virtual link attribute, and the computing power instance is optimized through the EGW, which greatly reduces the number of links connected to the virtual node, directly injects the virtual node and link information into the TEDB and uses the IGP for diffusion, avoids the virtual node and normal node protocol interaction mechanism, and normalizes the computing network joint calculation to the conventional network TE problem. The calculation method is fully compatible with the network distributed calculation and centralized controller calculation of the traditional network TE path. By designing a computing power routing layer and a two-level computing power routing model that are independent of the IP routing connection layer, VPN deployment is supported. IGW can directly search the computing power forwarding table according to the computing power identifier, encapsulate the tunnel to reach EGW, and then EGW selects the computing power instance, avoiding the use of computing power identifiers to expand other drainage methods. EGW perceives whether the computing power service and instance exist, and decides whether to publish and revoke the route; the computing power route is published upstream with EGW as the next hop, which greatly reduces the burden on the control plane. In addition, EGW does not need to publish the IP routing information that reaches the computing power instance to IGW, which reduces the routing deployment configuration and enhances the connection security and scalability of the entire computing power routing domain. Based on the TE calculation results and VPN computing power routing, IGW uses COLOR and the service virtual node IP for association search. The entries that meet the conditions use the corresponding EGW-SID and the penultimate SID of the Segmentlist in SR-POLICY for matching and optimization, converting the computing network joint computing and routing problem into a conventional routing domain problem for solution, which can realize VPN deployment with flexible computing power resources.

[0089] The above-mentioned computing network scheduling method has strong feasibility, adaptability to different scenarios and scalability, which can accelerate the rapid implementation of the computing network in the existing network environment. Specifically: The computing power information is transparent to the intermediate nodes of the network, and there is no need to upgrade equipment and adjust configuration, which is easy to deploy in the existing network; the centralized and distributed computing network integrated computing and the centralized and distributed TE path computing of the traditional network are normalized, and the computing network brain and network controller do not need to add other perception computing power channels, which is highly feasible; the computing power factors (experience, cost and resources, etc.) and network factors are normalized and modeled, avoiding the problems of low efficiency and complexity caused by the joint computing of the computing network, and supporting the conversion of complex SLA requirements of the computing network into a variety of TE algorithm extensions; the computing power service identification scheme and the control plane are completely decoupled, and different identification schemes only affect the packaging and parsing of the computing power gateway identification, and the control plane software system is highly reusable; while keeping the SR-TE technical framework unchanged, Metric can continue to expand constraints in the future (this case takes latency as the goal), and according to the TE configuration, you can choose to use PCEP to initiate controller centralized computing (cross-domain scenarios) and head node computing (single-domain fast convergence scenarios).

[0090] It should be noted that for distributed computing, the IGW can calculate the traffic engineering calculation path from the IGW to the virtual node. For centralized computing, the computing network brain can centrally generate the corresponding SR-POLICY and send it to the IGW. Other subsequent computing power routing optimization and installation processes are completely decoupled from the centralized and distributed steps.

[0091] Figure 4 This is a flowchart of a computing network scheduling method provided by an embodiment, which is applied to cloud-side nodes. For technical details not described in detail in this embodiment, please refer to any of the above embodiments. Figure 4 As shown, the method provided in this embodiment includes:

[0092] In step 210, a service registration request is sent to the domain node according to the managed service type.

[0093] In step 220, when the service registration is successful, the resource status of the service instance corresponding to the service identifier is collected.

[0094] In step 230, computing power information is notified to the computing power egress gateway according to the resource status information, and the computing power information is diffused from the computing power egress gateway to the upstream gateway. In addition, traffic may be directed to the service instance by the computing power inlet gateway and the computing power egress gateway.

[0095] Figure 5 This is a flowchart of a computing network scheduling method provided by an embodiment, which is applied to a computing power entry gateway. For technical details not described in detail in this embodiment, please refer to any of the above embodiments. Figure 5As shown, the method provided in this embodiment includes:

[0096] In step 310, the computing power information announced by the computing power export gateway, as well as the service identifier issued by the network domain node and the service level agreement SLA information of the corresponding user access are obtained.

[0097] In step 320, a computing power route corresponding to a specific service identifier is calculated based on the computing power measurement indicator, the computing power information, and the SLA information.

[0098] In step 330, the service request message is forwarded to the corresponding computing power export gateway according to the computing power routing.

[0099] In one embodiment, it further includes:

[0100] Maintaining a global service routing table having multiple next hops for the specific service identifier according to the received computing power information of the multiple computing power export gateways;

[0101] A traffic engineering model is constructed according to the SLA information corresponding to the specific service identifier and the corresponding virtual node, wherein the traffic engineering model includes color information and the virtual node IP mapped to the service identifier.

[0102] In one embodiment, the computing power routing includes global service routing;

[0103] Calculating a computing power route corresponding to a specific service identifier according to the computing power measurement indicator, the computing power information, and the SLA information includes:

[0104] Determine a traffic engineering calculation path from a computing power entry gateway to a virtual node mapped to a service identifier according to the computing power measurement indicator, the computing power information, and the SLA information;

[0105] Matching the traffic engineering calculation path with the global service routing table to obtain the global service routing;

[0106] Among them, the penultimate node of the traffic engineering calculation path corresponds to the computing power exit gateway, and the last node of the traffic engineering calculation path corresponds to the virtual node mapped by the service identifier.

[0107] In one embodiment,

[0108] The computing power information does not include the service instance and preferred item information corresponding to the specific service identifier;

[0109] The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally;

[0110] The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes;

[0111] The computing power information is spread from the computing power export gateway to the direct computing power export gateway and is uniformly processed by the computing power import gateway.

[0112] In one embodiment, for the case of distributed computing, the IGW may execute the process of computing the traffic engineering path and matching it with the global service routing table described in any of the above embodiments.

[0113] In one embodiment, the computing power information includes preferred entries, which are determined by the computing power export gateway based on the computing power information announced by the cloud side, the SLA information corresponding to the service identifier, the virtual private network VPN information, and the load of the service IP, and the virtual routing forwarding identifier and the service identifier are used as key indexes.

[0114] Figure 6 This is a flowchart of a computing network scheduling method provided by an embodiment, which is applied to a computing power export gateway. For technical details not described in detail in this embodiment, please refer to any of the above embodiments. Figure 6 As shown, the method provided in this embodiment includes:

[0115] In step 410, the resource status of the service instance is obtained;

[0116] In step 420, a computing power measurement indicator and a local service route are determined according to the resource status.

[0117] In step 430, the virtual link and link attribute information corresponding to the virtual node are installed, and the virtual link and link attribute information are obtained by the computing power export gateway by selecting the service instance to the specific service identifier according to the local service routing surface.

[0118] In step 440, the computing power information notified by the cloud side is spread to the computing power entry gateway.

[0119] In one embodiment, the computing power measurement index includes network delay converted from computing delay, network cost converted from resource cost, interface bandwidth converted from total resource amount, and interface bandwidth occupancy converted from resource occupancy;

[0120] The method further comprises:

[0121] Generate a local service routing table, wherein the local service routing table includes a virtual routing forwarding VRF identifier, a service identifier, a service instance identifier, and corresponding computing power measurement information.

[0122] In one embodiment, installing the virtual link and link attribute information corresponding to the virtual node includes:

[0123] According to the local service routing, the IP corresponding to the service identifier is used as the virtual node, and the computing power measurement information of the corresponding entry is used as the link attribute of the virtual link to be flooded within the domain by the IGP, so as to realize the diffusion of the virtual link and link attribute information within the domain.

[0124] In one embodiment, the computing power information does not include information about the service instance and preferred item corresponding to the specific service identifier;

[0125] The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally;

[0126] The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes;

[0127] The computing power information is diffused from the computing power export gateway to the computing power gateway import gateway and is uniformly processed by the computing power import gateway.

[0128] In one embodiment, it further includes:

[0129] The local service routing table is searched according to the service identifier in the service request message to determine the corresponding service instance, and the message is forwarded to the corresponding service instance.

[0130] Figure 7 The following is a schematic diagram of an implementation of a computing power perception and computing network integrated scheduling system provided by an embodiment. The system can be used to implement computing network joint computing and computing power addressing with normalization of different computing and network factors in a computing power network. Figure 7 As shown, the relevant components and descriptions included in the overall technical architecture are as follows:

[0131] Cloud-side computing power perception module: This module can be added to the cloud-side monitoring system. Based on a full understanding of computing power scheduling requirements, it can aggregate and model the original indicators of computing power monitoring to form a small number of comprehensive indicators that can stably reflect the quality level of computing power. It serves as a speaker for computing power status. For related notification information, see the X1 interface.

[0132] Computing power perception component: This component can be added to the network device (EGW), connected (X1 interface) to the cloud-side computing power perception module, and can be used as the first consumer of computing power information. At the same time, it can be connected (X2 interface) to the computing power routing management component. By configuring relevant policies, the information shock suppression and processing can be achieved, and the processed qualified computing power information can be injected into the computing power routing management component;

[0133] Computing power routing management component: This component can be added to the network device, and the following functions can be implemented according to the received computing power status information: Generate a local computing power routing table SRIB, and perform local optimization according to the optimization strategy (experience, cost, and resources, etc.) associated with the SAN-ID; inject the optimized local computing power routing table (X4 interface) into the BGP protocol component for external release, and at the same time, as an EGW, also receive the computing power routing published by the BGP component from the remote BGP node to form a global computing power routing table; according to the local optimal computing power routing table for each service, form each virtual computing power node and abstract link and link parameters corresponding to the injection into the TEDB (X3 interface); as an IGW node receiving (interface X6), the SR-TE component generates the result according to the northbound configuration (the Policy path from this node to the virtual computing power node that meets the COLOR requirements), and generates the final global computing power forwarding table according to the VPN computing power routing iteration; connect to the message forwarding component and send down (X7 interface) the computing power forwarding table, of which 1-4 points are the key to this application;

[0134] Message forwarding component: Expands network devices, receives (X7 interface) local / global computing power forwarding tables issued by computing power routing management components and installs them to implement traffic scheduling and forwarding of terminal computing power service requests;

[0135] BGP protocol component: Expands on network devices to achieve local upload / download (X4 interface) and inter-node (X5 node) diffusion of VPN computing power routing;

[0136] SR-TE computing component: The computing power routing management component subscribes to the relevant calculation result table items and does not modify the external interface.

[0137] The key interfaces and description examples included in the overall technical architecture are as follows:

[0138] X1 and X2 interfaces: In the interface model, X1 and X2 differ only in notification frequency, bearer protocol and channel. Information types include add, update and delete. Model content elements include but are not limited to service ID, service instance IP, latency (cloud instance processing latency), cost (cloud instance usage cost), physical bandwidth (cloud instance available resources), and occupied bandwidth (cloud instance occupied resources).

[0139] X3 interface: Virtual node elements include but are not limited to service ID, virtual node IP, virtual node NODE SID, virtual link attributes include but are not limited to information such as latency, cost, link bandwidth, and link occupied bandwidth. The link attributes represent the preferred local computing instance status, and link attributes are refreshed as the local computing instance preference changes or the status is updated;

[0140] X4 interface: includes EGW node upstream and IGW node downstream, and its elements include but are not limited to VRF-ID, SAN-ID, COLOR, EGW-IP, and EGW-SID;

[0141] X5 interface: MP-BGP extension is adopted, and its elements include but are not limited to VPN information (RT / RD), SAN-ID, COLOR, EGW-IP, EGW-SID, VPN-SID;

[0142] X6 interface: It delivers SR-POLICY information. Usually, the indexes include Color and S-VIP. The attributes include at least segment list {SID1, SID2...EGW-SID, S-NODE-SID}, direct outbound interface, and gateway IP.

[0143] X7 interface: The local computing power routing table elements include but are not limited to: VRF-ID, SAN-ID, INS-IP; the global computing power routing table elements include but are not limited to: VRF-ID, SAN-ID, VPN-SID, OIF:SR-POLICY (COLOR, EGW-IP), Segment List {SID1, SID2...EGW-SID}, direct L3 outbound interface and corresponding gateway IP.

[0144] The following briefly describes the workflow of traffic steering in the computing power network:

[0145] (1) The client initiates a computing service request. The service request message carries the SID. There are multiple ways to carry the SID (ANYCAST address as SID, IP extension header, etc.). Regardless of the carrying method, the goal is to ensure that the service request message can reach the IGW and the IGW perceives the SID.

[0146] (2) The IGW receives the service request message from the client, identifies the corresponding SID and selects the corresponding EGW, and issues a specific network path to meet the network quality requirements for service access.

[0147] (3) The EGW receives the service request forwarded by the IGW, identifies the corresponding SID and selects the appropriate service instance IP. It also modifies the destination address of the service request message to the service instance IP, searches the IP routing table, and forwards the service request message to the service instance to implement the service connection.

[0148] (4) The service instance responds to the service request message and modifies the source IP address of the message to the destination IP address in the service request message on the EGW. The subsequent steps are part of the normal network service process.

[0149] For the control plane, in order to achieve the goal of computing-aware traffic steering, the conventional design idea of ​​the control plane of network equipment is to use IGP to implement network link attribute flooding and IGP / BGP extension to implement computing awareness and notify upstream nodes to form a traffic engineering database (TEDB) and a computing-aware database (CADB). It is necessary to associate CADB and TEDB across layers and perform joint computing (centralized or distributed) according to the service access SLA requirements to obtain service instances and network paths that meet the requirements. This will bring two problems: 1) Due to different computing speed requirements, centralized and distributed computing needs to be supported at the same time, so a set of SDN architecture similar to that based on PCEP is repeatedly designed; 2) The dimensions of computing domain quality (health score, average processing delay, economic cost, resource occupancy) and network domain quality (bandwidth, delay, jitter, packet loss) are not unified, and the computing time increases with the increase of constraints. A large amount of CPU resources are consumed and cannot be deployed on a large scale. In addition, computing instances of the same service type can be flexibly deployed to the same EGW and / or different EGWs. If the computing resource status of the EGW is continuously updated to the upstream IGW, the massive computing status information update will add tremendous pressure to the control plane of the network device and even cause the system to crash.

[0150] Figure 8 A schematic diagram of a control plane implementation provided for an embodiment. In this embodiment, traffic can be redirected to SLA targets to unify the five key metrics of end-to-end access latency, cost, bandwidth, jitter, and packet loss, depending on the objectives: 1) Experience category, which often focuses on latency, jitter, and packet loss; 2) Cost category, which often focuses on cost / energy consumption, i.e., cost; 3) Resource category, which focuses on resource usage / status. If the remaining cloud resources are converted into available bandwidth, then the available bandwidth is focused. In actual business deployment, one of the five metrics is often selected according to different objectives, and the other metrics are selected together as constraints. For example, Figure 8 As shown in the figure, taking distributed computing as an example, the control plane process mainly includes:

[0151] S1. Register, upgrade or cancel the service according to the service type and the service instance to which each service is attached. In addition, the computing power information may be obtained from a computing resource pool or an operation management system, and this embodiment does not limit the method for obtaining the computing power information.

[0152] S2. EGW computing load update. Registered service instances can be represented by IP. By recording computing power measurement indicators (Computing Metric), the acquired computing power information is converted into a dimension consistent with the network.

[0153] S3 and EGW can generate a local service routing table based on the computing power information obtained from S2, including VRF identifier, service identifier, service instance IP, and Computing Metric. On this basis, local optimization can be further performed, such as optimization based on latency, and the preferred entries can be diffused upstream for the head node or computing network brain to calculate computing power routing.

[0154] S4. EGW forms virtual nodes (representing which preferred services are currently connected to EGW) and links (preferred links, whose Metrics are used as Metrics of preferred computing resources) based on the preferred service instances. On this basis, the number of links can be greatly reduced and the network computing efficiency can be improved. It should be noted that it is also possible not to make a preference, and the number of links is determined by the number of service instances connected to EGW. In this step, the computing power information of the computing resources can be converted into the TE attributes of the link.

[0155] S5. Based on IGP, the TE link attributes and virtual node information are diffused and flooded to the upstream nodes.

[0156] S6. After diffusion, the IGW has global link information.

[0157] S7. The computing network joint scheduling problem is transformed into a network path problem. IGW can calculate a path from IGW to the virtual node corresponding to the service identifier.

[0158] S8, EGW01 and EGW02 publish MP-BGP VPN service routes. It should be noted that S9 can be performed synchronously with S5 / S6.

[0159] S9. Generate a global service routing table to form a global service route with multiple EGW next hops. Exemplarily, for each service, if each EGW has two preferred entries, a total of four global service routes can be formed.

[0160] S10, jointly match the result of S7 (EGWIP of the penultimate hop) with the result of the route generated by S9 (whether the penultimate hop is EGW01 or EGW02), determine whether to forward to EGW01 or EGW02, and obtain the final forwarding table, that is, the global service route.

[0161] On this basis, EGW01 or EGW02 may further determine the service instance.

[0162] Fig. 9A schematic diagram of a local service routing table provided by an embodiment. EGW senses the computing instance status from EdgeManager, and maintains the corresponding service instance entry in SRT based on the VPN information deployed by the computing resources, using VRF-ID and SID as indexes, and combining the service instance IP and the latency, bandwidth, and cost elements of the computing resources (see Fig. 9 ), and implement local processing according to the SLA constraints corresponding to the SID (for example, if the service SLA focuses on latency, then local priority is based on instance latency), form local SRT entry priority and use the preferred entry as SFT (see Fig.10 ) is sent to the forwarding plane for computing service request processing and forwarding.

[0163] When a preferred service instance exists for a specific SID in the local SRT, the EGW publishes a routing update message to the IGW. Once the resource status deteriorates and the preferred service instance becomes zero, a routing withdrawal message is published to the IGW. The bearer protocol is usually implemented using the BGP protocol family extension (MP-BGP), and the elements carried include message type, SID, EGW-IP, VPN-SID, RT / RD, etc. Service routes are published to the IGW instead of specific service instance information, thereby forming a service routing layer independent of the VPN IP routing and reducing the pressure on the control plane.

[0164] Based on the local SRT, EGW selects the entry for each SID and installs the virtual node and virtual link corresponding to the SID into the IGP. The virtual node is connected to the EGW through a virtual link. The latency, bandwidth, and COST of the preferred service instance are used as the link attributes of the virtual link. The network metric value is flooded and diffused in the IGP domain, which greatly reduces the scale of control plane information diffusion.

[0165] Fig.10 FIG. 1 is a schematic diagram of a global service routing table provided by an embodiment. Fig.10 As shown in the figure, the demand for optimal traffic steering for accessing the computing service SID on the IGW is transformed into a traditional network traffic engineering problem: that is, path calculation is performed between the virtual nodes corresponding to the SIDs connected to the IGW and EGW according to the SLA constraints corresponding to the service SIDs, and the corresponding SR-POLICY-1 path (COLO, Endpoint: SID) is generated, where the penultimate SEGMENT ID (NODE) ​​in the Segment List expresses the preferred EGW for service access under the current conditions, and the SR-POLICY-1 is converted into a SR-POLICY-2 path (COLOR, Endpoint: EGW-IP) that meets the requirements.

[0166] IGW receives VPN service routing information published by each EGW, and forms a global SRT to multiple EGWs, that is, VRF-ID and SID are used as keys, and different EGW-IPs are used as multiple next hops. Based on the COLOR and EGW-IP of each entry in SRT, SR-POLICY-2 is matched to obtain the optimal global SRT entry and generate a global SFT (refer to Figure 7 ) is sent to the IGW forwarding plane for traffic steering requests.

[0167] Fig.11 FIG. 1 is a schematic diagram of an implementation of a forwarding plane provided by an embodiment. Fig.11 As shown, illustratively, the main process of the forwarding plane is as follows:

[0168] S1: The terminal initiates a computing service request. The SAN-ID can be carried in a variety of ways (ANYCAST address as SAN-ID, extended header carrying, etc.). This embodiment of the present application does not limit this. Regardless of the carrying method, its purpose is to make the request message reach the IGW and make the IGW aware of the SAN-ID. In this example, the UE initiates a computing service request with SAN-ID = SID1;

[0169] S2: IGW receives the service request message from S1 and searches for the VPN computing power SFIB according to the SAN-ID SID1 carried in the message: {vidx, SID1, vidx-EGW01-SID, py-SID1-EGW01};

[0170] S3: IGW encapsulates the outer tunnel header and SRH (including VPN SID: vidx-EGW01-SID) according to the SFIB content, and keeps the inner message encapsulation unchanged. It sends the message to the outbound interface, and finally forwards it to EGW01 through the intermediate P1 node.

[0171] S4: EGW01 receives the tunnel-encapsulated service request message from IGW, removes the tunnel encapsulation, and takes out SID1 based on vidx-EGW01-SID and the SAN-ID feature to search the VPN SFIB to obtain instance IP1. At the same time, it converts the DA in the message to IP1 to form a NAT entry.

[0172] S5: EGW01 searches the local IP routing table for the decapsulated message to the service instance node;

[0173] S6: The service instance node responds to the service request message, where the source IP is IP1 and the destination IP is UE_IP;

[0174] S7: EGW01 receives the response message, searches the NAT table in S4 according to the message SRC=IP1, modifies the source IP of the message to SID1, and searches the corresponding VPN routing table according to the destination IP of the message. This VPN routing table is derived from the route published by IGW to EGW, which is usually related to network planning and deployment. Of course, a specific SR-TE path can also be planned for the return message, which is not limited in the embodiment of the present application;

[0175] S8: EGW01 encapsulates the outer tunnel header and SRH (including VPN SID) according to the table lookup result, and the inner packet encapsulation remains unchanged. It sends the packet to the outbound interface, and finally forwards it to the IGW through the intermediate node.

[0176] S9: The IGW performs normal message processing according to the message received in S8. This is a standard L3VPN message PE node processing flow, which will not be described in detail here.

[0177] S10: The IGW searches the local VPN routing table according to the service message decapsulated in S9, and finally sends it to the UE. This completes the round-trip processing of the UE service request and service instance response message. Subsequent UE-initiated messages repeat the S1-S10 process.

[0178] The embodiment of the present application also provides a computing network scheduling device. Fig.12 FIG. 1 is a schematic diagram of a computing network scheduling device provided by an embodiment. Fig.12 As shown, the computing network scheduling device includes:

[0179] A service registration module 510, configured to generate a service identifier according to a service registration request;

[0180] An indicator determination module 520 is configured to determine a computing power measurement indicator according to a resource state of a service instance corresponding to the service identifier;

[0181] The sending module 530 is configured to send the service identifier and the service level agreement SLA information of the corresponding user access to the computing power gateway;

[0182] The calculation module 540 is configured to calculate the computing power routing according to the computing power measurement indicator, the computing power information notified by the computing power gateway, and the SLA information.

[0183] The computing network scheduling device of this embodiment distinguishes different types of services through service identifiers. The SLA information corresponding to each service can be flexibly set to meet the requirements of multi-factor scheduling of computing network integration and the scheduling goals of experience, cost, and resource scenarios. By integrating computing power perception and computing network scheduling, it can reduce equipment resource consumption and investment, solve the pressure on the control and forwarding planes caused by the expansion of computing power information scale, and has good feasibility and scalability. By uniformly sending SAN-ID and mapped SLA information to the computing power gateway, it provides a basis for realizing the joint TE of computing network and the optimization of computing power routing.

[0184] In one embodiment, the service registration request includes a service domain name, a service IP and port, SLA information, and resource information.

[0185] In one embodiment, the metric indicators of the SLA information include: latency, cost, bandwidth, jitter, and reliability;

[0186] The computing power measurement indicators include network delay obtained by converting computing delay, network cost obtained by converting resource cost, interface bandwidth obtained by converting total resource amount, and interface bandwidth occupancy obtained by converting resource occupancy.

[0187] In one embodiment, the calculation module 530 includes:

[0188] A path determination unit, configured to determine a traffic engineering calculation path from a computing power entry gateway to a virtual node mapped to a service identifier according to the computing power measurement indicator, the computing power information notified by the computing power gateway, and the SLA information;

[0189] A matching unit is configured to match the traffic engineering calculation path with the global service routing table to obtain a global service route; wherein;

[0190] an instance determination unit, configured to determine the service instance corresponding to the specific service identifier according to the resource state of the service instance, and obtain the local service route;

[0191] Among them, the penultimate node of the traffic engineering calculation path corresponds to the computing power export gateway IP, and the last node of the traffic engineering calculation path corresponds to the virtual node mapped by the service identifier.

[0192] In one embodiment, the virtual link and link attribute information corresponding to the virtual node are obtained by the computing power export gateway selecting the service instance to the specific service identifier according to the local service routing surface; wherein the local service routing table includes the virtual routing forwarding identifier, the service identifier, the service instance IP and the corresponding computing power measurement information;

[0193] The virtual link and link attribute information are diffused by the Internal Gateway Protocol (IGP).

[0194] In one embodiment, the global service route includes: virtual private network information, service identification, service color, computing power export gateway IP, computing power export gateway segment identification, virtual private network segment identification;

[0195] The global service route is formed by spreading computing power information from the computing power egress gateway to the computing power ingress gateway;

[0196] The bearer protocol of the global service routing information is based on the BGP protocol family extension.

[0197] In one embodiment, the computing power information does not include information about the service instance and preferred item corresponding to the specific service identifier;

[0198] The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally;

[0199] The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes;

[0200] The computing power information is spread from the computing power export gateway to the computing power import gateway and is uniformly processed by the computing power import gateway.

[0201] The network scheduling device proposed in this embodiment and the network scheduling method proposed in the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the network scheduling method.

[0202] The embodiment of the present application also provides a computing network scheduling device. Fig.13 FIG. 1 is a schematic diagram of a computing network scheduling device provided by an embodiment. Fig.13 As shown, the computing network scheduling device includes:

[0203] A request module 610, configured to send a service registration request to a network domain node according to a managed service type;

[0204] The collection module 620 is configured to collect the resource status of the service instance corresponding to the service identifier when the service registration is successful;

[0205] The notification module 630 is configured to notify the computing power information to the computing power export gateway according to the resource status. The computing power information is diffused from the computing power export gateway to the upstream gateway, and the computing power import gateway and the computing power export gateway direct the traffic to the service instance.

[0206] The network scheduling device proposed in this embodiment and the network scheduling method proposed in the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the network scheduling method.

[0207] The embodiment of the present application also provides a computing network scheduling device. Fig.14 FIG. 1 is a schematic diagram of a computing network scheduling device provided by an embodiment. Fig.14 As shown, the computing network scheduling device includes:

[0208] The acquisition module 710 is configured to acquire the computing power information notified by the computing power export gateway, as well as the service identifier issued by the network domain node and the service level agreement SLA information of the corresponding user access;

[0209] A routing calculation module 720, configured to calculate a computing power route corresponding to a specific service identifier according to the computing power measurement indicator, the computing power information and the SLA information;

[0210] The forwarding module 730 is configured to forward the service request message to the corresponding computing power export gateway according to the computing power routing.

[0211] In one embodiment, it further includes:

[0212] A maintenance module, configured to maintain a global service routing table having multiple next hops for the specific service identifier according to the received computing power information of multiple computing power export gateways;

[0213] The construction module is configured to construct a traffic engineering model according to the SLA information corresponding to the specific service identifier and the corresponding virtual node, wherein the traffic engineering model includes the color information and the virtual node IP mapped to the service identifier.

[0214] In one embodiment, computing power routing includes global service routing;

[0215] The routing calculation module 720 includes:

[0216] A path determination unit, configured to determine a traffic engineering calculation path from a computing power entry gateway to a virtual node mapped to a service identifier according to the computing power measurement indicator, the computing power information and the SLA information;

[0217] A matching unit, configured to match the traffic engineering calculation path with a global service routing table to obtain the global service routing;

[0218] Among them, the penultimate node of the traffic engineering calculation path corresponds to the computing power exit gateway, and the last node of the traffic engineering calculation path corresponds to the virtual node mapped by the service identifier.

[0219] In one embodiment, the computing power information does not include the service instance and preferred item information corresponding to the specific service identifier;

[0220] The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally;

[0221] The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes;

[0222] The computing power information is spread from the computing power export gateway to the direct computing power export gateway and is uniformly processed by the computing power import gateway.

[0223] The network scheduling device proposed in this embodiment and the network scheduling method proposed in the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the network scheduling method.

[0224] The embodiment of the present application also provides a computing network scheduling device. Fig.15 FIG. 1 is a schematic diagram of a computing network scheduling device provided by an embodiment. Fig.15 As shown, the computing network scheduling device includes:

[0225] A status acquisition module 810 is configured to acquire the resource status of a service instance;

[0226] A determination module 820, configured to determine a computing power measurement indicator and a local service route according to the resource status;

[0227] An installation module 830 is configured to install the virtual link and link attribute information corresponding to the virtual node, wherein the virtual link and link attribute information are obtained by the computing power egress gateway selecting a service instance from a specific service identifier according to a local service routing surface;

[0228] The diffusion module 840 is configured to diffuse the computing power information notified by the cloud side to the computing power entry gateway.

[0229] In one embodiment, the computing power measurement index includes network delay converted from computing delay, network cost converted from resource cost, interface bandwidth converted from total resource amount, and interface bandwidth occupancy converted from resource occupancy;

[0230] The device also includes: a local generation module, which is configured to generate a local service routing table, wherein the local service routing table includes a virtual routing forwarding VRF identifier, a service identifier, a service instance identifier, and corresponding computing power measurement information.

[0231] In one embodiment, the installation module is configured to: according to the local service routing, use the IP corresponding to the service identifier as the virtual node, use the computing power measurement information of the corresponding entry as the link attribute of the virtual link to be flooded within the domain by the IGP, so as to realize the diffusion of the virtual link and link attribute information within the domain.

[0232] In one embodiment, the computing power information does not include information about the service instance and preferred item corresponding to the specific service identifier;

[0233] The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally;

[0234] The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes;

[0235] The computing power information is diffused from the computing power export gateway to the computing power gateway import gateway and is uniformly processed by the computing power import gateway.

[0236] In one embodiment, the device further includes: a forwarding module, configured to search a local service routing table according to a service identifier in the service request message to determine a corresponding service instance, and forward the message to the corresponding service instance.

[0237] The network scheduling device proposed in this embodiment and the network scheduling method proposed in the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the network scheduling method.

[0238] The present application also provides a computing network brain. Fig.16 A schematic diagram of the hardware structure of a computing network brain provided by an embodiment is shown in FIG. Fig.16 As shown, the computing network brain provided by the present application includes a processor 11 and a memory 12; the processor 11 in the computing network brain may be one or more processors. Fig.16 A processor 11 is taken as an example; the memory 12 is configured to store one or more programs; the one or more programs are executed by the one or more processors 11, so that the one or more processors 11 implement the computing network scheduling method as described in the embodiment of the present application.

[0239] The computing network brain also includes: a communication device 13, an input device 14 and an output device 15.

[0240] The processor 11, memory 12, communication device 13, input device 14 and output device 15 in the network brain can be connected through a bus or other means. Fig.16 The example of connecting through bus is taken in the following.

[0241] The input device 14 can be used to receive input digital or character information, and generate key signal input related to user settings and function control of the computing network brain. The output device 15 can include display devices such as display screens.

[0242] The communication device 13 may include a receiver and a transmitter. The communication device 13 is configured to perform information transmission and reception communication according to the control of the processor 11.

[0243] The memory 12, as a computer-readable storage medium, can be configured to store software programs, computer executable programs and modules, such as the program instructions / modules corresponding to the computing network scheduling method described in the embodiment of the present application (for example, the service registration module 510, the issuing module 520 and the computing module 530 in the computing network scheduling device). The memory 12 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computing network brain, etc. In addition, the memory 12 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 12 may further include a memory remotely arranged relative to the processor 11, and these remote memories may be connected to the computing network brain via 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.

[0244] The embodiment of the present application also provides a cloud-side node, Fig.17 A schematic diagram of the hardware structure of a cloud-side node provided by an embodiment, such as Fig.17 As shown, the cloud side node provided in the present application includes a processor 21 and a memory 22; the processor 21 in the cloud side node may be one or more, Fig.17 A processor 21 is taken as an example; the memory 22 is configured to store one or more programs; the one or more programs are executed by the one or more processors 21, so that the one or more processors 21 implement the computing network scheduling method as described in the embodiment of the present application.

[0245] The cloud-side node also includes: a communication device 23 , an input device 24 and an output device 25 .

[0246] The processor 21, memory 22, communication device 23, input device 24 and output device 25 in the cloud-side node may be connected via a bus or other means. Fig.17 The example of connecting through bus is taken in the following.

[0247] The input device 24 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the cloud-side node. The output device 25 may include a display device such as a display screen.

[0248] The communication device 23 may include a receiver and a transmitter. The communication device 23 is configured to perform information transmission and reception communication according to the control of the processor 21.

[0249] The memory 22, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the computing network scheduling method described in the embodiment of the present application (for example, the request module 610, the acquisition module 620, and the notification module 630 in the computing network scheduling device). The memory 22 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to the use of the cloud side node, etc. In addition, the memory 22 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 22 may further include a memory remotely arranged relative to the processor 21, and these remote memories may be connected to the cloud side node via 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 combinations thereof.

[0250] The present application also provides a computing power entry gateway. Fig.18 A schematic diagram of the hardware structure of a computing power entry gateway provided by an embodiment is shown in FIG. Fig.18 As shown, the computing power entry gateway provided in the present application includes a processor 31 and a memory 32; the processor 31 in the computing power entry gateway may be one or more processors, Fig.18 A processor 31 is taken as an example; the memory 32 is configured to store one or more programs; the one or more programs are executed by the one or more processors 31, so that the one or more processors 31 implement the computing network scheduling method as described in the embodiment of the present application.

[0251] The computing power entry gateway also includes: a communication device 33, an input device 34 and an output device 35.

[0252] The processor 31, memory 32, communication device 33, input device 34 and output device 35 in the computing power entry gateway can be connected through a bus or other means. Fig.18 The example of connecting through bus is taken in the following.

[0253] The input device 34 may be used to receive input digital or character information, and to generate key signal input related to user settings and function control of the computing power entry gateway. The output device 35 may include display devices such as a display screen.

[0254] The communication device 33 may include a receiver and a transmitter. The communication device 33 is configured to perform information transmission and reception communication according to the control of the processor 31.

[0255] The memory 32, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as the program instructions / modules corresponding to the computing network scheduling method described in the embodiment of the present application (for example, the acquisition module 710, the determination module 720, and the forwarding module 730 in the computing network scheduling device). The memory 32 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to the use of the computing power entry gateway, etc. In addition, the memory 32 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 32 may further include a memory remotely arranged relative to the processor 31, and these remote memories may be connected to the computing power entry gateway via 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 combinations thereof.

[0256] The present application also provides a computing power export gateway. Fig.19 A schematic diagram of the hardware structure of a computing power export gateway provided in an embodiment is shown in FIG. Fig.19 As shown, the computing power export gateway provided in the present application includes a processor 41 and a memory 42; the processor 41 in the computing power export gateway may be one or more processors, Fig.19 A processor 41 is taken as an example; the memory 42 is configured to store one or more programs; the one or more programs are executed by the one or more processors 41, so that the one or more processors 41 implement the computing network scheduling method as described in the embodiment of the present application.

[0257] The computing power export gateway also includes: a communication device 43, an input device 44 and an output device 45.

[0258] The processor 41, memory 42, communication device 43, input device 44 and output device 45 in the computing power export gateway can be connected through a bus or other means. Fig.19 The example of connecting through bus is taken in the following.

[0259] The input device 44 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the computing power export gateway. The output device 45 may include display devices such as a display screen.

[0260] The communication device 43 may include a receiver and a transmitter. The communication device 43 is configured to perform information transmission and reception communication according to the control of the processor 41.

[0261] The memory 42, as a computer-readable storage medium, can be configured to store software programs, computer executable programs and modules, such as the program instructions / modules corresponding to the computing network scheduling method described in the embodiment of the present application (for example, the diffusion module 810, the acquisition module 820, the determination module 830 and the forwarding module 840 in the computing network scheduling device). The memory 42 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to the use of the computing power export gateway, etc. In addition, the memory 42 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 42 may further include a memory remotely arranged relative to the processor 41, and these remote memories may be connected to the computing power export gateway via 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.

[0262] Fig. 20 A schematic diagram of the structure of a computing network scheduling system provided in one embodiment. The embodiment of the present application also provides a computing network scheduling system, including: a network domain node 910 and a cloud side node 920 as described in any of the above embodiments; the network domain node 910 includes a computing network brain 911, a packet network device 912, a computing power entry gateway 913 as described in any of the above embodiments, and a computing power exit gateway 914 as described in any of the above embodiments.

[0263] The computing network brain 911 generates a service identifier according to the service registration request of the cloud side node 920, and sends the service identifier and the corresponding service level agreement SLA information to the computing power gateway; in the scenario of centralized computing, it can also calculate the traffic engineering calculation path according to the computing power measurement index, the computing power information notified by the computing power gateway, and the SLA information, match the traffic engineering calculation path with the global service routing table to obtain the global service route, and send the global service route to the computing power entry gateway 913. The cloud side node 920 sends a service registration request to the network domain node 910 according to the managed service type; collects cloud side resource status information when the service registration is successful; and notifies the computing power information to the computing power exit gateway 914 according to the resource status information. The computing power information is diffused upstream by the computing power exit gateway 914 through the packet network device 912, and the computing power entry gateway 913 and the computing power exit gateway 914 guide the traffic to the service instance.

[0264] The computing power entry gateway 913 obtains the computing power information notified by the computing power exit gateway, as well as the service identifier and corresponding service level agreement SLA information issued by the computing network brain 910; in the scenario of distributed computing, the computing power entry gateway 913 can calculate the traffic engineering calculation path locally according to the computing power measurement index, the computing power information notified by the computing power gateway, and the SLA information, match the traffic engineering calculation path with the global service routing table to obtain the global service route and complete the issuance. According to the global service route, the service request message is forwarded to the corresponding computing power exit gateway 914.

[0265] The computing power export gateway 914 obtains the resource status of the service instance; determines the computing power measurement index and the local service route according to the resource status; installs the virtual link and link attribute information corresponding to the virtual node, and the virtual link and link attribute information are obtained by the computing power export gateway by selecting the service instance to the specific service identifier according to the local service routing surface; and spreads the computing power information notified by the cloud side to the computing power import gateway 913.

[0266] In this embodiment, the computing network brain 911 can perform centralized computing, or the computing power entry gateway 913 can perform distributed head node computing. Different types of services are distinguished by service identifiers, and the SLA information corresponding to each service can be flexibly set to meet the multi-factor scheduling requirements of the computing network as a whole, and meet the scheduling goals of experience, cost, and resource scenarios; by integrating computing power perception and computing network scheduling, it can reduce equipment resource consumption and investment, solve the pressure on the control and forwarding planes caused by the expansion of computing power information scale, and have good feasibility and scalability. By uniformly sending the SAN-ID and the mapped SLA information to the computing power gateway, it provides a basis for realizing the joint TE of the computing network and the optimization of computing power routing.

[0267] The embodiment of the present application also provides a storage medium, the storage medium stores a computer program, and when the computer program is executed by a processor, it implements any of the computing network scheduling methods described in the embodiments of the present application. The method includes: generating a service identifier according to a service registration request; determining a computing power measurement index according to the resource status of the service instance corresponding to the service identifier; sending the service identifier and the service level agreement SLA information of the corresponding user access to the computing power gateway; calculating the computing power routing according to the computing power measurement index, the computing power information notified by the computing power gateway, and the SLA information.

[0268] Alternatively, the method includes: sending a service registration request to a network domain node according to the type of service to be managed; collecting the resource status of the service instance corresponding to the service identifier when the service registration is successful; and notifying the computing power information to the computing power export gateway according to the resource status, and the computing power information is diffused by the computing power export gateway to the upstream gateway.

[0269] Alternatively, the method includes: obtaining computing power information announced by the computing power export gateway, as well as the service identifier issued by the network domain node and the service level agreement SLA information accessed by the corresponding user; calculating the computing power route corresponding to the specific service identifier based on the computing power measurement indicator, the computing power information and the SLA information; and forwarding the service request message to the corresponding computing power export gateway based on the computing power route.

[0270] Alternatively, the method includes: obtaining the resource status of the service instance; determining the computing power measurement index and the local service route according to the resource status; installing the virtual link and link attribute information corresponding to the virtual node, the virtual link and link attribute information are obtained by the computing power export gateway selecting the service instance to a specific service identifier according to the local service routing surface; and spreading the computing power information notified by the cloud side to the computing power entry gateway.

[0271] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (Random Access Memory, RAM), a read-only memory (Read Only Memory, ROM), an erasable programmable read-only memory (ErasableProgrammable Read Only Memory, EPROM), a flash memory, an optical fiber, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the above. The computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, a device or a device or used in combination with it.

[0272] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to: electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0273] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the above.

[0274] The computer program code for performing the operation of the present application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and also conventional procedural programming languages, such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on the remote computer, or completely on the remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect through the Internet).

[0275] The above description is merely an exemplary embodiment of the present application and is not intended to limit the protection scope of the present application.

[0276] It will be appreciated by those skilled in the art that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.

[0277] In general, various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, microprocessor or other computing device, although the present application is not limited thereto.

[0278] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0279] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored in a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs (DVD) or compact disks (CD), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FGPAs) and processors based on multi-core processor architectures.

[0280] By way of exemplary and non-limiting examples, a detailed description of exemplary embodiments of the present application has been provided above. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, but will not depart from the scope of the present application. Therefore, the proper scope of the present application will be determined according to the claims.

Claims

1. A computing network scheduling method, applied to a network domain node, characterized in that: include: Generate a service identifier according to a service registration request; Determine a computing power measurement indicator according to the resource status of the service instance corresponding to the service identifier; Send the service identifier and the service level agreement (SLA) information of the corresponding user access to the computing power gateway; The computing power route is calculated according to the computing power measurement indicator, the computing power information announced by the computing power gateway, and the SLA information.

2. The method according to claim 1, characterized in that The service registration request includes the service domain name, service IP and port, SLA information and resource information.

3. The method according to claim 1, characterized in that The metrics of the SLA information include: latency, cost, bandwidth, jitter, and reliability; The computing power measurement indicators include network delay obtained by converting computing delay, network cost obtained by converting resource cost, interface bandwidth obtained by converting total resource amount, and interface bandwidth occupancy obtained by converting resource occupancy.

4. The method according to claim 1, characterized in that: The computing power routing includes global service routing and local service routing; Calculating a computing power route according to the computing power measurement indicator, the computing power information notified by the computing power gateway, and the SLA information includes: Determine a traffic engineering calculation path from the computing power entry gateway to the virtual node mapped to the specific service identifier according to the computing power measurement indicator, the computing power information notified by the computing power gateway, and the SLA information; Matching the traffic engineering calculation path with the global service routing table to obtain the global service routing; Determine the service instance corresponding to the specific service identifier according to the resource state of the service instance, and obtain the local service route; Among them, the penultimate node of the traffic engineering calculation path corresponds to the computing power exit gateway, and the last node of the traffic engineering calculation path corresponds to the virtual node mapped by the specific service identifier.

5. The method according to claim 4, characterized in that The virtual link and link attribute information corresponding to the virtual node are obtained by the computing power export gateway selecting the service instance to the specific service identifier according to the local service routing surface; wherein the local service routing table includes the virtual routing forwarding identifier, the service identifier, the service instance IP and the corresponding computing power measurement information; The virtual link and link attribute information are diffused by the Internal Gateway Protocol (IGP).

6. The method according to claim 4, characterized in that The global service route includes: virtual private network information, service identifier, service color, computing power export gateway IP, computing power export gateway segment identifier, virtual private network segment identifier; The global service route is formed by spreading computing power information from the computing power egress gateway to the computing power ingress gateway; The bearer protocol of the global service routing information is based on the BGP protocol family extension.

7. The method according to claim 6, characterized in that The computing power information does not include information about the service instance and preferred item corresponding to the specific service identifier; The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally; The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes; The computing power information is spread from the computing power export gateway to the computing power import gateway and is uniformly processed by the computing power import gateway.

8. A computing network scheduling method, applied to cloud-side nodes, characterized in that: include: Send a service registration request to the domain node according to the managed service type; If the service registration is successful, the resource status of the service instance corresponding to the service identifier is collected; The computing power information is notified to the computing power export gateway according to the resource status, and the computing power information is diffused by the computing power export gateway to the upstream gateway.

9. A computing network scheduling method, applied to a computing power entry gateway, characterized in that: include: Obtain the computing power information announced by the computing power export gateway, as well as the service identifier issued by the network domain node and the service level agreement SLA information accessed by the corresponding user; Calculate the computing power route corresponding to the specific service identifier according to the computing power measurement indicator, the computing power information and the SLA information; The service request message is forwarded to the corresponding computing power export gateway according to the computing power routing.

10. The method according to claim 9, characterized in that Also includes: Maintaining a global service routing table having multiple next hops for the specific service identifier according to the received computing power information of the multiple computing power export gateways; A traffic engineering model is constructed according to the SLA information corresponding to the specific service identifier and the corresponding virtual node, wherein the traffic engineering model includes color information and the virtual node IP mapped to the service identifier.

11. The method according to claim 10, characterized in that The computing power routing includes global service routing; Calculating a computing power route corresponding to a specific service identifier according to the computing power measurement indicator, the computing power information, and the SLA information includes: Determine a traffic engineering calculation path from a computing power entry gateway to a virtual node mapped to a service identifier according to the computing power measurement indicator, the computing power information, and the SLA information; Matching the traffic engineering calculation path with the global service routing table to obtain the global service routing; Among them, the penultimate node of the traffic engineering calculation path corresponds to the computing power exit gateway, and the last node of the traffic engineering calculation path corresponds to the virtual node mapped by the service identifier.

12. The method according to claim 10, characterized in that The computing power information does not include the service instance and preferred item information corresponding to the specific service identifier; The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally; The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes; The computing power information is spread from the computing power export gateway to the direct computing power export gateway and is uniformly processed by the computing power import gateway.

13. A computing network scheduling method, applied to a computing power export gateway, characterized in that: include: Get the resource status of the service instance; Determine a computing power measurement indicator and a local service route according to the resource status; Install the virtual link and link attribute information corresponding to the virtual node, where the virtual link and link attribute information are obtained by the computing power egress gateway selecting a service instance from a specific service identifier according to the local service routing surface; Spread the computing power information notified by the cloud side to the computing power entry gateway.

14. The method according to claim 13, characterized in that The computing power measurement indicators include network delay converted from computing delay, network cost converted from resource cost, interface bandwidth converted from total resource amount, and interface bandwidth occupancy converted from resource occupancy; The method further comprises: Generate a local service routing table, wherein the local service routing table includes a virtual routing forwarding VRF identifier, a service identifier, a service instance identifier, and corresponding computing power measurement information.

15. The method according to claim 13, characterized in that Install the virtual links and link attribute information corresponding to the virtual nodes, including: According to the local service routing, the IP corresponding to the service identifier is used as the virtual node, and the computing power measurement information of the corresponding entry is used as the link attribute of the virtual link to be flooded within the domain by the IGP, so as to realize the diffusion of the virtual link and link attribute information within the domain.

16. The method according to claim 13, characterized in that The computing power information does not include information about the service instance and preferred item corresponding to the specific service identifier; The computing power information is decided by the computing power export gateway whether to announce or revoke it according to whether there is a corresponding preferred entry locally; The computing power information uses the virtual routing forwarding identifier and service identifier as key indexes; The computing power information is diffused from the computing power export gateway to the computing power gateway import gateway and is uniformly processed by the computing power import gateway.

17. The method according to claim 13, characterized in that Also includes: The local service routing table is searched according to the service identifier in the service request message to determine the corresponding service instance, and the message is forwarded to the corresponding service instance.

18. A network domain node, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the computing network scheduling method as described in any one of claims 1 to 7.

19. A cloud-side node, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the computing network scheduling as described in claim 8.

20. A computing power entry gateway, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the computing network scheduling method as described in any one of claims 9 to 12.

21. A computing power export gateway, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the computing network scheduling method as described in any one of claims 13-17.

22. A computing network scheduling system, characterized in that: include: A network domain node and a cloud side node as claimed in claim 18; The network domain node includes a computing network brain, a packet network device, a computing power entry gateway as described in claim 19, and a computing power exit gateway as described in claim 20.

23. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the computing network scheduling method as described in any one of claims 1-17 is implemented.

Images