A Node Scheduling Method, Device, Equipment and Medium for a Computing Power Network

Abstract

The present application provides a node scheduling method, device, equipment and medium for a computing power network. The method obtains the computing power information of each computing power service node in the computing power network and the performance information of the network, and then determines the first candidate nodes corresponding to each preset service type according to the above information. By sending the first corresponding relationship between the first candidate nodes and the preset service types to the gateway device, the gateway device can schedule the service requests sent by the application device to the target nodes corresponding to the service types of the service requests according to the first corresponding relationship, and then provide computing power resources for the application device through the target nodes. The gateway device in the above process does not participate in the calculation of the corresponding relationship. Therefore, even if the first candidate nodes corresponding to each preset service type are updated and calculated frequently, there will be no problem of routing oscillation. Thus, the best computing power service nodes can be provided for the services with high-frequency refresh requirements in a timely manner to ensure their service requirements.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technologies, and in particular, to a node scheduling method, device, equipment, and medium for a computing power network. Background Art

[0002] As the information society enters a new stage of intelligence, the demand for information infrastructure is no longer to solve the connectivity problem. Currently, computing power and big data resources have become the key to new information infrastructure. A computing power network is a new type of information infrastructure that allocates and flexibly schedules resources on demand among the cloud, edge, and terminal according to service requirements.

[0003] The computing power network will select the best computing power node from numerous computing power service nodes based on service requirements, and send the computing power resources of this node to the application device. The current node selection method mostly uses the Border Gateway Protocol (BGP). The computing power service node reports its own computing power information to the edge router, and then the gateway device deployed in the bearer network, such as the edge router, integrates and calculates the network performance information and the received computing power information to obtain the best computing power node.

[0004] The above method requires the participation of gateway devices in the calculation. To suppress routing oscillation, currently, the method of setting the BGP protocol advertisement period is mostly used to report resources periodically. This directly limits the node switching rate, and it is difficult to provide the best computing power node in a timely manner for services with high-frequency refresh requirements for computing power information, such as assisted driving, virtual reality / augmented reality (VR / AR), etc., and it is difficult to guarantee their service requirements. Summary of the Invention

[0005] The embodiments of the present application provide a node scheduling method, device, equipment, and medium for a computing power network, which are used to solve the problem that the node selection time of the computing power network is relatively long due to the resource reporting method, and thus the best computing power node cannot be provided in a timely manner for services with high-frequency refresh requirements.

[0006] To achieve the above object, the technical solution of the embodiments of the present application is realized as follows:

[0007] In a first aspect, the embodiments of the present application provide a node scheduling method for a computing power network, and the method includes:

[0008] Obtain the computing power information of the computing power service node and the performance information of the network;

[0009] For any preset service type, determine a first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network;

[0010] Send the correspondence between the preset service type and the first candidate node to the gateway device; wherein, the preset service type is the service type supported by the computing power service node;

[0011] The first correspondence is used for the gateway device to schedule the service request to the target node according to the correspondence when receiving a service request sent by the application device; wherein, the first candidate node includes the target node.

[0012] In some possible embodiments, after determining the first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network, the method further includes:

[0013] Generate a scheduling path of the first candidate node according to the first correspondence, and send the scheduling path to the gateway device; wherein, the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

[0014] In some possible embodiments, the method further includes:

[0015] When the computing power service node in the network changes, obtain the computing power information of the changed computing power service node and the performance information of the network;

[0016] Determine a second candidate node corresponding to the preset service type according to the newly obtained computing power information and performance information;

[0017] Establish a second correspondence between each preset service type and the second candidate node, and send the second correspondence to the gateway device; wherein, the second correspondence is used for the gateway device to schedule the service request to the alternative node according to the second correspondence when the first correspondence is not available; wherein, the second candidate node includes the alternative node.

[0018] In some possible embodiments, the computing power information includes any one or combination of the processor utilization rate, memory utilization rate, number of received and transmitted packets, number of received and transmitted bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the network.

[0019] In a second aspect, an embodiment of the present application provides a node scheduling device for a computing power network, and the device includes:

[0020] An information acquisition module, configured to execute acquiring the computing power information of the computing power service node and the performance information of the network;

[0021] A node determination module, configured to execute, for any preset service type, determine a first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network;

[0022] A relationship distribution module, configured to execute and distribute the first correspondence between the preset service type and the first candidate node to the gateway device; wherein, the preset service type is the service type supported by the computing power service node;

[0023] The first correspondence is used for the gateway device to schedule the service request to the target node according to the correspondence when receiving a service request sent by the application device; wherein, the first candidate node includes the target node.

[0024] In some possible embodiments, the relationship distribution module is further configured to:

[0025] Generate a scheduling path of the first candidate node according to the first correspondence, and distribute the scheduling path to the gateway device; wherein, the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

[0026] In some possible embodiments, the node determination module is further configured to:

[0027] When the computing power service nodes in the network change, obtain the computing power information of the changed computing power service nodes and the performance information of the network;

[0028] Determine a second candidate node corresponding to the preset service type according to the newly obtained computing power information and the performance information;

[0029] Establish a second correspondence between each preset service type and the second candidate node, and distribute the second correspondence to the gateway device; wherein, the second correspondence is used for the gateway device to schedule the service request to the alternative node according to the second correspondence when the first correspondence is not available; wherein, the second candidate node includes the alternative node.

[0030] In some possible embodiments, the computing power information includes any one or combination of the processor utilization rate, memory utilization rate, number of received and transmitted packets, number of received and transmitted bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the network.

[0031] In a third aspect, an embodiment of the present application further provides a control device for a computing power network, including a memory and a processor. A computer program that can run on the processor is stored on the memory. When the computer program is executed by the processor, the processor implements any one of the methods in the above first aspect.

[0032] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium. A computer program is stored in the computer-readable storage medium. When the computer program is executed by a processor, it implements any one of the methods in the above first aspect.

[0033] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes computer instructions. The computer instructions are stored in a computer-readable storage medium. When a processor of a computer device reads the computer instructions from the computer-readable storage medium, the processor executes the computer instructions, so that the computer device executes any one of the methods in the above first aspect.

[0034] In the embodiment of the present application, by obtaining the computing power information of each computing power service node in the computing power network and the performance information of the network, and then determining the first candidate nodes corresponding to each preset service type according to the above information. By sending the first correspondence between the first candidate nodes and the preset service types to the gateway device, the gateway device can schedule the service requests sent by the application device to the target nodes corresponding to the service types of the service requests according to the first correspondence, and then provide computing power resources for the application device through the target nodes. The gateway device in the above process does not participate in the calculation of the correspondence. Therefore, even if the first candidate nodes corresponding to each preset service type are updated and calculated frequently, there will be no problem of routing oscillation. Thus, the best computing power service nodes can be provided in time for services with high-frequency refresh requirements, ensuring their service requirements.

[0035] Other features and advantages of the present application will be described in the subsequent specification, and, in part, will be obvious from the specification, or will be understood by implementing the present disclosure. The objectives and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written specification, claims, and drawings. Description of the Drawings

[0036] Figure 1 It is an expanded schematic diagram of the BGP protocol provided by an embodiment of the present application;

[0037] Figure 2 It is the overall flowchart of the node scheduling method for the computing power network provided by an embodiment of the present application;

[0038] Figure 3 It is the schematic diagram of the computing power network structure provided by an embodiment of the present application;

[0039] Figure 4 It is an interaction schematic diagram of the computing power network provided by the embodiment of the present application;

[0040] Figure 5 It is a schematic diagram of the computing power routing table provided by the embodiment of the present application;

[0041] Figure 6 It is a schematic diagram of the forwarding flow table provided by the embodiment of the present application;

[0042] Figure 7 It is a schematic diagram of the binding table provided by the embodiment of the present application;

[0043] Figure 8 It is a node scheduling flow chart provided by the embodiment of the present application;

[0044] Figure 9 It is a structural diagram of the node scheduling device 900 of the computing power network provided by the embodiment of the present application;

[0045] Figure 10 It is a structural diagram of a control device of a computing power network provided by the embodiment of the present application. Detailed implementation manners

[0046] To make the objectives, technical solutions, and advantages of the present application clearer and more understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present application. Without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other arbitrarily. And although the logical order is shown in the flow chart, in some cases, the steps shown or described can be executed in a different order than here.

[0047] The terms "first" and "second" in the specification and claims of the present application and the above accompanying drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the term "including" and any variations thereof are intended to cover non-exclusive protection. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally further includes steps or units not listed, or optionally further includes other steps or units inherent to these processes, methods, products, or devices. "Multiple" in the present application can represent at least two, for example, it can be two, three, or more, and the embodiments of the present application do not make limitations.

[0048] As mentioned above, the computing power network will select the best computing power node from numerous computing power service nodes based on service requirements and allocate the computing power resources of this node to the application device to provide the required computing power resources for the application device. When the application device sends a service request to the computing power network, the computing power network will select the best computing power node that best meets the service requirements from numerous computing power service nodes and allocate the computing power resources of this node to the application device. Currently, most node selection methods require each computing power service node to report its computing power information to the edge router connected to it through the BGP protocol, and then the gateway devices such as edge routers deployed in the bearer network integrate and calculate the network performance information and the received computing power information to obtain the best computing power node.

[0049] That is, whenever the application device sends a service request, it is necessary to calculate the best computing power node that provides computing power resources for the application device through the above process. Since the gateway device is a physical device with fixed resources, if the best computing power node is calculated based on the gateway device at a high frequency, routing oscillation is very likely to occur. To suppress routing oscillation, currently, the method of setting the BGP protocol advertisement period is mostly used to report resources periodically. By setting an extended field for the BGP protocol, various computing power information of the node is defined as corresponding data type fields, including site priority, computing power resource utilization rate, load measurement, etc. Then, periodically (usually set to one cycle every 32 seconds), the computing power information of itself is reported to the connected edge server through the BGP protocol, which directly limits the switching rate of the node. Specifically, as Figure 1 shown, its data type Type is the type of computing power information, Length is the data length, and Vlaue is the data value of the Type data type, that is, the value of this type of computing power information.

[0050] From the perspective of resource requirements, services can be divided into two categories: services with high-frequency refresh requirements and services with low-frequency refresh requirements. Services with high-frequency refresh requirements are those that need to perform real-time rendering of images, such as assisted driving, virtual reality / augmented reality (VR / AR), etc., and have high requirements for computing power performance, network latency, etc. While services such as video playback, which have a certain caching ability and low requirements for computing power performance, are services with low-frequency refresh requirements. For services with high-frequency refresh requirements, the above method of updating network resources once every 32 seconds obviously cannot meet their service requirements. That is, it cannot provide the best computing power node for services with high-frequency refresh requirements in a timely manner.

[0051] To solve the above problems, the inventive concept of the embodiments of the present application is as follows: by obtaining the computing power information of each computing power service node in the computing power network and the performance information of the network, to determine the first candidate nodes corresponding to each preset service type according to the above information. By sending the first correspondence between the first candidate nodes and the preset service types to the gateway device, so that the gateway device can schedule the service requests sent by the application device to the target nodes corresponding to the service types of the service requests according to the first correspondence, and then provide computing power resources for the application device through the target nodes. The gateway device in the above process does not participate in the calculation of the correspondence. Therefore, even if the first candidate nodes corresponding to each preset service type are updated and calculated frequently, there will be no problem of routing oscillation. Thus, the best computing power service nodes can be provided in time for services with high-frequency refresh requirements to ensure their service requirements.

[0052] See Figure 2 , Figure 2 is the overall flowchart of a node scheduling method for a computing power network provided by an embodiment of the present application, which specifically includes:

[0053] Step 201: Obtain the computing power information of the computing power service node and the performance information of the network;

[0054] Specifically, as Figure 3 shown, from the perspective of sending computing power resources to the application device, the computing power network can be divided into three parts: a controller 100 for overall scheduling of internal devices in the computing power network, a bearer network 101, and a data center 102 (i.e., the internal network). The service requests of the application device need to be scheduled to the computing power service nodes in the data center 102 for providing computing power resources through the bearer network 101.

[0055] There are various gateway devices in the bearer network 101, such as edge routers located at the network edge and core routers located at the network center. As Figure 4 shown, a first gateway device 401 is provided on one side of the network in the bearer network 101, and a second gateway device 402 is provided on the other side. The first gateway device 401 is used to connect to the application device, and the second gateway device 402 on the other side is used to connect to the computing power service node 403 in the data center 102. By pre-establishing communication links between the controller 100 and each computing power service node 403 and gateway devices (including the first gateway device 401, the second gateway device 402, and gateway devices such as core routers not shown in the figure), the computing power information of the computing power service node and the performance information of the bearer network can be obtained at any time.

[0056] It should be further noted that, as mentioned above, in the prior art, the BGP protocol extension method is mostly used for the computing power service node to report its own computing power information to the edge router connected to it. Due to equipment constraints, there is a problem that some devices in the existing network do not support the BGP protocol extension, that is, the device may have transformation requirements such as replacement and upgrade to support the information transmission in the BGP protocol extension mode.

[0057] However, in this application, by establishing a communication link between the controller and each computing power service node, the computing power information of each computing power service node can be directly obtained through the communication link, without using the BGP protocol extension method for information transmission. It is very friendly to the existing network devices, does not involve the transformation work introduced by service expansion, avoids the replacement and upgrade work of related boards and devices, and can effectively shorten the cycle of new service deployment and opening.

[0058] The computing power information in the embodiments of this application includes any one or combination of the processor utilization rate, memory utilization rate, number of received and sent packets, number of received and sent bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the bearer network.

[0059] Step 202: For any preset service type, determine a first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network;

[0060] As mentioned above, the main reason why the current computing power network cannot meet the service requirements of high-frequency refreshing is that in the current computing power network, each computing power service node 403 first reports its own computing power information to the edge router connected to it through the BGP protocol (that is, the first gateway device 401 shown above), and then the gateway devices deployed in the bearer network such as the edge router integrate and calculate the performance information and the received computing power information to obtain the optimal computing power node. The entire process requires physical devices to participate in the calculation, and high-frequency calculations will cause routing oscillations. Therefore, in the related technology, a 32-second cycle is adopted, and the resource statistics are carried out through the advertisement method of BGP protocol extension. Figure 3 Since the controller of the computing power network is essentially a software program, its resources are not fixed like hardware. Therefore, if the decision-making of node calculation is handed over to the controller for execution, the routing oscillation problem caused by high-frequency node calculation can be effectively avoided. During implementation, a computing power routing table can be established according to the performance information and the computing power information. The significance of computing power routing is to schedule the service requests in the application segment along the optimal path to the computing power service node, so as to improve the efficiency of computing power and network resources. Therefore, from the perspective of computing power routing, it is necessary to maintain a computing power routing table to record the computing power routing of each computing power service node.

[0061] Since the controller of the computing power network is essentially a software program, its resources are not fixed like hardware. Therefore, if the decision-making of node calculation is handed over to the controller for execution, the routing oscillation problem caused by high-frequency node calculation can be effectively avoided. During implementation, a computing power routing table can be established according to the performance information and the computing power information. The significance of computing power routing is to schedule the service requests in the application segment along the optimal path to the computing power service node, so as to improve the efficiency of computing power and network resources. Therefore, from the perspective of computing power routing, it is necessary to maintain a computing power routing table to record the computing power routing of each computing power service node.

[0062] During implementation, the controller scores each computing power service node based on the performance information and computing power information, and then determines the scores of the computing power service nodes that can support each preset service type, the next-hop address, and the computing power service nodes connected to the first gateway device indicated by the next-hop address. Specifically, as Figure 5 shown, the computing power routing table records the SID of each preset service type, the score Compute Metric, the next-hop address Next Hop, the address BID IP of the computing power service node, and the scheduling path Color to the computing power service node. In this way, through this computing power routing table, it is possible to know the computing power service nodes in the current network that can provide computing power resources for each preset service type.

[0063] Furthermore, according to the score situation corresponding to each preset service type in the computing power routing table, the first candidate nodes for providing computing power resources for the service requests of this preset service type can be selected based on the scores of each computing power service node. For example Figure 5 the score results of the three computing power service nodes corresponding to the preset service type 1 shown are 70, 50, and 35 respectively. The higher the score in the table, the better the performance of the computing power resources that the computing power service node can provide. To avoid resource waste, the selection rule can be set according to actual needs. For example, the computing power service node with the lowest score is selected as the first candidate node corresponding to the preset service type 1.

[0064] It should be noted that it has been mentioned above that the computing power information in the embodiments of the present application includes any one or combination of the processor utilization rate, memory utilization rate, number of received and sent packets, number of received and sent bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the network. Since the service requests have different business requirements, for example, some service requests expect to obtain powerful computing power resources, and some need computing power resources with low latency and fast response speed, etc., the weights can be flexibly attached to each data item in the above-mentioned computing power information and performance information for each preset service type according to the focus of the business requirements, and then the comprehensive scores of each computing power service node that can provide computing power resources for this preset service type are determined based on the weights, and then the first candidate node corresponding to this preset service type is selected from them according to the comprehensive scores.

[0065] Step 203: Send the first correspondence between the preset service type and the first candidate node to the gateway device; where the preset service type is the service type supported by the computing power service node; the first correspondence is used for the gateway device to schedule the service request to the target node according to the correspondence when receiving the service request sent by the application device; where the first candidate node includes the target node.

[0066] During implementation, the corresponding relationship between each preset service type and the first candidate node, i.e., the first corresponding relationship, can be determined according to the computing power routing table in step 202 above. Then, a forwarding flow table for being sent to the second gateway device is generated according to the first corresponding relationship. Still taking Figure 5 as an example, assume that Figure 5 the IP address of the first candidate node of the preset service type 1 shown is BID31. Then, a forwarding flow table as shown in Figure 6 is generated. Each preset service type SID, the address BID IP of the first candidate node corresponding to SID, and the next-hop address Next Hop to the first candidate node are recorded in the forwarding flow table. In this way, the second gateway device can schedule the service request sent by the application device to the computing power service nodes indicated by the forwarding flow table according to the received forwarding flow table.

[0067] Furthermore, after determining the first corresponding relationship between each preset service type and the first candidate node, a scheduling path for the first candidate node can be generated according to the first corresponding relationship. The scheduling path is used to indicate the optimal path for scheduling the service request to the first candidate node. By sending the scheduling path to the second gateway device, the second gateway device can schedule the service request to the target node in step 203 above according to the scheduling path corresponding to the target node. It should be understood that the preset service type having the first corresponding relationship with the target node is the service type of the service request.

[0068] During implementation, a scheduling path Color indicating the optimal path for scheduling the service request to the first candidate node can be added to the forwarding flow table representing the first corresponding relationship. Specifically, the calculated computing power routing can be used to send the forwarding flow table to the second gateway device in the BGP-FS extension manner, and its scheduling path can be sent using the BGP protocol.

[0069] Considering that when a communication failure occurs between the controller and the device, there may be a situation where the forwarding flow table fails to be sent. To ensure that the second gateway device can still schedule the service request when it does not have the forwarding flow table, when the computing power service nodes in the network change, the computing power information of the changed computing power service nodes and the performance information of the network can be obtained. The second candidate node corresponding to the preset service type is determined according to the newly obtained computing power information and performance information, and the second corresponding relationship between each preset service type and the second candidate node is established. Then, the second corresponding relationship is sent to the gateway device; wherein, the second corresponding relationship is used for the gateway device to schedule the service request to the alternative node according to the second corresponding relationship when it does not have the first corresponding relationship; wherein, the second candidate node includes the alternative node.

[0070] Specifically, when there are changes in the service nodes of the computing power network, for example, when an established computing power service node in the network goes offline or a new computing power service node is added, the resource information of the entire network (i.e., computing power information and performance information) is re - counted, and the second candidate nodes corresponding to each preset service type are determined according to the re - counted resource information. The so - called second candidate nodes are computing power service nodes whose own computing power and network performance can support the preset service type. Thus, a binding table is generated to record the second correspondence between each preset service type and the corresponding second candidate nodes.

[0071] Specifically, the binding table is as follows Figure 7 shown. What is recorded in the binding table is the second correspondence between each preset service type and the second candidate nodes. For example Figure 7 as shown in, for preset service type 1, there are 3 second candidate node addresses BID11, 21, and 31, which means that these three second candidate nodes are all computing power service nodes whose own computing power and network performance can support this preset service type.

[0072] As mentioned above, the purpose of setting the binding table is to provide resources for application devices even when the device does not have a forwarding flow table. After the application device sends a service request, node scheduling can be performed through the process as shown in Figure 8 shown, including:

[0073] Step 800: Receive the service request sent by the application device;

[0074] Step 801: Determine whether there is a communication failure in the second gateway device;

[0075] Specifically, if there is a communication failure between the controller and the second gateway device, it means that the controller cannot inform the second gateway device of the forwarding flow table based on the latest resource statistics, that is, the second gateway device does not have the latest updated forwarding flow table.

[0076] Step 802: If there is no communication failure, the second gateway device determines the target node of the service request according to the forwarding flow table;

[0077] Specifically, assume that the service request sent by the application device is for enabling cloud gaming. Then cloud gaming is the request type of this service request. The controller issues a forwarding flow table to the second gateway device through a pre - established communication link, so that the second gateway device determines the preset service type of enabling cloud gaming from the forwarding flow table and determines the scheduling path of the first candidate node (i.e., the target node) corresponding to this preset service type according to the first correspondence shown in the table.

[0078] Step 803: Schedule the service request to the target node;

[0079] Step 804: If there is a communication failure, the second gateway device determines alternative nodes for the service request according to the binding table;

[0080] During implementation, when the second gateway device does not have a forwarding flow table, it can find a preset service type that is the same as the service request type in the binding table representing the second corresponding relationship, and the second candidate nodes corresponding to the preset service type. Then, an alternative node is selected from each of the second candidate nodes.

[0081] It should be noted that specifically how to select alternative nodes from the second candidate nodes can be determined according to actual business requirements, and this application does not make any limitations in this regard.

[0082] Step 805: Schedule the service request to the alternative node.

[0083] The above process generates a forwarding flow table for the second gateway device based on the corresponding relationship between the preset service type and the first candidate node, so that the second gateway device schedules the service request sent by the application device to the target node through the first gateway device, and then provides computing power resources for the application device through the target node. And when there is an update to the computing power service nodes in the network, a binding table is sent to the second gateway device to enable resource allocation to the application device even when the second gateway device does not have a forwarding flow table.

[0084] Since the gateway device does not participate in the calculation of the corresponding relationship throughout the process. Therefore, even if the corresponding relationship between each preset service type and the first candidate node is refreshed frequently, there will be no problem of routing oscillation, and thus the best target node can be provided in a timely manner for services with high-frequency refresh requirements to ensure their business needs.

[0085] Based on the same inventive concept, an embodiment of this application provides a node scheduling device 900 for a computing power network, specifically as Figure 9 shown, including:

[0086] An information acquisition module 901, configured to acquire the computing power information of the computing power service nodes and the performance information of the network;

[0087] A node determination module 902, configured to, for any preset service type, determine a first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network;

[0088] A relationship distribution module 903, configured to distribute the first corresponding relationship between the preset service type and the first candidate node to the gateway device; where the preset service type is the service type supported by the computing power service nodes;

[0089] The first corresponding relationship is used for the gateway device to schedule the service request to the target node according to the corresponding relationship when receiving the service request sent by the application device; wherein, the first candidate node includes the target node.

[0090] In some possible embodiments, the relationship distribution module is further configured to:

[0091] Generate a scheduling path of the first candidate node according to the first corresponding relationship, and distribute the scheduling path to the gateway device; wherein, the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

[0092] In some possible embodiments, the node determination module is further configured to:

[0093] When the computing power service nodes in the network change, obtain the computing power information of the changed computing power service nodes and the performance information of the network;

[0094] Determine a second candidate node corresponding to the preset service type according to the newly obtained computing power information and performance information;

[0095] Establish a second corresponding relationship between each preset service type and the second candidate node, and distribute the second corresponding relationship to the gateway device; wherein, the second corresponding relationship is used for the gateway device to schedule the service request to the alternative node according to the second corresponding relationship when the first corresponding relationship is not available; wherein, the second candidate node includes the alternative node.

[0096] In some possible embodiments, the computing power information includes any one or combination of the processor utilization rate, memory utilization rate, number of received and transmitted packets, number of received and transmitted bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the network.

[0097] Next, refer to Figure 10 to describe a control device 130 of a computing power network according to this embodiment of the present application. This control device 130 is a controller for carrying the computing power network introduced in the foregoing steps 201 to 203. This control device may specifically be a hardware device such as a server or a service cluster for carrying the controller, and the present application does not limit this. It should be noted that Figure 10 The displayed control device 130 is only an example, and should not bring any limitation to the functions and usage scope of the embodiments of the present application.

[0098] Such as Figure 10As shown, the control device 130 is presented in the form of a general control device. The components of the control device 130 may include, but are not limited to: the at least one processor 131 described above, the at least one memory 132 described above, and a bus 133 that connects different system components (including the memory 132 and the processor 131).

[0099] The bus 133 represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a processor, or a local area bus using any of the multiple bus structures.

[0100] The memory 132 may include a readable medium in the form of volatile memory, such as a random access memory (RAM) 1321 and / or a cache memory 1322, and may further include a read-only memory (ROM) 1323.

[0101] The memory 132 may also include a program / utilities 1325 having a set (at least one) of program modules 1324. Such program modules 1324 include, but are not limited to: an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include the implementation of a network environment.

[0102] The control device 130 may also communicate with one or more external devices 134 (such as a keyboard, a pointing device, etc.), may also communicate with one or more devices that enable a user to interact with the control device 130, and / or may communicate with any device (such as a router, a modem, etc.) that enables the control device 130 to communicate with one or more other control devices. Such communication may be performed through an input / output (I / O) interface 135. Moreover, the control device 130 may also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 136. As shown in the figure, the network adapter 136 communicates with other modules for the control device 130 through the bus 133. It should be understood that although not shown in the figure, other hardware and / or software modules may be used in conjunction with the control device 130, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0103] In an exemplary embodiment, a computer-readable storage medium including instructions is also provided, such as the memory 132 including instructions, and the instructions can be executed by the processor 131 of the above device to complete the above method. Optionally, the computer-readable storage medium may be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc.

[0104] In an exemplary embodiment, a computer program product is further provided, including a computer program / instructions, and when the computer program / instructions are executed by a processor 131, any of the methods in a node scheduling method of a computing power network provided in this application is implemented.

[0105] In an exemplary embodiment, various aspects of a node scheduling method of a computing power network provided in this application can also be implemented in the form of a program product, which includes program code. When the program product runs on a computer device, the program code is used to cause the computer device to execute the steps in a node scheduling method of a computing power network according to various exemplary embodiments described above in this specification.

[0106] The program product can adopt any combination of one or more readable media. The readable media can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples (non-exhaustive list) of the readable storage medium include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0107] The program product for node scheduling of a computing power network in the embodiments of this application can adopt a portable compact disc read-only memory (CD-ROM) and include program code, and can run on a control device. However, the program product of this application is not limited to this. In this document, the readable storage medium can be any tangible medium that contains or stores a program, and this program can be used by or in combination with an instruction execution system, apparatus, or device.

[0108] The readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, in which the readable program code is carried. Such a propagated data signal can take various forms, including - but not limited to - electromagnetic signals, optical signals, or any suitable combination of the above. The readable signal medium can also be any readable medium other than the readable storage medium, and this readable medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device.

[0109] The program code included on the readable medium can be transmitted with any appropriate medium, including - but not limited to - wireless, wired, optical cable, RF, etc., or any suitable combination of the above.

[0110] The program code for performing the operations of the present application can be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and also including conventional procedural programming languages such as languages or similar programming languages. The program code can be executed entirely on the user control device, partially on the user device, executed as a stand-alone software package, partially on the user control device and partially on a remote control device, or entirely on a remote control device or server. In the case of a remote control device, the remote control device can be connected to the user control device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external control device (e.g., by connecting through the Internet using an Internet service provider).

[0111] It should be noted that although several units or subunits of the device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, according to the embodiments of the present application, the features and functions of the two or more units described above can be embodied in one unit. Conversely, the features and functions of one unit described above can be further divided and embodied by multiple units.

[0112] In addition, although the operations of the method of the present application are described in a specific order in the drawings, this does not require or imply that these operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, some steps can be omitted, multiple steps can be combined into one step for execution, and / or one step can be decomposed into multiple steps for execution.

[0113] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0114] This application is described with reference to the flowcharts and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram can be implemented by computer program instructions, and the combination of the flows and / or blocks in the flowchart and / or block diagram can also be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable image scaling devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable image scaling devices generate means for implementing the functions specified in one or more of the flows Figure 1 one or more of the flows Figure 1 or one or more of the blocks

[0115] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable image scaling device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a manufactured article including instruction means, and the instruction means implement the functions specified in one or more of the flows Figure 1 one or more of the flows Figure 1 or one or more of the blocks

[0116] These computer program instructions can also be loaded onto a computer or other programmable image scaling device, so that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process, and the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more of the flows Figure 1 one or more of the flows Figure 1 or one or more of the blocks

[0117] Although the preferred embodiments of the present application have been described, those skilled in the art can make additional changes and modifications once they know the basic creative concepts. Therefore, the appended claims are intended to be construed to include the preferred embodiments and all changes and modifications that fall within the scope of the present application.

[0118] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these modifications and variations.

Claims

1. A node scheduling method for a computing power network, characterized in that, The method includes: Obtaining the computing power information of computing power service nodes and the performance information of the network; For any preset service type, determining a first candidate node corresponding to the preset service type from one or more computing power service nodes that support the preset service type according to the computing power information and the performance information of the network; wherein, the preset service type is a service type supported by the one or more computing power service nodes; Generating a forwarding flow table according to the first correspondence between the preset service type and the first candidate node; Sending the forwarding flow table to a gateway device, so that when the gateway device receives a service request sent by an application device, scheduling the service request to a target node according to the forwarding flow table; wherein, the first candidate node includes the target node; When there is a change in the computing power service nodes in the network, obtaining the computing power information of the changed computing power service nodes and the performance information of the network; Determining a second candidate node corresponding to the preset service type according to the newly obtained computing power information and the performance information; Establishing a second correspondence between the preset service type and the second candidate node, and generating a binding table for recording the second correspondence; Sending the binding table to the gateway device, so that when there is a communication failure between the controller and the gateway device, the gateway device schedules the service request to an alternative node according to the binding table; the second candidate node includes the alternative node.

2. The method according to claim 1, characterized in that, After determining the first candidate node corresponding to the preset service type according to the computing power information and the performance information of the network, the method further includes: Generating a scheduling path of the first candidate node according to the first correspondence; wherein, the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

3. The method according to claim 1 or 2, characterized in that, The computing power information includes any one or combination of the processor utilization rate, memory utilization rate, number of received and sent packets, number of received and sent bytes, and node priority of the computing power service node; the performance information includes any one or combination of the network delay, jitter, and packet loss rate of the network.

4. A node scheduling device for a computing power network, characterized in that, The apparatus includes: An information acquisition module configured to obtain the computing power information of computing power service nodes and the performance information of the network; A node determination module configured to, for any preset service type, determine a first candidate node corresponding to the preset service type from one or more computing power service nodes that support the preset service type according to the computing power information and the performance information of the network; wherein, the preset service type is a service type supported by the one or more computing power service nodes; A relationship sending module configured to generate a forwarding flow table according to the first correspondence between the preset service type and the first candidate node; send the forwarding flow table to a gateway device, so that when the gateway device receives a service request sent by an application device, schedule the service request to a target node according to the forwarding flow table; wherein, the first candidate node includes the target node; The node determination module is further configured to, when a computing power service node in the network changes, obtain the computing power information of the changed computing power service node and the performance information of the network; determine a second candidate node corresponding to the preset service type according to the re-obtained computing power information and performance information; The relationship distribution module is further configured to establish a second correspondence between the preset service type and the second candidate node, and generate a binding table for recording the second correspondence; send the binding table to the gateway device, so that when a communication failure occurs between the controller and the gateway device, the gateway device schedules the service request to the alternative node according to the binding table; the second candidate node includes the alternative node.

5. The device according to claim 4, characterized in that, The relationship distribution module is further configured to: Generate a scheduling path of the first candidate node according to the first correspondence; wherein, the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

6. The device according to claim 4 or 5, characterized in that, The computing power information includes any one or a combination of the processor utilization rate, memory utilization rate, number of received and sent packets, number of received and sent bytes, and node priority of the computing power service node; the performance information includes any one or a combination of the network delay, jitter, and packet loss rate of the network.

7. A control device for a computing power network, characterized in that, Including: A memory for storing program instructions; The controller is configured to call the program instructions stored in the memory and execute the method according to any one of claims 1-3 according to the obtained program instructions.

8. A computer program product, characterized in that, The computer program product includes: computer program code, when the computer program code runs on a computer, causing the computer to execute the method according to any one of claims 1-3 above.

Images