CN115695281A

CN115695281A - Node scheduling method, device, equipment and medium for computational power network

Info

Publication number: CN115695281A
Application number: CN202211321511.4A
Authority: CN
Inventors: 刘明; 李加新; 曲延锋; 陈学平
Original assignee: Beijing Star Net Ruijie Networks Co Ltd
Current assignee: Beijing Star Net Ruijie Networks Co Ltd
Priority date: 2022-10-26
Filing date: 2022-10-26
Publication date: 2023-02-03

Abstract

The method comprises the steps of obtaining computing power information of each computing power service node in the computing power network and performance information of the network, and further determining first candidate nodes corresponding to each preset service type according to the information. The first corresponding relation between the first candidate node and the preset service type is issued to the gateway equipment, so that the gateway equipment can dispatch the service request sent by the application equipment to a target node corresponding to the service type of the service request according to the first corresponding relation, and computing resources are provided for the application equipment through the target node. The gateway device in the above-mentioned flow does not participate in the calculation of the correspondence. Therefore, even if the first candidate node corresponding to each preset service type is updated and calculated at high frequency, the problem of route oscillation cannot be caused, so that the optimal calculation service node can be provided for the service with the high-frequency refreshing requirement in time, and the service requirement is guaranteed.

Description

Node scheduling method, device, equipment and medium for computational power network

Technical Field

The embodiment of the application relates to the technical field of communication, in particular to a node scheduling method, device, equipment and medium of a computational power network.

Background

As the information society enters a new intelligent stage, the demand of information infrastructure is no longer a solution to the connectivity problem, and computing power and big data resources become the key of the novel information infrastructure at present. The computing network is a novel information infrastructure for allocating and flexibly scheduling resources among the cloud, the edge and the terminal according to business requirements.

The computing network selects the optimal computing node from a plurality of computing service nodes based on the service requirement, and issues the computing resource of the node to the application equipment. The current node selection mode mostly passes through a Border Gateway Protocol (BGP), and the computing service node reports computing power information of itself to an edge router, and then the edge router and other Gateway devices deployed in a bearer network integrate and compute network performance information and received computing power information to obtain an optimal computing power node.

In the method, gateway equipment needs to participate in calculation, and in order to inhibit the route oscillation, a BGP protocol notification period is mostly set at present to periodically report resources. This directly limits the switching rate of the node, and for services such as driving assistance, virtual reality/augmented reality (VR/AR), etc., which have a high-frequency refreshing requirement on the computational power information, the optimal computational power node cannot be provided in time, and it is difficult to guarantee the service requirement.

Disclosure of Invention

The embodiment of the application provides a node scheduling method, a node scheduling device and a node scheduling medium for a computational power network, which are used for solving the problem that the computational power network cannot provide an optimal computational power node for a service with a high-frequency refreshing requirement in time due to a long node selection time caused by a resource reporting mode.

In order to achieve the above purpose, the technical solution of the embodiment of the present application is implemented as follows:

in a first aspect, an embodiment of the present application provides a node scheduling method for a computational power network, where the method includes:

acquiring computing power information of a computing power service node and performance information of a network;

aiming at any preset service type, determining a first candidate node corresponding to the preset service type according to the computing power information and the network performance information;

issuing the first corresponding relation between the preset service type and the first candidate node to gateway equipment; the preset service type is a service type supported by the computing power service node;

the first corresponding relation is used for dispatching the service request to a target node according to the corresponding relation when the gateway equipment receives the service request sent by the application equipment; wherein the first candidate node comprises the target node.

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:

generating a dispatching path of the first candidate node according to the first corresponding relation, and issuing the dispatching path to the gateway equipment; wherein the scheduling path is used for the gateway device to schedule the service request to the target node through the scheduling path.

In some possible embodiments, the method further comprises:

under the condition that a computing power service node in the network is changed, obtaining computing power information of the computing power service node and performance information of the network after the change;

determining a second candidate node corresponding to the preset service type according to the re-acquired computational power information and the performance information;

establishing a second corresponding relation between each preset service type and the second candidate node, and sending the second corresponding relation to the gateway equipment; the second corresponding relation is used for dispatching the service request to an alternative node according to the second corresponding relation when the gateway device does not have the first corresponding relation; wherein the second candidate node comprises the candidate node.

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

In a second aspect, an embodiment of the present application provides an apparatus for scheduling nodes in a computational power network, where the apparatus includes:

the information acquisition module is configured to acquire computing power information of the computing power service node and performance information of the network;

the node determination module is configured to determine a first candidate node corresponding to any preset service type according to the computing power information and the performance information of the network;

the relationship issuing module is configured to execute issuing the first corresponding relationship between the preset service type and the first candidate node to gateway equipment; the preset service type is a service type supported by the computing power service node;

In some possible embodiments, the relationship issuing module is further configured to:

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

under the condition that a computing power service node in the network is changed, obtaining computing power information of the computing power service node after the change and performance information of the network;

establishing a second corresponding relation between each preset service type and the second candidate node, and sending the second corresponding relation to the gateway equipment; the second corresponding relationship is used for dispatching the service request to an alternative node according to the second corresponding relationship when the gateway device does not have the first corresponding relationship; wherein the second candidate node comprises the candidate node.

In a third aspect, an embodiment of the present application further provides a control device for a computational power network, including a memory and a processor, where the memory stores a computer program executable on the processor, and when the computer program is executed by the processor, the processor is caused to implement any one of the methods in the first aspect.

In a fourth aspect, this application further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements any one of the methods of the first aspect.

In a fifth aspect, an embodiment of the present application is a computer program product, which includes computer instructions stored in a computer-readable storage medium; when the processor of the computer device reads the computer instructions from the computer-readable storage medium, the processor executes the computer instructions, causing the computer device to perform the method of any of the first aspects described above.

According to the method and the device, the computing power information of each computing power service node in the computing power network and the performance information of the network are obtained, and then the first candidate node corresponding to each preset service type is determined according to the information. The first corresponding relation between the first candidate node and the preset service type is issued to the gateway equipment, so that the gateway equipment can dispatch the service request sent by the application equipment to a target node corresponding to the service type of the service request according to the first corresponding relation, and computing resources are provided for the application equipment through the target node. The gateway device in the above-mentioned flow does not participate in the calculation of the correspondence. Therefore, even if the first candidate node corresponding to each preset service type is updated and calculated at high frequency, the problem of route oscillation cannot be caused, so that the optimal calculation service node can be provided for the service with the high-frequency refreshing requirement in time, and the service requirement is guaranteed.

Additional features and advantages of the present application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the present disclosure. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

Fig. 1 is a schematic diagram of an extension of a BGP protocol provided in an embodiment of the present application;

fig. 2 is an overall flowchart of a node scheduling method of a computational power network according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of a computational power network according to an embodiment of the present disclosure;

FIG. 4 is an interaction diagram of a computational power network provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of a computational power routing table provided by an embodiment of the present application;

fig. 6 is a schematic diagram of a forwarding flow table provided in an embodiment of the present application;

FIG. 7 is a diagram of a binding table provided in an embodiment of the present application;

fig. 8 is a flowchart of node scheduling provided in the embodiment of the present application;

fig. 9 is a structural diagram of a node scheduling apparatus 900 of a computational power network according to an embodiment of the present application;

fig. 10 is a block diagram of a control device of a computational power network according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application without making any creative effort belong to the protection scope of the present application. In the present application, the embodiments and features of the embodiments may be arbitrarily combined with each other without conflict. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.

The terms "first" and "second" in the description and claims of the present application and the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the term "comprises" and any variations thereof are intended to cover non-exclusive protection. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. The "plurality" in the present application may mean at least two, for example, two, three or more, and the embodiments of the present application are not limited.

As mentioned above, the computing network selects the best computing node from the computing service nodes based on the service demand and issues the computing resources of the node to the application device, so as to provide the application device with the required computing resources. When the application equipment sends a service request to the computing network, the computing network selects the best computing node which best meets the service requirement from a plurality of computing service nodes based on the service requirement, and sends computing resources of the node to the application equipment. In the current node selection mode, each computational power service node reports own computational power information to an edge router connected with the computational power service node through a BGP protocol, and then the edge router and other gateway equipment deployed in a carrier network integrate and calculate network performance information and the received computational power information to obtain an optimal computational power node.

That is, each time the application device sends a service request, the optimal computing node for providing computing resources for the application device needs to be computed through the above process. Because the gateway device is a fixed-resource entity device, if the calculation of the optimal computational power node is performed based on the high frequency of the gateway device, routing oscillation is easily generated. In order to suppress the route oscillation, a BGP protocol advertisement period is often set at present to periodically report resources. Various computing power information of the nodes is defined to be corresponding data type fields by setting extension fields for a BGP protocol, wherein the data type fields comprise site priority, computing power resource utilization rate, load measurement and the like. The self-computing information is then reported periodically (usually set to be 32 seconds per cycle) to the connected edge servers via the BGP protocol, which directly limits the switching rate of the nodes. Specifically, as shown in fig. 1, the data Type is the Type of the computing power information, the Length is the data Length, and Vlaue is the data value of the Type data Type, that is, the value of the Type of the computing power information.

From the perspective of resource requirements, services can be divided into two types of services with high frequency refreshing requirements and low frequency refreshing requirements. The services with the high frequency refreshing requirement are services which need to render a picture in real time, such as driving assistance, virtual reality/augmented reality (VR/AR), and the like, and have high requirements on computing power performance, network delay, and the like, for example, video playing and the like have certain caching capacity, and the services with low requirements on computing power performance are services with the low frequency refreshing requirement. For services with high frequency refreshing requirements, the above-mentioned manner of updating the resources in the network every 32 seconds obviously cannot meet the service requirements. That is, the best computational power node cannot be provided for the service with high frequency refreshing requirement in time.

In order to solve the above problems, the inventive concept of the embodiments of the present application is: and determining a first candidate node corresponding to each preset service type according to the information by acquiring the computing power information of each computing power service node in the computing power network and the performance information of the network. The first corresponding relation between the first candidate node and the preset service type is issued to the gateway equipment, so that the gateway equipment can dispatch the service request sent by the application equipment to a target node corresponding to the service type of the service request according to the first corresponding relation, and computing resources are provided for the application equipment through the target node. The gateway device in the above-mentioned flow does not participate in the calculation of the correspondence. Therefore, even if the first candidate node corresponding to each preset service type is updated and calculated at high frequency, the problem of route oscillation cannot be caused, so that the optimal calculation service node can be provided for the service with the high-frequency refreshing requirement in time, and the service requirement is guaranteed.

Referring to fig. 2, fig. 2 is an overall flowchart of a node scheduling method of a computational power network provided in an embodiment of the present application, which specifically includes:

step 201: acquiring computing power information of a computing power service node and performance information of a network;

specifically, as shown in fig. 3, from the perspective of issuing computing resources to application devices, the computing network may be divided into three parts, namely a controller 100, a bearer network 101 and a data center 102 (i.e., an intranet) for performing overall scheduling on internal devices of the computing network, and a service request of an application device needs to be scheduled to a computing service node for providing computing resources in the data center 102 through the bearer network 101.

A variety of gateway devices, such as an edge router located at the edge of the network and a core router located at the center of the network, are disposed in the carrier network 101. As shown in fig. 4, a first gateway device 401 is disposed on one side of a network in the bearer network 101, and a second gateway device 402 is disposed on the other side. The first gateway device 401 is used to connect to an application device, and the second gateway device 402 on the other side is used to connect to a computing power service node 403 in the data center 102. By 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 a core router not shown in the figure) in advance, computing power information of the computing power service node and performance information of the bearer network are obtained at any time.

It should be noted that, as mentioned above, in the prior art, the computation service node reports its computation information to the edge router connected to the computation service node in a BGP protocol extension manner. The existing network stock equipment has the problem that part of equipment does not support BGP protocol extension due to the restriction of the equipment, namely the equipment possibly has transformation requirements such as replacement, upgrading and the like so as to support BGP protocol extension for information transmission.

By establishing the communication link between the controller and each computational power service node, the computational power information of each computational power service node can be directly obtained through the communication link without adopting a BGP protocol extension mode for information transmission. The method is very friendly to the existing network stock equipment, does not relate to the transformation work introduced by service expansion, avoids the replacement and upgrade work of related board cards and equipment, and can effectively shorten the period of deploying and opening new services.

The computing power information in the embodiment of the application comprises any one or combination of the processor utilization rate, the memory utilization rate, the number of receiving and sending packets, the number of receiving and sending bytes and the node priority of the computing power service node; the performance information includes any one or a combination of network delay, jitter and packet loss rate of the bearer network.

Step 202: aiming at any preset service type, determining a first candidate node corresponding to the preset service type according to the calculation force information and the performance information of the network;

as mentioned above, the main reason that the current computational power network cannot meet the service requirement of high frequency refreshing is that in the current computational power network, each computational power service node 403 reports its own computational power information to an edge router (i.e., the first gateway device 401 shown in fig. 3) connected to the edge router through a BGP protocol, and then the edge router and other gateway devices deployed in the bearer network integrate and calculate the performance information and the received computational power information to obtain an optimal computational power node. The whole process requires entity equipment to participate in calculation, and high-frequency calculation can generate routing oscillation. Therefore, in the related art, statistics of resources is performed in an announcement manner of BGP protocol extension with a period of 32 seconds.

Because the controller of the computational power network is essentially a software program, and the resources of the controller are not fixed as hardware, the problem of routing oscillation caused by high-frequency node computation can be effectively avoided if the decision of the node computation is executed by the controller. In implementation, the calculation force routing table can be established according to the performance information and the calculation force information. The significance of the computational routing is that the service request of the application segment is dispatched to the computational service node along the optimal path, so that the computational and network resource efficiency is improved. It is necessary to maintain a computation routing table to record the computation routing of each computation service node from the computation routing perspective.

In implementation, the controller scores each computing power service node according to the performance information and the computing power information, and further determines a score, a next hop address and a computing power service node which is connected with the first gateway device indicated by the next hop address and can support each preset service type. Specifically, as shown in fig. 5, each preset service type SID, score computer Metric, next Hop address Next Hop, address BID IP of the computing service node, and dispatch path Color to the computing service node are recorded in the computing routing table. Therefore, the computational power service node in the current network can be known through the computational power routing table, and computational power resources can be provided for each preset service type.

Further, according to the score condition corresponding to each preset service type in the calculation force routing table, the first candidate node for providing calculation force resources for the service request of the preset service type can be selected according to the score of each calculation force service node. For example, the scoring results of three computing power service nodes corresponding to the preset service type 1 shown in fig. 5 are 70, 50 and 35, respectively, and the higher the scoring is, the more excellent the performance of computing power resources that the computing power service node can provide is represented. In order to avoid resource waste, a selection rule may be set according to actual requirements, for example, a computational service node with the lowest score is selected as the first candidate node corresponding to the preset service type 1.

It should be noted that, in the foregoing, it has been mentioned that the computation force information in this embodiment includes any one or a combination of a processor utilization rate, a memory utilization rate, a number of send-receive packets, a number of send-receive bytes, and a node priority of the computation force service node; the performance information includes any one or a combination of network delay, jitter, and packet loss rate of the network. Because the service requirements of different service requests are different, for example, some service requests expect to obtain powerful computing resources, some service requests need computing resources with low time delay and high response speed, and the like, weights can be flexibly added to each item of data in the computing information and the performance information according to the emphasis of the service requirements, then the comprehensive scores of the computing service nodes capable of providing the computing resources for the preset service types are determined based on the weights, and then the first candidate node corresponding to the preset service type is selected according to the comprehensive scores.

Step 203: issuing the first corresponding relation between the preset service type and the first candidate node to gateway equipment; the preset service type is a service type supported by the computing power service node; the first corresponding relation is used for dispatching the service request to a target node according to the corresponding relation when the gateway equipment receives the service request sent by the application equipment; wherein the first candidate node comprises the target node.

In practice, the corresponding relationship between each preset service type and the first candidate node, i.e. the first corresponding relationship, may be determined according to the computation power routing table in step 202. And generating a forwarding flow table for issuing to the second gateway device according to the first corresponding relation. Still taking fig. 5 as an example for explanation, assuming that the IP address of the first candidate node of the preset service type 1 shown in fig. 5 is BID31, a forwarding flow table as shown in fig. 6 is generated. The forwarding flow table records each preset service type SID, an address BID IP of a first candidate node corresponding to the SID, and a Next Hop address Next Hop to the first candidate node. In this way, the second gateway device may schedule the service request sent by the application device into the compute service node indicated by the forwarding flow table according to the received forwarding flow table.

Further, after determining a first corresponding relationship between each preset service type and the first candidate node, the scheduling path of the first candidate node may be generated according to the first corresponding relationship. The scheduling path is an optimal path for instructing to schedule the service request to the first candidate node, and the scheduling path is issued to the second gateway device, so that the second gateway device schedules the service request to the target node in step 203 according to the scheduling path corresponding to the target node. It should be understood that the predetermined service type having the first corresponding relationship with the target node is the service type of the service request.

In implementation, a scheduling path Color characterizing the forwarding flow table characterizing the first corresponding relationship may be added to the forwarding flow table characterizing the first corresponding relationship, for indicating an optimal path for scheduling the service request to the first candidate node. Specifically, the calculated computational route may be issued a forwarding flow table to the second gateway device by using a BGP-FS extension mode, and the scheduling path may be issued by using a BGP protocol.

When a communication fault occurs between the controller and the device, a situation that the forwarding flow table is failed to be issued may exist. In order to ensure that the second gateway device can still realize the scheduling of the service request when the forwarding flow table is not provided, the computing power information of the computing power service node and the performance information of the network after the scheduling of the service request are changed can be obtained under the condition that the computing power service node in the network is changed. And determining a second candidate node corresponding to the preset service type according to the re-acquired computational power information and performance information, and establishing a second corresponding relation between each preset service type and the second candidate node. Then, the second corresponding relation is issued to the gateway equipment; the second corresponding relation is used for dispatching the service request to the alternative node according to the second corresponding relation when the gateway equipment does not have the first corresponding relation; wherein the second candidate node comprises a candidate node.

Specifically, when a service node of the computational power network changes, for example, an established computational power service node is offline in the network or a computational power service node is newly added, the resource information (i.e., the computational power information and the performance information) of the whole network is counted again, and a second candidate node corresponding to each preset service type is determined according to the resource information counted again, where the second candidate node is the computational power service node capable of supporting the preset service type in terms of self computational power and network performance. And generating a binding table for recording a second corresponding relation between each preset service type and the corresponding second candidate node.

The binding table is specifically shown in fig. 7, and what is recorded in the binding table is a second corresponding relationship between each preset service type and the second candidate node. For example, the preset service type 1 shown in fig. 7 corresponds to addresses BID11, BID 21, and BID31 of 3 second candidate nodes, that is, these three second candidate nodes are all self-computing power, and the network performance can support the computing power service node of the preset service type.

As mentioned above, the purpose of setting the binding table is to provide resources for the application device even when the device does not have a forwarding flow table. After the application device sends the service request, the node scheduling may be performed through a process shown in fig. 8, which includes:

step 800: receiving a service request sent by application equipment;

step 801: determining whether a communication failure exists in the second gateway device;

specifically, if there is a communication failure between the controller and the second gateway device, it indicates that the controller cannot notify the second gateway device of the forwarding flow table obtained based on the latest resource statistics, that is, the second gateway device does not have the latest updated forwarding flow table.

Step 802: if no communication fault exists, the second gateway device determines a target node of the service request according to the forwarding flow table;

specifically, assuming that the service request sent by the application device is enabled for a cloud game, the cloud game is a request type of the service request. The controller issues a forwarding flow table for the second gateway device through a pre-established communication link, so that the second gateway device determines the preset service type of the cloud game starting from the forwarding flow table, and determines a scheduling path of a first candidate node (namely a target node) corresponding to the preset service type according to a first corresponding relation shown in the table.

Step 803: scheduling the service request to a target node;

step 804: if the communication fault exists, the second gateway equipment determines an alternative node of the service request according to the binding table;

in implementation, when the second gateway device does not have a forwarding flow table, the preset service type which is the same as the service request type and the second candidate node corresponding to the preset service type can be found according to the binding table representing the second correspondence. And then selecting and determining a candidate node from the second candidate nodes.

It should be noted that, specifically, how to select the candidate node from the second candidate nodes may be set by itself according to the actual service requirement, which is not limited in the present application.

Step 805: the service request is scheduled to an alternative node.

The flow generates a forwarding flow table for issuing to 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 according to the forwarding flow table, and then computing resources are provided for the application device through the target node. And when the computational power service node in the network is updated, the binding table is issued for the second gateway device, so that the resource can still be issued to the application device when the second gateway device does not have the forwarding flow table.

The gateway device does not participate in the calculation of the corresponding relationship in the whole process. Therefore, even if the corresponding relation between each preset service type and the first candidate node is refreshed at high frequency, the problem of route oscillation is not generated, so that the optimal target node can be provided for the service with the high-frequency refreshing requirement in time, and the service requirement is guaranteed.

Based on the same inventive concept, an embodiment of the present application provides a node scheduling apparatus 900 for a computational power network, specifically as shown in fig. 9, including:

an information acquisition module 901 configured to perform acquisition of computing power information of the computing power service node and performance information of the network;

a node determining module 902 configured to determine, for any preset service type, a first candidate node corresponding to the preset service type according to the computational power information and the performance information of the network;

a relationship issuing module 903, configured to execute issuing the first corresponding relationship between the preset service type and the first candidate node to a gateway device; the preset service type is a service type supported by the computing power service node;

In some possible embodiments, the relationship issuance module is further configured to:

A control apparatus 130 of a computational power network according to this embodiment of the present application is described below with reference to fig. 10. The control device 130 is a controller for carrying the computational power network described in the foregoing steps 201 to 203. The control device may be a hardware device such as a server and a service cluster for carrying the controller, which is not limited in this application. It should be noted that the control device 130 shown in fig. 10 is only an example, and should not bring any limitation to the functions and the scope of the application of the embodiments.

As shown in fig. 10, the control device 130 is 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, the at least one memory 132, and a bus 133 that connects the various system components (including the memory 132 and the processor 131).

Bus 133 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, or a local bus using any of a variety of bus architectures.

The memory 132 may include readable media in the form of volatile memory, such as Random Access Memory (RAM) 1321 and/or cache memory 1322, and may further include Read Only Memory (ROM) 1323.

Memory 132 may also include a program/utility 1325 having a set (at least one) of program modules 1324, such program modules 1324 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

The control device 130 may also communicate with one or more external devices 134 (e.g., keyboard, pointing device, etc.), with one or more devices that enable a user to interact with the control device 130, and/or with any devices (e.g., router, modem, etc.) that enable the control device 130 to communicate with one or more other control devices. Such communication may occur via input/output (I/O) interfaces 135. Also, the control device 130 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via a network adapter 136. As shown, network adapter 136 communicates with other modules for controlling device 130 over bus 133. It should be understood that although not shown in the figures, 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, among others.

In an exemplary embodiment, a computer-readable storage medium comprising instructions, such as the memory 132 comprising instructions, executable by the processor 131 of the apparatus to perform the method described above is also provided. Alternatively, the computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

In an exemplary embodiment, there is also provided a computer program product comprising computer programs/instructions which, when executed by the processor 131, implement any of the node scheduling methods of an computational power network as provided herein.

In exemplary embodiments, various aspects of a node scheduling method of an computational power network provided by the present application may also be implemented in the form of a program product, which includes program code for causing a computer device to perform the steps in a node scheduling method of an computational power network according to various exemplary embodiments of the present application described above in this specification, when the program product is run on the computer device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having 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 foregoing.

The program product for node scheduling for a computational power network of embodiments of the present application may employ a portable compact disk read only memory (CD-ROM) and include program code, and may be run on a control device. However, the program product of the present application is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the PowerPC programming language or similar programming languages. The program code may execute entirely on the user control device, partly on the user device, as a stand-alone software package, partly on the user control device and partly on the remote control device, or entirely on the remote control device or server. In the case of a remote control device, the remote control device may be connected to the user control device over any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external control device (e.g., over the internet using an internet service provider).

It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functions of two or more units described above may be embodied in one unit, according to embodiments of the application. Conversely, the features and functions of one unit described above may be further divided into embodiments by a plurality of units.

Further, while the operations of the methods of the present application are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable image scaling apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable image scaling apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable image scaling apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable image scaling device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer implemented process such that the instructions which execute on the computer or other programmable device provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A method for scheduling nodes in a computational power network, the method comprising:

2. The method of claim 1, wherein 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 comprises:

3. The method of claim 1, further comprising:

determining a second candidate node corresponding to the preset service type according to the re-acquired computing power information and the performance information;

4. The method according to any one of claims 1-3, wherein the computing power information comprises any one or a combination of processor utilization, memory utilization, number of transceived packets, number of transceived bytes, and node priority of the computing power service node; the performance information includes any one or a combination of network delay, jitter, and packet loss rate of the network.

5. An apparatus for scheduling nodes in a computational power network, the apparatus comprising:

6. The apparatus of claim 5, wherein the relationship issuing module is further configured to:

7. The apparatus of claim 5, wherein the node determination module is further configured to:

8. The apparatus according to any one of claims 5-7, wherein the computing power information comprises any one or a combination of processor utilization, memory utilization, number of transceived packets, number of transceived bytes, and node priority of the computing power service node; the performance information includes any one or a combination of network delay, jitter, and packet loss rate of the network.

9. A control device for a computational power network, comprising:

a memory for storing program instructions;

the controller is configured to call program instructions stored in the memory and execute the method of any one of claims 1-4 according to the obtained program instructions.

10. A computer program product, the computer program product comprising: computer program code which, when run on a computer, causes the computer to perform the method according to any of the preceding claims 1-4.