A computing power routing method and device, a computing power network device, and a storage medium

Abstract

Embodiments of the present application provide a computing power routing method and device, a computing power network device and a storage medium. The method is applied to any computing power network device and includes the following steps: in response to a first message corresponding to any computing power network service, determining node information of a previous node sending the first message based on identification information of the first message; wherein the node information represents an entry computing power network node or a non-entry computing power network node; determining a target routing table from a candidate routing table of the computing power network device based on the node information, and routing based on the target routing table; wherein the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information. The above scheme realizes flexible change of computing power information through two routing tables, and the computing power network device can accurately identify its own attributes, thereby selectively querying the routing table and improving routing efficiency.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a computing power routing method, apparatus, computing power network device, and storage medium. Background Technology

[0002] A computing power network is a network architecture that deeply integrates computing power and networks, connecting widely distributed computing resources through a network. In a computing power network, resource utilization is optimized by scheduling computing applications to the optimal computing nodes.

[0003] In related technologies, after the client sends a request, the computing network nodes query the global routing table to select a route.

[0004] However, the above methods cannot achieve flexible changes to computing power information, and frequent updates to computing power information will put a heavy burden on the routing system. Summary of the Invention

[0005] This application provides a computing power routing method, apparatus, computing power network device, and storage medium to enable flexible changes to computing power information.

[0006] In a first aspect, embodiments of this application provide a first computing power routing method, applicable to any computing power network device, the method comprising:

[0007] In response to the first message corresponding to any computing power network service, the node information of the previous node that sent the first message is determined based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node;

[0008] Based on the node information, a target routing table is determined from the candidate routing table of the computing power network device, and route selection is performed based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0009] The above scheme, because the computing network device maintains two types of routing tables—a local routing table and a remote routing table (global routing table)—only requires updating the corresponding local routing table when a computing node is updated. This enables flexible changes to computing information and reduces the burden of updating computing information on the routing system. After receiving the first packet of a computing network service, the computing network device can determine the node information of the previous node that sent the first packet based on the identifier information of the first packet, i.e., whether the previous node is an ingress computing network node or a non-ingress computing network node, and thus determine its own attributes (ingress computing network node or egress computing network node). This allows for precise selection of the target routing table suitable for its own attributes, i.e., selectively deciding whether to query the global routing table or only the local routing table, thereby improving routing efficiency.

[0010] In some optional implementations, the identification information is the flag value of a preset flag bit in the first message.

[0011] The above scheme, by selecting specific fields in the first message and using their marked values ​​as identification information, enables the computing network device that receives the first message to accurately and efficiently identify whether the previous node is an ingress computing network node or a non-ingress computing network node.

[0012] In some optional implementations, based on the identifier information of the first message, the node information of the node that sent the first message is determined, including:

[0013] If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or

[0014] If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0015] In the above scheme, since non-computing network devices do not mark the preset flag bit, only computing network devices will mark the preset flag bit. If the flag value of the preset flag bit is the default value, it means that the previous node did not modify the flag value of the preset flag bit, and the previous node is not a computing network device. Therefore, the previous node will not be the entry computing network node. Conversely, if the flag value of the preset flag bit is not the default value, it means that the previous node modified the flag value of the preset flag bit. Therefore, the previous node is a computing network device. That is, the node information of the previous node represents the entry computing network node, thereby accurately identifying the node information of the previous node.

[0016] In some optional implementations, determining the target routing table from the alternative routing table of the computing power network device based on the node information includes:

[0017] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or

[0018] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0019] In the above scheme, if the node information of the previous node indicates that it is not an ingress computing network node, it means that the previous node is not a computing network device, and this node is the first computing network device to receive the first packet (the ingress computing network node). The target computing node may or may not be local. Precise route selection is achieved by querying the global routing table. Furthermore, by modifying the default value of the preset flag to a non-default value, when the target computing node is not local, the next computing network device (the computing network device connected to the target computing node) can recognize that this node is an ingress computing network node based on the non-default value and select a local routing table suitable for its own attributes. If the node information of the previous node indicates that it is an ingress computing network node, it means that the previous node is a computing network device, and this node is not the first computing network device to receive the first packet. The target computing node is local, and efficient route selection can be achieved simply by querying the local routing table.

[0020] In some optional implementations, the preset flag is a preset field in the segmented routing header or a preset field in the destination options header.

[0021] In some optional implementations, the identification information is the source address corresponding to the first message.

[0022] The above scheme uses the source address corresponding to the first message as the identification information, eliminating the need to expand the first message. This allows the computing network device that receives the first message to identify whether the previous node is an ingress computing network node or a non-ingress computing network node.

[0023] In some optional implementations, based on the identifier information of the first message, the node information of the node that sent the first message is determined, including:

[0024] If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node.

[0025] Otherwise, the node information is determined to represent a non-entry computing power network node.

[0026] The above scheme, because the computing network routing is implemented at the virtual network (overlay) layer and uses a tunneling protocol, allows the computing network device to accurately identify whether the node information of the previous node represents the ingress computing network node by combining the protocol type and source address of the first packet.

[0027] In some optional implementations, determining the target routing table from the alternative routing table of the computing power network device based on the node information includes:

[0028] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or

[0029] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0030] In the above scheme, if the node information of the previous node indicates that it is not an ingress computing network node, it means that this node is the first computing network device (ingress computing network node) to receive the first message mentioned above. The target computing node may or may not be local. Accurate route selection is achieved by querying the global routing table. If the node information of the previous node indicates that it is an ingress computing network node, it means that the previous node is the first computing network device to receive the first message mentioned above. This node is an egress computing network node. The target computing node is local. Efficient route selection is achieved by querying the local routing table, which meets the routing needs of computing network nodes with different attributes.

[0031] Secondly, embodiments of this application provide a first computing power routing device, applicable to any computing power network device, the device comprising:

[0032] The node identification module is used to respond to the first message corresponding to any computing power network service, and determine the node information of the previous node that sent the first message based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node;

[0033] The routing module is used to determine a target routing table from the candidate routing table of the computing power network device based on the node information, and to perform route selection based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0034] In some optional implementations, the identification information is the flag value of a preset flag bit in the first message.

[0035] In some optional implementations, the node identification module is specifically used for:

[0036] If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or

[0037] If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0038] In some optional implementations, the routing module is specifically used for:

[0039] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or

[0040] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0041] In some optional implementations, the preset flag is a preset field in the segmented routing header or a preset field in the destination options header.

[0042] In some optional implementations, the identification information is the source address corresponding to the first message.

[0043] In some optional implementations, the node identification module is specifically used for:

[0044] If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node.

[0045] Otherwise, the node information is determined to represent a non-entry computing power network node.

[0046] In some optional implementations, the routing module is specifically used for:

[0047] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or

[0048] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0049] Thirdly, embodiments of this application provide a computing power network device, including at least one processor and at least one memory, wherein the memory stores a computer program, and when the program is executed by the processor, the processor executes any of the computing power routing methods described in the first aspect above.

[0050] Fourthly, embodiments of this application provide a computer-readable storage medium storing a computer program executable by a processor, which, when run on the processor, causes the processor to execute any of the computing power routing methods described in the first aspect above. Attached Figure Description

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

[0052] Figure 1 This is a schematic diagram of the system architecture of the computing network provided in the embodiments of this application;

[0053] Figure 2 A flowchart illustrating the first computing power routing method provided in this application embodiment;

[0054] Figure 3 This is a schematic diagram of the segmented routing header structure provided in an embodiment of this application;

[0055] Figure 4 This is a schematic diagram of the structure of the purpose option header provided in an embodiment of this application;

[0056] Figure 5 A flowchart illustrating the second computing power routing method provided in this application embodiment;

[0057] Figure 6 A flowchart illustrating the third computing power routing method provided in this application embodiment;

[0058] Figure 7 A flowchart illustrating the fourth computing power routing method provided in this application embodiment;

[0059] Figure 8 A flowchart illustrating the fifth computing power routing method provided in this application embodiment;

[0060] Figure 9 This is a schematic diagram of the computing power routing device provided in the embodiments of this application;

[0061] Figure 10 This is a schematic diagram of the structure of the computing network device provided in the embodiments of this application. Detailed Implementation

[0062] To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0063] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this application, unless otherwise stated, "a plurality of" means two or more.

[0064] In the description of this application, it should be noted that, unless otherwise expressly specified and limited, the term "connection" should be interpreted broadly. For example, it can refer to a direct connection, an indirect connection through an intermediate medium, or a connection within two devices. Those skilled in the art can understand the specific meaning of the above term in this application based on the specific circumstances.

[0065] A computing power network is a network architecture that deeply integrates computing power and networks, connecting widely distributed computing resources through a network. (See also...) Figure 1 As shown, this computing network comprises three levels of computing resources: cloud computing nodes, edge computing nodes, and terminal computing nodes. Terminal computing nodes include terminal devices such as mobile phones, computers, and laptops; edge computing nodes include computing nodes in wireless access networks (such as base stations) and computing nodes in Passive Optical Networks (PONs) (such as routers and operator service equipment). In practical applications, the architecture of the computing network can include more or fewer levels of computing resources, and each level of computing nodes can employ other implementation methods.

[0066] In a computing network, by scheduling computing applications to the optimal computing nodes, user experience can be improved and computing and network resource utilization can be optimized.

[0067] To minimize the impact on the existing network, computing power network services are located in the overlay layer above the network layer, meaning that the publication and routing of computing power information are implemented at the overlay layer.

[0068] After the client sends a request, the computing network nodes query the global routing table to select a route. However, in this method, each computing network node needs to query the routing information of both remote and local computing resources, resulting in low routing efficiency. Furthermore, frequent updates to computing power information can place a significant burden on the routing system; for example, updating a computing node requires updating the global routing table.

[0069] Some implementations propose an aggregateable two-layer architecture, where the maintenance and routing of computing resources are segmented. Computing network devices maintain two types of routing tables: a local routing table and a remote routing table (global routing table). The global routing table includes both remote and local routing information; the local routing table includes local routing information.

[0070] For a computing network service request, the corresponding computing network nodes are the ingress computing network node (CATS-R) and the egress computing network node (CATS-L). CATS-R queries the remote routing table to select a route. If the target computing node is local, it is directly forwarded to the target computing node. If the target computing node is not local, it needs to be passed to the computing network node CATS-L connected to the target computing node through a tunnel. After arriving at CATS-L, the local routing table is queried again and forwarded to the local target computing node.

[0071] Therefore, in an aggregateable two-layer architecture, the computing network node that receives the first message needs to know whether it is an ingress computing network node or an egress computing network node in order to decide whether to query the remote routing table or the local routing table.

[0072] In view of this, embodiments of this application propose a computing power routing method, apparatus, computing power network device, and storage medium. The method is applied to any computing power network device and includes: responding to the first message corresponding to any computing power network service, determining the node information of the previous node that sent the first message based on the identification information of the first message; wherein the node information represents an ingress computing power network node or a non-ingress computing power network node; determining a target routing table from the candidate routing table of the computing power network device based on the node information, and performing route selection based on the target routing table; wherein the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0073] The above scheme, because the computing network device maintains two types of routing tables—a local routing table and a remote routing table (global routing table)—only requires updating the corresponding local routing table when a computing node is updated. This enables flexible changes to computing information and reduces the burden of updating computing information on the routing system. After receiving the first packet of a computing network service, the computing network device can determine the node information of the previous node that sent the first packet based on the identifier information of the first packet, i.e., whether the previous node is an ingress computing network node or a non-ingress computing network node, and thus determine its own attributes (ingress computing network node or egress computing network node). This allows for precise selection of the target routing table suitable for its own attributes, i.e., selectively deciding whether to query the global routing table or only the local routing table, thereby improving routing efficiency.

[0074] The technical solution of this application and how it solves the above-mentioned technical problems will be described in detail below with reference to the accompanying drawings and specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments.

[0075] Figure 2 A flowchart illustrating the first computing power routing method provided in this application embodiment is shown below. Figure 2 As shown, it includes the following steps:

[0076] Step S201: In response to the first message corresponding to any computing power network service, determine the node information of the previous node that sent the first message based on the identification information of the first message.

[0077] The node information represents either an ingress computing power network node or a non-ingress computing power network node.

[0078] For a computing network service, when a client sends a packet for that service for the first time, the computing network device needs to query the routing table to select a route. In this embodiment, the computing network device maintains two types of routing tables: a local routing table and a remote routing table (global routing table). The global routing table includes both remote and local routing information; the local routing table only includes local routing information.

[0079] In practice, the computing network nodes transmit messages through tunnels. Therefore, the attributes of the computing network nodes can be either CATS-R or CATS-L. The routing table queried is different depending on the attribute.

[0080] Since there is only one CATS-R and one CATS-L in the computing network routing, the first computing network device to receive the first message is CATS-R; therefore, the attributes of the computing network device depend on the node information of the previous node (the node that sent the first message to the computing network device).

[0081] Based on this, in this embodiment, after receiving the first message of the computing power network service, the computing power network device first obtains the node information of the previous node based on the identification information of the first message, that is, whether the previous node is an ingress computing power network node or a non-ingress computing power network node.

[0082] Step S202: Based on the node information, determine the target routing table from the alternative routing table of the computing power network device, and perform route selection based on the target routing table.

[0083] The alternative routing table includes a global routing table and a local routing table. The global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0084] As mentioned above, computing network nodes can have two attributes: CATS-R and CATS-L. For CATS-R, the target computing node may be local or not; therefore, it is necessary to query the remote routing table (containing global routing information) for route selection.

[0085] For CATS-L, if the target computing node is local, only the local routing table needs to be queried.

[0086] For example, the previous node could be a client or a CATS-R; if the previous node is a non-ingress computing network node, then the computing network device is a CATS-R, and the global routing table is selected; if the previous node is a CATS-R, then the computing network node is a CATS-L, and the local routing table is selected.

[0087] The above scheme, because the computing network device maintains two types of routing tables—a local routing table and a remote routing table (global routing table)—only requires updating the corresponding local routing table when a computing node is updated. This enables flexible changes to computing information and reduces the burden of updating computing information on the routing system. After receiving the first packet of a computing network service, the computing network device can determine the node information of the previous node that sent the first packet based on the identifier information of the first packet, i.e., whether the previous node is an ingress computing network node or a non-ingress computing network node, and thus determine its own attributes (ingress computing network node or egress computing network node). This allows for precise selection of the target routing table suitable for its own attributes, i.e., selectively deciding whether to query the global routing table or only the local routing table, thereby improving routing efficiency.

[0088] In some optional implementations, the identification information is the flag value of a preset flag bit in the first message.

[0089] For example, a specific field in the first message can be selected as a preset flag bit. After receiving the first message, the node marks it with the preset flag bit so that the next node can know the node information of the previous node.

[0090] The above scheme, by selecting specific fields in the first message and using their marked values ​​as identification information, enables the computing network device that receives the first message to accurately and efficiently identify whether the previous node is an ingress computing network node or a non-ingress computing network node.

[0091] In some optional implementations, step S201 above can be implemented in, but is not limited to, the following ways:

[0092] If the preset flag value is the default value, then the node information is determined to represent a non-entry computing power network node;

[0093] If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0094] For example, non-computing network devices (such as clients) do not mark the preset flag bit; only computing network devices mark the preset flag bit (CATS-R flag). Therefore, if the preset flag bit's value is the default value, it means the previous node did not modify the preset flag bit's value, and the previous node is not a computing network device; therefore, the previous node is not the entry computing network node. Conversely, if the preset flag bit's value is not the default value, it means the previous node modified the preset flag bit's value; therefore, the previous node is a computing network device, meaning the previous node's node information represents the entry computing network node. In this case, the computing network node is not CATS-R, but CATS-L.

[0095] In some optional implementations, step S202 above can be implemented in, but is not limited to, the following ways:

[0096] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or

[0097] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0098] As mentioned above, non-computing network devices will not mark the preset flag bit; only computing network devices will mark the preset flag bit.

[0099] If the preset flag value is the default value, it means that the previous node did not modify the preset flag value. The previous node is not a computing network device. This node is the first computing network device to receive the first packet. It needs to change the preset flag value from the default value to a non-default value and query the global routing table to select a route. This is so that when there is a next computing network device, the next computing network device can know that this node is the ingress computing network node based on the non-default value, and then select the target routing table (local routing table) that is suitable for its own attributes.

[0100] If the preset flag value is not the default value, it means that the previous node has modified the preset flag value. The previous node is also a computing network device (as CATS-R). This node is not the first computing network device to receive the first packet, so it directly queries the local routing table to select a route.

[0101] This embodiment does not limit the specific implementation of the flag value, such as the default value being 0, and the non-default value being 1, etc.

[0102] In the above scheme, if the node information of the previous node indicates that it is not an ingress computing network node, it means that the previous node is not a computing network device, and this node is the first computing network device to receive the first packet (the ingress computing network node). The target computing node may or may not be local. Accurate routing is achieved by querying the global routing table. Furthermore, by modifying the default value of the preset flag to a non-default value, when the target computing node is not local, the next computing network device (the computing network device connected to the target computing node) can recognize that this node is an ingress computing network node based on this non-default value and select a local routing table suitable for its own attributes. If the node information of the previous node indicates that it is an ingress computing network node, it means that the previous node is a computing network device, and this node is not the first computing network device to receive the first packet. The target computing node is local, and efficient routing can be achieved simply by querying the local routing table.

[0103] The following two specific examples illustrate this:

[0104] Example 1

[0105] The client sends the first message to the computing network device r1. The preset flag bit in the first message has a default value of 0. After receiving the first message, the computing network device r1 determines the node information of the previous node as a non-entry computing network node based on the preset flag bit, while this device r1 is the entry computing network node.

[0106] r1 modifies the flag value of the preset flag bit in the first message from the default value 0 to the non-default value 1, and finds the next node from the global routing table as the computing network device r3 (the target computing node A0 is not local);

[0107] After receiving the first message, the computing network device r3 determines the node information of the previous node as an ingress computing network node based on the preset flag bit, while this device r3 is a non-ingress computing network node (exgress computing network node).

[0108] r3 finds the next node as A0 from its local routing table and sends the first packet to A0.

[0109] Example 2

[0110] The client sends the first message to the computing network device r2. The preset flag bit in the first message has a default value of 0. After receiving the first message, the computing network device r2 determines the node information of the previous node as a non-entry computing network node based on the preset flag bit, while the current device r2 is the entry computing network node.

[0111] r2 modifies the preset flag value in the first message from the default value 0 to the non-default value 1, finds the next node A0 from the global routing table, and sends the first message to A0 (the target computing node A0 is local).

[0112] This embodiment does not specifically limit the preset flag bit; the preset flag bit can be selected according to the type of the first message.

[0113] Taking the first message mentioned above as an example, which is a message in Internet Protocol Version 6 (IPv6), the default flag is a default field in the segmentation routing header or a default field in the destination options header.

[0114] See Figure 3 As shown, the Segment Routing Header (SRH) includes the NextHeader field, the Hdr Ext Len field, the Routing Type field, the Segments Left field, the LastEntry field (index of the last element in the segment list), the Flags field, the Tag field, the Segment List field, and an optional Optical Type Length Value (optical TLV) field.

[0115] You can use one bit of the Flags field as the default flag bit; or, you can use an optical TLV as the default flag bit.

[0116] See Figure 4 As shown, the Destination Options Header (DOH) includes the Next Header field, the Hdr Ext Len field, and the options field.

[0117] One of the options in the above options field can be used as a preset flag.

[0118] The above Figure 3 and Figure 4 This is merely an illustrative example of a preset flag bit. In practice, other fields may be used as preset flag bits, and this application does not impose any specific limitations on this.

[0119] For cases where the identification information is the flag value of the aforementioned preset flag bit, this application embodiment provides a flowchart of a second computing power routing method, as follows: Figure 5 As shown, it includes the following steps:

[0120] Step S501: In response to the first message corresponding to any computing power network service, if the flag value of the preset flag bit is the default value, then the node information is determined to represent a non-entry computing power network node.

[0121] Step S502: Determine the global routing table as the target routing table, and modify the default value of the preset flag bit to a non-default value.

[0122] The specific implementation of steps S501 to S502 can be referred to the above embodiments, and will not be repeated here.

[0123] For cases where the identification information is the flag value of the aforementioned preset flag bit, this application embodiment provides a flowchart of a third computing power routing method, as follows: Figure 6 As shown, it includes the following steps:

[0124] Step S601: In response to the first message corresponding to any computing power network service, if the flag value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0125] Step S602: Determine the local routing table as the target routing table.

[0126] The specific implementation of steps S601 to S602 can be referred to the above embodiments, and will not be repeated here.

[0127] In some optional implementations, the identification information is the source address corresponding to the first message.

[0128] For example, the first message carries a source address, which represents the basic attributes of the previous node (whether it is a computing network device or a non-computing network device); and the computing network routing is implemented at the overlay layer, using a tunneling protocol. Therefore, the source address can be used as identification information, and after receiving the first message, the computing network device can also identify the node information of the previous node by combining the protocol type of the first message and the source address.

[0129] The above scheme uses the source address corresponding to the first message as the identification information, eliminating the need to expand the first message. This allows the computing network device that receives the first message to identify whether the previous node is an ingress computing network node or a non-ingress computing network node.

[0130] In some optional implementations, step S201 above can be implemented in, but is not limited to, the following ways:

[0131] If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node.

[0132] Otherwise, the node information is determined to represent a non-entry computing power network node.

[0133] As mentioned above, the computing network routing is implemented in the overlay layer and uses a tunneling protocol. After receiving the first packet, the computing network device combines the protocol type and source address of the first packet. If the first packet is a tunneling protocol packet and the source address is the address of another computing network device, it means that the previous node is the entry computing network node in the computing network routing process.

[0134] If the first message is a tunneling protocol message and the source address is not the address of a computing network device, it means that the previous node is another type of node in the computing network routing process and is not the entry computing network node. This node is the first computing network device to receive the first message.

[0135] If the first message is a message of another protocol and the source address is the address of another computing network device, it means that although the previous node is a computing network device, it is not in the computing network routing process and the previous node cannot be used as the entry computing network node.

[0136] In the above scheme, since the computing network routing is implemented at the overlay layer and a tunneling protocol is used, the computing network device combines the protocol type and source address of the first packet to accurately identify whether the node information of the previous node represents the ingress computing network node.

[0137] In some optional implementations, step S202 above can be implemented in, but is not limited to, the following ways:

[0138] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table;

[0139] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0140] For example, if the previous node is not an ingress computing power network node, but this node will act as an ingress computing power network node, the global routing table will be queried to select a route.

[0141] If the previous node is an ingress computing power network node, and this node will be an egress computing power network node, the target computing power node is located locally, and the local routing table is directly queried for route selection.

[0142] In the above scheme, if the node information of the previous node indicates that it is not an ingress computing network node, it means that this node is the first computing network device (ingress computing network node) to receive the first message mentioned above. The target computing node may or may not be local. Accurate route selection is achieved by querying the global routing table. If the node information of the previous node indicates that it is an ingress computing network node, it means that the previous node is the first computing network device to receive the first message mentioned above. This node is an egress computing network node. The target computing node is local. Efficient route selection is achieved by querying the local routing table, which meets the routing needs of computing network nodes with different attributes.

[0143] For the case where the identifier information is the source address corresponding to the first message mentioned above, this application embodiment provides a flowchart of a fourth computing power routing method, as follows: Figure 7 As shown, it includes the following steps:

[0144] Step S701: In response to the first message corresponding to any computing power network service, if the first message is a tunnel protocol message and the source address is the address of another computing power network device, then determine that the node information represents the entry computing power network node.

[0145] Step S702: Determine the local routing table as the target routing table.

[0146] The specific implementation of steps S701 to S702 can be referred to the above embodiments, and will not be repeated here.

[0147] For the case where the identifier information is the source address corresponding to the first message mentioned above, this application embodiment provides a flowchart of the fifth computing power routing method, as follows: Figure 8 As shown, it includes the following steps:

[0148] Step S801: In response to the first message corresponding to any computing power network service, if the first message is not a tunnel protocol message, and / or the source address is not the address of other computing power network devices, then determine that the node information represents a non-entry computing power network node.

[0149] Step S802: Determine the global routing table as the target routing table.

[0150] The specific implementation of steps S801 to S802 can be referred to the above embodiments, and will not be repeated here.

[0151] like Figure 9 As shown, this application provides a computing power routing device 900, which is applied to any computing power network device. The device includes:

[0152] The node identification module 901 is used to respond to the first message corresponding to any computing power network service, and determine the node information of the previous node that sent the first message based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node;

[0153] The routing module 902 is used to determine a target routing table from the candidate routing table of the computing power network device based on the node information, and to perform route selection based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0154] In some optional implementations, the identification information is the flag value of a preset flag bit in the first message.

[0155] In some optional implementations, the node identification module 901 is specifically used for:

[0156] If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or

[0157] If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0158] In some optional implementations, the routing module 902 is specifically used for:

[0159] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or

[0160] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0161] In some optional implementations, the preset flag is a preset field in the segmented routing header or a preset field in the destination options header.

[0162] In some optional implementations, the identification information is the source address corresponding to the first message.

[0163] In some optional implementations, the node identification module 901 is specifically used for:

[0164] If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node.

[0165] Otherwise, the node information is determined to represent a non-entry computing power network node.

[0166] In some optional implementations, the routing module 902 is specifically used for:

[0167] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or

[0168] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0169] Based on the same technical concept, this application also provides a computing power network device 1000, such as... Figure 10 As shown, it includes at least one processor 1001 and a memory 1002 connected to at least one processor. In this embodiment, the specific connection medium between the processor 1001 and the memory 1002 is not limited. Figure 10 Taking the connection between processor 1001 and memory 1002 via bus 1003 as an example. The bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, Figure 10 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0170] The processor 1001 serves as the control center of the computing network device. It connects to various parts of the device via various interfaces and lines, and performs data processing by running or executing instructions stored in the memory 1002 and accessing data stored in the memory 1002. Optionally, the processor 1001 may include one or more processing units. The processor 1001 may integrate an application processor and a modem processor. The application processor primarily handles the operating system, user interface, and applications, while the modem processor primarily handles issuing instructions. It is understood that the modem processor may not be integrated into the processor 1001. In some embodiments, the processor 1001 and the memory 1002 may be implemented on the same chip; in other embodiments, they may be implemented on separate chips.

[0171] The processor 1001 can be a general-purpose processor, such as a central processing unit (CPU), digital signal processor, application-specific integrated circuit (ASIC), field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of the computing power routing method can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0172] Memory 1002, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. Memory 1002 may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic memory, magnetic disk, optical disk, etc. Memory 1002 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. In the embodiments of this application, memory 1002 can also be a circuit or any other device capable of implementing storage functions for storing program instructions and / or data.

[0173] In this embodiment, the memory 1002 stores a computer program, which, when executed by the processor 1001, causes the processor 1001 to perform the following:

[0174] In response to the first message corresponding to any computing power network service, the node information of the previous node that sent the first message is determined based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node;

[0175] Based on the node information, a target routing table is determined from the candidate routing table of the computing power network device, and route selection is performed based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information.

[0176] In some optional implementations, the identification information is the flag value of a preset flag bit in the first message.

[0177] In some optional implementations, processor 1001 specifically performs:

[0178] If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or

[0179] If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

[0180] In some optional implementations, processor 1001 specifically performs:

[0181] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or

[0182] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0183] In some optional implementations, the preset flag is a preset field in the segmented routing header or a preset field in the destination options header.

[0184] In some optional implementations, the identification information is the source address corresponding to the first message.

[0185] In some optional implementations, processor 1001 specifically performs:

[0186] If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node.

[0187] Otherwise, the node information is determined to represent a non-entry computing power network node.

[0188] In some optional implementations, processor 1001 specifically performs:

[0189] If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or

[0190] If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

[0191] Based on the same technical concept, embodiments of this application also provide a computer-readable storage medium storing a computer program executable by a processor, which, when run on the processor, causes the processor to perform the steps of the above-described computing power routing method.

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

[0193] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, 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 instructions for implementing 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.

[0194] 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.

[0195] 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.

[0196] Although preferred embodiments of this application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of this application.

[0197] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A computing power routing method, characterized in that, Applied to any computing network device, the method includes: In response to the first message corresponding to any computing power network service, the node information of the previous node that sent the first message is determined based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node; Based on the node information, a target routing table is determined from the candidate routing table of the computing power network device, and route selection is performed based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information; The determination of the target route table from the candidate route table of the computing power network device based on the node information includes: If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or, If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

2. The method as described in claim 1, characterized in that, The identification information is the flag value of the preset flag bit in the first message.

3. The method as described in claim 2, characterized in that, Based on the identifier information of the first message, the node information of the previous node that sent the first message is determined, including: If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

4. The method as described in claim 3, characterized in that, Based on the node information, the target routing table is determined from the alternative routing table of the computing power network device, including: If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table, and the default value of the preset flag bit is modified to a non-default value; or If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

5. The method as described in claim 2, characterized in that, The preset flag is a preset field in the segmented routing header or a preset field in the destination options header.

6. The method as described in claim 1, characterized in that, The identification information is the source address corresponding to the first message.

7. The method as described in claim 6, characterized in that, Based on the identifier information of the first message, the node information of the previous node that sent the first message is determined, including: If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node. Otherwise, the node information is determined to represent a non-entry computing power network node.

8. A computing power routing device, characterized in that, Applied to any computing network device, the device includes: The node identification module is used to respond to the first message corresponding to any computing power network service, and determine the node information of the previous node that sent the first message based on the identification information of the first message; wherein, the node information represents an ingress computing power network node or a non-ingress computing power network node; A routing module is used to determine a target routing table from the candidate routing table of the computing power network device based on the node information, and to perform route selection based on the target routing table; wherein, the candidate routing table includes a global routing table and a local routing table, the global routing table includes remote routing information and local routing information, and the local routing table includes local routing information; Specifically, the routing module is used for: If the node information represents a non-entry computing power network node, then the global routing table is determined as the target routing table; or, If the node information represents an ingress computing power network node, then the local routing table is determined as the target routing table.

9. The apparatus as claimed in claim 8, characterized in that, The identification information is the flag value of the preset flag bit in the first message.

10. The apparatus as claimed in claim 9, characterized in that, The node identification module is specifically used for: If the preset flag value is a default value, then the node information is determined to represent a non-entry computing power network node; or If the value of the preset flag bit is not the default value, then the node information represents the entry computing power network node.

11. The apparatus as claimed in claim 8, characterized in that, The identification information is the source address corresponding to the first message.

12. The apparatus as claimed in claim 11, characterized in that, The node identification module is specifically used for: If the first message is a tunneling protocol message and the source address is the address of another computing power network device, then the node information is determined to represent the entry computing power network node. Otherwise, the node information is determined to represent a non-entry computing power network node.

13. A computing power network device, characterized in that, It includes at least one processor and at least one memory, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the method as described in any one of claims 1 to 7.

14. A computer-readable storage medium, characterized in that, It stores a computer program executable by a computer, which, when run on the computer, causes the computer to perform the method as described in any one of claims 1 to 7.

Images