Data packet routing method, apparatus, and computer-readable storage medium

Abstract

The embodiments of the present application provide a data packet routing method, a data packet routing apparatus, a communication device, a chip, a computer-readable storage medium, and a computer program product. The method is applied to an ingress node and comprises: receiving an advertisement sent by at least one egress node, the advertisement comprising one or more of the following information: computing power and / or service information of a service node corresponding to the egress node, energy efficiency information of the service node corresponding to the egress node, cost information of the service node corresponding to the egress node for processing a first service, and security level information of the service node corresponding to the egress node; generating a routing policy on the basis of the one or more pieces of information in the advertisement, the routing policy comprising: a default routing policy; and receiving a data packet of the first service sent by a terminal or a user, and using the routing policy to forward the data packet.

Description

Data packet routing method, device, and computer-readable storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application is based on the Chinese patent application with application number 202410278996.6 and application date of March 12, 2024, and claims the priority of the Chinese patent application. The entire content of the Chinese patent application is hereby introduced into this application as a reference. Technical Field

[0003] The embodiments of the present application relate to the field of communication technology, and specifically to a data packet routing method, a data packet routing apparatus, a communication device, a chip, a computer-readable storage medium, and a computer program product. Background Art

[0004] In the current computing power notification scheme, either the capacity and real-time status of the service node are considered at the same time. The real-time status requires frequent notification of the load situation, which takes up a lot of network and computing resources. Or only the capacity of the service node is considered, which is too static. The problem in this case is that scheduling to busy nodes may still occur. There is no solution that can take both into account. Summary of the Invention

[0005] Embodiments of the present application provide a data packet routing method, a data packet routing apparatus, a communication device, a chip, a computer-readable storage medium, and a computer program product.

[0006] The data packet routing method provided in the embodiment of the present application is applied to an ingress node, including:

[0007] Receiving a notification sent by at least one exit node; the notification including one or more of the following information: computing power and / or service information of a service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of processing a first service by the service node corresponding to the exit node, and security level information of the service node corresponding to the exit node;

[0008] Generate a routing policy based on one or more pieces of information in the notification; the routing policy includes: a default routing policy;

[0009] Receive a data packet of the first service sent by a terminal or a user, and forward the data packet using the routing strategy.

[0010] The data packet routing method provided in the embodiment of the present application is applied to an egress node, including:

[0011] Sending a notification to the entry node; the notification including one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first service, and security level information of the service node corresponding to the exit node;

[0012] Receive the data packet forwarded by the entry node, and send the data packet to its corresponding service node.

[0013] The data packet routing device provided in an embodiment of the present application is applied to an ingress node and includes:

[0014] A first routing unit is configured to receive a notification sent by at least one egress node; the notification includes one or more of the following information: computing power and / or service information of a service node corresponding to the egress node, energy efficiency information of the service node corresponding to the egress node, cost information of the service node corresponding to the egress node processing a first service, and security level information of the service node corresponding to the egress node;

[0015] The first routing unit is further configured to generate a routing policy based on one or more information in the notification; the routing policy includes: a default routing policy;

[0016] The first routing unit is further configured to receive a data packet of the first service sent by a terminal or a user, and forward the data packet using the routing strategy.

[0017] The data packet routing device provided in the embodiment of the present application is applied to an egress node, including:

[0018] A second routing unit is configured to send a notification to the ingress node; the notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the egress node, energy efficiency information of the service node corresponding to the egress node, cost information of the service node corresponding to the egress node processing the first service, and security level information of the service node corresponding to the egress node;

[0019] The second routing unit is further configured to receive a data packet forwarded by the entry node and send the data packet to its corresponding service node.

[0020] The communication device provided in an embodiment of the present application includes: a processor and a memory, the memory is configured to store a computer program, and the processor is configured to call and run the computer program stored in the memory to execute any data packet routing method provided in an embodiment of the present application.

[0021] The chip provided in the embodiment of the present application includes: a processor configured to call and run a computer program from a memory, so that a device equipped with the chip executes any data packet routing method provided in the embodiment of the present application.

[0022] The computer-readable storage medium provided in the embodiments of the present application is configured to store a computer program, which enables a computer to execute any data packet routing method provided in the embodiments of the present application.

[0023] The computer program product provided in the embodiments of the present application includes a computer program, which, when executed by a processor, implements any data packet routing method provided in the embodiments of the present application.

[0024] The data packet routing method provided in the embodiment of the present application integrates and improves the current computing power notification related mechanism. The entry node generates a routing strategy based on one or more information reported by the service node corresponding to the exit node. The routing strategy includes a default routing strategy. The exit node can influence the default forwarding strategy based on the notification, so that the default forwarding strategy can better adapt to the service. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0026] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0027] FIG1 is a schematic diagram of a computing power measurement solution provided in an embodiment of the present application;

[0028] FIG2 is a schematic diagram of a first implementation flow of a data packet routing method provided in an embodiment of the present application;

[0029] FIG3 is a schematic diagram of data packet routing provided in an embodiment of the present application;

[0030] FIG4 is a second schematic diagram of an implementation flow of the data packet routing method provided in an embodiment of the present application;

[0031] FIG5 is a schematic diagram of the structure of a data packet routing device 500 provided in an embodiment of the present application;

[0032] FIG6 is a schematic diagram of the structure of a data packet routing device 600 provided in an embodiment of the present application;

[0033] FIG7 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0034] FIG8 is a schematic structural diagram of a chip provided in an embodiment of the present application. DETAILED DESCRIPTION

[0035] The following will describe the technical solutions in the embodiments of this application in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0036] It should be noted that in the embodiments of the present application, the term "and / or" is merely a description of the association relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent three situations: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the embodiments of the present application, the character " / " generally indicates that the associated objects are in an "or" relationship.

[0037] In the description of the embodiments of the present application, the term "corresponding" may indicate a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship between indication and being indicated, configuration and being configured, etc.

[0038] To facilitate understanding of the technical solutions of the embodiments of the present application, the relevant technologies of the embodiments of the present application are described below. The following relevant technologies can be arbitrarily combined with the technical solutions of the embodiments of the present application as optional solutions, and they all fall within the protection scope of the embodiments of the present application.

[0039] In traditional anycast routing solutions, only network factors are considered when making routing decisions for anycast addresses. However, computing power routing supports the perception of computing power information, and thus combines computing power information with network information to make a joint decision and select an appropriate computing power service node.

[0040] The computing power routing solution consists of three main parts. The first is the notification of computing power information (hereafter referred to as computing power notification), which is the notification of computing power information (generated by the computing power measurement mechanism) to the network. The second is routing decision-making. At this time, the decision-making nodes of the computing power network, such as the entry node, will comprehensively consider computing power and network information to select the appropriate path corresponding to the exit node and form a corresponding forwarding strategy. The third is the forwarding of computing power service data packets. After the entry node receives the user's computing power service data packet, it will forward it according to the aforementioned forwarding strategy. Furthermore, the exit node will forward the user's computing power service data packet to the appropriate computing power service node.

[0041] Refer to Figure 1, which is a schematic diagram of the computing power measurement scheme provided by an embodiment of the present application. As shown in Figure 1, there are two split ideas in the current computing power measurement scheme in computing power routing. The first idea is to minimize the total delay (total-delay) to optimize the user experience. The total delay is the sum of the network delay and the processing delay of the computing node. In traditional network scheduling, the node closest to the network is selected, and the processing delay of the computing node is not considered. However, the node closest to the network is not necessarily the best node (its processing delay may be longer), so selecting the nearest node in the traditional solution is problematic. At this time, the estimated service delay (i.e., business processing delay service-delay) of the computing node (i.e., computing power service node) can be published, and the network delay (network-delay) can be combined to form an estimated total delay. The egress node (or service point) is selected based on the estimated total-delay; the decision point (such as Ingress) can switch the route. The problem with this approach is its scalability and real-time performance. For example, when there is a lot of business, it is difficult to guarantee real-time updates of service-delay, and service-delay is also difficult to predict. In addition, business requirements are usually not the lowest latency, but rather a latency within a reasonable upper limit. The second approach focuses on load. The basic optimization goal is load balancing (LB). Starting from the LB concept of enhanced anycast, this approach better matches the design goals of the network and provides adapted services to as many users as possible. The problem with this approach is that it basically only considers the capabilities of the node, which is too static and can still result in scheduling to a busy node.

[0042] Some hashrate notification schemes assume extreme requirements (such as millisecond-level status notifications). However, this real-time performance comes at a high cost and is difficult to achieve. Therefore, a compromise solution is needed, considering some tradeoffs. At the same time, it is also necessary to consider integrating the currently fragmented hashrate measurement approaches. Furthermore, a single forwarding strategy is unlikely to flexibly meet the diverse needs of users.

[0043] FIG2 is a schematic diagram of a first implementation flow of a data packet routing method provided in an embodiment of the present application. As shown in FIG2 , an embodiment of the present application provides a data packet routing method, which is applied to an ingress node. The method includes the following steps:

[0044] Step 201: Receive a notification sent by at least one exit node; the notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first business, and security level information of the service node corresponding to the exit node.

[0045] Exemplarily, the computing power and / or service information may include one or more of the following information: service capability information of the service node corresponding to the egress node in processing the first business, and latency information of the service node corresponding to the egress node in processing the first business. The service capability information is represented by the value of capability. For example, some service nodes have the capability to support 1000 concurrent sessions (i.e., the capability value is 1000), and some service nodes have the capability to support 100 concurrent sessions (i.e., the capability value is 100); latency information can be represented by the estimated time for the service node to complete the first business. The computing power and / or service information also includes the business busy status information of the service node corresponding to the egress node, which can be supplemented with timeliness information or time information.

[0046] Based on this, in an optional embodiment of the present application, the computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information:

[0047] service capability information of the service node corresponding to the egress node for processing the first service;

[0048] The service node corresponding to the egress node processes the delay information of the first service.

[0049] Illustratively, the egress node may determine the information carried in the notification based on service requirements and / or optimization objectives.

[0050] In an optional embodiment of the present application, the service nodes corresponding to the at least one egress node all deploy the same service, which is referred to as the first service for ease of description. The embodiment of the present application does not limit the type of the first service, for example, the first service may be a short video service.

[0051] Exemplarily, the service node is a server, virtual machine, or container in an edge computing node (Mobile Edge Computing, MEC), and this application does not limit this.

[0052] Step 202: Generate a routing policy based on one or more pieces of information in the notification; the routing policy includes: a default routing policy.

[0053] For example, if the notification only includes the computing power of the service node corresponding to the egress node and / or the service capability information for processing the first service in the service information, then the entry node (such as Ingress) constructs a load balancing (LB) between multiple service nodes based on the service capability information of each service node (different nodes can have different weights) and generates a load balancing-based routing policy as the default routing policy. In specific implementation, the entry node performs load balancing between the paths corresponding to the egress nodes corresponding to the service nodes.

[0054] It should be noted that the "default routing policy" described in the embodiments of the present application refers to a routing policy generated based on the information in the notification. The "default routing policy" can also be replaced by "initial routing policy" or "basic routing policy".

[0055] For example, if the announcement only includes the delay information of the service node corresponding to the egress node processing the first service, then the ingress node selects the service node with the smallest delay and access based on the delay information, and uses the unselected service node as a backup to generate a routing strategy based on the overall service delay as the default routing strategy.

[0056] In an embodiment of the present application, the delay information includes business processing delay and network delay. In specific implementation, the entry node selects between the paths corresponding to the exit node corresponding to the service node. At this time, on the one hand, the entry node perceives the network delay information of the exit node. On the other hand, the entry node obtains the estimated business processing delay information of the corresponding service node notified by the exit node. Then, the entry node indirectly selects the target service node by selecting a suitable exit node.

[0057] Exemplarily, if the notification includes multiple pieces of information, the priority of each piece of information may be set. For example, the priority of latency information may be set higher than that of service capability information. When the notification includes the service capability information of the service node corresponding to the egress node and the latency information of the service node corresponding to the egress node processing the first service, a routing policy based on the overall service latency is preferentially generated as the default routing policy.

[0058] Illustratively, if the notification includes multiple pieces of information, a default routing strategy may be selected based on different service requirements and / or different optimization goals.

[0059] In an optional implementation manner of the present application, the types of routing strategies include one or more of the following:

[0060] A first routing strategy, wherein the first routing strategy is a routing strategy for performing load balancing based on service capability information;

[0061] A second routing strategy, wherein the second routing strategy is a routing strategy for load balancing based on service capability information and energy efficiency information;

[0062] a third routing strategy, wherein the third routing strategy is a routing strategy based on the overall service latency; and

[0063] A fourth routing strategy is a routing strategy based on overall service delay and cost information; wherein the overall service delay includes: the delay of the service node in processing the first service, and the network delay of the egress node.

[0064] Step 203: Receive a data packet of the first service sent by a terminal or a user, and route the data using the routing strategy.

[0065] Refer to Figure 3, which is a schematic diagram of data packet routing provided in an embodiment of the present application. As shown in Figure 3, egress node 1, egress node 2, and egress node 3 respectively report notification-related information of MEC1, MEC2, and MEC3 through the Border Gateway Protocol (BGP). The entry node 1 generates a routing policy based on the notification reported by the egress node. According to the routing policy, the data packet sent by the client is forwarded through router 1 and / or router 2 and / or router 3 and / or router 4 and / or router 5 to the exit node corresponding to the default policy, and the service is completed through the corresponding MEC.

[0066] In an embodiment of the present application, the entry node adopts a routing strategy to forward data packets, and during the routing process, adjusts the routing strategy according to real-time information of computing power and / or service. For example, the exit node sends first information to the entry node during the service process; the first information indicates that the service node corresponding to the exit node is currently busy or is about to enter a busy state, and the entry node adjusts the routing strategy according to the first information.

[0067] In an embodiment of the present application, when the routing strategy is a routing strategy based on the overall service delay, the first information can be set to 1 to represent that the corresponding service node is currently busy or is about to enter a busy state.

[0068] In an optional embodiment of the present application, the method further includes:

[0069] receiving first information sent by one or more egress nodes among the at least one egress node, wherein the first information indicates that a service node corresponding to the egress node is currently busy or is about to enter a busy state;

[0070] Based on the first information, the routing policy is adjusted.

[0071] Here, the first information may also carry timeliness information and / or time information. When the first information reported by the egress node indicates that the service node corresponding to the egress node is in a busy state, the ingress node adjusts the state of the service node in the routing policy. For example, if the routing policy is the first routing policy or the second routing policy, then within the first time, the forwarding path corresponding to the service node may not participate in LB, or the weight of the forwarding path corresponding to the service node may be changed to 0, indicating that it does not participate in forwarding. The first time may be a preset value, or it may be determined by the timeliness information carried by the first information. Alternatively, if the routing policy is the third routing policy or the fourth routing policy, then within the first time, the forwarding path corresponding to the service node may not participate in data forwarding. The first time may be a preset value, or it may be determined by the timeliness information and / or time information carried by the first information.

[0072] When the first information reported by the egress node indicates that the service node corresponding to the egress node is about to be in a busy state, the ingress node adjusts the state of the service node in the routing policy. For example, if the routing policy is the first routing policy or the second routing policy, the weight of the forwarding path corresponding to the service node can be reduced within the first time. For example, it can be adjusted to a first preset value. The first time can be a preset value, or it can be determined by the timeliness information or time information carried by the first information.

[0073] In an embodiment of the present application, the first information can also indicate that the service node corresponding to the egress node is in an idle state. At this time, it is generally not necessary to adjust the forwarding path corresponding to the service node. However, if the decision point (such as the entry node) has previously received the first information indicating that the service node is currently busy or is about to enter a busy state, and the first information is still within the validity period, then there is no need to wait for the time limit to expire, and the previous policy modification can be directly canceled, that is, the forwarding path corresponding to the service node is re-added to the routing policy.

[0074] Exemplarily, the first information may include the number of users that the service node can still access, and the status of the service node is represented by the number of users.

[0075] Based on this, in an optional implementation manner of the present application, adjusting the routing policy based on the first information includes:

[0076] If the routing policy is the first routing policy or the second routing policy, the path corresponding to the first exit node is removed from the routing policy; or, the weight of the path corresponding to the first exit node is adjusted to a first preset value; wherein the first exit node is the exit node corresponding to the first information; or,

[0077] If the routing policy is the third routing policy or the fourth routing policy, the path corresponding to the first exit node is removed from the routing policy; wherein the first exit node is the exit node corresponding to the first information.

[0078] In an optional embodiment of the present application, the method further includes:

[0079] After a first time, the path corresponding to the first exit node is re-added to the routing policy; wherein the first time is a preset value; or, the first time is determined based on the timeliness information and / or time information carried by the first information.

[0080] In the embodiment of the present application, the adopting the routing strategy to forward the data packet includes:

[0081] The data packet is forwarded using the default routing policy.

[0082] In an embodiment of the present application, in addition to generating a default routing policy, the decision point (entry node) can also generate a personalized routing policy or an optimized routing policy, that is, an additional routing policy; the types of the additional routing policies include one or more of the following: a first routing policy, wherein the first routing policy is a routing policy for load balancing based on service capability information; a second routing policy, wherein the second routing policy is a routing policy for load balancing based on service capability information and energy efficiency information; a third routing policy, wherein the third routing policy is a routing policy based on the overall service delay; and a fourth routing policy, wherein the fourth routing policy is a routing policy based on the overall service delay and cost information; the overall service delay includes: the delay information of the service node processing the first service, and the network delay of the data packet from the entry node to the exit node.

[0083] In an optional implementation manner of the present application, the personalized routing strategy or the optimized routing strategy is further adjusted based on the first information.

[0084] Here, the specific adjustment method can be understood by referring to the adjustment method of the routing policy in the above embodiment.

[0085] In an embodiment of the present application, the data packet sent by the client may also carry service intent information to indicate the target routing policy, which may be the default routing policy, a personalized routing policy or an optimized routing policy.

[0086] For example, when the destination address (DA) is a 128-bit address, the ingress node can match all forwarding requests. In this case, different DAs can be matched to different policies.

[0087] For example, when the DA is a combination of an IPv6 prefix and an Intent number, the first 120 bits can be matched and forwarded by default (the 128 bits here can be allocated in addition to 120 bits and 8 bits, or in other ways, which is not limited in this application), and the remaining 8 bits are used to identify the service intent number.

[0088] For example: intent number 01 indicates that the optimization goal is LB, and LB should be executed according to the capacity of each service node, and the forwarding path should be selected according to the LB mechanism; intent number 02 indicates that the optimization goal is the lowest total delay, and the forwarding path will be selected according to the optimal delay; intent number 03 indicates that the optimization goal is to comprehensively consider load balancing and energy efficiency information. At this time, the egress node needs to support the notification of the energy efficiency information of the service node, which will affect the weight of each path during LB; intent number 04 indicates that the optimization goal is to comprehensively consider the delay and cost information. At this time, the egress node needs to support the notification of the cost information of each computing node. The specific algorithm can be to select the one with the lowest cost in the set that meets the delay. For example: the client influences the selected routing node through indication information, for example,

[0089] DA=ServiceID1::0000, the selected egress node is the node selected by executing the default policy, that is, forwarding is performed according to the default forwarding policy of the ingress node; at this time, DA will match the default forwarding policy of the ingress node.

[0090] DA = ServiceID1::0001. The selected egress node is the node selected by executing the LB policy based on the capabilities of each service node, that is, forwarding is based on the LB routing policy. At this time, DA will match the personalized routing policy or optimized routing policy of the ingress node.

[0091] DA = ServiceID1::0002. The selected egress node is the node that executes the optimal overall delay strategy, that is, the routing strategy based on the overall service delay is adopted for forwarding. In this case, DA will match the personalized routing strategy or optimized routing strategy of the ingress node.

[0092] DA = ServiceID1::0003. The selected egress node is the node selected by executing the strategy that comprehensively considers load balancing and energy efficiency information. That is, the routing strategy based on load balancing and energy efficiency information is adopted for forwarding. At this time, DA will match the personalized routing strategy or optimized routing strategy of the ingress node.

[0093] DA = ServiceID1::0004. The selected egress node is the node that executes the strategy that comprehensively considers latency and cost information. That is, the routing strategy based on the overall latency and cost information of the service is adopted for forwarding. In this case, DA will match the personalized routing strategy or optimized routing strategy of the ingress node.

[0094] For example, if the message is IPv6, the indication information can be carried in the TLV of the SRv6 extension header and represented by a number, for example: number 01 indicates that the optimization goal is LB, and LB should be performed according to capacity; number 02 indicates that the optimization goal is the lowest total delay, and the forwarding path will be selected according to the optimal delay; number 03 indicates that the optimization goal is to comprehensively consider load balancing and energy efficiency information. At this time, the egress node needs to support the notification of the energy efficiency information of the service node, which will affect the weight of each path in LB; number 04 indicates that the optimization goal is to comprehensively consider the delay and cost information. At this time, the egress node needs to support the notification of the cost information of each computing node. The specific algorithm can be to select the one with the lowest cost in the set that meets the delay.

[0095] Exemplarily, if the destination address and / or corresponding indication information of the data packet matches a first additional routing policy among the one or more additional routing policies, the first additional routing policy is adopted to forward the data packet; or

[0096] If the destination address and / or corresponding indication information of the data packet does not match any of the one or more additional routing policies and can only match the default routing policy, the data packet is forwarded using the default routing policy; or

[0097] If the destination address and / or corresponding indication information of the data packet does not match the one or more additional routing policies and does not match the default routing policy, the data packet is discarded.

[0098] Based on this, in an optional implementation manner of the present application, the routing policy includes one or more additional routing policies; the data packet carries indication information, and the indication information is used to indicate the target routing policy;

[0099] Forwarding the data packet using the routing strategy includes:

[0100] Matching the destination address and / or indication information of the data packet with the default routing policy and the one or more additional routing policies;

[0101] If the destination address and / or corresponding indication information of the data packet matches a first additional routing policy among the one or more additional routing policies, the first additional routing policy is adopted to forward the data packet; or

[0102] If the destination address and / or indication information of the data packet does not match the target routing policy and the one or more additional routing policies, and only matches the default routing policy, the data packet is forwarded using the default routing policy.

[0103] In an embodiment of the present application, the entry node can also monitor the network delay information of the exit node (for example, the delay of the data packet reaching the exit node) and adjust the routing policy based on the network delay information of the exit node. For example, if the delay of the exit node does not meet the delay requirements of the current business, the path corresponding to the exit node is removed from the routing policy.

[0104] Based on this, in an optional implementation manner of the present application, the method further includes:

[0105] monitoring network delay information of the at least one egress node;

[0106] The path corresponding to the second egress node is removed from the routing strategy; the second egress node is an egress node whose network delay information exceeds a second preset value.

[0107] FIG4 is a second schematic diagram of an implementation flow of a data packet routing method provided in an embodiment of the present application. As shown in FIG4 , an embodiment of the present application provides a data packet routing method, which is applied to an egress node. The method includes the following steps:

[0108] Step 401: Send a notification to the entry node; the notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first business, and security level information of the service node corresponding to the exit node.

[0109] Exemplarily, the computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information: service capability information of the service node corresponding to the exit node in processing the first business; delay information of the service node corresponding to the exit node in processing the first business.

[0110] For example, the service capability information of the service node corresponding to the egress node for processing the first service can be represented by the capability value. For example, some service nodes can support 1,000 sessions, and some service nodes can support 100 sessions. The delay information of the service node corresponding to the egress node for processing the first service can be represented by the estimated time for the service node to complete the first service.

[0111] Exemplarily, the egress node may determine the information carried in the notification based on service requirements and optimization goals.

[0112] In an optional implementation manner of the present application, the service nodes associated with the at least one egress node all deploy the same service, such as the first service.

[0113] Step 402: Receive a data packet forwarded by the ingress node, and send the data packet to its corresponding service node.

[0114] Here, the service node can be a server, virtual machine, or container in MEC.

[0115] In an optional implementation manner of the present application, the method further includes: sending first information to the entry node; the first information indicates that the service node corresponding to the egress node is currently busy or is about to enter a busy state.

[0116] Here, the first information is used by the ingress node to adjust the routing policy.

[0117] In an optional implementation manner of the present application, the first information carries timeliness information and / or time information, and the timeliness information and / or time information is used to influence the routing policy of the entry node.

[0118] Here, the first information may also carry timeliness information and / or time information. When the first information reported by the egress node indicates that the service node corresponding to the egress node is in a busy state, the ingress node adjusts the state of the service node in the routing policy. For example, if the routing policy is the first routing policy or the second routing policy, then within the first time, the forwarding path corresponding to the service node may not participate in LB, or the weight of the forwarding path corresponding to the service node may be changed to 0, indicating that it does not participate in forwarding. The first time may be a preset value, or it may be determined by the timeliness information or time information carried by the first information. Alternatively, if the routing policy is the third routing policy or the fourth routing policy, then within the first time, the forwarding path corresponding to the service node may not participate in data forwarding. The first time may be a preset value, or it may be determined by the timeliness information and / or time information carried by the first information.

[0119] When the first information reported by the egress node indicates that the service node corresponding to the egress node is about to be in a busy state, the ingress node adjusts the state of the service node in the routing policy. For example, if the routing policy is the first routing policy or the second routing policy, the weight of the forwarding path corresponding to the service node can be reduced within the first time. For example, it can be adjusted to a first preset value. The first time can be a preset value, or it can be determined by the timeliness information or time information carried by the first information.

[0120] In an embodiment of the present application, the first information can also indicate that the service node corresponding to the egress node is in an idle state. At this time, it is generally not necessary to adjust the forwarding path corresponding to the service node. However, if the decision point (such as the entry node) has previously received the first information that the service node is currently busy or is about to enter a busy state, and the information is still within the validity period, then there is no need to wait for the time limit to expire, but the policy modifications made previously can be directly canceled.

[0121] Exemplarily, the first information may include the number of users that the service node can still access, and the status of the service node is represented by the number of users.

[0122] The packet routing method provided in the embodiment of the present application integrates and improves the current computing power notification and computing power decision-making mechanisms. First, an initial routing policy is provided at the decision node (Ingress). The policy can be generated by the Ingress based on the notification reported by the egress node. For example, the weight of the corresponding forwarding path is set according to the capacity of the service node (the maximum number of concurrent sessions supported). Then, LB is performed based on the network delay information. For example, the path corresponding to the egress node with a delay exceeding a certain value does not participate in LB. During the routing process, the routing policy is adjusted based on the service node's own busy information and the timeliness information of the busy information, so that the routing policy can adapt to the service in real time. For some services with strong dynamics, the egress node directly notifies the relevant service status information to influence the default forwarding policy. On the one hand, it does not lead to frequent notifications, and on the other hand, it does not lead to information expiration and decision-making errors. It is a compromise strategy. It also supports user-indicated routing policies and forwards according to user needs. At this time, one or more personalized routing policies or optimized routing policies will be generated at the ingress node. The client or user indicates the policy through the data packet and matches the relevant policy for forwarding.

[0123] The present application also provides a data packet routing device 500. Referring to FIG. 5 , the data packet routing device 500 in this embodiment is applied to an ingress node and includes:

[0124] The first routing unit 510 is configured to receive a notification sent by at least one egress node; the notification includes one or more of the following information: computing power and / or service information of a service node corresponding to the egress node, energy efficiency information of the service node corresponding to the egress node, cost information of the service node corresponding to the egress node processing the first service, and security level information of the service node corresponding to the egress node;

[0125] The first routing unit 510 is further configured to generate a routing policy based on one or more information in the notification; the routing policy includes: a default routing policy;

[0126] The first routing unit 510 is further configured to receive a data packet of the first service sent by a terminal or a user, and forward the data packet using the routing strategy.

[0127] In an embodiment of the present application, the computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information: service capability information of the service node corresponding to the exit node in processing the first business; delay information of the service node corresponding to the exit node in processing the first business.

[0128] In an embodiment of the present application, the first routing unit 510 is further configured to receive first information sent by one or more egress nodes among the at least one egress node; the first information indicates that the service node corresponding to the egress node is currently busy or is about to enter a busy state; and the routing policy is adjusted based on the first information.

[0129] In an embodiment of the present application, the types of routing strategies include one or more of the following: a first routing strategy, wherein the first routing strategy is a routing strategy for load balancing based on service capability information; a second routing strategy, wherein the second routing strategy is a routing strategy for load balancing based on service capability information and energy efficiency information; a third routing strategy, wherein the third routing strategy is a routing strategy based on the overall service delay; and a fourth routing strategy, wherein the fourth routing strategy is a routing strategy based on the overall service delay and cost information; wherein the overall service delay includes: the delay of the service node in processing the first service, and the network delay of the egress node.

[0130] In an embodiment of the present application, the first routing unit 510 is configured to: if the routing policy is the first routing policy or the second routing policy, remove the path corresponding to the first exit node from the routing policy; or, adjust the weight of the path corresponding to the first exit node to a first preset value; wherein the first exit node is the exit node corresponding to the first information; or, if the routing policy is the third routing policy or the fourth routing policy, remove the path corresponding to the first exit node from the routing policy; wherein the first exit node is the exit node corresponding to the first information.

[0131] In an embodiment of the present application, the first routing unit 510 is further configured to re-add the path corresponding to the first exit node to the routing policy after a first time; wherein the first time is a preset value; or, the first time is determined based on the timeliness information and / or time information carried by the first information.

[0132] In the embodiment of the present application, the first routing unit 510 is configured to forward the data packet using the default routing policy.

[0133] In an embodiment of the present application, the routing policy also includes one or more additional routing policies; the data packet carries indication information, and the indication information is used to indicate the target routing policy; the first routing unit 510 is configured to match the destination address and / or indication information of the data packet with the default routing policy and the one or more additional routing policies; if the destination address and / or corresponding indication information of the data packet matches the first additional routing policy in the one or more additional routing policies, the first additional routing policy is used to forward the data packet; or, if the destination address and / or indication information of the data packet does not match either the target routing policy or the one or more additional routing policies, and can only match the default routing policy, the default routing policy is used to forward the data packet.

[0134] In an embodiment of the present application, the first routing unit 510 is further configured to monitor the network delay information of the at least one egress node; remove the path corresponding to the second egress node from the routing policy; the second egress node is an egress node whose network delay information exceeds a second preset value.

[0135] Those skilled in the art will appreciate that the functions implemented by each unit in the packet routing device 500 shown in FIG5 can be understood by referring to the relevant description of the aforementioned method. The functions of each unit in the packet routing device 500 shown in FIG5 can be implemented by a program running on a processor or by a specific logic circuit.

[0136] The present application also provides a data packet routing device 600. Referring to FIG. 6 , the data packet routing device 600 in this embodiment is applied to an egress node and includes:

[0137] The second routing unit 610 is configured to send a notification to the ingress node; the notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the egress node, energy efficiency information of the service node corresponding to the egress node, cost information of the service node corresponding to the egress node processing the first service, and security level information of the service node corresponding to the egress node;

[0138] The second routing unit 610 is further configured to receive a data packet forwarded by the ingress node and send the data packet to its corresponding service node.

[0139] In an embodiment of the present application, the computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information: service capability information of the service node corresponding to the exit node in processing the first business; delay information of the service node corresponding to the exit node in processing the first business.

[0140] In the embodiment of the present application, the second routing unit 610 is further configured to send first information to the entry node; the first information indicates that the service node corresponding to the exit node is currently busy or is about to enter a busy state.

[0141] In an embodiment of the present application, the first information carries timeliness information and / or time information, and the timeliness information and / or time information is used to influence the routing policy of the entry node.

[0142] Those skilled in the art will appreciate that the functions implemented by each unit in the packet routing device 600 shown in FIG6 can be understood by referring to the relevant description of the aforementioned method. The functions of each unit in the packet routing device 600 shown in FIG6 can be implemented by a program running on a processor or by a specific logic circuit.

[0143] Figure 7 is a schematic structural diagram of a communication device 700 provided in an embodiment of the present application. The communication device 700 shown in Figure 7 includes a processor 710, which can call and run a computer program from a memory to implement the method in the embodiment of the present application.

[0144] Optionally, as shown in Figure 7, the communication device 700 may further include a memory 720. The processor 710 may call and execute a computer program from the memory 720 to implement the method in the embodiment of the present application.

[0145] The memory 720 may be a separate device independent of the processor 710 , or may be integrated into the processor 710 .

[0146] Optionally, as shown in FIG7 , the communication device 700 may further include a transceiver 730 , and the processor 710 may control the transceiver 730 to communicate with other devices, specifically, to send information or data to other devices, or to receive information or data sent by other devices.

[0147] The transceiver 730 may include a transmitter and a receiver. The transceiver 730 may further include an antenna, and the number of antennas may be one or more.

[0148] The communication device 700 may specifically be the data packet routing device 500 / data packet routing device 600 of the embodiment of the present application, and the communication device 700 may implement the corresponding processes implemented by the data packet routing device 500 / data packet routing device 600 in the various methods of the embodiment of the present application. For the sake of brevity, they will not be repeated here.

[0149] Illustratively, an embodiment of the present application further provides a computer program product, including a computer program, which can be executed by the processor 710 of the communication device 700 to complete the steps of any of the aforementioned methods.

[0150] Figure 8 is a schematic structural diagram of a chip according to an embodiment of the present application. The chip 800 shown in Figure 8 includes a processor 810, which can call and run a computer program from a memory to implement the method according to the embodiment of the present application.

[0151] Optionally, as shown in FIG8 , the chip 800 may further include a memory 820 , wherein the processor 810 may call and execute a computer program from the memory 820 to implement the method in the embodiment of the present application.

[0152] The memory 820 may be a separate device independent of the processor 810 , or may be integrated into the processor 810 .

[0153] Optionally, the chip 800 may further include an input interface 830. The processor 810 may control the input interface 830 to communicate with other devices or chips, and specifically, may obtain information or data sent by other devices or chips.

[0154] Optionally, the chip 800 may further include an output interface 840. The processor 810 may control the output interface 840 to communicate with other devices or chips, and specifically, may output information or data to other devices or chips.

[0155] This chip can be applied to the data packet routing device 500 / data packet routing device 600 in the embodiments of the present application, and the chip can implement the corresponding processes implemented by the data packet routing device 500 / data packet routing device 600 in the various methods of the embodiments of the present application. For the sake of brevity, they will not be repeated here.

[0156] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0157] It should be understood that the processor of the embodiments of the present application may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiment can be completed by hardware integrated logic circuits in the processor or software instructions. The above processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0158] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0159] It should be understood that the above-mentioned memories are exemplary but not restrictive. For example, the memories in the embodiments of the present application may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM RAM (DR RAM), etc. In other words, the memories in the embodiments of the present application are intended to include, but are not limited to, these and any other suitable types of memories.

[0160] The present invention also provides a computer-readable storage medium configured to store a computer program. The computer-readable storage medium can be applied to the data packet routing device 500 / data packet routing device 600 in the present invention. The computer program causes a computer to execute the corresponding processes implemented by the data packet routing device 500 / data packet routing device 600 in the various methods of the present invention. For the sake of brevity, these procedures are not further described here.

[0161] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0162] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0163] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0164] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0165] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0166] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a data packet routing device 500 / data packet routing device 600, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0167] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A data packet routing method, applied to an ingress node, comprising: receiving a notification sent by at least one exit node; The notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first service, and security level information of the service node corresponding to the exit node; generating a routing policy based on one or more pieces of information in the advertisement; The routing strategy includes: a default routing strategy; Receive a data packet of the first service sent by a terminal or a user, and forward the data packet using the routing strategy.

2. The method according to claim 1, wherein The computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information: service capability information of the service node corresponding to the egress node for processing the first service; The service node corresponding to the egress node processes the delay information of the first service.

3. The method according to claim 1, wherein The method further comprises: receiving first information sent by one or more egress nodes among the at least one egress node, wherein the first information indicates that a service node corresponding to the egress node is currently busy or is about to enter a busy state; Based on the first information, the routing policy is adjusted.

4. The method according to claim 3, wherein: The types of routing strategies include one or more of the following: A first routing strategy, wherein the first routing strategy is a routing strategy for performing load balancing based on service capability information; A second routing strategy, wherein the second routing strategy is a routing strategy for load balancing based on service capability information and energy efficiency information; A third routing strategy, wherein the third routing strategy is a routing strategy based on the overall service delay; as well as, A fourth routing strategy is a routing strategy based on overall service delay and cost information; wherein the overall service delay includes: the delay of the service node in processing the first service, and the network delay of the egress node.

5. The method according to claim 4, wherein The adjusting the routing policy based on the first information includes: If the routing policy is the first routing policy or the second routing policy, the path corresponding to the first exit node is removed from the routing policy; or the weight of the path corresponding to the first exit node is adjusted to a first preset value; wherein the first exit node is the exit node corresponding to the first information; or, If the routing policy is the third routing policy or the fourth routing policy, the path corresponding to the first exit node is removed from the routing policy; wherein the first exit node is the exit node corresponding to the first information.

6. The method according to claim 5, wherein: Also includes: After a first time, re-adding the path corresponding to the first egress node to the routing policy; wherein the first time is a preset value; Alternatively, the first time is determined based on timeliness information and / or time information carried by the first information.

7. The method according to any one of claims 1 to 6, wherein: Forwarding the data packet using the routing strategy includes: The data packet is forwarded using the default routing policy.

8. The method according to any one of claims 1 to 6, wherein The routing policy also includes one or more additional routing policies; The data packet carries indication information, where the indication information is used to indicate a target routing policy; Forwarding the data packet using the routing strategy includes: Matching the destination address and / or indication information of the data packet with the default routing policy and the one or more additional routing policies; If the destination address and / or corresponding indication information of the data packet matches a first additional routing policy among the one or more additional routing policies, the first additional routing policy is adopted to forward the data packet; or If the destination address and / or indication information of the data packet does not match the target routing policy and the one or more additional routing policies, and only matches the default routing policy, the data packet is forwarded using the default routing policy.

9. The method according to any one of claims 1 to 6, wherein Also includes: monitoring network delay information of the at least one egress node; Eliminate the path corresponding to the second egress node from the routing policy; The second egress node is an egress node whose network delay information exceeds a second preset value.

10. A data packet routing method, applied to an egress node, comprising: Send notification to the entry node; The notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first service, and security level information of the service node corresponding to the exit node; Receive the data packet forwarded by the entry node, and send the data packet to its corresponding service node.

11. The method according to claim 10, wherein: The computing power and / or service information of the service node corresponding to the exit node includes one or more of the following information: service capability information of the service node corresponding to the egress node for processing the first service; The service node corresponding to the egress node processes the delay information of the first service.

12. The method according to claim 11, wherein Also includes: Sending first information to the entry node; The first information indicates that the service node corresponding to the egress node is currently in a busy state or is about to enter a busy state.

13. The method according to claim 12, wherein: The first information carries timeliness information and / or time information, and the timeliness information and / or time information is used to influence the routing policy of the entry node.

14. A data packet routing device, applied to an ingress node, comprising: A first routing unit: configured to receive an advertisement sent by at least one egress node; The notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first service, and security level information of the service node corresponding to the exit node; The first routing unit is further configured to generate a routing policy based on one or more information in the notification; The routing strategy includes: a default routing strategy; The first routing unit is further configured to receive a data packet of the first service sent by a terminal or a user, and forward the data packet using the routing strategy.

15. A data packet routing device, applied to an egress node, comprising: Second routing unit: configured to send an announcement to the ingress node; The notification includes one or more of the following information: computing power and / or service information of the service node corresponding to the exit node, energy efficiency information of the service node corresponding to the exit node, cost information of the service node corresponding to the exit node processing the first service, and security level information of the service node corresponding to the exit node; The second routing unit is further configured to receive a data packet forwarded by the entry node and send the data packet to its corresponding service node.

16. A communication device comprising: A processor and a memory, the memory being configured to store a computer program, the processor being configured to call and run the computer program stored in the memory to execute the data packet routing method according to any one of claims 1 to 9, or the data packet routing method according to any one of claims 10 to 13.

17. A chip, comprising: The processor is configured to call and run a computer program from a memory, so that a device equipped with the chip executes the data packet routing method described in any one of claims 1 to 9, or the data packet routing method described in any one of claims 10 to 13.

18. A computer-readable storage medium configured to store a computer program, wherein the computer program causes a computer to execute the data packet routing method according to any one of claims 1 to 9, or the data packet routing method according to any one of claims 10 to 13.

19. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the data packet routing method according to any one of claims 1 to 9, or the data packet routing method according to any one of claims 10 to 13.

Images