Information processing method, node and autonomous system

Abstract

The present disclosure provides an information processing method, a node and an autonomous system, and relates to the technical field of communication. The method comprises the following steps: a first node receives N first messages from a group of nodes, the N first messages carrying first computing power information corresponding to each of M second nodes in the autonomous system except the first node, the group of nodes comprising each of the M second nodes having a neighbor relationship with the first node, N>1, M>1, N and M being integers; and the first node stores the first computing power information, wherein at least two nodes in the autonomous system are the first node.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to an information processing method, a node, and an autonomous system. Background Technology

[0002] Computing power is a general term for data processing capabilities and services. With the large-scale commercial deployment of 5G, vertical fields such as the industrial internet, vehicle-to-everything (V2X) and virtual reality / augmented reality are booming. The transmission, analysis, and storage of massive amounts of data have driven computing in the network to move from centralization to the edge, and computing has begun to be embedded in the network, giving rise to computing power networks.

[0003] Computing power networks connect distributed computing nodes through ubiquitous networks, building a new network infrastructure that can be aware of computing power, ensuring that the network can schedule computing resources in different locations on demand and in real time, thereby improving the utilization rate of network and computing resources.

[0004] In related technologies, when a computing power network schedules computing resources, each node in the network needs to report its corresponding computing power information to the controller so that the controller can schedule computing power based on the computing power information of the entire network. Summary of the Invention

[0005] The inventors noted that the reliability of computing power scheduling is low in related technologies.

[0006] Through analysis, the inventors discovered that when all nodes in the network centrally report computing power information to the controller, a failure of the controller will prevent computing power scheduling from being carried out for all nodes in the network, resulting in low reliability of computing power scheduling.

[0007] To address the aforementioned problems, the present disclosure proposes the following solutions.

[0008] According to one aspect of the present disclosure, an information processing method is provided, comprising: a first node receiving N first messages from a group of nodes, the N first messages carrying first computing power information corresponding to each of M second nodes in an autonomous system other than the first node, the group of nodes including each of the M second nodes that has a neighbor relationship with the first node, N≥1, M≥1, N and M being integers; the first node storing the first computing power information; wherein at least two nodes in the autonomous system are the first node.

[0009] In some embodiments, any node in the autonomous system is the first node.

[0010] In some embodiments, N equals M.

[0011] In some embodiments, the method further includes: the first node responding to a computing power scheduling request by performing computing power scheduling based on the computing power information corresponding to the first node and the first computing power information.

[0012] In some embodiments, the method further includes: the first node receiving a second message from at least one second node in the group of nodes, the second message carrying second computing power information corresponding to any one of the M second nodes, the second computing power information being different from the first computing power information corresponding to the any one second node; the first node updating the stored first computing power information corresponding to the any one second node to the second computing power information.

[0013] In some embodiments, the second message includes a plurality of second messages, the transmission times of the plurality of second messages are different from each other, and the second computing power information of any second node carried in each second message is different from each other. The first node updating the first computing power information corresponding to any second node stored in the first message to the second computing power information includes: the first node updating the first computing power information corresponding to any second node stored in the first message to the second computing power information carried in the second message with the latest transmission time among the plurality of second messages.

[0014] In some embodiments, the method further includes: after receiving the second message, the first node receives a third message from the at least one second node, the third message carrying third computing power information corresponding to any one of the second nodes, the third computing power information being different from the second computing power information, and the third message being sent before the second message being sent; wherein, after receiving the third message, the first node updates the stored first computing power information corresponding to any one of the second nodes to the second computing power information.

[0015] In some embodiments, if the computing power information of at least one type of computing power in the first computing power information corresponding to any second node is not in the second computing power information, then updating the first computing power information corresponding to any second node to the second computing power information stored by the first node includes: the first node deleting the computing power information of the at least one type of computing power from the first computing power information corresponding to any second node stored by the first node.

[0016] In some embodiments, the first message is a Database Description (DD) message based on the Open Shortest Path First (OSPF) protocol.

[0017] In some embodiments, the second message is a Link State Update (LSU) message based on the OSPF protocol.

[0018] In some embodiments, the first computing power information includes computing power information of multiple types of computing power, with different types of computing power corresponding to different computing power levels; the first message is a DD message based on the OSPF protocol, and both the DD message and the LSU message include multiple extended fields, with different extended fields carrying computing power information of different types of computing power.

[0019] According to another aspect of the present disclosure, a node is provided as a first node, and includes: a receiving module configured to receive N first messages from a group of nodes, the N first messages carrying first computing power information corresponding to each of M second nodes in an autonomous system other than the first node, the group of nodes including each of the M second nodes that has a neighbor relationship with the first node, N≥1, M≥1, and N and M are integers; and a storage module configured to store the first computing power information, wherein at least two nodes in the autonomous system are the first node.

[0020] According to another aspect of the present disclosure, a node is provided as a first node, and includes: a memory; and a processor coupled to the memory, the processor being configured to execute the method described in any of the above embodiments based on instructions stored in the memory.

[0021] According to another aspect of the present disclosure, an autonomous system is provided, comprising: a first node as described in any of the above embodiments; and M second nodes, wherein a group of the M second nodes includes each second node having a neighbor relationship with the first node, and the group of nodes is configured to send the N first messages to the first node.

[0022] According to another aspect of the present disclosure, a computer-readable storage medium is provided, including computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method described in any of the above embodiments.

[0023] According to another aspect of the present disclosure, a computer program product is provided, including a computer program, wherein the computer program, when executed by a processor, implements the method described in any of the above embodiments.

[0024] In this embodiment of the disclosure, at least two nodes within the autonomous system can obtain the computing power information of all nodes other than themselves by receiving messages from their neighboring nodes. Furthermore, each of these at least two nodes can store the computing power information of all nodes within the autonomous system. Thus, each of the at least two nodes within the autonomous system can have the ability to perform subsequent computing power scheduling based on the stored computing power information of all nodes within the autonomous system, improving the reliability of computing power scheduling.

[0025] The technical solutions of this disclosure will be further described in detail below with reference to the accompanying drawings and embodiments. Attached Figure Description

[0026] To more clearly illustrate the technical solutions in the embodiments of this disclosure or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0027] Figure 1 This is a schematic flowchart of an information processing method according to some embodiments of the present disclosure;

[0028] Figure 2 This is a schematic flowchart of an information processing method according to other embodiments of this disclosure;

[0029] Figure 3 This is a schematic diagram of message interaction between computing nodes according to some embodiments of this disclosure;

[0030] Figure 4 This is a schematic diagram of the structure of a node according to some embodiments of this disclosure;

[0031] Figure 5 This is a schematic diagram of the structure of a node according to other embodiments of this disclosure. Detailed Implementation

[0032] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0033] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps set forth in these embodiments do not limit the scope of this disclosure.

[0034] At the same time, it should be understood that, for ease of description, the dimensions of the various parts shown in the accompanying drawings are not drawn according to actual scale.

[0035] Techniques, methods, and equipment known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and equipment should be considered part of the specification.

[0036] In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values.

[0037] It should be noted that similar labels and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be discussed further in subsequent figures.

[0038] Figure 1 This is a flowchart illustrating an information processing method according to some embodiments of the present disclosure.

[0039] In step 102, the first node receives N first messages from a group of nodes.

[0040] Here, the first node is a node in an Autonomous System (AS), which also includes M second nodes in addition to the first node. The M first messages can carry first computing power information corresponding to each second node. A set of nodes can include each of the M second nodes that is a neighbor of the first node, where N≥1, M≥1, and N and M are integers. It should be understood that a set of nodes is at least a portion of the M second nodes in the AS, and each of these at least a portion of the second nodes is a neighbor of the first node.

[0041] In some embodiments, N may be different from M. In this case, if N < M, then at least one first message may carry the first computing power information corresponding to each of the plurality of second nodes. If N > M, then the first computing power information corresponding to at least one second node may be carried through at least two first messages. In some cases, N may be equal to M, which will be further explained later.

[0042] In some embodiments, the first computing power information corresponding to each second node may include computing power type information, computing power quantity information, and memory resource information corresponding to the second node.

[0043] In some embodiments, the first computing power information corresponding to each second node in the AS may include the computing power information of the second node and the computing power information of all nodes that are neighbors of the second node.

[0044] In some embodiments, both the first node and the second node can be network nodes connected to computing resources within the AS, or they can be network nodes with intrinsic computing power. For example, a network node connected to computing resources can be a data center gateway in the edge cloud that serves as a unified data exit, while a network node with intrinsic computing power can be a network device such as a router or switch in the network.

[0045] In some embodiments, the first message may be based on an Interior Gateway Protocol (IGP). For example, the Interior Gateway Protocol may be a Routing Information Protocol (RIP), an Intermediate System to Intermediate System (ISIS) protocol, or an Open Shortest Path First (OSPF) protocol.

[0046] In step 104, the first node stores the first computing power information.

[0047] Here, each of the at least two nodes in AS can be the first node.

[0048] In some embodiments, the first node may pre-store the computing power information of the node itself, and store the first computing power information corresponding to each second node in the AS other than the first node by receiving N first messages, so as to store the computing power information of all nodes in the AS.

[0049] In some embodiments, the first node may respond to a computing power scheduling request by performing computing power scheduling based on the computing power information corresponding to the first node and the first computing power information corresponding to each second node in the AS (excluding the first node). For example, the first node may respond to a computing power scheduling request from a terminal by selecting computing power resources that meet the terminal's computing power requirements based on the computing power information corresponding to the first node and the first computing power information corresponding to each second node, and allocating the computing power resources to the terminal so that the terminal can perform relevant business processing based on the allocated computing power resources.

[0050] In the above embodiments, at least two nodes within the AS can obtain the computing power information of all nodes other than themselves by receiving messages from their neighboring nodes. Each of these at least two nodes can then store the computing power information of all nodes within the AS. Thus, each of the at least two nodes within the AS can have the ability to perform subsequent computing power scheduling based on the stored computing power information of all nodes within the AS, improving the reliability of computing power scheduling.

[0051] In some embodiments, each node within the AS can report its own computing power information to the controller, so that the controller can centrally store the computing power information of the entire network. In this way, the computing power information stored in the controller and the computing power information stored in the first node can serve as backups for each other, so that the computing power scheduling of the entire network will not be affected in the event of a failure in one of them.

[0052] In some embodiments, any node in the AS can be the first node. Thus, each node in the AS can store the computing power information of all nodes within the AS, thereby enabling each node to perform subsequent computing power scheduling based on the stored computing power information, further improving the reliability of computing power scheduling.

[0053] In some embodiments, N can be equal to M. In this case, a first message can carry only the first computing power information corresponding to any one of the second nodes in the AS other than the first node. In this way, each second node in a group of nodes does not need to wait for its neighboring nodes to send the corresponding computing power information to the second node before sending all computing power information to the first node through a first message, which ensures the timeliness of computing power information updates and reduces the possibility of transmission anomalies caused by too much data loaded in the message.

[0054] In some embodiments, the first message can be a Database Description (DD) message based on the OSPF protocol. Since DD messages can be used to transmit link-state database information of the local router during network initialization, this method allows nodes to transmit computing power information while transmitting routing information, thus enabling the transmission of computing power information without affecting the original routing information transmission between nodes in the AS.

[0055] As one implementation, DD messages may include extended fields to carry computing power information that needs to be transmitted. This will be explained further later.

[0056] The information processing method provided in this disclosure will be further described below with reference to some embodiments.

[0057] Figure 2 This is a flowchart illustrating an information processing method according to other embodiments of the present disclosure.

[0058] and Figure 1 Compared to the embodiments shown, Figure 2 The illustrated embodiment also includes steps 202 to 204.

[0059] In step 202, the first node receives a second message from at least one second node in a group of nodes.

[0060] Here, the second message may carry the second computing power information corresponding to any one of the M second nodes, and the second computing power information may be different from the first computing power information corresponding to that any one of the M second nodes.

[0061] In some embodiments, the first and second messages can be based on the same interior gateway protocol. For example, the first message is a DD message based on the OSPF protocol, and the second message is a Link State Update (LSU) message based on the OSPF protocol. In this way, nodes in the AS can update computing power information based on the routing information update process.

[0062] In step 204, the first node updates the first computing power information corresponding to any stored second node to the second computing power information.

[0063] For example, the first node can replace the first computing power information corresponding to any stored second node with the second computing power information.

[0064] In some embodiments, any second node corresponding to the second computing power information may have a neighbor relationship with the second node that sent the second message to the first node. The following is in conjunction with... Figure 3 This will be explained further.

[0065] Figure 3 This is a schematic diagram of message interaction between computing nodes according to some embodiments of this disclosure.

[0066] like Figure 3 As shown, Figure 3 The diagram illustrates three nodes in an AS, each of which can act as the first node. Node 1 and Node 2, as well as Node 2 and Node 3, can establish and maintain neighbor relationships by periodically sending Hello messages.

[0067] During network initialization, Node 2 can send a DD message carrying its corresponding first computing power information to Node 1, allowing Node 1 to store this information. After Node 3 sends a DD message carrying its corresponding first computing power information to Node 2, Node 2 can then send a DD message carrying its corresponding first computing power information to Node 1. Thus, Node 1 can obtain the first computing power information corresponding to Nodes 2 and 3 by receiving these two DD messages from Node 2.

[0068] Similarly, node 2 can obtain the first computing power information corresponding to nodes 1 and 3 by receiving two DD messages from nodes 1 and 3, and node 3 can also obtain the first computing power information corresponding to nodes 1 and 2 by receiving two DD messages from node 2. Figure 3 This is only an illustrative illustration of how node 1 obtains the first computing power information corresponding to nodes 2 and 3 by receiving two DD messages from node 2.

[0069] Based on this, please continue to refer to Figure 3 Taking a change in the first computing power information corresponding to node 3 as an example, in this case, node 3 will send an LSU message carrying the second computing power information corresponding to node 3 to node 2, so that node 2 can update the stored first computing power information corresponding to node 3 to the second computing power information. Furthermore, node 2 will send an LSU message carrying the second computing power information corresponding to node 3 to node 1, so that node 1 can also update the stored first computing power information corresponding to node 3 to the second computing power information. In this way, the computing power information stored in both node 1 and node 2 is updated.

[0070] In some embodiments, after receiving an LSU message carrying the second computing power information corresponding to node 3, node 1 may send a Link State Acknowledgment (LSAck) message to node 2 as a response. Similarly, after receiving an LSU message carrying the second computing power information corresponding to node 3, node 2 may also send an LSAck message to node 3 as a response.

[0071] In the above embodiments, when the computing power information corresponding to any second node changes, each node in the AS that stores the computing power information of all nodes can update the stored computing power information in real time so that subsequent computing power scheduling can be performed based on the updated computing power information, thereby further improving the reliability of computing power scheduling.

[0072] In some embodiments, the second message received by the first node may include multiple second messages. These multiple second messages are sent at different times, and the second computing power information of any second node carried in each second message is different from each other.

[0073] In this case, the first node can update the first computing power information corresponding to any second node in the storage to the second computing power information carried in the second message with the latest sending time among multiple second messages.

[0074] It should be understood that the timing of the second message's transmission can indicate the order in which the computing power information carried in that message changes.

[0075] For example, please continue to refer to Figure 3In the illustrated embodiment, whenever the first computing power information corresponding to node 3 changes, node 3 can proactively send an LSU message to node 2 to inform it of the updated computing power information. If the first computing power information corresponding to node 3 changes multiple times within a short period of time and sends multiple LSU messages accordingly, but due to network congestion or other reasons, node 2 receives these multiple LSU messages at the same time, then node 2 will update the stored first computing power information of node 3 with the second computing power information carried in the latest LSU message among these multiple LSU messages (i.e., the computing power information that changed last).

[0076] In this way, it can be ensured that if the computing power information corresponding to any second node changes, each node in the AS that stores the computing power information of all nodes will store the latest computing power information, thereby further improving the reliability of computing power scheduling.

[0077] In some embodiments, after receiving the second message, the first node may receive a third message from at least one of the group of nodes. Here, the third message carries third computing power information corresponding to any one of the M second nodes. The third computing power information is different from the second computing power information, and the third message is sent before the second message is sent.

[0078] In this case, after receiving the third message, the first node updates the first computing power information corresponding to any second node in its storage to the second computing power information.

[0079] It should be understood that if the first node has already updated the first computing power information corresponding to any second node in its storage to the second computing power information corresponding to that node carried in the previously received second message, the first node will not update the already stored second computing power information again.

[0080] In some embodiments, the second and third messages may have the same format. For example, both the second and third messages may be LSU messages, but the computing power information carried in the two LSU messages may be different and the transmission times may be different.

[0081] For example, please continue to refer to Figure 3In the illustrated embodiment, assume that node 3 sends the first LSU message (i.e., the third message) when the corresponding first computing power information changes for the first time, and sends the second LSU message (i.e., the second message) when the corresponding first computing power information changes for the second time. However, due to network congestion or other reasons, node 2 receives the second LSU message first, and then receives the first LSU message. At this time, since node 2 has already updated the stored first computing power information corresponding to node 3 to the second computing power information based on the previously received second LSU message, even if the third computing power information carried in the first LSU message is different from the second computing power information (i.e., the third computing power information is also changed computing power information relative to the second computing power information), because the first LSU message was sent before the second LSU message was sent (i.e., the change time of the third computing power information carried in the first LSU message was earlier, and it is not the latest computing power information), node 2 will not continue to update the stored second computing power information to the third computing power information again.

[0082] This further ensures that each node in the AS stores the latest computing power information, thereby further improving the reliability of computing power scheduling.

[0083] In some embodiments, the computing power information of at least one type of computing power in the first computing power information corresponding to any second node may not be in the second computing power information.

[0084] In this case, the first node can delete the computing power information of at least one type of computing power from the first computing power information corresponding to any second node stored in the database.

[0085] For example, if a second node shuts down the computing power service corresponding to a certain type of computing power, the computing power information for that type of computing power in the first computing power information corresponding to that second node will be deleted. At this time, after receiving the corresponding second message, the first node will also delete the computing power information for that type of computing power from the stored first computing power information corresponding to that second node. This reduces the occupancy rate of storage resources in the nodes, thereby improving the utilization rate of storage resources.

[0086] As some implementations, both DD and LSU messages can include extended fields to carry computing power information that needs to be transmitted.

[0087] In some embodiments, the first computing power information corresponding to each second node among the M nodes can include computing power information of multiple types of computing power, and different types of computing power can correspond to different computing power levels. For example, the computing power information of each type of computing power can include computing power resource information of that type of computing power and memory resource information required by that type of computing power. The computing power resource information of each type of computing power can include computing power type information and computing power quantity information.

[0088] In this scenario, different extended fields within the DD and LSU messages can be used to carry computing power information for different types of computing power. Thus, the receiving node can determine the priority of processing computing power information based on the priority of computing power levels, ensuring that computing power information for higher-level computing power is processed first, further improving the reliability of subsequent computing power scheduling.

[0089] Table 1 shows the names, lengths, and functions of extended fields according to some embodiments of this disclosure.

[0090] Table 1

[0091] Basic-computing-resource Basic computing resource information corresponding to the identifier node 16 bytes AI-computing-resource Intelligent computing resource information corresponding to the identifier node 16 bytes Super-computing-resource Supercomputing resource information corresponding to the identifier node 16 bytes Memory-resource Identifier node's memory resource information 16 bytes time Indicate the current time 8 bytes

[0092] As shown in Table 1, the extended fields in DD and LSU messages may include the “Basic-computing-resource” field, the “AI-computing-resource” field, the “Super-computing-resource” field, the “Memory-resource” field, and the “time” field.

[0093] The “Basic-computing-resource”, “AI-computing-resource”, “Super-computing-resource”, and “Memory-resource” fields can be 16 bytes long, while the “time” field can be 8 bytes long.

[0094] In some embodiments, computing power provided by servers based on general-purpose CPUs can be classified as basic computing power, and the basic computing power resource information corresponding to the node can be carried in the "Basic-computing-resource" field of DD and LSU messages; computing power provided by chips based on Graphics Processing Units (GPUs), Field Programmable Gate Arrays (FPGAs), or Application Specific Integrated Circuits (ASICs) for inference of artificial intelligence algorithms can be classified as intelligent computing power, and the intelligent computing power resource information corresponding to the node can be carried in the "AI-computing-resource" field of DD and LSU messages; computing power provided by computing clusters such as supercomputers can be classified as supercomputing power, and the supercomputing power resource information corresponding to the node can be carried in the "Super-computing-resource" field of DD and LSU messages.

[0095] In some embodiments, the "Memory-resource" field can be used to carry information about the memory resources required for different types of computing power.

[0096] In some embodiments, the computing power levels, arranged from highest to lowest, can be: basic computing power, intelligent computing power, and supercomputing power.

[0097] In some embodiments, for any one of the fields “Basic-computing-resource”, “AI-computing-resource”, and “Super-computing-resource”, setting the field to all F can be used to indicate that the computing power information of the corresponding computing power has been deleted.

[0098] In some embodiments, when a second node shuts down computing power services for all types of computing power, the second node may send at least one LSU message to inform its neighboring nodes. In each LSU message, the “Basic-computing-resource”, “AI-computing-resource”, “Super-computing-resource”, and “Memory-resource” fields can all be set to all F, so that the node receiving the LSU message knows that the second node has shut down computing power services for all types of computing power and will delete all stored computing power information corresponding to that second node.

[0099] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For node embodiments, since they largely correspond to the method embodiments, the description is relatively simple; relevant parts can be found in the descriptions of the method embodiments.

[0100] Figure 4 This is a schematic diagram of the structure of a node according to some embodiments of the present disclosure.

[0101] like Figure 4 As shown, node 400 can serve as the first node in the AS. Node 400 may include a receiving module 401 and a storage module 402.

[0102] The receiving module 401 can be configured to receive N first messages from a set of nodes. Here, the N first messages carry the first computing power information corresponding to each of the M second nodes in the AS (excluding the first node). The set of nodes includes each of the M second nodes that has a neighbor relationship with the first node, where N≥1, M≥1, and N and M are integers.

[0103] Storage module 402 can be configured to store first computing power information, wherein at least two nodes in the autonomous system are first nodes.

[0104] Figure 5 This is a schematic diagram of the structure of a node according to other embodiments of this disclosure.

[0105] like Figure 5 As shown, node 500 can serve as the first node in AS. Node 500 includes memory 501 and processor 502 coupled to memory 501, processor 502 being configured to execute the method of any of the foregoing embodiments based on instructions stored in memory 501.

[0106] The memory 501 may include, for example, system memory, fixed non-volatile storage media, etc. The system memory may store, for example, an operating system, application programs, a boot loader, and other programs.

[0107] Node 500 may also include input / output interfaces 503, network interfaces 504, and storage interfaces 505. These interfaces 503, 504, and 505, as well as the memory 501 and processor 502, can be connected via, for example, a bus 506. Input / output interface 503 provides a connection interface for input / output devices such as monitors, mice, keyboards, and touchscreens. Network interface 504 provides a connection interface for various networked devices. Storage interface 505 provides a connection interface for external storage devices such as SD cards and USB flash drives.

[0108] This disclosure also provides an autonomous system including a first node (e.g., node 400 / 500) and M second nodes, as described in any of the above embodiments. A group of the M second nodes can be configured to send N first messages to the first node. This group of nodes may include each second node that has a neighbor relationship with the first node.

[0109] This disclosure also provides a computer-readable storage medium including computer program instructions that, when executed by a processor, implement the method of any of the above embodiments.

[0110] This disclosure also provides a computer program product, including a computer program, wherein when the computer program is executed by a processor, it implements the method of any of the above embodiments.

[0111] The embodiments of this disclosure have now been described in detail. To avoid obscuring the concept of this disclosure, some details known in the art have not been described. Those skilled in the art can fully understand how to implement the technical solutions disclosed herein based on the above description.

[0112] Those skilled in the art will understand that embodiments of this disclosure can be provided as methods, systems, or computer program products. Therefore, this disclosure can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this disclosure can take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0113] This disclosure is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that the functions specified in one or more flowchart illustrations and / or one or more blocks in a block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate functions for implementing the functions in the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0114] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0115] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0116] While specific embodiments of this disclosure have been described in detail by way of examples, those skilled in the art should understand that the examples are for illustrative purposes only and not intended to limit the scope of this disclosure. Those skilled in the art should understand that modifications can be made to the above embodiments or equivalent substitutions can be made to some technical features without departing from the scope and spirit of this disclosure. The scope of this disclosure is defined by the appended claims.

Claims

1. An information processing method, comprising: The first node receives N first messages from a group of nodes. The N first messages carry the first computing power information of each of the M second nodes in the autonomous system other than the first node. The group of nodes includes each of the M second nodes that has a neighbor relationship with the first node. N≥1, M≥1, N and M are integers. The first message is a database description (DD) message based on the Open Shortest Path First (OSPF) protocol. The first node stores the first computing power information, which includes computing power information of various types of computing power. Different types of computing power correspond to different computing power levels. The DD message includes multiple extended fields, and different extended fields carry computing power information of different types of computing power. The first node responds to the computing power scheduling request and performs computing power scheduling based on the computing power information corresponding to the first node and the first computing power information, wherein any node in the autonomous system is the first node.

2. The method according to claim 1, wherein, N equals M.

3. The method according to claim 1, further comprising: The first node receives a second message from at least one second node in the group of nodes. The second message carries second computing power information corresponding to any one of the M second nodes. The second computing power information is different from the first computing power information corresponding to any one of the M second nodes. The first node updates the first computing power information corresponding to any one of the second nodes stored in the memory to the second computing power information.

4. The method according to claim 3, wherein, The second message includes multiple second messages, the multiple second messages are sent at different times, and the second computing power information of any one of the second nodes carried in each second message is different from each other. The first node updates the stored first computing power information corresponding to any one of the second nodes to the second computing power information, including: The first node updates the first computing power information corresponding to any one of the second nodes stored in the memory to the second computing power information carried in the second message with the latest sending time among the plurality of second messages.

5. The method according to claim 3, further comprising: After receiving the second message, the first node receives a third message from the at least one second node. The third message carries third computing power information corresponding to any one of the second nodes. The third computing power information is different from the second computing power information. The third message is sent before the second message is sent. Upon receiving the third message, the first node updates the first computing power information corresponding to any one of the second nodes stored in the memory to the second computing power information.

6. The method according to claim 3, wherein, In the first computing power information corresponding to any one of the second nodes, the computing power information of at least one type of computing power is not in the second computing power information. The first node updating the stored first computing power information corresponding to any one of the second nodes to the second computing power information includes: The first node deletes the computing power information of at least one type of computing power from the first computing power information corresponding to any of the second nodes stored in the database.

7. The method according to claim 3, wherein, The second message is a Link State Update (LSU) message based on the OSPF protocol.

8. The method according to claim 7, wherein: The LSU message includes multiple extended fields, and different extended fields carry computing power information of different types of computing power.

9. A node, serving as a first node, and comprising: The receiving module is configured to receive N first messages from a group of nodes. The N first messages carry first computing power information corresponding to each of the M second nodes in the autonomous system other than the first node. The group of nodes includes each of the M second nodes that has a neighbor relationship with the first node. N≥1, M≥1, N and M are integers. The first message is a database description (DD) message based on the Open Shortest Path First (OSPF) protocol. The storage module is configured to store the first computing power information, which includes computing power information for various types of computing power, with different types of computing power corresponding to different computing power levels. The DD message includes multiple extended fields, with different extended fields carrying computing power information for different types of computing power. The first node is configured to respond to a computing power scheduling request and perform computing power scheduling based on the computing power information corresponding to the first node and the first computing power information. Any node in the autonomous system is the first node.

10. A node, serving as a first node, and comprising: Memory; as well as A processor coupled to the memory is configured to execute the method of any one of claims 1-8 based on instructions stored in the memory.

11. An autonomous system, comprising: The first node is the node described in claim 9 or 10; as well as M second nodes, wherein a group of the M second nodes includes each second node that has a neighbor relationship with the first node, and the group of nodes is configured to send the N first messages to the first node.

12. A computer-readable storage medium comprising computer program instructions, wherein, When the computer program instructions are executed by the processor, they implement the method described in any one of claims 1-8.

13. A computer program product comprising a computer program, wherein, When the computer program is executed by a processor, it implements the method described in any one of claims 1-8.

Images