Data packet routing method, device and computer readable storage medium

Abstract

Embodiments of the present application provide a data packet routing method, a data packet routing device, a communication device, a chip, a computer readable storage medium and a computer program product. The method is applied to an entry node and includes: 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 a 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 for processing first business, security level information of the service node corresponding to the exit node; generating a routing strategy based on one or more information in the notification; the routing strategy includes: a default routing strategy; receiving a data packet of the first business sent by a terminal or a user, and forwarding the data packet by using the routing strategy.

Description

TECHNICAL FIELD

[0001] Embodiments of the present application relate to the technical field of communication, in particular to a data packet routing method, a data packet routing device, a communication device, a chip, a computer readable storage medium and a computer program product. BACKGROUND

[0002] In the current computing power notification scheme, either the ability and real-time state of the service node are considered at the same time, the real-time state needs to frequently notify the load situation, which occupies a large amount of network and computing resources, or only the ability of the service node is considered, which is too static, at this time, the problem is that scheduling to a busy node still occurs, and there is no compromise solution. SUMMARY

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

[0004] The data packet routing method provided by the embodiments of the present application is applied to an entry node, and includes:

[0005] 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 a 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 a first service, security level information of the service node corresponding to the exit node;

[0006] generating a routing strategy based on one or more information in the notification; the routing strategy includes a default routing strategy;

[0007] receiving a data packet of the first service sent by a terminal or a user, and forwarding the data packet using the routing strategy.

[0008] The data packet routing method provided by the embodiments of the present application is applied to an exit node, and includes:

[0009] sending a notification to an entry node; the notification includes 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 the service node corresponding to the exit node processing a first service, security level information of the service node corresponding to the exit node;

[0010] receiving a data packet forwarded by the entry node, and sending the data packet to a corresponding service node.

[0011] The data packet routing device provided by the embodiments of the present application is applied to an entry node, and includes:

[0012] The first routing unit is further configured to receive an announcement sent by at least one exit node, and the announcement comprises 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 the service node corresponding to the exit node for processing the first service, and security level information of the service node corresponding to the exit node.

[0013] The first routing unit is further configured to generate a routing strategy based on one or more of the information in the announcement, and the routing strategy comprises a default routing strategy.

[0014] 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 by using the routing strategy.

[0015] The data packet routing apparatus provided by the embodiment of the present application is applied to an exit node, and comprises:

[0016] The second routing unit is configured to send an announcement to an entry node, and the announcement comprises 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 the service node corresponding to the exit node for processing the first service, and security level information of the service node corresponding to the exit node.

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

[0018] The communication device provided by the embodiment of the present application comprises a processor and a memory, the memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory to execute any data packet routing method provided by the embodiment of the present application.

[0019] The chip provided by the embodiment of the present application comprises a processor, which is used for calling and running a computer program from a memory, so that a device installed with the chip executes any data packet routing method provided by the embodiment of the present application.

[0020] The computer readable storage medium provided by the embodiment of the present application is used for storing a computer program, and the computer program causes a computer to execute any data packet routing method provided by the embodiment of the present application.

[0021] The computer program product provided by the embodiment of the present application comprises a computer program, and the computer program implements any data packet routing method provided by the embodiment of the present application when executed by a processor.

[0022] The data packet routing method provided by the embodiment of the present application integrates and perfects the current computing power announcement related mechanism. The entry node generates a routing strategy according to 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 affect the default forwarding strategy according to the announcement, so that the default forwarding strategy can better adapt to the service. BRIEF DESCRIPTION OF DRAWINGS

[0023] The drawings described herein are used to provide further understanding of the present application, and form 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:

[0024] Figure 1 The schematic diagram of the computing power measurement scheme provided by the embodiment of the present application;

[0025] Figure 2 The implementation flowchart of the data packet routing method provided by the embodiment of the present application Figure 1 ;

[0026] Figure 3 The data packet routing schematic diagram provided by the embodiment of the present application;

[0027] Figure 4 The implementation flowchart of the data packet routing method provided by the embodiment of the present application Figure 2 ;

[0028] Figure 5 The structural composition schematic diagram of the data packet routing device 500 provided by the embodiment of the present application;

[0029] Figure 6 The structural composition schematic diagram of the data packet routing device 600 provided by the embodiment of the present application;

[0030] Figure 7 The schematic structural diagram of the communication device provided by the embodiment of the present application;

[0031] Figure 8 The schematic structural diagram of the chip provided by the embodiment of the present application. DETAILED DESCRIPTION

[0032] The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative labor fall within the scope of the present application.

[0033] It should be noted that in the embodiments of the present application, the term "and / or" is only used to describe the relationship between the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent the three cases of A alone, A and B together, and B alone. In addition, in the embodiments of the present application, the character " / " generally represents an "or" relationship between the front and rear associated objects.

[0034] In the description of the embodiments of the present application, the term "corresponding" can represent a direct or indirect corresponding relationship between the two, can also represent an associated relationship between the two, and can also indicate a relationship such as being indicated, configured, and configured.

[0035] In order to facilitate understanding of the technical solutions of the embodiments of the present application, the related technologies of the embodiments of the present application are described as follows, which can be combined with the technical solutions of the embodiments of the present application in any way, and all belong to the protection scope of the embodiments of the present application.

[0036] In the traditional anycast routing scheme, only network factors are considered when making routing decisions for anycast addresses. In the computing power routing scheme, information that supports sensing computing power is supported, so that computing power information and network information are combined for joint decision-making to select a suitable computing power service node.

[0037] The computing power routing scheme mainly includes three parts. The first is the announcement of computing power information (referred to as computing power announcement), that is, the computing power information (result generated by the computing power measurement mechanism) is announced to the network; the second is routing decision-making, at this time the decision node of the computing power network, such as the entry node, will consider the information of computing power and network to select a suitable 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 match the aforementioned forwarding strategy for forwarding, and further, the exit node will forward the user's computing power service data packet to the appropriate computing power service node.

[0038] Reference Figure 1 , Figure 1 The schematic diagram of the computing power measurement scheme provided by the embodiments of the present application is as follows Figure 1As shown, there are two split ideas in the current computing power routing computing power measurement scheme. The first idea is for delay, and the optimization goal is to minimize the total delay (total-delay) to optimize user experience, and the total delay is the sum of network delay and processing delay of computing nodes. In traditional network scheduling, the node closest to the network distance will be selected, and the processing delay of the computing node will not be considered. However, the node closest to the network distance is not necessarily the best node (its processing delay can be longer), so it is a problem to select the nearest node in the traditional scheme. 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 the estimated total delay. According to the estimated total delay, the egress node (Egress) (or service node (Service Point)) is selected; the decision point (such as Ingress) can be switched to route. The problem of this idea is scalability and real-time performance, for example, when there are many businesses, it is difficult to guarantee real-time update of service-delay, and service-delay is also difficult to predict. In addition, the business usually does not require the lowest delay, but the delay size within the reasonable upper limit of the delay. The second idea is for load, and the basic optimization goal is load balancing (Load Balance, LB). Starting from the LB idea of enhancing anycast, this idea is more matched with the design goal of the network, and tries to provide adaptive services for more users. The problem of this idea is that it basically only considers the capacity of the node, which is too static, and still may schedule to a busy node.

[0039] The assumed requirement in some schemes of computing power announcement is a relatively extreme capability (such as millisecond ms level state announcement), but this real-time cost is large and difficult to implement, so a compromise scheme is needed now, considering some tradeoff. At the same time, it is also necessary to consider integrating the currently split computing power measurement ideas, and a single forwarding strategy is difficult to flexibly meet the different needs of users.

[0040] Figure 2 Implementation process of the data packet routing method provided by the embodiment of the application Figure 1 As shown in Figure 2 The data packet routing method provided by the embodiment of the application is applied to an ingress node, and the method comprises the following steps:

[0041] Step 201: receiving an announcement sent by at least one egress node; the announcement 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 first service, security level information of the service node corresponding to the egress node.

[0042] For example, the computing power and / or service information can comprise one or more of the following information: service capability information of the service node corresponding to the egress node for processing the first service, and latency information of the service node corresponding to the egress node for processing the first service. The service capability information is represented by a value of capability, for example, a service node has a capability of supporting 1000 concurrent sessions (i.e., the value of capability is 1000), and another service node has a capability of supporting 100 concurrent sessions (i.e., the value of capability is 100); the latency information can be represented by an estimated time for the service node to complete the first service. The computing power and / or service information further comprises service busy state information of the service node corresponding to the egress node, which can be attached with time-to-live information or time information.

[0043] 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 egress node comprises one or more of the following information:

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

[0045] latency information of the service node corresponding to the egress node for processing the first service.

[0046] For example, the egress node can determine the information carried by the announcement according to service demand and / or optimization target.

[0047] 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 the convenience of description. The embodiments of the present application do not limit the type of the first service, for example, the first service can be a short video service.

[0048] For example, the service node is one of a server, a virtual machine, or a container in a mobile edge computing (MEC), and the present application does not limit this.

[0049] Step 202: generating a routing policy based on one or more of the information in the announcement; the routing policy comprising a default routing policy.

[0050] For example, if the announcement only includes the service capability information of the service nodes corresponding to the egress nodes and / or the computing power of the service nodes, the ingress node constructs the LB (different nodes can have different weights) among the service nodes according to the service capability information of the service nodes, generates a routing strategy based on load balancing as the default routing strategy. In a specific implementation, the ingress node performs load balancing among the paths corresponding to the egress nodes of the service nodes.

[0051] It should be noted that the "default routing strategy" described in the embodiments of the present application refers to the routing strategy generated according to the information in the announcement. The "default routing strategy" can also be described as "initial routing strategy" or "basic routing strategy".

[0052] For example, if the announcement only includes the latency information of the service nodes corresponding to the egress nodes processing the first service, the ingress node selects the service node with the minimum latency according to the latency information, and takes the unselected service nodes as backups, generates a routing strategy based on the overall latency of the services as the default routing strategy.

[0053] In the embodiments of the present application, the latency information includes service processing latency and network latency. In a specific implementation, the ingress node selects among the paths corresponding to the egress nodes of the service nodes. At this time, on the one hand, the ingress node perceives the network latency information of the egress nodes, and on the other hand, the ingress node obtains the service processing latency information estimated by the corresponding service nodes announced by the egress nodes. Then the ingress node indirectly selects the target service node by selecting a suitable egress node.

[0054] For example, if the announcement includes multiple information, the priority of each information can also be set. For example, the priority of the latency information is higher than that of the service capability information. When the announcement includes the service capability information of the service nodes corresponding to the egress nodes and the latency information of the service nodes corresponding to the egress nodes processing the first service, the routing strategy based on the overall latency of the services is generated as the default routing strategy in priority.

[0055] For example, if the announcement includes multiple information, the default routing strategy can be selected according to different requirements of the services and / or different optimization targets.

[0056] In an optional embodiment of the present application, the types of the routing strategy include one or more of the following:

[0057] The first routing strategy is a routing strategy based on load balancing of service capability information;

[0058] The second routing strategy is a load balancing strategy based on service capability information and energy efficiency information.

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

[0060] The fourth routing strategy is a routing strategy based on overall service latency and cost information; wherein, the overall service latency includes: the latency of the service node processing the first service, and the network latency of the egress node.

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

[0062] refer to Figure 3 , Figure 3 This is a schematic diagram of data packet routing provided in an embodiment of this application, such as... Figure 3 As shown, exit nodes 1, 2, and 3 respectively announce the relevant information of MEC1, MEC2, and MEC3 through the Border Gateway Protocol (BGP). Ingress node 1 generates a routing policy based on the announcements reported by the exit nodes. According to the routing policy, the data packets sent by the client are forwarded to the corresponding exit nodes of the default policy through routers 1 and / or 2 and / or 3 and / or 4 and / or 5, and the service is completed through the corresponding MEC.

[0063] In this embodiment of the application, the ingress node uses a routing strategy to forward data packets, and adjusts the routing strategy according to the real-time information of computing power and / or services during the routing process. For example, during the service process, the egress node sends first information to the ingress 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, and the ingress node adjusts the routing strategy according to the first information.

[0064] In this embodiment of the application, when the routing strategy is a routing strategy based on the overall service latency, the first information can be used to indicate that the corresponding service node is currently in a busy state or is about to enter a busy state by setting all bits of the estimated latency for processing the first service to 1.

[0065] In one optional embodiment of this application, the method further includes:

[0066] Receive first information sent by one or more of the at least one exit 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.

[0067] adjust the routing policy based on the first information.

[0068] Here, the first information can also carry time-to-live 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, the forwarding path corresponding to the service node can be excluded from LB or the weight of the forwarding path corresponding to the service node can be changed to 0, representing that the forwarding path does not participate in forwarding, within a first time. The first time can be a preset value or can be determined by the time-to-live information carried by the first information. Alternatively, if the routing policy is the third routing policy or the fourth routing policy, the forwarding path corresponding to the service node can be excluded from data forwarding within a first time. The first time can be a preset value or can be determined by the time-to-live information and / or time information carried by the first information.

[0069] 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 a first time. For example, the weight can be adjusted to a first preset value. The first time can be a preset value or can be determined by the time-to-live information or time information carried by the first information.

[0070] In the embodiments of the present application, the first information can also indicate that the service node corresponding to the egress node is in an idle state. In this case, the forwarding path corresponding to the service node generally does not need to be adjusted. However, if the decision point (such as the ingress node) has previously received the first information indicating that the service node is in a busy state or is about to enter a busy state, and the first information is still within the time-to-live validity period, the previously made policy modification can be directly canceled, that is, the forwarding path corresponding to the service node is re-added to the routing policy.

[0071] For example, the first information can include the number of users that can still access the service node, and the state of the service node is indicated by the number of users.

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

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

[0074] If the routing policy is the third routing policy or the fourth routing policy, a path corresponding to a first egress node is removed from the routing policy; wherein the first egress node is an egress node corresponding to the first information.

[0075] In an optional embodiment of the present application, the method further comprises:

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

[0077] In an embodiment of the present application, the forwarding of the data packet using the routing policy comprises:

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

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

[0080] In an optional embodiment of the present application, it further comprises: adjusting the personalized routing policy or the optimized routing policy based on the first information.

[0081] Here, the specific adjustment method can be understood with reference to the adjustment method of the routing policy in the foregoing embodiments.

[0082] In the embodiments of the present application, the data packet sent by the client can also carry service intent information, which is used to indicate a target routing strategy. The target routing strategy can be the default routing strategy, the personalized routing strategy, or the optimized routing strategy.

[0083] For example, when the destination address (DA) is a 128-bit address, the ingress node can perform full matching forwarding. At this time, different DAs can be matched to different strategies.

[0084] For example, when the DA is a combination of an IPv6 prefix and an intent number, the first 120 bits can be matched to perform forwarding by default (here, the allocation mode of the 128-bit address can be other allocation modes besides the 120-bit and 8-bit allocation modes, and the present application does not limit this), and the last 8 bits are used to identify the service intent number.

[0085] For example, intent number 01 indicates that the optimization target is LB, and the LB should be performed according to the capacity of each service node (service capacity value), and the forwarding path is selected according to the LB mechanism; intent number 02 indicates that the optimization target is the lowest total delay, and the forwarding path is selected according to the delay optimization; intent number 03 indicates that the optimization target is to comprehensively consider load balancing and energy efficiency information, at this time, the egress node needs to support 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 target is to comprehensively consider the delay and cost information, at this time, the egress node needs to support the cost information of each computing node, and the specific algorithm can be to select the lowest cost in the set that meets the delay. For example, the client can affect the selection of the routing node by indicating information, for example,

[0086] DA=ServiceID1::0000, the selected egress node is the node selected by performing the default strategy, that is, forwarding is performed according to the default forwarding strategy of the ingress node; at this time, the DA matches the default forwarding strategy of the ingress node.

[0087] DA=ServiceID1::0001, the selected egress node is the node selected by performing the LB strategy according to the capacity of each service node, that is, forwarding is performed based on the LB routing strategy; at this time, the DA matches the personalized routing strategy or the optimized routing strategy of the ingress node.

[0088] DA = ServiceID1 :: 0002, the selected egress node is the node selected by executing the optimal overall latency policy, i.e., forwarding is performed using a routing policy based on service overall latency; at this time, the DA matches the individualized routing policy or the optimized routing policy of the ingress node.

[0089] DA = ServiceID1 :: 0003, the selected egress node is the node selected by executing the policy considering load balancing and energy efficiency information comprehensively, i.e., forwarding is performed using a routing policy based on load balancing and energy efficiency information; at this time, the DA matches the individualized routing policy or the optimized routing policy of the ingress node.

[0090] DA = ServiceID1 :: 0004, the selected egress node is the node selected by executing the policy considering latency and cost information comprehensively, i.e., forwarding is performed using a routing policy based on service overall latency and cost information; at this time, the DA matches the individualized routing policy or the optimized routing policy of the ingress node.

[0091] For example, if the packet is IPv6, the indication information can be carried in the TLV of the SRv6 extension header, and is characterized by a number, for example: number 01 indicates that the optimization target is LB, and LB should be performed according to capacity; number 02 indicates that the optimization target is the lowest overall latency, and the forwarding path is selected according to latency optimization; number 03 indicates that the optimization target is the comprehensive consideration of load balancing and energy efficiency information, at this time, the egress node needs to support the energy efficiency information of the announcing service node, which will affect the weight of each path in LB; number 04 indicates that the optimization target is the comprehensive consideration of latency and cost information, at this time, the egress node needs to support the cost information of each computing node, and the specific algorithm can be to select the lowest cost in the set that meets the latency.

[0092] For example, if the destination address of the data packet and / or the corresponding indication information match 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,

[0093] If the destination address of the data packet and / or the corresponding indication information do not match any of the one or more additional routing policies, but only match the default routing policy, the default routing policy is used to forward the data packet; or,

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

[0095] Based on this, in an optional embodiment of the present application, the routing strategy includes one or more additional routing strategies; the data packet carries indication information, and the indication information is used to indicate a target routing strategy;

[0096] Forwarding the data packet by using the routing strategy, including:

[0097] Matching the destination address of the data packet and / or the indication information with the default routing strategy and the one or more additional routing strategies;

[0098] If the destination address of the data packet and / or the corresponding indication information match a first additional routing strategy in the one or more additional routing strategies, the first additional routing strategy is used to forward the data packet; or,

[0099] If the destination address of the data packet and / or the indication information do not match the target routing strategy and the one or more additional routing strategies, but only match the default routing strategy, the default routing strategy is used to forward the data packet.

[0100] In the embodiment of the present application, the ingress node can also monitor the network delay information (for example, the delay of the data packet reaching the egress node) to the egress node, and adjust the routing strategy according to the network delay information of the egress node. For example, if the delay of the egress node does not meet the delay requirement of the current service, the path corresponding to the egress node is removed from the routing strategy.

[0101] Based on this, in an optional embodiment of the present application, the method further includes:

[0102] Monitoring the network delay information of the at least one egress node;

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

[0104] Figure 4 The implementation flow of the data packet routing method provided by the embodiment of the present application Figure 2 As shown in Figure 4 The embodiment of the present application provides a data packet routing method, which is applied to an egress node, and the method includes the following steps:

[0105] Step 401: sending a notification to an ingress node; the notification includes one or more of the following information: the computing power and / or service information of the service node corresponding to the egress node, the energy efficiency information of the service node corresponding to the egress node, the cost information of the service node corresponding to the egress node processing the first service, and the security level information of the service node corresponding to the egress node.

[0106] Exemplarily, the computing power and / or service information of the service node corresponding to the egress 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; and latency information of the service node corresponding to the egress node for processing the first service.

[0107] Exemplarily, the service capability information of the service node corresponding to the egress node for processing the first service can be represented by a value of capability, for example, some service nodes can support 1000 sessions, and some service nodes can support 100 sessions; and the latency information of the service node corresponding to the egress node for processing the first service can be represented by an estimated time for the service node to complete the first service.

[0108] Exemplarily, the egress node can determine the information carried by the notification according to service requirements and optimization targets.

[0109] In an optional embodiment of the present application, the service nodes associated with the at least one egress node all deploy the same service, for example, the first service.

[0110] Step 402: receiving the data packet forwarded by the ingress node, and sending the data packet to the service node corresponding to the data packet.

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

[0112] In an optional embodiment of the present application, the method further includes: sending first information to the ingress node; and the first information represents that the service node corresponding to the egress node is currently in a busy state or is about to enter a busy state.

[0113] Here, the first information is used for the ingress node to adjust the routing strategy.

[0114] In an optional embodiment of the present application, the first information carries time limit information and / or time information, and the time limit information and / or time information is used to affect the routing strategy of the ingress node.

[0115] Here, the first information can also carry time-to-live 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 entry node adjusts the state of the service node in the routing strategy. For example, if the routing strategy is the first routing strategy or the second routing strategy, the forwarding path corresponding to the service node can be excluded from LB or the weight of the forwarding path corresponding to the service node can be changed to 0, representing that the forwarding path does not participate in forwarding, within a first time. The first time can be a preset value, or can be determined according to the time-to-live information or the time information carried in the first information. Alternatively, if the routing strategy is the third routing strategy or the fourth routing strategy, the forwarding path corresponding to the service node can be excluded from data forwarding within a first time. The first time can be a preset value, or can be determined according to the time-to-live information and / or the time information carried in the first information.

[0116] 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 entry node adjusts the state of the service node in the routing strategy. For example, if the routing strategy is the first routing strategy or the second routing strategy, the weight of the forwarding path corresponding to the service node can be reduced within a first time. For example, the weight can be adjusted to a first preset value. The first time can be a preset value, or can be determined according to the time-to-live information or the time information carried in the first information.

[0117] In the embodiments of the present application, the first information can also indicate that the service node corresponding to the egress node is in an idle state. In this case, the forwarding path corresponding to the service node generally does not need to be adjusted. However, if the decision point (such as the entry node) has previously received the first information indicating that the service node is in a busy state or is about to be in a busy state, and the information is still within the time-to-live validity period, the previously made strategy modification can be directly cancelled without waiting for the time-to-live to expire.

[0118] For example, the first information can include the number of users that can still access the service node, and the state of the service node is indicated by the number of users.

[0119] The data packet routing method provided in the embodiments of the present application integrates and perfects the related mechanisms of current computing power announcement and computing power decision, first provides an initial routing strategy at a decision node (Ingress), which can be generated by the Ingress according to the announcement reported by an exit node, for example, the weight of the corresponding forwarding path is set according to the capability (the maximum supported concurrent session number) of a service node, then LB is performed in combination with network delay information, for example, the path corresponding to the exit node whose delay exceeds a certain value does not participate in LB, and in the routing process, the routing strategy is adjusted according to the busy information of the service node itself and the timeliness information of the busy information, so that the routing strategy can adapt to the business in real time. For some services with strong dynamics, the exit node directly announces the related service state information to affect the default forwarding strategy, which on the one hand will not cause frequent announcements, and on the other hand will not cause decision errors due to expired information, which is a kind of compromise strategy. And support user indication routing strategy, forwarding according to user's demand, at this time, one or more personalized routing strategies or optimized routing strategies are generated at the entry node, and the client or user indicates the strategy through the data packet, and the related strategy is matched for forwarding.

[0120] The embodiments of the present application also provide a data packet routing device 500, referring to Figure 5 The data packet routing device 500 in the embodiments is applied to an entry node and includes:

[0121] The first routing unit 510 is configured to receive an announcement sent by at least one exit node, and the announcement includes 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 the service node corresponding to the exit node for processing the first business, and security level information of the service node corresponding to the exit node.

[0122] The first routing unit 510 is further configured to generate a routing strategy based on one or more of the information in the announcement, and the routing strategy includes a default routing strategy.

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

[0124] In the embodiments 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 for processing the first business; and delay information of the service node corresponding to the exit node for processing the first business.

[0125] In the embodiments of the present application, the first routing unit 510 is further configured to receive first information sent by one or more of the at least one egress node, wherein the first information indicates that the service node corresponding to the egress node is currently in a busy state or is about to enter the busy state; and adjust the routing strategy based on the first information.

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

[0127] In the embodiments of the present application, the first routing unit 510 is configured to: if the routing strategy is the first routing strategy or the second routing strategy, remove the path corresponding to the first egress node from the routing strategy; or adjust the weight of the path corresponding to the first egress node to a first preset value; wherein the first egress node is the egress node corresponding to the first information; or if the routing strategy is the third routing strategy or the fourth routing strategy, remove the path corresponding to the first egress node from the routing strategy; wherein the first egress node is the egress node corresponding to the first information.

[0128] In the embodiments of the present application, the first routing unit 510 is further configured to: after a first time, re-add the path corresponding to the first egress node to the routing strategy; wherein the first time is a preset value; or the first time is determined based on time limit information and / or time information carried in the first information.

[0129] In the embodiments of the present application, the first routing unit 510 is configured to use the default routing strategy to forward the data packet.

[0130] In the embodiment of the present application, the routing policy further comprises one or more additional routing policies; the data packet carries indication information, and the indication information is used to indicate a target routing policy; the first routing unit 510 is configured to match the destination address of the data packet and / or the indication information with the default routing policy and the one or more additional routing policies; if the destination address of the data packet and / or the corresponding indication information matches a 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 of the data packet and / or the indication information does not match the target routing policy and the one or more additional routing policies, and only matches the default routing policy, the default routing policy is used to forward the data packet.

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

[0132] Those skilled in the art should understand that, Figure 5 The implementation functions of each unit in the data packet routing device 500 shown can be understood with reference to the related description of the foregoing method. Figure 5 The functions of each unit in the data packet routing device 500 shown can be implemented by a program running on a processor, or by a specific logic circuit.

[0133] The embodiment of the present application also provides a data packet routing device 600, which is described in detail with reference to Figure 6 The data packet routing device 600 in the embodiment is applied to an egress node, and comprises:

[0134] The second routing unit 610 is configured to send a notification to an ingress node; the notification comprises 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, security level information of the service node corresponding to the egress node;

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

[0136] In the embodiment of the present application, the computing power and / or service information of the service node corresponding to the egress node comprises one or more of the following information: service capability information of the service node corresponding to the egress node for processing the first service; and delay information of the service node corresponding to the egress node for processing the first service.

[0137] In this embodiment of the application, the second routing unit 610 is further configured to send first information to the ingress 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.

[0138] In this embodiment of the application, the first information carries timeliness information and / or time information, which is used to influence the routing strategy of the ingress node.

[0139] Those skilled in the art should understand that Figure 6 The functions of each unit in the data packet routing device 600 shown can be understood by referring to the relevant description of the aforementioned method. Figure 6 The functions of each unit in the data packet routing device 600 shown can be implemented by a program running on a processor or by specific logic circuits.

[0140] Figure 7 This is a schematic structural diagram of a communication device 700 provided in an embodiment of this application. Figure 7 The communication device 700 shown includes a processor 710, which can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0141] Optionally, such as Figure 7 As shown, the communication device 700 may further include a memory 720. The processor 710 can retrieve and run computer programs from the memory 720 to implement the methods described in this embodiment.

[0142] The memory 720 can be a separate device independent of the processor 710, or it can be integrated into the processor 710.

[0143] Optionally, such as Figure 7 As shown, the communication device 700 may also include a transceiver 730, and the processor 710 may control the transceiver 730 to communicate with other devices. Specifically, it may send information or data to other devices or receive information or data sent by other devices.

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

[0145] The communication device 700 may specifically be the data packet routing device 500 / data packet routing device 600 in the embodiments of this 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 embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0146] Exemplarily, the embodiment of the present application further provides a computer program product comprising a computer program, which can be executed by the processor 710 of the communication device 700 to complete the steps of any of the foregoing methods.

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

[0148] Optionally, as shown in Figure 8 The chip 800 can further comprise a memory 820. The processor 810 can call and run a computer program from the memory 820 to implement the method in the embodiment of the present application.

[0149] The memory 820 can be a separate device independent of the processor 810, or can be integrated in the processor 810.

[0150] Optionally, the chip 800 can further comprise an input interface 830. The processor 810 can control the input interface 830 to communicate with other devices or chips, and specifically, can acquire information or data sent by other devices or chips.

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

[0152] The chip can be applied to the data packet routing device 500 / data packet routing device 600 in the embodiment 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 each method of the embodiment of the present application. For the sake of brevity, details are not repeated here.

[0153] It should be understood that the chip mentioned in the embodiment of the present application can also be referred to as a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0154] It should be understood that the processor of the embodiments of the present application can be an integrated circuit chip with a processing capability of signals. In the implementation process, each step of the method embodiments described above can be completed by the integrated logic circuit of hardware in the processor or the instructions in the form of software. The processor described above can be a general processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor or the like. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as a hardware coding processor for execution, or a combination of hardware and software modules in the coding processor for execution. The software module can be located in a random access memory, a flash memory, a read only memory, a programmable read only memory or an electrically erasable programmable memory, a register or other mature storage medium in the art. The storage medium is located in the storage, and the processor reads the information in the storage, and combines the hardware to complete the steps of the above method.

[0155] It is to be understood that the memory in the embodiments of the present application can be a volatile memory or a nonvolatile memory, or can include both volatile and nonvolatile memory. Among them, the nonvolatile memory can be a read-only memory (Read-Only Memory, ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electrically erasable programmable read-only memory (Electrically EPROM, EEPROM) or a flash memory. The volatile memory can be a random access memory (Random Access Memory, RAM) used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (Static RAM, SRAM), dynamic random access memory (Dynamic RAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (Synchlink DRAM, SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DR RAM). It should be noted that the memory of the system and method described herein is intended to include, but not limited to, these and any other suitable types of memory.

[0156] It should be understood that the above-mentioned memory is exemplary but not limiting, for example, the memory in the embodiments of the present application can also be static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synch link DRAM, SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DR RAM) and the like. That is, the memory in the embodiments of the present application is intended to include, but not limited to, these and any other suitable types of memory.

[0157] The embodiment of the present application further provides a computer readable storage medium for storing 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 embodiment of the present application, and the computer program causes a computer to execute the corresponding process realized by the data packet routing device 500 / data packet routing device 600 in each method of the embodiment of the present application. For brevity, details are not repeated here.

[0158] Those skilled in the art can clearly understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are realized in hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0159] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, and details are not repeated here.

[0160] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be realized by other ways. For example, the device embodiments described above are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0161] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, that is, they can be located in one place, or can be distributed on a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

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

[0163] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application or the parts of the present application that essentially contribute to the prior art or the parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing 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 methods described in the various embodiments of the present application. The aforementioned storage medium includes a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0164] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A data packet routing method, characterized by, The application is applied to an entry node, comprising: receiving an announcement sent by at least one exit node; the announcement comprises one or more of the following information: service node corresponding to the exit node's computing power and / or service information, service node corresponding to the exit node's energy efficiency information, service node corresponding to the exit node's cost information for processing the first service, and service node corresponding to the exit node's security level information; generating a routing strategy based on one or more of the information in the announcement; the routing strategy comprises a default routing strategy; receiving a data packet of the first service sent by a terminal or a user, and forwarding the data packet by using the routing strategy; receiving first information sent by one or more of the at least one exit node; the first information indicates that the service node corresponding to the exit node is currently in a busy state or will soon enter a busy state; adjusting the routing strategy based on the first information; the routing strategy comprises one or more of the following: a first routing strategy, which is a load balancing routing strategy based on service capability information; a second routing strategy, which is a load balancing routing strategy based on service capability information and energy efficiency information; a third routing strategy, which is a routing strategy based on service overall delay; and a fourth routing strategy, which is a routing strategy based on service overall delay and cost information; wherein the service overall delay comprises a delay of the service node processing the first service and a network delay of the exit node.

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

3. The method of claim 1, wherein, The adjusting of the routing strategy based on the first information comprises: if the routing strategy is the first routing strategy or the second routing strategy, removing a path corresponding to a first exit node from the routing strategy; or adjusting a 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 strategy is the third routing strategy or the fourth routing strategy, removing the path corresponding to the first exit node from the routing strategy; wherein the first exit node is the exit node corresponding to the first information.

4. The method of claim 3, wherein, Further comprising: after a first time, re-adding the path corresponding to the first exit node to the routing strategy; wherein the first time is a preset value; or, the first time is determined based on time limit information and / or time information carried by the first information.

5. The method according to any one of claims 1 to 4, characterized in that ； The forwarding of the data packet by using the routing strategy comprises: forwarding the data packet by using the default routing strategy.

6. The method according to any one of claims 1 to 4, characterized in that, The routing strategy further comprises one or more additional routing strategies; the data packet carries indication information, which is used to indicate a target routing strategy; The forwarding of the data packet by using the routing strategy comprises: matching the destination address and / or the indication information of the data packet with the default routing strategy and the one or more additional routing strategies; if the destination address and / or the corresponding indication information of the data packet matches the first additional routing strategy in the one or more additional routing strategies, the first additional routing strategy is used to forward the data packet; or, if the destination address and / or the indication information of the data packet matches neither the target routing strategy nor the one or more additional routing strategies, but only matches the default routing strategy, the default routing strategy is used to forward the data packet.

7. The method according to any one of claims 1 to 4, characterized in that, Further comprising: monitoring network delay information of the at least one exit node; eliminating the path corresponding to the second exit node from the routing strategy; the second exit node is an exit node whose network delay information exceeds a second preset value.

8. A data packet routing method, characterized by, Applied to an exit node, comprising: sending a notification to an entry node; the notification includes one or more of the following information: the computing power and / or service information of the service node corresponding to the exit node, the energy efficiency information of the service node corresponding to the exit node, the cost information of the service node corresponding to the exit node processing the first business, and the security level information of the service node corresponding to the exit node; the notification is used for the entry node to generate a routing strategy; the routing strategy includes a default routing strategy; receiving a data packet forwarded by the entry node using the routing strategy, and sending the data packet to its corresponding service node; sending first information to the entry node; the first information indicates that the service node corresponding to the exit node is currently in a busy state or will soon enter a busy state; the first information is used for the entry node to adjust the routing strategy; the type of the routing strategy includes one or more of the following: a first routing strategy, which is a routing strategy based on service capability information for load balancing; a second routing strategy, which is a routing strategy based on service capability information and energy efficiency information for load balancing; a third routing strategy, which is a routing strategy based on service overall delay; and a fourth routing strategy, which is a routing strategy based on service overall delay and cost information; wherein the service overall delay includes the delay of the service node processing the first business and the network delay of the exit node.

9. The method of claim 8, 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 exit node processing the first business; delay information of the service node corresponding to the exit node processing the first business.

10. The method of claim 9, wherein, The first information carries time limit information and / or time information, which is used to affect the routing strategy of the entry node.

11. A data packet routing device, characterized by Applied to an entry node, comprising: The first routing unit is configured to receive a notification sent by at least one exit node, and the notification comprises one or more of the following information: service node corresponding to the exit node, the service information and / or the computing power, the energy efficiency information of the service node corresponding to the exit node, the cost information of the service node corresponding to the exit node for processing the first service, and the security level information of the service node corresponding to the exit node. The first routing unit is further configured to generate a routing strategy based on one or more of the information in the notification, and the routing strategy comprises 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 by using the routing strategy. The first routing unit is further configured to receive first information sent by one or more of the at least one exit node, and the first information indicates that the service node corresponding to the exit node is currently in a busy state or will enter the busy state. The first routing unit is further configured to adjust the routing strategy based on the first information, and the routing strategy comprises one or more of the following: a first routing strategy, which is a routing strategy for load balancing based on service capability information; a second routing strategy, which is a routing strategy for load balancing based on service capability information and energy efficiency information; a third routing strategy, which is a routing strategy based on service overall latency; and a fourth routing strategy, which is a routing strategy based on service overall latency and cost information, wherein the service overall latency comprises a latency of the service node for processing the first service and a network latency of the exit node.

12. A data packet routing apparatus, characterized by, The application is applied to an exit node, and comprises: a second routing unit configured to send a notification to an entry node, and the notification comprises one or more of the following information: service node corresponding to the exit node, the service information and / or the computing power, the energy efficiency information of the service node corresponding to the exit node, the cost information of the service node corresponding to the exit node for processing the first service, and the security level information of the service node corresponding to the exit node; the notification is used for the entry node to generate a routing strategy, and the routing strategy comprises a default routing strategy; The second routing unit is further configured to receive a data packet forwarded by the entry node by using the routing strategy, and send the data packet to the corresponding service node. The second routing unit is further configured to send first information to the entry node, and the first information indicates that the service node corresponding to the exit node is currently in a busy state or will enter the busy state; the first information is used for the entry node to adjust the routing strategy, and the routing strategy comprises one or more of the following: a first routing strategy, which is a routing strategy for load balancing based on service capability information; a second routing strategy, which is a routing strategy for load balancing based on service capability information and energy efficiency information; a third routing strategy, which is a routing strategy based on service overall latency; and a fourth routing strategy, which is a routing strategy based on service overall latency and cost information, wherein the service overall latency comprises a latency of the service node for processing the first service and a network latency of the exit node. A fourth routing strategy, which is a routing strategy based on service overall latency and cost information; wherein the service overall latency comprises: a latency of a service node processing the first service, and a network latency of an egress node.

13. A communication device, characterized by Comprising: A processor and a memory for storing a computer program, the processor being configured to invoke and run the computer program stored in the memory to perform the data packet routing method according to any one of claims 1-7, or the data packet routing method according to any one of claims 8-10.

14. A chip, characterized by Comprising: A processor configured to invoke and run a computer program from a memory, so that a device installed with the chip performs the data packet routing method according to any one of claims 1-7, or the data packet routing method according to any one of claims 8-10.

15. A computer-readable storage medium, characterized in that, A computer program for storing, the computer program causing a computer to perform the data packet routing method according to any one of claims 1-7, or the data packet routing method according to any one of claims 8-10.

16. A computer program product comprising a computer program, characterized in that, The computer program, when executed by a processor, implements the data packet routing method according to any one of claims 1-7, or the data packet routing method according to any one of claims 8-10.

Images