CN118413537A

CN118413537A - Computing power dispatching method and device, related equipment and storage medium

Info

Publication number: CN118413537A
Application number: CN202310105939.3A
Authority: CN
Inventors: 付月霞; 刘鹏; 陆璐
Original assignee: China Mobile Communications Group Co Ltd; Research Institute of China Mobile Communication Co Ltd
Current assignee: China Mobile Communications Group Co Ltd; Research Institute of China Mobile Communication Co Ltd
Priority date: 2023-01-30
Filing date: 2023-01-30
Publication date: 2024-07-30
Also published as: WO2024160054A1

Abstract

The application discloses a power calculation scheduling method, a power calculation scheduling device, related equipment and a storage medium, wherein the power calculation scheduling method comprises the following steps: the computing node sends first information to a first server or an accessed router; the first information is generated based on the computing power resource information and/or the computing power service information of the computing power node and is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

Description

Computing power dispatching method and device, related equipment and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and apparatus for computing power scheduling, related devices, and a storage medium.

Background

In the related technology, the computational power network realizes multi-factor collaborative scheduling of the computational network based on global perception of ubiquitous computational power resources, computational power services and network states. However, extra computing power and time are required to be introduced to preprocess the perceived information before making a scheduling decision, which brings extra overhead and increases the time delay of the whole decision.

Disclosure of Invention

In order to solve the related technical problems, the embodiment of the application provides a computing power scheduling method, a computing power scheduling device, related equipment and a storage medium.

The technical scheme of the embodiment of the application is realized as follows:

the embodiment of the application provides a power calculation scheduling method which is applied to power calculation nodes and comprises the following steps:

transmitting first information to a first server or an accessed router; wherein,

The first information is generated based on the computing power resource information and/or the computing power service information of the computing power node and is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

In the above aspect, the method further comprises at least one of:

Generating first information based on the computing power resource information and/or the computing power service information;

Receiving first information issued by a second server; wherein,

The first information issued by the second server is generated by the second server and issued when the second server registers the computing node successfully.

In the above scheme, the method further comprises:

Sending a first registration request to an accessed router;

receiving second information forwarded by an accessed router; the second information is used for indicating third information required by the computing node to register, and the third information is used for generating first information;

Sending a second registration request to the second server based on the second information;

Receiving a first response returned by the second server; and carrying first information of the computing node when the first response characterizes that the computing node is successfully registered.

In the above scheme, the first information sent by the second server is obtained by encrypting the private key of the second server; the method further comprises the steps of:

And decrypting the first information issued by the second server by adopting the public key of the second server to obtain decrypted first information.

In the above scheme, the first information sent to the first server is obtained by encrypting the private key of the computing node.

In the above-described arrangement, the first and second embodiments,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In the above scheme, sending the first information to the accessed router includes:

The first information is sent to the accessed router based on an Open Shortest path first (OSPF, open Shortest PATH FIRST) protocol or an interior gateway protocol (IGP, interior Gateway Protocol).

In the above solution, the first information is carried in link data in a router link state advertisement (LSA, link State Advertise) type packet of the OSPF protocol.

In the above solution, the first information sent to the first server is carried in a POST message of the hypertext transfer protocol (HTTP, hyper Text Transfer Protocol).

The embodiment of the application also provides a power calculation scheduling method which is applied to the second server and comprises the following steps:

Generating corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node;

under the condition that the registering of the computing power node is successful, corresponding first information is issued; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

In the above scheme, the method further comprises:

issuing second information to a router accessed by the computing node; the second information is used for indicating third information required by the registration of the computing power node, and the third information is used for generating first information;

receiving a second registration request sent by the computing node; the second registration request carries at least third information;

Returning a first response to the force node; and carrying first information of the computing node when the first response represents that the computing node is successfully registered.

In the above-described arrangement, the first and second embodiments,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In the above scheme, the issued first information is obtained by encrypting the private key of the second server.

The embodiment of the application also provides a computing power scheduling method which is applied to the first server and comprises the following steps:

Receiving first information sent by at least one computing node;

Converging first information of the at least one computing node according to the computing force type to obtain a first data table; the computing power type comprises a computing power resource type and/or a computing power service type;

Reporting the first data table to a third server; wherein,

In the above scheme, the method further comprises:

Receiving a first service request forwarded by the third server; the first service request is sent by the computing power demand to the third server, and at least carries class demand information corresponding to computing power resource types and/or computing power service types;

Returning at least one first computing node to the computing force demander based on the first service request;

the first computing power node is a computing power node which meets the computing power requirement of the first service request and the corresponding grade requirement.

In the above-described arrangement, the first and second embodiments,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In the above scheme, the first information and the first data table are carried in an HTTP POST message.

In the scheme, the first information is obtained by encrypting the private key of the corresponding computing node; the method further comprises the steps of:

and decrypting the corresponding first information by adopting the public key of the computing node to obtain decrypted first information.

In the above solution, the reporting the first data table to the third server includes:

And reporting the first data table encrypted by the private key of the first server to the third server.

The embodiment of the application also provides a power calculation scheduling method which is applied to the third server and comprises the following steps:

receiving a first data table reported by at least one first server;

Generating a second data table based on the received first data table; wherein,

The first data table is obtained by converging first information of at least one corresponding computing node according to the computing type by the first server; the computing power type comprises a computing power resource type and/or a computing power service type; the first information is generated based on the computing power resource information and/or the computing power service information of the computing power node and is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

In the above scheme, the method further comprises:

Receiving a first service request sent by a computing power demand party; the first service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

and performing computational scheduling based on the first service request and the second data table.

In the above scheme, the second data table is maintained with the first server as granularity; the performing computational power scheduling based on the first service request and the second data table includes:

determining at least one first server in the second data table based on the first service request;

forwarding the first service request to the at least one first server; the determined first server meets the computing power requirement and the corresponding grade requirement of the first service request.

In the above scheme, the second data table is maintained with the computing nodes as granularity; the performing computational power scheduling based on the first service request and the second data table includes:

determining at least one second computing node in the second data table based on the first service request;

returning the at least one second computing node to the computing force demander; wherein,

The second power node is a power node that satisfies the power demand and the corresponding level demand of the first service request.

In the above-described arrangement, the first and second embodiments,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In the scheme, the first data table is obtained by encrypting the private key of the corresponding first server; the method further comprises the steps of:

And decrypting the corresponding first data table by adopting the public key of the first server to obtain a decrypted first data table.

In the above scheme, the method further comprises:

And encrypting the second data table by adopting the public key of the third server.

The embodiment of the application also provides a power calculation scheduling method which is applied to the first router, and comprises the following steps:

receiving first information sent by at least one accessed computing node;

Converging the received first information according to the calculation force type to obtain a third data table; the computing power type comprises a computing power resource type and/or a computing power service type; wherein,

In the above scheme, the method further comprises:

the third data table is advertised to at least one second router.

In the above scheme, the method further comprises:

receiving a second service request sent by the computing power demand party; the second service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

Performing computational power scheduling based on the second service request and based on the third data table and/or at least one fourth data table; wherein,

The fourth data table is obtained by converging first information of the computing nodes accessed to the second router according to the computing type by the second router, and announces to the first router.

In the above solution, the performing the power calculation scheduling based on the second service request and based on the third data table and/or at least one fourth data table includes at least one of the following:

Returning at least one third computing node in the third data table to the computing force demander based on the second service request;

Returning at least one fourth computing node in a fourth data table to the computing power demand party based on the second service request; wherein,

The third and fourth computing nodes are computing nodes that satisfy the computing demands of the second service request and the corresponding level demands.

In the above scheme, the first information is generated by the second server; the method further comprises the steps of:

receiving a first registration request sent by an accessed computing node;

reporting the computing power node to the second server;

Receiving second information issued by the second server, and forwarding the second information to the computing node; the second information is used for the computing node to send a second registration request to the second server.

In the above scheme, the first information generated by the computing node is sent based on the OSPF protocol or IGP.

In the above solution, the first information is carried in link data in a router LSA type packet of the OSPF protocol.

In the above solution, the third data table and the fourth data table are both carried in TLV (Type-length-value) in a path attribute field of a border gateway protocol (BGP, border Gateway Protocol) data packet.

The embodiment of the application also provides a power calculation scheduling device, which comprises:

a first transmitting unit configured to transmit first information to a first server or an accessed router; wherein,

the first generation unit is used for generating corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node;

The second sending unit is used for sending corresponding first information under the condition that the registering of the computing power node is successful; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

the first receiving unit is used for receiving first information sent by at least one computing node;

the first processing unit is used for converging first information of the at least one computing node according to the computing force type to obtain a first data table; the computing power type comprises a computing power resource type and/or a computing power service type;

the third sending unit is used for reporting the first data table to a third server; wherein,

the second receiving unit is used for receiving the first data table reported by the at least one first server;

a second generating unit, configured to generate a second data table based on the received first data table; wherein,

a third receiving unit, configured to receive first information sent by at least one accessed computing node;

the second processing unit is used for converging the received first information according to the calculation force type to obtain a third data table; the computing power type comprises a computing power resource type and/or a computing power service type; wherein,

The embodiment of the application also provides a computing power node which comprises a first processor and a first communication interface, wherein,

The first communication interface is used for sending first information to a first server or an accessed router; the first information is generated based on the computing power resource information and/or the computing power service information of the computing power node and is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

The embodiment of the application also provides a second server, which comprises a second processor and a second communication interface, wherein,

The second processor is used for generating corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node;

The second communication interface is used for issuing corresponding first information under the condition that the registering of the computing power node is successful; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

The embodiment of the application also provides a first server, which comprises a third processor and a third communication interface, wherein,

The third communication interface is used for receiving first information sent by at least one computing node; the first data table is used for reporting to a third server;

The third processor is used for converging the first information of the at least one computing node according to the computing force type to obtain a first data table; the computing power type comprises a computing power resource type and/or a computing power service type;

The embodiment of the application also provides a third server, which comprises a fourth processor and a fourth communication interface, wherein,

The fourth communication interface is configured to receive a first data table reported by at least one first server;

The second processor is used for generating a second data table based on the received first data table; wherein,

The embodiment of the application also provides a first router, which comprises a fifth processor and a fifth communication interface, wherein,

The fifth communication interface is used for receiving first information sent by at least one accessed computing node;

the fifth processor is used for converging the received first information according to the calculation force type to obtain a third data table; the computing power type comprises a computing power resource type and/or a computing power service type; wherein,

The embodiment of the application also provides a computing node comprising a first processor and a first memory for storing a computer program capable of running on the processor,

The first processor is configured to execute the steps of any one of the methods on the force node side when running the computer program.

The embodiment of the application also provides a second server comprising a second processor and a second memory for storing a computer program capable of running on the processor,

And the second processor is used for executing any step of the method at the second server side when the computer program is run.

The embodiment of the application also provides a first server comprising a third processor and a third memory for storing a computer program capable of running on the processor,

And the third processor is used for executing any step of the method at the first server side when the computer program is run.

The embodiment of the application also provides a third server comprising a fourth processor and a fourth memory for storing a computer program capable of running on the processor,

Wherein the fourth processor is configured to execute any one of the steps of the method on the third server side when running the computer program.

The embodiment of the application also provides a first router comprising a fifth processor and a fifth memory for storing a computer program capable of running on the processor,

The fifth processor is configured to execute any one of the steps of the method on the first router side when running the computer program.

The embodiment of the application also provides a storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of any of the methods described above.

In the power computing scheduling method, the power computing node, the second server, the first server, the third server, the first router and the storage medium provided by the embodiment of the application, the second server generates corresponding first information based on power computing resource information and/or power computing service information of the power computing node, and issues the corresponding first information under the condition that the power computing node is successfully registered; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node; the computing node sends first information to a first server or an accessed router; the method comprises the steps that a first server receives first information sent by at least one computing node, gathers the first information of the at least one computing node according to computing type to obtain a first data table, and reports the first data table to a third server; the computing power type comprises a computing power resource type and/or a computing power service type; the third server receives at least one first data table reported by the first server, and generates a second data table based on the received first data table; the first router receives first information sent by at least one accessed computing node, and gathers the received first information according to the computing type to obtain a third data table. According to the scheme, before the power calculation scheduling, the power calculation nodes or the second server can uniformly classify or evaluate the power calculation nodes according to the power calculation resource information and/or the power calculation service information of the power calculation nodes to obtain the corresponding first information. Therefore, the performance data detail of the computing node can be shielded, and the information quantity reported by the computing node to the first server or the accessed router can be reduced; in addition, the first information is obtained by carrying out capacity grading on the computing nodes according to the unified dimension or granularity, so that additional computing power and time are not required to be spent in the process of computing power scheduling for preprocessing the first information, the total time consumed by computing power scheduling can be shortened, and the computing power scheduling efficiency is improved.

Drawings

FIG. 1 is a schematic diagram of an implementation flow of a power calculation scheduling method according to an embodiment of the present application;

FIG. 2 is a schematic diagram of an OSPF protocol Router-LSA type packet structure according to an embodiment of the present application;

FIG. 3 is a schematic diagram of an implementation flow of a power calculation scheduling method according to an embodiment of the present application;

FIG. 4 is a schematic diagram of an implementation flow of a power calculation scheduling method according to an embodiment of the present application;

FIG. 5 is a schematic diagram of an implementation flow of a power calculation scheduling method according to an embodiment of the present application;

FIG. 6 is a schematic diagram of an implementation flow of a power calculation scheduling method according to an embodiment of the present application;

Fig. 7 is a schematic diagram of BGP protocol message structure according to the present application;

FIG. 8 is a schematic diagram of an interaction flow of a computing power scheduling method according to an embodiment of the present application;

FIG. 9 is a schematic diagram of an interaction flow of a computing power scheduling method according to an embodiment of the present application;

FIG. 10 is a schematic diagram of a power calculation scheduling device according to an embodiment of the present application;

FIG. 11 is a schematic diagram of a power calculation scheduling device according to an embodiment of the present application;

FIG. 12 is a schematic diagram of a power calculation scheduling device according to an embodiment of the present application;

FIG. 13 is a schematic diagram of a power calculation scheduling device according to an embodiment of the present application;

FIG. 14 is a schematic diagram of a power calculation scheduling device according to an embodiment of the present application;

FIG. 15 is a schematic view of a power node structure according to an embodiment of the present application;

FIG. 16 is a schematic diagram of a second server according to an embodiment of the present application;

FIG. 17 is a schematic diagram of a first server according to an embodiment of the present application;

FIG. 18 is a schematic diagram of a third server according to an embodiment of the present application;

fig. 19 is a schematic structural diagram of a first router according to an embodiment of the present application.

Detailed Description

The computational power network realizes multi-factor collaborative scheduling of the computational network based on global perception of ubiquitous computational power resources, computational power services and network states. Different technical routes exist for both the computing power perception and the computing power scheduling, for example, a distributed scheme is that computing power resource state information and/or computing power service state information are carried by expanding a routing protocol control surface, and the computing power information is synchronously advertised by a distributed whole network, so that the coordinated scheduling of the computing network is realized on a router; the centralized scheme is that the calculation power information and the network information are respectively reported to a calculation network dispatching center through a calculation network and a controller, and decision making and strategy issuing are carried out in the same dispatching center.

In the related technology, the computing power resource state and the computing power service state both have multidimensional factors, and computing power resources which are widely deployed in a network have computing power of different scales and different types; the same computing service may also exhibit different performance and service levels due to different deployment environments and different service programming languages. In the distributed scheme, the existing information notification mechanism does not define in detail how to transmit information, what information is transmitted, or simply defines the type information of transmitted computing resources, the total information of computing resources and the like, and notifies the total information of each computing resource node, so that huge information quantity is formed in the whole network; the huge information volume brings the challenges of computing power and capability to computing power routing nodes by combining computing power resource information and making computing power routing decisions. The centralized scheme also does not explicitly define information such as a calculation power information reporting template and the like in the existing scheme.

Based on the analysis, the distributed computing power routing scheduling has the condition that the acquired or perceived information is non-uniform in dimension and/or granularity, so that the routing table format is non-uniform, and the routing nodes need to introduce extra computing power and time to preprocess the acquired or perceived information when making routing decisions, thereby bringing extra expense; similar problems exist in a centralized scheduling center as well, and the time delay of the whole decision is increased.

In addition, in the related art, a plaintext notification mechanism is adopted to notify calculation information in a network, and the notified information is often sensitive information such as a service deployment position, a service real-time state and the like, so that potential information safety hazards exist.

Based on the above, in various embodiments of the present application, the second server generates corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node, and issues the corresponding first information when the registering of the computing power node is successful; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node; the computing node sends first information to a first server or an accessed router; the method comprises the steps that a first server receives first information sent by at least one computing node, gathers the first information of the at least one computing node according to computing type to obtain a first data table, and reports the first data table to a third server; the computing power type comprises a computing power resource type and/or a computing power service type; the third server receives at least one first data table reported by the first server, and generates a second data table based on the received first data table; the first router receives first information sent by at least one accessed computing node, and gathers the received first information according to the computing type to obtain a third data table. According to the scheme, before the power calculation scheduling, the power calculation nodes or the second server can uniformly classify or evaluate the power calculation nodes according to the power calculation resource information and/or the power calculation service information of the power calculation nodes to obtain the corresponding first information. Therefore, the performance data detail of the computing node can be shielded, and the information quantity reported by the computing node to the first server or the accessed router can be reduced; in addition, the first information is obtained by carrying out capacity grading on the computing nodes according to the unified dimension or granularity, so that additional computing power and time are not required to be spent in the process of computing power scheduling for preprocessing the first information, the total time consumed by computing power scheduling can be shortened, and the computing power scheduling efficiency is improved.

The present application will be described in further detail with reference to the accompanying drawings and examples.

The embodiment of the application provides a power calculation scheduling method which is applied to power calculation nodes, as shown in fig. 1, and comprises the following steps:

Step 101: the first information is sent to the first server or the accessed router.

Here, the computing force node sends the first information to the first server so that the first server centrally advertises the first information of the plurality of computing force nodes. The first server may be a cloud management platform or a server running the cloud management platform, or may be a computing force control center or a server running the computing force control center.

The ranking or evaluation result of the computing power resources may include a ranking of the computing power resources, e.g., a ranking of the computing power resource types; the ranking or evaluation result of the computing force service may include a ranking of the computing force service, e.g., a ranking of the computing force service type; the classification results or evaluation results of the computing power resources and the computing power services may include a level of the computing power resources and a level of the computing power services.

The computing node sends first information to the router accessed by the computing node, so that the router further announces the first information of the computing node connected with the router to other routers, and therefore distributed announcement of the first information is achieved. The router to which the computing node accesses may also be referred to as an intra-domain router. In actual application, the computing node may advertise first information of the computing node to the intradomain router based on the intradomain control plane protocol.

The first information may be generated by the computing node or may be received by the computing node. And the first information generated based on the computing power resource information of the computing power node is used for indicating a grading result or an evaluation result of the computing power resource of the computing power node. The first information generated based on the power service information of the power node is used for indicating a grading result or an evaluation result of the power service of the power node. The first information generated based on the computing power resource information and/or the computing power service information of the computing power node is used for indicating a grading result or an evaluation result of the computing power resource of the computing power node and a grading result or an evaluation result of the computing power service.

In practice, a hierarchical template or evaluation template of the computing power resource and/or the computing power service may be defined to support the capability classification or evaluation of the computing power node by the corresponding node according to the defined template. The classification or evaluation rules, as well as the granularity or dimension of the information, are defined in the classification or evaluation templates. That is, what manner, which type or types of information are capability-rated or evaluated is defined in the rating template or evaluation template.

To obtain more accurate ranking or evaluation results, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

Here, the classification result or the evaluation result of the computing power resource is obtained by classifying or evaluating based on at least one of the scale of the computing power resource, the performance of the computing power resource, and the energy consumption of the computing power resource. The grading result or the evaluation result of the computing power service is obtained by grading or evaluating the computing power service based on at least one of service deployment environment, service performance, service maximum capacity, service response time delay and service energy consumption.

In order to improve the security and privacy of the data, the computing node may encrypt the first information and then send the encrypted first information to the first server. Based on this, in an embodiment, the first information sent to the first server is encrypted using a private key of the computing node.

Here, the computing node encrypts the first information by using a private key of the computing node, and transmits the encrypted first information to the first server.

In an embodiment, the first information sent to the first server is carried in an HTTP POST message.

Here, the computing node may send an HTTP POST message to the first server, where the HTTP POST message carries the first information.

In actual application, the computing node and the first server communicate information via an application programming interface (API, application Programming Interface) HTTP protocol. By expanding the HTTP protocol, a message type is newly added in the HTTP POST message to carry the first information.

In one embodiment, sending first information to an accessed router includes:

The first information is sent to the router of the access based on the OSPF protocol or IGP.

Here, in a domain, the force node advertises first information of the force node to an accessed router based on OSPF protocol or IGP. In practical application, the computing node can carry the first information through an extended OSPF protocol or an IGP protocol. And under the condition that the first information is changed, updating the changed first information to the router accessed by the computing node by expanding the OSPF protocol or the IGP protocol.

In one embodiment, the first information is carried in link data in a router LSA type packet of the OSPF protocol.

Here, the first information may be carried in link data in a router LSA type packet of the extended OSPF protocol. The Router LSA type packet may be denoted as a Router-LSA type packet, the structure of which is shown in fig. 2. In practical application, the link data (link data) in the Router-LSA type packet may also carry the calculation type of the calculation node, the identity of the calculation node, the internet protocol (IP, internet Protocol) address, and the like. Wherein the computing force type comprises a computing force resource type and/or a computing force service type.

The first information needs to be obtained before the computing node sends the first information to the first server or the accessed router. Based on this, in an embodiment, the method further comprises at least one of:

Receiving first information issued by a second server; wherein,

Here, the computing power node may perform computing power classification or evaluation based on computing power resource information and/or computing power service information of the computing power node, to obtain the first information.

Under the condition that the computing node is successfully registered to the second server, the computing node can receive first information of the computing node issued by the second server; the first information is obtained by the second server through calculation force grading or evaluation based on calculation force resource information and/or calculation force service information of the calculation force node. Wherein the second server may centrally generate the first information of the different computing nodes. The second server may be a power registry or a power management registry, or the second server may be a server running the power registry or the power management registry.

Table 1 gives examples of the classification results or evaluation results of the computing resources/computing services of the computing nodes.

TABLE 1

To ensure that the computing power is ranked or evaluated according to a unified principle or criteria, the second server may centrally generate the first information for the different computing power nodes. Based on this, in an embodiment, before receiving the first information issued by the second server, the method further includes:

Sending a first registration request to an accessed router;

Here, the second information is sent by the second server to a router accessed by the computing node, and the second registration request carries third information.

In practical application, the registering process of the computing node is as follows:

When the power computing node performs power computing grid connection, the power computing node sends a first registration request to the accessed router, wherein the first registration request is used for requesting to register the power computing node and can carry power computing capability information of the power computing node.

Under the condition that the router receives the first registration request, generating or updating a capability list of the computing node based on information carried by the first registration request, and reporting the capability list to a second server, wherein the capability list can be reported to the second server through notification information when the router is actually applied; the router also reports the unregistered computing node to a second server.

The second server receives the capability list reported by the router and unregistered computing nodes and transmits second information to the router; the second information is used to indicate third information required for registration of the computing node. For example, the third information may include computing power resource information and/or computing power service information of the computing power node, and the second information may be used to indicate certain computing power resource information and/or certain computing power service information required for the computing power node to register.

The router receives second information issued by the second server and forwards the received second information to the corresponding computing power node.

The power computing node receives the second information forwarded by the router, determines third information required by registration based on the second information, and sends a second registration request to the second server, wherein the second registration request carries the third information.

The second server receives a second registration request sent by the computing node, and generates first information of the computing node based on third information carried by the second registration request; registering the computing power node based on the second registration request, and returning a first response to the computing power node based on a registration result. Of course, the second server may also store the identity of each computing node in association with the corresponding first information for subsequent pinging. Wherein, the first response characterizes the registration result of the computing power node, and the registration result comprises registration success or registration failure; in the case that the first response characterizes the successful registration of the computing node, the first response carries first information of the computing node. In the case that the first response characterizes the failure of registration of the computing node, the first response does not carry the first information of the computing node.

The computing node receives a first response returned by the second server based on the second registration request.

The computing power resource, the computing power service, the first information and the like of the computing power node are all sensitive information of the computing power node, and in order to improve the safety and privacy of data, the second server can encrypt the first information and then send the first information. Based on this, in an embodiment, the first information issued by the second server is obtained by encrypting the private key of the second server; the method further comprises the steps of:

Here, when the computing node receives the encrypted first information sent by the second server, the computing node decrypts the received first information by using the public key of the second server, and obtains the decrypted first information.

Because the first information sent by the computing node can be generated by the second server, the embodiment of the application also provides a computing power scheduling method which is applied to the second server, wherein the second server can be a computing power registry or a computing power management registry, and can also be a server running the computing power registry or the computing power management registry. As shown in fig. 3, the method includes:

Step 301: and generating corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node.

The first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

Here, the second server obtains the computing power resource information and/or the computing power service information of the computing power node, and generates the first information of the computing power node based on the computing power resource information and/or the computing power service information of the computing power node. The computing power resource information and/or the computing power service information of the computing power node can be reported by the computing power node before registration is initiated to the second server or reported when registration is initiated to the second server. In actual application, the computing node can initiate registration to the second server through the first server, and can send registration to the second server through the accessed router. The implementation process of the computing node initiating registration to the second server through the first server is similar to the implementation process of the computing node sending registration to the second server through the accessed router, and is not repeated here.

In actual application, the computing power resource information and/or the computing power service information of the computing power node are carried in a registration request sent to the second server.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

Step 302: and under the condition that the registering of the computing power node is successful, the corresponding first information is issued.

Here, the second server issues first information of the computing node to the computing node successfully registered with the second server. The second server does not issue corresponding first information to the computing nodes which are not successfully registered to the second server.

In order to improve the security and privacy of the data, in an embodiment, the issued first information is obtained by encrypting the private key of the second server.

Here, the second server encrypts the first information of the computing node by using a private key of the second server; and issuing the encrypted first information of the computing node to the computing node successfully registered to the second server.

The second server may perform calculation classification or evaluation on the calculation node under the condition that the calculation node initiates registration to the second server, to obtain the first information. Based on this, in an embodiment, the method further comprises:

When the power calculation node performs power calculation grid-connected registration in actual application, the power calculation node sends a first registration request to an accessed router; the router accessed by the computing node reports unregistered computing nodes to a second server based on the received first registration request; the second server transmits second information to a router accessed by the computing node; the router accessed by the computing node forwards the received second information to the computing node which sends the first registration request; the power computing node sends a second registration request to a second server based on the received second information, wherein the second registration request at least carries third information, and the third information comprises power computing resource information and/or power computing service information of the power computing node; the second server registers the computing node based on the second registration request, generates first information of the computing node based on the third information, and returns a first response to the computing node. When the second server successfully registers the computing node, the returned first response carries first information of the computing node; when the second server fails to register the computing node, the returned first response does not carry the first information of the computing node.

After the computing power node sends the first information of the computing power node to the first server, the first server aggregates the first information of different computing power nodes, and reports an aggregation result to a third server (computing network dispatching center). Therefore, the embodiment of the application also provides a computing power dispatching method which is applied to the first server, wherein the first server can be a cloud management platform or a server running the cloud management platform, and also can be a computing power control center or a server running the computing power control center. As shown in fig. 4, the method includes:

step 401: first information sent by at least one computing node is received.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In order to improve the security and privacy of data, in an embodiment, the first information is obtained by encrypting a private key of a corresponding computing node; the method further comprises the steps of:

Here, since the first information sent by the computing node is encrypted by the private key of the computing node, when the first server receives the first information sent by any computing node, the first server decrypts the first information sent by the computing node by using the public key of the computing node, so as to obtain decrypted first information.

Step 402: and converging the first information of the at least one computing node according to the computing force type to obtain a first data table.

Wherein the computing power type comprises a computing power resource type and/or a computing power service type.

Here, the first data table may be understood as a calculation force information table, with a calculation force type as a dimension. Therefore, the first server only needs to maintain the calculation force type and the corresponding grading result or evaluation result, so that the information maintenance difficulty can be reduced and the stored data volume can be reduced.

Table 2 gives an example of the first data table.

TABLE 2

Step 403: and reporting the first data table to a third server.

In actual application, the first server and the third server transfer information through the API HTTP protocol. The first server may report the first data table to the third server based on the HTTP protocol. The third server comprises a computing network dispatching center or a server running the computing network dispatching center.

In an embodiment, the first information and the first data table are both carried in an HTTP POST message.

Here, two message types are newly added in the HTTP POST message by expanding the HTTP protocol, so that the first information and the first data table are respectively carried by the newly added message types.

In order to improve the security and privacy of the data, the first data table may be encrypted and then sent.

Based on this, in an embodiment, the reporting the first data table to the third server includes:

Here, the first server encrypts the first data table using the private key of the first server, and transmits the encrypted first data table to the third server.

After the first server reports the first data table to the third server, the third server performs calculation scheduling based on the first data table. Based on this, in an embodiment, the method further comprises:

Under the condition that the first server receives the first service request forwarded by the third server, at least one first computing node is determined in the first data table based on the computing power resource type carried by the first service request and/or the grade requirement information corresponding to the computing power service type, and the determined at least first computing node is returned to the computing power requirement party. The force-calculating demander may be a terminal, a server or an application.

The first service request is used for requesting the computing power service, and the requirement information carried by the first service request can be understood as the requirement information of the computing power service. The first service request may also carry information of the force-calculating demander. The computing power requirement of the first service request refers to a computing power resource type and/or a computing power service type carried by the first service request; the level requirement of the first service request refers to the level of the computing power resource type and/or the level of the computing power service type.

The first computing power node meeting the computing power requirement of the first service request means that the first computing power node can provide all computing power resource types and computing power service types carried by the first service request; the first computing power node meets the level requirement of the first service request, which means that the level of the computing power resource type which can be provided by the first computing power node is the same as or higher than the corresponding level requirement.

For example, a first service request is for requesting level 1 service 1, i.e., the computing power service type is service 1, the level of service 1 is level 1, then the computing power node that may provide level 1 service 1 is the first computing power node. For example, the computing node 1 in the table above.

Based on the scheme, the first server receives the first information, gathers the first information according to the calculation force type to obtain a first data table, and sends the first data table to the third server. Therefore, the embodiment of the application also provides a computing power dispatching method which is applied to a third server, wherein the third server comprises a computing network dispatching center or a server running the computing network dispatching center. As shown in fig. 5, the method includes:

step 501: and receiving a first data table reported by at least one first server.

The number of first servers is greater than or equal to 1, and one first server may manage at least one computing node.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In order to improve the security and privacy of data, in an embodiment, the first data table is obtained by encrypting a private key of a corresponding first server; the method further comprises the steps of:

Here, since the first data table sent by the first server is encrypted by the private key of the first server, the third server decrypts the first data table sent by the first server by using the public key of the first server, and obtains the decrypted first data table.

Step 502: based on the received first data table, a second data table is generated.

Here, the third server aggregates the received first data table to obtain the second data table. The third server may maintain the second data table with granularity of the first server or with granularity of the computing node.

Table 3 shows an example of a second data table with granularity of the first server.

TABLE 3 Table 3

Table 4 gives an example of a second data table with granularity of the calculation nodes.

TABLE 4 Table 4

In an embodiment, the method further comprises:

Here, in order to ensure security and privacy of the second data table, the third server encrypts the received second data table with the public key of the third server to ensure that only the third server can read the second data table.

In an embodiment, the method further comprises:

Here, the third server determines, in the second data table, the computing power node or the first server that meets the demand based on the computing power resource type carried by the first service request and/or the level demand information corresponding to the computing power service type. And in the case that the calculation force node meeting the demand is determined, the third server returns the calculation force node meeting the demand to the calculation force demand side. And under the condition that the first server meeting the requirement is determined, the third server forwards the first service request to the first server meeting the requirement, so that the first server performs power calculation scheduling based on the first service request and the first data table, and returns a first power calculation node meeting the requirement to a power calculation requirement party. Wherein the first service request may also carry information of the power demand party.

It should be noted that, in the process of computing power scheduling, the third server only needs to match the computing power type, the grading result or the evaluation result, so that the complexity of demand matching is reduced, and the data processing requirement on the third server is reduced.

In one embodiment, the second data table is maintained with the first server as granularity; the performing computational power scheduling based on the first service request and the second data table includes:

The third server determines at least one first server meeting the calculation power requirement and the corresponding grade requirement of the first service request in the second data table, and forwards the first service request to the determined at least one first server, so that the first server determines a first calculation power node meeting the calculation power requirement and the corresponding grade requirement of the first service request in the first data table stored locally, and returns the determined first calculation power node to the calculation power requirement party.

For example, in the case where the first service request is for requesting the service 1 of level 1, the third server determines in table 3 that the first server that can provide the service 1 of level 1 is the cloud management platform 1, and forwards the first service request to the cloud management platform 1.

In one embodiment, the second data table is maintained with the computing nodes as granularity; the performing computational power scheduling based on the first service request and the second data table includes:

Here, the third server determines at least one second computing node satisfying the computing power demand of the first service request and the corresponding level demand in the second data table, and returns the determined second computing node to the computing power demand side.

For example, in the case where the first service request is for requesting service 1 of level 1, the third server determines in table 4 that the second computing node that can provide service 1 of level 1 includes computing node 1 and computing node 11, at which point the third server may return computing node 1 and/or computing node 11 to the computing force demander.

And after the computing node sends the first information to the accessed router, the router accessed by the computing node gathers the first information. Therefore, the embodiment of the application also provides a power-calculation scheduling method which is applied to the first router, wherein the first router can be widely used as a router accessed by any power-calculation node, and the first router can be used as an intra-domain router or an inter-domain router. As shown in fig. 6, the method includes:

step 601: first information sent by at least one computing node of the access is received.

Here, the accessed computing node refers to the computing node accessed to the first router, and can also be understood as the computing node connected with the first router.

In an embodiment, the first information generated by the computing node is sent based on an OSPF protocol or IGP.

In one embodiment, the first information is carried in link data in router LSA type packets of the OSPF protocol.

Step 602: converging the received first information according to the calculation force type to obtain a third data table; the computing force type includes a computing force resource type and/or a computing force service type.

Here, the first router gathers the first information of the computing node according to the computing force type, and a third data table is obtained. The third data table may be understood as a routing information table having the calculation force type as a dimension. The third data table comprises a calculation force node, a calculation force type of the calculation force node, and a grading result or an evaluation result corresponding to the calculation force type. Therefore, the first router only needs to maintain the calculation force type and the corresponding grading result or evaluation result, so that the information maintenance difficulty can be reduced and the stored data volume can be reduced.

An example of a third data table is given in table 5.

TABLE 5

The first router can collect the first information sent by the power calculation nodes in the domain and then announce the first information to the inter-domain router so as to facilitate the inter-domain router to carry out power calculation scheduling. Based on this, in an embodiment, the method further comprises:

the third data table is advertised to at least one second router.

Here, the second router may be understood as any router that can communicate with the first router. The second router and the first router are respectively located in different domains, and the first router and the second router are inter-domain routers.

It should be noted that, the first router may also receive the fourth data table advertised by at least one second router; the fourth data table is obtained by converging the first information of the computing nodes accessed to the second router according to the computing type by the second router.

When the method is actually applied, the first router announces the third data table to the second router based on the BGP protocol; the second router advertises the fourth data table to the first router based on the BGP protocol. And under the condition that the third data table or the fourth data table is changed, the updated data table is transferred between the first router and the second router through inter-domain information.

In an embodiment, the method further comprises:

Here, the first router performs computational scheduling based on the second service request and the third data table without receiving the fourth data table. For example, based on the computing power resource type carried by the second service request and/or the level demand information corresponding to the computing power service type, determining computing power nodes meeting the demand in the third data table, and returning the computing power nodes meeting the demand to the computing power demand party. The second service request is used for requesting the power calculation service, and the requirement information carried by the second service request can be understood as the requirement information of the power calculation service. The second service request may also carry information of the force-calculating demander.

And the first router performs computational scheduling based on the second service request and based on the third data table and/or the received fourth data table under the condition that the fourth data table is acquired. For example, based on the computing power resource type carried by the second service request and/or the level demand information corresponding to the computing power service type, determining computing power nodes meeting the demand in the third data table and/or the fourth data table, and returning the computing power nodes meeting the demand to the computing power demand party.

For example, the second service request is used to request a service 1 with a level 1 of the classification result or the evaluation result, where the first router determines, in the third data table and/or the fourth data table, a computing node, such as computing node 1 and computing node 3, that can provide the service 1 with the level 1; the first router may determine, according to the shortest path principle, among the computing nodes 1 and 3, a computing node with a better path, and return the computing node with the better path to the computing demand side.

In the process of computing power scheduling, the first router only needs to match the computing power type, the grading result or the evaluation result, so that the complexity of demand matching is reduced, and the data processing requirement on the first router is reduced.

In an embodiment, the third data table and the fourth data table are each carried in a TLV in a path attribute field of a BGP packet.

Here, as shown in fig. 7, the BGP protocol may be extended, and a TLV is newly added in a BGP Path attribute (Path Attributes) field, so that the third data table or the fourth data table is carried in the TLV.

In an embodiment, the performing the power schedule based on the second service request and based on the third data table and/or at least one fourth data table includes at least one of:

Here, the first router may determine at least one third calculation node satisfying the calculation force demand in the third data table based on the second service request, and return the determined at least one third calculation node to the calculation force demand side.

The first router may determine at least one fourth computing node satisfying the computing power demand in the fourth data table based on the second service request, and return the determined at least one fourth computing node to the computing power demand party.

In one embodiment, the first information is generated by the second server; the method further comprises the steps of:

receiving a first registration request sent by an accessed computing node;

reporting the computing power node to the second server;

In practical application, the calculation force scheduling method comprises centralized calculation force scheduling and distributed calculation force scheduling; the following describes an embodiment of the present application by taking an example that the computing node locally generates the first information, and further combining with an interactive flow diagram.

Example one: centralized power-calculation scheduling

The power calculation scheduling method as shown in fig. 8 includes:

step 1: the computing power node generates first information based on the computing power resource information and/or the computing power service information.

Here, the computing node locally generates first information; the first information is used to indicate a classification result or an evaluation result of the computing power resources and/or the computing power services of the computing power node. The grading result or the evaluation result comprises a grade corresponding to the calculation force type; the computing force type includes a computing force resource type and/or a computing force service type.

Wherein the computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

Step2: the computing node sends first information to a first server.

In one embodiment, the first information sent by the computing node to the first server is encrypted using a private key of the computing node.

The first information is carried in an HTTP POST message.

Step 3: the first server receives first information sent by at least one computing node, and gathers the first information of the at least one computing node according to the computing type to obtain a first data table.

In one embodiment, the first information is encrypted by a private key of the corresponding computing node; the method further comprises the steps of: the first server decrypts the corresponding first information by adopting the public key of the computing node to obtain decrypted first information.

Step 4: the first server reports the first data table to the third server.

The first data table is carried in an HTTP POST message.

The first server may report the first data table encrypted by the private key of the first server to the third server.

Step 5: and the third server receives the first data table reported by at least one first server and generates a second data table based on the received first data table.

Here, the third server may aggregate the first data table to obtain the second data table.

In one embodiment, the first data table is obtained by encrypting a private key of a corresponding first server; the method further comprises the steps of:

And the third server decrypts the corresponding first data table by adopting the public key of the first server to obtain a decrypted first data table.

In an embodiment, the method further comprises:

And the third server encrypts the second data table by adopting the public key of the third server.

Step 6: the computing power demand sends a first service request to a third server.

The first service request at least carries the computing power resource type and/or the grade requirement information corresponding to the computing power service type.

Step 7: the third server receives a first service request sent by the computing power demand party and performs computing power scheduling based on the first service request and the second data table.

In one embodiment, the second data table is maintained with the first server as granularity; a third server performs computational power scheduling based on the first service request and the second data table, including:

the third server determines at least one first server in the second data table based on the first service request; the determined first server meets the calculation power requirement and the corresponding grade requirement of the first service request;

the third server forwards the first service request to the determined at least one first server;

The first server receives a first service request forwarded by a third server;

The first server returns at least one first computing power node to the computing power demand party based on the first service request;

In one embodiment, the second data table is maintained with the computing nodes as granularity; a third server performs computational power scheduling based on the first service request and the second data table, including:

the third server determines at least one second computing node in a second data table based on the first service request; the second computing power node is a computing power node which meets the computing power requirement of the first service request and the corresponding grade requirement;

the third server returns the determined at least one second computing node to the computing force demand party.

Example two: distributed computing power scheduling

The power calculation scheduling method as shown in fig. 9 includes:

Here, the computing node locally generates first information; the first information is used to indicate a classification result or an evaluation result of the computing power resources and/or the computing power services of the computing power node.

Wherein the computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

Step 2: the force node sends the generated first information to the accessed router.

In one embodiment, the computing node sends first information to an access router based on an OSPF protocol or IGP.

Wherein the first information is carried in link data in a router LSA type packet of the OSPF protocol.

Step 3: the first router receives first information sent by at least one accessed computing node, and gathers the received first information according to the computing type to obtain a third data table.

Wherein the computing force type comprises a computing force resource type and/or a computing force service type.

Step 4: the first router advertises the third data table to at least one second router.

Wherein the third data table is carried in a TLV in a path attribute field of the BGP data packet.

Step 5: the first router receives a fourth data table advertised by at least one second router.

The fourth data table is obtained by converging first information of the computing nodes accessed to the second router according to the computing type by the second router.

The fourth data table is carried in a TLV in a path attribute field of the BGP packet.

In practical application, the first router may further aggregate the third data table and the fourth data table under the condition that the fourth data table is received, so as to obtain an aggregated data table.

Step 6: the computing power demand sends a second service request to the first router.

The second service request at least carries the computing power resource type and/or the grade requirement information corresponding to the computing power service type.

The force demand party may also send the second service request to the second router.

Step 7: the first router receives a second service request sent by the power demand party, and performs power calculation scheduling based on the second service request and based on the third data table and/or at least one fourth data table.

In an embodiment, the first router performs the computational power scheduling based on the second service request and based on the third data table and/or the at least one fourth data table, including at least one of:

The first router returns at least one third computing power node in a third data table to the computing power demand party based on the second service request;

the first router returns at least one fourth computing node in a fourth data table to the computing force demand party based on the second service request; wherein,

In order to implement the power calculation scheduling method of the embodiment of the present application, the embodiment of the present application further provides a power calculation scheduling device, which is disposed on a power calculation node, as shown in fig. 10, and the device includes:

a first transmitting unit 1001 configured to transmit first information to a first server or an accessed router;

In one embodiment, the apparatus further comprises at least one of:

a third generation unit for generating the first information based on the computing power resource information and/or the computing power service information;

the fourth receiving unit is used for receiving the first information issued by the second server; wherein,

In one embodiment, the apparatus further comprises:

A fourth sending unit, configured to send a first registration request to an accessed router;

A fifth receiving unit, configured to receive second information forwarded by the accessed router; the second information is used for indicating third information required by the computing node to register, and the third information is used for generating first information;

A fifth transmitting unit configured to transmit a second registration request to the second server based on the second information;

A sixth receiving unit, configured to receive a first response returned by the second server; and carrying first information of the computing node when the first response characterizes that the computing node is successfully registered.

In an embodiment, the first information sent by the second server is obtained by encrypting a private key of the second server; the apparatus further comprises:

and the first decryption unit is used for decrypting the first information issued by the second server by adopting the public key of the second server to obtain decrypted first information.

In an embodiment, the first information sent to the first server is encrypted using a private key of the computing node.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In an embodiment, the first sending unit 1001 is specifically configured to send the first information to the accessed router based on an OSPF protocol or IGP.

In practical application, the first sending unit 1001, the fourth receiving unit, the fourth sending unit, the fifth receiving unit, the fifth sending unit, and the sixth receiving unit may be implemented by a processor in the computing power scheduling device in combination with a communication interface; the third generation unit and the first decryption unit may be implemented by a processor in a power scheduling apparatus.

It should be noted that: in the power calculation scheduling device provided in the above embodiment, only the division of each program module is used for illustration, and in practical application, the process allocation may be performed by different program modules according to needs, that is, the internal structure of the device is divided into different program modules, so as to complete all or part of the processes described above. In addition, the power calculation scheduling device and the power calculation scheduling method provided in the foregoing embodiments belong to the same concept, and detailed implementation processes are detailed in the method embodiments, which are not repeated herein.

In order to implement the power calculation scheduling method of the embodiment of the present application, the embodiment of the present application further provides a power calculation scheduling device, which is disposed on a second server, as shown in fig. 11, and the device includes:

A first generating unit 1101, configured to generate corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node;

The second sending unit 1102 is configured to send corresponding first information when the registration of the computing node is successful; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

In one embodiment, the apparatus further comprises:

a sixth sending unit, configured to send second information to a router accessed by the computing node; the second information is used for indicating third information required by the registration of the computing power node, and the third information is used for generating first information;

a seventh receiving unit, configured to receive a second registration request sent by the computing node; the second registration request carries at least third information;

A seventh sending unit, configured to return a first response to the force node; and carrying first information of the computing node when the first response represents that the computing node is successfully registered.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In an embodiment, the first information is obtained by encrypting the private key of the second server.

In practical application, the second sending unit 1102, the sixth sending unit, the seventh receiving unit and the seventh sending unit may be implemented by a processor in the computing power scheduling device in combination with a communication interface; the first generation unit 1101 may be implemented by a processor in a computing power scheduler.

In order to implement the power calculation scheduling method of the embodiment of the present application, the embodiment of the present application further provides a power calculation scheduling device, which is disposed on a first server, as shown in fig. 12, and the device includes:

A first receiving unit 1201, configured to receive first information sent by at least one computing node;

a first processing unit 1202, configured to aggregate first information of the at least one computing node according to a computing force type, to obtain a first data table; the computing power type comprises a computing power resource type and/or a computing power service type;

A third sending unit 1203 configured to report the first data table to a third server; wherein,

In one embodiment, the apparatus further comprises:

An eighth receiving unit, configured to receive the first service request forwarded by the third server; the first service request is sent by the computing power demand to the third server, and at least carries class demand information corresponding to computing power resource types and/or computing power service types;

an eighth sending unit, configured to return at least one first computing node to the computing force demander based on the first service request;

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In one embodiment, the first information is encrypted by a private key of the corresponding computing node; the apparatus further comprises:

And the second decryption unit is used for decrypting the corresponding first information by adopting the public key of the computing node to obtain decrypted first information.

In an embodiment, the third sending unit 1203 is specifically configured to report, to the third server, the first data table encrypted with the private key of the first server.

In practical application, the first receiving unit 1201, the third sending unit 1203, the eighth receiving unit and the eighth sending unit may be implemented by a processor in the computing power scheduling apparatus in combination with a communication interface; the first processing unit 1202 and the second decryption unit may be implemented by a processor in a power dispatching device.

In order to implement the power calculation scheduling method of the embodiment of the present application, the embodiment of the present application further provides a power calculation scheduling device, which is disposed on a third server, as shown in fig. 13, and the device includes:

a second receiving unit 1301, configured to receive a first data table reported by at least one first server;

a second generating unit 1302, configured to generate a second data table based on the received first data table;

In one embodiment, the apparatus further comprises:

A ninth receiving unit configured to receive a first service request sent by the computing power demand side; the first service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

and the first scheduling unit is used for performing computational scheduling based on the first service request and the second data table.

In one embodiment, the second data table is maintained with the first server as granularity; the first scheduling unit is specifically configured to:

In one embodiment, the second data table is maintained with the computing nodes as granularity; the first scheduling unit is specifically configured to:

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In one embodiment, the first data table is obtained by encrypting a private key of a corresponding first server; the apparatus further comprises:

and the third decryption unit is used for decrypting the corresponding first data table by adopting the public key of the first server to obtain a decrypted first data table.

In one embodiment, the apparatus further comprises:

and the first encryption unit is used for encrypting the second data table by adopting the public key of the third server.

In practical application, the second receiving unit 1301, the ninth receiving unit and the first scheduling unit may be implemented by a processor in the computing power scheduling apparatus in combination with a communication interface; the second generation unit 1302, the third decryption unit, and the first encryption unit may be implemented by a processor in a computing power scheduler.

In order to implement the power calculation scheduling method of the embodiment of the present application, the embodiment of the present application further provides a power calculation scheduling device, which is disposed on the first router, as shown in fig. 14, and the device includes:

A third receiving unit 1401, configured to receive first information sent by at least one accessed computing node;

a second processing unit 1402, configured to aggregate the received first information according to the calculation force type, to obtain a third data table; the computing power type comprises a computing power resource type and/or a computing power service type; wherein,

In one embodiment, the apparatus further comprises:

And a ninth sending unit, configured to advertise the third data table to at least one second router.

In one embodiment, the apparatus further comprises:

A tenth receiving unit configured to receive a second service request sent by the computing power demand side; the second service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

A second scheduling unit, configured to perform computational scheduling based on the second service request and based on the third data table and/or at least one fourth data table; wherein,

In an embodiment, the second scheduling unit is configured to at least one of:

In one embodiment, the first information is generated by the second server; the apparatus further comprises:

An eleventh receiving unit, configured to receive a first registration request sent by an accessed computing node;

A tenth sending unit, configured to report the computing node to the second server;

a twelfth receiving unit, configured to receive second information sent by the second server, and forward the second information to the computing node; the second information is used for the computing node to send a second registration request to the second server.

In an embodiment, the third data table and the fourth data table are each carried in a TLV in a path attribute field of a border gateway protocol BGP data packet.

In practical application, the third receiving unit 1401, the ninth sending unit, the tenth receiving unit, the second scheduling unit, the eleventh receiving unit, the tenth sending unit, and the twelfth receiving unit may be implemented by a processor in the computing power scheduling apparatus in combination with a communication interface; the second processing unit 1402 may be implemented by a processor in a computing power scheduling device.

Based on the hardware implementation of the program modules, and in order to implement the method of the force calculation node side in the embodiment of the present application, the embodiment of the present application further provides a force calculation node, as shown in fig. 15, the force calculation node 1500 includes:

A first communication interface 1501 capable of information interaction with other network nodes;

the first processor 1502 is connected to the first communication interface 1501 to implement information interaction with other network nodes, and is configured to execute, when running a computer program, a method provided by one or more technical solutions on the power node side. And the computer program is stored on the first memory 1503.

Specifically, the first communication interface 1501 is configured to send first information to a first server or an accessed router;

In one embodiment of the present invention, in one embodiment,

The first processor 1502 is configured to generate first information based on computing power resource information and/or computing power service information;

The first communication interface 1501 is further configured to receive first information issued by a second server; wherein,

In an embodiment, the first communication interface 1501 is further configured to send a first registration request to an accessed router, receive second information forwarded by the accessed router, send a second registration request to the second server based on the second information, and receive a first response returned by the second server; the second information is used for indicating third information required by the computing node to register, and the third information is used for generating first information; and carrying first information of the computing node when the first response represents that the computing node is successfully registered.

In an embodiment, the first information sent by the second server is obtained by encrypting a private key of the second server; the first processor 1502 is further configured to decrypt the first information sent by the second server by using the public key of the second server, to obtain decrypted first information.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In an embodiment, the first communication interface 1501 is specifically configured to send the first information to the accessed router based on OSPF protocol or IGP.

It should be noted that: the specific processing of the first processor 1502 and the first communication interface 1501 can be understood with reference to the methods described above.

Of course, in actual practice, the various components in computing node 1500 are coupled together by bus system 1504. It is to be appreciated that bus system 1504 is used to facilitate connection communications between these components. The bus system 1504 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration, the various buses are labeled as bus system 1504 in fig. 15.

The first memory 1503 in embodiments of the present application is used to store various types of data to support the operation of the computing node 1500. Examples of such data include: any computer program for operating on the computing node 1500.

The method disclosed in the above embodiment of the present application may be applied to the first processor 1502 or implemented by the first processor 1502. The first processor 1502 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the method may be implemented by an integrated logic circuit of hardware in the first processor 1502 or by instructions in software. The first Processor 1502 described above may be a general purpose Processor, a digital signal Processor (DSP, digital Signal Processor), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The first processor 1502 may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the application can be directly embodied in the hardware of the decoding processor or can be implemented by combining hardware and software modules in the decoding processor. The software module may be located in a storage medium located in the first memory 1503, said first processor 1502 reading the information in the first memory 1503, in combination with its hardware performing the steps of the method described above.

In an exemplary embodiment, the computing node 1500 may be implemented by one or more Application Specific Integrated Circuits (ASICs), DSPs, programmable logic devices (PLDs, programmable Logic Device), complex Programmable logic devices (CPLDs, complex Programmable Logic Device), field-Programmable gate arrays (FPGAs), general purpose processors, controllers, microcontrollers (MCUs, micro Controller Unit), microprocessors (microprocessors), or other electronic elements for performing the foregoing methods.

Based on the hardware implementation of the program modules, and in order to implement the method at the second server side in the embodiment of the present application, the embodiment of the present application further provides a second server, as shown in fig. 16, where the second server 1600 includes:

The second communication interface 1601 is capable of performing information interaction with other network nodes;

The second processor 1602 is connected to the second communication interface 1601, so as to implement information interaction with other network nodes, and is configured to execute the methods provided by one or more of the second server side technical solutions when running a computer program. And the computer program is stored on the second memory 1603.

Specifically, the second processor 1602 is configured to generate corresponding first information based on the computing power resource information and/or the computing power service information of the computing power node;

The second communication interface 1601 is configured to issue corresponding first information when the registering of the computing node is successful; the first information is used for indicating a grading result or an evaluation result of the computing power resource and/or the computing power service of the computing power node.

In an embodiment, the second communication interface 1601 is further configured to send second information to a router accessed by the computing node, receive a second registration request sent by the computing node, and return a first response to the computing node; the second information is used for indicating third information required by the registration of the computing power node, and the third information is used for generating first information; the second registration request carries at least third information; and carrying first information of the computing power node when the first response represents that the computing power node is successfully registered.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

It should be noted that: the specific processing procedure of the second processor 1602 and the second communication interface 1601 can be understood with reference to the above-described method.

Of course, in actual practice, the various components in second server 1600 are coupled together via bus system 1604. It is appreciated that the bus system 1604 is used to enable connected communications between these components. The bus system 1604 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration, the various buses are labeled as bus system 1604 in fig. 16.

The second memory 1603 in the embodiment of the present application is used to store various types of data to support the operation of the second server 1600. Examples of such data include: any computer program for operating on second server 1600.

The method disclosed in the above embodiment of the present application may be applied to the second processor 1602 or implemented by the second processor 1602. The second processor 1602 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the method described above may be performed by integrated logic circuits of hardware or instructions in software form in the second processor 1602. The second processor 1602 described above may be a general purpose processor, a DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The second processor 1602 may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the application can be directly embodied in the hardware of the decoding processor or can be implemented by combining hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the second memory 1603, and the second processor 1602 reads information in the second memory 1603, in conjunction with its hardware, to perform the steps of the methods described above.

In an exemplary embodiment, second server 1600 may be implemented by one or more ASIC, DSP, PLD, CPLD, FPGA, general purpose processors, controllers, MCU, microprocessor, or other electronic components for performing the foregoing methods.

Based on the hardware implementation of the program modules, and in order to implement the method at the first server side in the embodiment of the present application, the embodiment of the present application further provides a first server, as shown in fig. 17, where the first server 1700 includes:

A third communication interface 1701 capable of information interaction with other network nodes;

The third processor 1702 is connected to the third communication interface 1701, so as to implement information interaction with other network nodes, and is configured to execute the method provided by one or more technical solutions on the first server side when running a computer program. And the computer program is stored on the third memory 1703.

Specifically, the third communication interface 1701 is configured to receive first information sent by at least one computing node;

The third processor 1702 is configured to aggregate first information of the at least one computing node according to a computing power type to obtain a first data table; the computing power type comprises a computing power resource type and/or a computing power service type;

The third communication interface 1701 is further configured to report the first data table to a third server; wherein,

In an embodiment, the third communication interface 1701 is further configured to receive a first service request forwarded by the third server, and return at least one first computing power node to the computing power demander based on the first service request; the first service request is sent by the computing power demand to the third server, and at least carries class demand information corresponding to computing power resource types and/or computing power service types; the first computing power node is a computing power node which meets the computing power requirement of the first service request and the corresponding grade requirement.

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

The third processor 1702 is further configured to decrypt the corresponding first information by using the public key of the computing node, to obtain decrypted first information.

In an embodiment, the third communication interface 1701 is specifically configured to report, to the third server, the first data table encrypted with the private key of the first server.

It should be noted that: the specific processing of the third processor 1702 and the third communication interface 1701 may be understood with reference to the methods described above.

Of course, in actual practice, the various components in first server 1700 would be coupled together via bus system 1704. It is appreciated that the bus system 1704 is used to implement a connected communication between these components. The bus system 1704 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration, the various buses are labeled as bus system 1704 in fig. 17.

The third memory 1703 in an embodiment of the present application is used to store various types of data to support the operation of the first server 1700. Examples of such data include: any computer program for operating on first server 1700.

The method disclosed in the above embodiment of the present application may be applied to the third processor 1702 or implemented by the third processor 1702. The third processor 1702 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the method may be implemented by an integrated logic circuit of hardware in the third processor 1702 or an instruction in software form. The third processor 1702 described above may be a general purpose processor, DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The third processor 1702 may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the application can be directly embodied in the hardware of the decoding processor or can be implemented by combining hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the third memory 1703 and the third processor 1702 reads information from the third memory 1703, in combination with its hardware, to perform the steps of the methods described above.

In an exemplary embodiment, first server 1700 may be implemented by one or more ASIC, DSP, PLD, CPLD, FPGA, general purpose processors, controllers, MCU, microprocessor, or other electronic components for performing the foregoing methods.

Based on the hardware implementation of the program modules, and in order to implement the method at the third server side in the embodiment of the present application, the embodiment of the present application further provides a third server, as shown in fig. 18, where the third server 1800 includes:

a fourth communication interface 1801, capable of information interaction with other network nodes;

The fourth processor 1802 is connected to the fourth communication interface 1801, so as to implement information interaction with other network nodes, and when executing a computer program, perform a method provided by one or more of the above-mentioned third server side technical solutions. And the computer program is stored on the fourth memory 1803.

Specifically, the fourth communication interface 1801 is configured to receive a first data table reported by at least one first server;

The fourth processor 1802 is configured to generate a second data table based on the received first data table;

In an embodiment, the fourth communication interface 1801 is further configured to receive a first service request sent by the computing power demander; the first service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

The fourth processor 1802 is further configured to perform computational power scheduling based on the first service request and the second data table.

In one embodiment, the second data table is maintained with the first server as granularity; the fourth processor 1802 is specifically configured to determine at least one first server in the second data table based on the first service request;

the fourth communication interface 1801 is further configured to forward the first service request to the at least one first server; the determined first server meets the computing power requirement and the corresponding grade requirement of the first service request.

In one embodiment, the second data table is maintained with the computing nodes as granularity; the fourth processor 1802 is specifically configured to determine at least one second computing node in the second data table based on the first service request;

the fourth communication interface 1801 is further configured to return the at least one second computing node to the computing power demander; wherein,

In one embodiment of the present invention, in one embodiment,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

In one embodiment, the first data table is obtained by encrypting a private key of a corresponding first server; the fourth processor 1802 is further configured to decrypt a corresponding first data table by using the public key of the first server, to obtain a decrypted first data table.

In an embodiment, the fourth processor 1802 is further configured to encrypt the second data table using a public key of the third server.

It should be noted that: the specific processing of the fourth processor 1802 and the fourth communication interface 1801 may be understood with reference to the above-described methods.

Of course, in actual practice, the various components in the third server 1800 are coupled together by a bus system 1804. It is appreciated that the bus system 1804 is employed to facilitate connected communications between these components. The bus system 1804 includes a power bus, a control bus, and a status signal bus in addition to the data bus. The various buses are labeled as bus system 1804 in fig. 18 for clarity of illustration.

The fourth memory 1803 in the embodiment of the present application is used to store various types of data to support the operation of the third server 1800. Examples of such data include: any computer program for operating on the third server 1800.

The method disclosed in the above embodiment of the present application may be applied to the fourth processor 1802 or implemented by the fourth processor 1802. The fourth processor 1802 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the method described above may be performed by instructions in the form of integrated logic circuits or software in hardware in the fourth processor 1802. The fourth processor 1802 described above may be a general purpose processor, DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The fourth processor 1802 can implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the application can be directly embodied in the hardware of the decoding processor or can be implemented by combining hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the fourth memory 1803 and the fourth processor 1802 reads the information in the fourth memory 1803 and performs the steps of the method in combination with its hardware.

In an exemplary embodiment, the third server 1800 may be implemented by one or more ASIC, DSP, PLD, CPLD, FPGA, general-purpose processors, controllers, MCU, microprocessor, or other electronic components for performing the foregoing methods.

Based on the hardware implementation of the program modules, and in order to implement the method on the first router side in the embodiment of the present application, the embodiment of the present application further provides a first router, as shown in fig. 19, where the first router 1900 includes:

A fifth communication interface 1901 capable of information interaction with other network nodes;

And a fifth processor 1902, coupled to the fifth communication interface 1901, for implementing information interaction with other network nodes, where the fifth processor is configured to execute, when running a computer program, a method provided by one or more technical solutions on the first router side. And the computer program is stored on the fifth memory 1903.

Specifically, the fifth communication interface 1901 is configured to receive first information sent by at least one accessed computing node;

The fifth processor 1902 is configured to aggregate the received first information according to the calculation force type, to obtain a third data table; the computing power type comprises a computing power resource type and/or a computing power service type; wherein,

In an embodiment, the fifth communication interface 1901 is further configured to advertise the third data table to at least one second router.

In an embodiment, the fifth communication interface 1901 is further configured to receive a second service request sent by the computing power demander; the second service request at least carries grade requirement information corresponding to the computing power resource type and/or the computing power service type;

The fifth processor 1902 is further configured to perform computational scheduling based on the second service request and based on the third data table and/or at least one fourth data table; wherein,

In one embodiment, the fifth processor 1902 is specifically configured to at least one of:

In one embodiment, the first information is generated by the second server; the fifth communication interface 1901 is further configured to receive a first registration request sent by an accessed computing node, report the computing node to the second server, receive second information issued by the second server, and forward the second information to the computing node; the second information is used for the computing node to send a second registration request to the second server.

It should be noted that: the specific processing of the fifth processor 1902 and the fifth communication interface 1901 can be understood with reference to the methods described above.

Of course, in actual practice, the various components in first router 1900 are coupled together via bus system 1904. It is appreciated that the bus system 1904 is used to implement the connected communications between these components. The bus system 1904 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration, the various buses are labeled as bus system 1904 in fig. 19.

The fifth memory 1903 in the embodiment of the present application is used to store various types of data to support the operation of the first router 1900. Examples of such data include: any computer program for operating on first router 1900.

The method disclosed in the above embodiment of the present application may be applied to the fifth processor 1902 or implemented by the fifth processor 1902. The fifth processor 1902 may be an integrated circuit chip with signal processing capability. In implementation, the steps of the method described above may be performed by integrated logic circuits of hardware or instructions in software form in the fifth processor 1902. The fifth processor 1902 described above may be a general purpose processor, DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. The fifth processor 1902 may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiment of the application can be directly embodied in the hardware of the decoding processor or can be implemented by combining hardware and software modules in the decoding processor. The software modules may be located in a storage medium including a fifth memory 1903, and the fifth processor 1902 reads information in the fifth memory 1903 and performs the steps of the methods described above in conjunction with its hardware.

In an exemplary embodiment, the first router 1900 may be implemented by one or more ASIC, DSP, PLD, CPLD, FPGA, general purpose processors, controllers, MCU, microprocessor, or other electronic elements for performing the foregoing methods.

It is to be understood that the memories (the first memory 1503, the second memory 1603, the third memory 1703, the fourth memory 1803, the fifth memory 1903) of the embodiments of the present application may be volatile memories or nonvolatile memories, and may include both volatile and nonvolatile memories. The non-volatile Memory may be, among other things, a Read Only Memory (ROM), a programmable Read Only Memory (PROM, programmable Read-Only Memory), erasable programmable Read-Only Memory (EPROM, erasable Programmable Read-Only Memory), electrically erasable programmable Read-Only Memory (EEPROM, ELECTRICALLY ERASABLE PROGRAMMABLE READ-Only Memory), Magnetic random access Memory (FRAM, ferromagnetic random access Memory), flash Memory (Flash Memory), magnetic surface Memory, optical disk, or compact disk-Only (CD-ROM, compact Disc Read-Only Memory); the magnetic surface memory may be a disk memory or a tape memory. The volatile memory may be random access memory (RAM, random Access Memory) which acts as external cache memory. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM, static Random Access Memory), synchronous static random access memory (SSRAM, synchronous Static Random Access Memory), dynamic random access memory (DRAM, dynamic Random Access Memory), synchronous dynamic random access memory (SDRAM, synchronous Dynamic Random Access Memory), and, double data rate synchronous dynamic random access memory (DDRSDRAM, double Data Rate Synchronous Dynamic Random Access Memory), enhanced synchronous dynamic random access memory (ESDRAM, enhanced Synchronous Dynamic Random Access Memory), synchronous link dynamic random access memory (SLDRAM, syncLink Dynamic Random Access Memory), Direct memory bus random access memory (DRRAM, direct Rambus Random Access Memory). the memory described by embodiments of the present application is intended to comprise, without being limited to, these and any other suitable types of memory.

In an exemplary embodiment, the present application further provides a storage medium, i.e. a computer storage medium, in particular a computer readable storage medium, for example comprising a first memory 1503 storing a computer program executable by the first processor 1502 of the computing node 1500 to perform the steps of the aforementioned computing node side method. For example, further comprising a second memory 1603 storing a computer program executable by the second processor 1602 of the second server 1600 to perform the steps described in the second server-side method. For example, the third memory 1703 may store a computer program executable by the third processor 1702 of the first server 1700 to perform the steps of the first server-side method described above. Further for example, the fourth memory 1803 may include a computer program executable by the fourth processor 1802 of the third server 1800 to perform the steps of the third server side method described above. Further for example, a fifth memory 1903 storing a computer program executable by the fifth processor 1902 of the first router 1900 to perform the steps described above for the first router side method. The computer readable storage medium may be FRAM, ROM, PROM, EPROM, EEPROM, flash Memory, magnetic surface Memory, optical disk, or CD-ROM.

It should be noted that: "first," "second," etc. are used to distinguish similar objects and not necessarily to describe a particular order or sequence.

The term "and/or" is herein merely an association relationship describing an associated object, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the term "at least one" herein means any combination of any one or more of at least two of the plurality, for example, including at least one of A, B, C, may mean including any one or more elements selected from the group consisting of A, B and C.

In addition, the embodiments of the present application may be arbitrarily combined without any collision.

The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the present application.

Claims

1. A method of power calculation scheduling, applied to a power calculation node, the method comprising:

2. The method of claim 1, further comprising at least one of:

Receiving first information issued by a second server; wherein,

3. The method according to claim 2, wherein the method further comprises:

Sending a first registration request to an accessed router;

4. A method according to claim 2 or3, wherein the first information issued by the second server is obtained by encrypting a private key of the second server; the method further comprises the steps of:

5. The method of claim 1, wherein the first information sent to the first server is encrypted using a private key of the computing node.

6. The method according to any one of claims 1 to 3, 5, wherein,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

7. The method of claim 1, wherein sending the first information to the accessed router comprises:

The first information is sent to the accessed router based on an open shortest path first, OSPF, protocol or an interior gateway protocol, IGP.

8. The method of claim 7 wherein the first information is carried in link data in a router link state advertisement LSA type packet of an OSPF protocol.

9. The method according to claim 1 or 5, wherein the first information sent to the first server is carried in a hypertext transfer protocol HTTP POST message.

10. A method of power dispatch for a second server, the method comprising:

11. The method according to claim 10, wherein the method further comprises:

12. The method according to claim 10 or 11, wherein,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

13. The method according to claim 10 or 11, wherein the issued first information is encrypted with a private key of the second server.

14. A method of power dispatch, for use with a first server, the method comprising:

Receiving first information sent by at least one computing node;

Reporting the first data table to a third server; wherein,

15. The method of claim 14, wherein the method further comprises:

16. The method according to claim 14 or 15, wherein,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

17. The method of claim 14, wherein the first information and the first data table are both carried in an HTTP POST message.

18. The method of claim 14, 15 or 17, wherein the first information is encrypted using a private key of the corresponding computing node; the method further comprises the steps of:

19. The method of claim 14, 15 or 17, wherein said reporting the first data table to a third server comprises:

20. A method of power dispatch for a third server, the method comprising:

receiving a first data table reported by at least one first server;

Generating a second data table based on the received first data table; wherein,

21. The method of claim 20, wherein the method further comprises:

22. The method of claim 21, wherein the second data table is maintained at a first server granularity; the performing computational power scheduling based on the first service request and the second data table includes:

23. The method of claim 21, wherein the second data table is maintained at granularity of a force node; the performing computational power scheduling based on the first service request and the second data table includes:

24. The method according to any one of claims 20 to 23, wherein,

The computing power resource information includes at least one of:

Calculating the scale of the power resources;

Calculating the performance of the power resource;

Calculating the energy consumption of the power resources;

and/or

The computing force service information includes at least one of:

A service deployment environment;

Service performance;

Service maximum capacity;

service response time delay;

Service energy consumption.

25. The method according to any one of claims 20 to 23, wherein the first data table is encrypted using a private key of the corresponding first server; the method further comprises the steps of:

26. The method according to any one of claims 20 to 23, further comprising:

27. A method of power dispatch for a first router, the method comprising:

receiving first information sent by at least one accessed computing node;

28. The method of claim 27, wherein the method further comprises:

the third data table is advertised to at least one second router.

29. The method according to claim 27 or 28, characterized in that the method further comprises:

30. The method according to claim 29, wherein said performing a power schedule based on said second service request and on said third data table and/or at least one fourth data table comprises at least one of:

31. The method of claim 27, wherein the first information is generated by the second server; the method further comprises the steps of:

receiving a first registration request sent by an accessed computing node;

reporting the computing power node to the second server;

32. The method of claim 27 wherein the first information generated by the computing node is sent based on OSPF protocols or IGPs.

33. The method of claim 32 wherein the first information is carried in link data in router LSA type packets of the OSPF protocol.

34. The method of claim 29, wherein the third data table and the fourth data table are each carried in a TLV in a path attribute field of a border gateway protocol BGP data packet.

35. A computing power scheduling apparatus, comprising:

36. A computing power scheduling apparatus, comprising:

37. A computing power scheduling apparatus, comprising:

38. A computing power scheduling apparatus, comprising:

39. A computing power scheduling apparatus, comprising:

40. A computing node is characterized by comprising a first processor and a first communication interface, wherein,

41. A second server comprising a second processor and a second communication interface, wherein,

42. The first server is characterized by comprising a third processor and a third communication interface, wherein,

43. A third server comprising a fourth processor and a fourth communication interface, wherein,

44. A first router comprising a fifth processor and a fifth communication interface, wherein,

45. A computing node comprising a first processor and a first memory for storing a computer program capable of running on the processor,

Wherein the first processor is adapted to perform the steps of the method of any of claims 1 to 9 when the computer program is run.

46. A second server comprising a second processor and a second memory for storing a computer program capable of running on the processor,

Wherein the second processor is adapted to perform the steps of the method of any of claims 10 to 13 when the computer program is run.

47. A first server comprising a third processor and a third memory for storing a computer program capable of running on the processor,

Wherein the third processor is adapted to perform the steps of the method of any of claims 14 to 19 when the computer program is run.

48. A third server comprising a fourth processor and a fourth memory for storing a computer program capable of running on the processor,

Wherein the fourth processor is adapted to perform the steps of the method of any of claims 20 to 26 when the computer program is run.

49. A first router comprising a fifth processor and a fifth memory for storing a computer program capable of running on the processor,

Wherein the fifth processor is configured to perform the steps of the method of any of claims 27 to 34 when the computer program is run.

50. A storage medium having stored thereon a computer program, which when executed by a processor, performs the steps of the method of any one of claims 1 to 9, or the steps of the method of any one of claims 10 to 13, or the steps of the method of any one of claims 14 to 19, or the steps of the method of any one of claims 20 to 26, or the steps of the method of any one of claims 27 to 34.