CN115695284A

CN115695284A - Return flow drainage method, device, equipment and storage medium in computational power network

Info

Publication number: CN115695284A
Application number: CN202211339128.1A
Authority: CN
Inventors: 贺继国
Original assignee: Beijing Star Net Ruijie Networks Co Ltd
Current assignee: Beijing Star Net Ruijie Networks Co Ltd
Priority date: 2022-10-28
Filing date: 2022-10-28
Publication date: 2023-02-03

Abstract

The application discloses a backhaul flow diversion method, a backhaul flow diversion device, equipment and a storage medium in a computational power network, which solve the problem that a common diversion method in the computational power network cannot complete backhaul flow diversion of a plurality of services of the same terminal, wherein the backhaul flow diversion method in the computational power network is applied to an exit router connected with an edge computing node in the computational power network, and the exit router is provided with at least two SRv Policy tunnels, and the method comprises the following steps: receiving a return data message aiming at a target service and sent by an edge computing node; replacing the source IP address in the return data message from the identifier of the edge computing node to the identifier of the target service; determining the identification of a target SRv6Policy tunnel based on the identification of the target service; and transmitting the backhaul data message through the SRv Policy tunnel corresponding to the target SRv6Policy tunnel identifier.

Description

Return flow drainage method, device, equipment and storage medium in computational power network

Technical Field

The present application relates to the field of communications technologies, and in particular, to a backhaul traffic diversion method, apparatus, device, and storage medium in a computational power network.

Background

The computational Force Network (CFN-dynamic Network) is a novel Network architecture with the integration of computational Force and Network depth, which is a novel information infrastructure for allocating and flexibly scheduling Computing resources, storage resources and Network resources as required among a cloud Computing side, an Edge Computing side and a terminal side according to service requirements, and is a distributed technology for scheduling the service requirements of users to optimal MEC nodes based on the computational load and Network state of a plurality of Edge Computing nodes (MECs).

The purpose of the computational power network is to realize that data traffic selects an optimal path and an optimal computational power node in a forward process and an optimal path in a return process, and a current drainage scheme generally includes the following three types:

the first mode is Binding SID (Binding Segment ID) drainage: creating SRv (Segmet Routing IPv6, IPv 6-based Segment Routing) Policy tunnels, binding SIDs of SRv Policy tunnels, and Segment lists corresponding to the Binding SIDs on an IR (Ingress Router), where an upstream node includes the Binding SIDs in a service data traffic message sent to the IR, and when the IR processes the service data message, introducing traffic corresponding to the service data message into SRv Policy tunnels corresponding to the Binding SIDs, so as to complete traffic data drainage.

Mode two, color drainage: SRv6Policy uses a triple as a Key, where the triple is a header node, a Color, and an Endpoint node, the Key can uniquely identify a SRv Policy, the Color is used to identify the ID of SRv Policy, the Color can be carried as an extended community attribute of a BGP (Border Gateway Protocol) route, and is associated with a service route on an ER (Egress Router), and the associated information is transmitted from the ER to the IR through the BGP route, so that, after the service data packet arrives at the IR, the service data packet enters SRv Policy tunnel corresponding to the Color through route iteration to complete service data drainage.

Mode three, DSCP (Differentiated Services Code Point) drainage: the method comprises the steps of conducting drainage through a DSCP value packaged in an IP (Internet Protocol) message header, appointing a mapping relation between SRv Policy and the DSCP value, and introducing traffic corresponding to a service data message into a SRv Policy tunnel corresponding to the DSCP value to complete the drainage of service data.

However, the above-mentioned traffic steering schemes only implement the traffic steering for outbound traffic, but do not implement the traffic steering for backhaul traffic of a plurality of services having the same destination IP address (i.e., the IP address of the UE).

To solve the above technical problem, taking Color drainage as an example for explanation, as shown in fig. 1, a terminal UE _ a accesses a computational power network through an access network, and an IP address of the UE _ a is: IPA (IP _ a), UE _ a has two services: service 1 and service 2 are both served by edge computing node MEC2, and during the outbound, the data packet of service 1 is transmitted to MEC2 through a normal path, and the data packet of service 2 is transmitted to MEC2 through a low-latency path, assuming that the normal path is: UE _ A → IR1 → … → ER2 → MEC2, the low latency path is: UE _ A → IR1 → ER2 → MEC2, wherein, in the common path, the routing device of other transit is also included between IR1 and ER2, the identification of Service 1 is SID (Service ID) 1, the identification of Service 2 is SID2, in the edge computing node MEC2, BID21 represents the identification of MEC2 corresponding to Service 1, and BID22 identifies the identification of MEC2 corresponding to Service 2. In scenario 1, when UE _ a currently has only one service (e.g., service 1), only one backhaul route is needed, ER2 creates SRv6Policy tunnel, assuming that the Color value corresponding to the normal path of service 1 is 10, during outbound, the outbound data packet of service 1 carries Color value 10, and after being directed to ER2 through IR1, ER2 directs the traffic corresponding to the outbound data packet of service 1 to SRv Policy1 tunnel corresponding to Color value 10 to complete outbound traffic steering, during backhaul, the source IP address included in the backhaul data packet of service 1 is the identifier of MEC 2: BID21, destination IP address: IPA, ER2 will be business 1 return stroke data message flow to SRv6Policy 1 tunnel, finish the flow guide of the return stroke flow. However, in scenario 2, when UE _ a currently has two services: during service 1 and service 2, two backhaul routes are required, assuming that the Color value corresponding to the low latency path corresponding to service 2 is 20, and during backhaul, the source IP address contained in the backhaul data packet of service 1 is the identifier of MEC 2: BID21, destination IP address is: IPA, the source IP address contained in the backhaul data packet of service 2 is the identifier of MEC 2: BID22, the destination IP address is: IPA, where the backhaul data packet of the service 1 and the backhaul data packet of the service 2 contain the same destination IP address IPA, the same destination IP address corresponds to two different services, and in the data plane (i.e., the forwarding plane), the ER2 cannot perform different routing iterative selections according to the same destination IP, and in the control plane, the IR1 cannot mark a route with the same destination address IPA as two colors, i.e., color10 and Color20, so that the flow of backhaul traffic cannot be completed. The same problems exist with Binding SID drainage and DSCP drainage.

Disclosure of Invention

In order to solve the problem that a common flow guiding method in a decision-force network cannot complete the return flow guiding of multiple services of the same terminal, embodiments of the present application provide a return flow guiding method, an apparatus, a device, and a storage medium in the decision-force network.

In a first aspect, an embodiment of the present application provides a backhaul traffic steering method in a computational power network, which is applied to an egress router connected to an edge computing node in the computational power network, where the egress router is configured with at least two segment routing policies SRv6Policy tunnels based on IPv6, and the method includes:

receiving a backhaul data message aiming at a target service, which is sent by the edge computing node;

replacing the source IP address in the backhaul data message with the identifier of the target service from the identifier of the edge computing node;

determining a target SRv Policy tunnel identifier based on the identifier of the target service;

and transmitting the backhaul data message through a SRv Policy tunnel corresponding to the target SRv6Policy tunnel identifier.

In a possible embodiment, the determining the target SRv6Policy tunnel identifier based on the identifier of the target service includes:

determining header node information of the target SRv Policy tunnel based on the identification information of the egress router;

determining destination node information of the target SRv Policy tunnel based on a destination IP address in the backhaul data message;

determining a Color value of the target SRv Policy tunnel based on the identification of the target service;

and determining the target SRv6Policy tunnel identification according to the head node information, the destination node information and the determined Color value.

In one possible embodiment, the determining the Color value of the target SRv Policy tunnel based on the identifier of the target service includes:

determining a target Color value corresponding to the identifier of the target service according to the corresponding relation between the identifier of the preset service and the preset Color value;

determining the target Color value as the Color value of the target SRv Policy tunnel.

determining a target DSCP value corresponding to the target service identifier based on the corresponding relation between the preset service identifier and the DSCP value of the differentiated service code point;

determining a target Color value corresponding to the target DSCP value based on the corresponding relation between the preset DSCP value and the Color value;

and determining the target Color value as the Color value of the target SRv Policy tunnel.

In one possible embodiment, said at least two SRv Policy tunnels are created by said egress router; alternatively, the first and second electrodes may be,

the at least two SRv6Policy tunnels are created by the controller and then sent to the egress router.

In a second aspect, an embodiment of the present application provides a backhaul traffic diversion apparatus in a computational power network, which is applied to an egress router connected to an edge computing node in the computational power network, where the egress router is configured with at least two IPv 6-based segment routing policies SRv Policy tunnels, and the apparatus includes:

a receiving unit, configured to receive a backhaul data packet for a target service, where the backhaul data packet is sent by the edge computing node;

a replacing unit, configured to replace a source IP address in the backhaul data packet with an identifier of the target service from an identifier of the edge computing node;

a determining unit, configured to determine a target SRv6Policy tunnel identifier based on the identifier of the target service;

and the flow guide unit is used for transmitting the backhaul data message through a SRv Policy tunnel corresponding to the target SRv6Policy tunnel identifier.

In a possible implementation manner, the determining unit is configured to determine header node information of the target SRv6Policy tunnel based on the identification information of the egress router; determining destination node information of the target SRv Policy tunnel based on a destination IP address in the backhaul data message; determining a Color value of the target SRv Policy tunnel based on the identification of the target service; and determining the target SRv6Policy tunnel identification according to the head node information, the destination node information and the determined Color value.

In a possible implementation manner, the determining unit is configured to determine, according to a correspondence between an identifier of a preset service and a preset Color value, a target Color value corresponding to the identifier of the target service; determining the target Color value as the Color value of the target SRv Policy tunnel.

In a possible implementation manner, the determining unit is configured to determine, based on a correspondence between an identifier of a preset service and a differentiated services code point DSCP value, a target DSCP value corresponding to the identifier of the target service; determining a target Color value corresponding to the target DSCP value based on the corresponding relation between the preset DSCP value and the Color value; determining the target Color value as the Color value of the target SRv Policy tunnel.

In a third aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the backhaul traffic steering method in a computational power network according to the present application.

In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps in the backhaul traffic diversion method in a computational power network described in the present application.

The beneficial effect of this application is as follows:

the method, the device, the equipment and the storage medium for guiding the backhaul traffic in the computational power network are applied to an exit router connected with an edge computing node in the computational power network, the exit router is configured with at least two SRv Policy tunnels, the exit router receives a backhaul data message for a target service sent by the edge computing node, a source IP address in the backhaul data message of the target service is replaced by an identifier of the target service from the identifier of the edge computing node to obtain an updated backhaul data message, the identifier of the target SRv6Policy tunnel is determined based on the identifier of the target service, and the backhaul data message is transmitted through a SRv Policy tunnel corresponding to the SRv6Policy tunnel identifier corresponding to the target SRv6Policy tunnel identifier. Therefore, when the destination IP addresses of the backhaul data packets of a plurality of different services are the same (that is, the backhaul data packets of different services return to the same terminal), in the present application, for each service, the source IP address of the backhaul data packet may be replaced by the identifier of the edge computing node, and then the corresponding SRv Policy is selected according to the respective service identifier for performing the flow guiding, so that the respective flow guiding for the backhaul flows of different services is realized, and the backhaul flows of different services are guided to different paths.

Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

FIG. 1 is a schematic view of an application scenario of Color drainage in an computational power network;

fig. 2 is a schematic view of an application scenario of a backhaul traffic diversion method in a computational power network according to an embodiment of the present application;

fig. 3 is a schematic implementation flow diagram of a backhaul traffic diversion method in a computational power network according to an embodiment of the present application;

fig. 4 is a schematic flow chart illustrating an implementation of determining a target SRv Policy tunnel identifier according to an embodiment of the present application;

FIG. 5 is a schematic diagram of an implementation flow for determining a Color value of a target SRv Policy tunnel according to an embodiment of the present disclosure;

FIG. 6 is a schematic diagram of another implementation flow for determining a Color value of a target SRv Policy tunnel according to the embodiment of the present application;

fig. 7 is a schematic structural diagram of a backhaul flow diversion device in a computational power network according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

The embodiments of the present application are described below with reference to the drawings of the specification, and it is to be understood that the embodiments described herein are merely for illustrating and explaining the present application and are not intended to limit the present application, and that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.

In this context, it is to be understood that, in the technical terms referred to in the present application:

1. segment Routing (SR): the Segment routing technique is to implement the programmability of the network by encapsulating an ordered Segment list at the source node, instructing the network to execute the corresponding instructions on the designated nodes.

2. SRv6 Policy: by encapsulating a series of SRv Segment IDs (SRv SID) in an SRH (Segment Routing Header), a service data packet can be explicitly guided to be forwarded according to a planned path, thereby implementing fine-grained control of an end-to-end forwarding path, and meeting requirements of high reliability, large bandwidth, low delay and the like of a service. SRv6Policy uses the following triplets as keys: headend, color, and endPoint, key can uniquely identify one SRv Policy. The head end identifies SRv Policy head nodes, and can lead data traffic into a SRv Policy tunnel; the Color ID used for identifying SRv6Policy may be associated with a series of service attributes, such as low latency, high bandwidth and other attributes, which may be understood as a service requirement template ID, and the Color value may be configured by a user according to requirements, for example, a Color may be assigned as 100 when the end-to-end latency is less than 10 milliseconds; endPoint is used to identify the destination address of SRv Policy. When SRv6Policy issues to the head node Headend, since all the Headend fields of SRv Policy are the nodes, one SRv Policy can be uniquely identified by passing on the head node Headend, and therefore traffic is guided to SRv Policy tunnel by passing on the head node Headend. SRv6Policy is designed for services, color describes that the requirements of services on the network, such as delay, bandwidth, reliability, etc., are met, and the design of SRv Policy makes SRv6Policy capable of interacting directly with services.

Fig. 2 is a schematic view of an application scenario of the backhaul traffic diversion method in the computational power network according to the embodiment of the present application, where the scenario is scenario 2 in fig. 1, and the example that the terminal UE _ a has two services is still used as an example for description. As shown in fig. 2, a terminal UE _ a accesses the computational power network through the access network, and the IP address of UE _ a is: IPA, UE _ a has two services: service 1 and service 2 are both served by edge computing node MEC2, and during the outbound, the data packet of service 1 is transmitted to MEC2 through a normal path, and the data packet of service 2 is transmitted to MEC2 through a low-latency path, assuming that the normal path is: UE _ A → IR1 → … → ER2 → MEC2, the low latency path is: UE _ A → IR1 → ER2 → MEC2, wherein, in the common path, the ingress router IR1 and the egress router ER2 further include other transit routing devices, the Service 1 identifier is SID1 (Service ID 1), the Service 2 identifier is SID2 (Service ID 2), in the edge computing node MEC2, BID21 (Binding ID 21) represents the Service 1 corresponding MEC2 identifier, and BID22 (Binding ID 22) represents the Service 2 corresponding MEC identifier. The backhaul data packets of the service 1 and the backhaul data packets of the service 2 are both returned from the edge computing node MEC2 to the egress router ER2 connected thereto.

Based on the above application scenarios, exemplary embodiments of the present application will be described in more detail below with reference to fig. 3 to 6, it should be noted that the above application scenarios are only shown for the convenience of understanding the spirit and principles of the present application, and the embodiments of the present application are not limited in any way herein. Rather, embodiments of the present application may be applied to any scenario where applicable.

As shown in fig. 3, which is a schematic implementation flow diagram of a backhaul traffic diversion method in a computational power network provided in an embodiment of the present application, the backhaul traffic diversion method in the computational power network may be applied to an egress router connected to an edge computing node in the computational power network, and specifically may include the following steps:

s11, the exit router receives a backhaul data message aiming at the target service and sent by the edge computing node.

In specific implementation, the edge computing node is a node connected to the egress router and providing a service for a target service.

In the application scenario shown in fig. 2, the backhaul data packet of service 1 and the backhaul data packet of service 2 both return from the edge computing node MEC2 to the egress router ER2 connected thereto, and a source IP address (SA) included in the backhaul data packet of service 1 is an identifier of MEC 2: BID21, destination IP address (DA) is: IPA, the source IP address (SA) contained in the backhaul data packet of service 2 is the identifier of MEC 2: BID22, destination IP address (DA) is: the IPA, both having the same destination IP address, needs to direct the backhaul data traffic of service 1 and the backhaul data traffic of service 2 to different SRv6Policy tunnels for transmission to return to the terminal UE _ a.

And S12, replacing the source IP address in the backhaul data message with the identifier of the target service from the identifier of the edge computing node.

Continuing with the above example, in fig. 2, after receiving the backhaul data packet of the service 1 and the backhaul data packet of the service 2 sent by the edge computing node MEC2, the egress router ER2 replaces the source IP address in the backhaul data packet of the service 1 from the BID21 to the identifier SID1 of the service 1, replaces the source IP address in the backhaul data packet of the service 2 from the BID22 to the identifier SID2 of the service 2, and if the destination IP address is unchanged, the source IP address is the IP address of the terminal UE _ a: IPA is added.

S13, determining the identification of the target SRv6Policy tunnel based on the identification of the target service.

The service identifier and the Color value of the SRv6Policy tunnel have a corresponding relation.

In a specific implementation, the egress router is configured with at least two SRv Policy tunnels, the egress router may establish multiple SRv Policy tunnels between an ingress router IR and an egress router ER, each SRv Policy tunnel is identified by a respective triplet (i.e., a header, an destination Endpoint, and a Color value), the header of the SRv Policy tunnels is the same, the destination node is the same, the Color value is different, and a user may set a Color value in advance according to a service attribute.

As a possible implementation manner, the at least two SRv6Policy tunnels may also be created by the controller and then issued to the egress router, which is not limited in this embodiment of the present application.

Specifically, the method for determining the target SRv6Policy tunnel identifier according to the process shown in fig. 4 includes the following steps:

s21, determining the head node information of the target SRv6Policy tunnel based on the identification information of the exit router.

In this step, the egress router is the head node of the target SRv6Policy tunnel, and the identifier of the egress router is marked as the head node information of the target SRv Policy tunnel.

S22, determining destination node information of the target SRv6Policy tunnel based on the destination IP address in the backhaul data message.

In this step, the egress router may determine destination node information of the target SRv6Policy tunnel based on a sending node of a VPN SID (Virtual Private Network Segment ID) corresponding to a destination IP address in the backhaul data packet.

In specific implementation, when a terminal accesses a computational power network to send a service data message through an entrance router IR, the entrance router IR allocates a VPN SID and generates a corresponding relationship between the VPN SID and an IP address of the terminal, the entrance router IR sends the VPN SID and the corresponding relationship between the VPN SID and the IP address of the terminal to an exit router ER, when the exit router ER receives a backhaul data message of the service, the VPN SID is matched with the corresponding VPN SID according to a destination IP address (namely the IP address of the terminal) in the backhaul data message, the sending node of the VPN SID is a destination node of a target SRv Policy tunnel, and the identification of the sending node of the VPN SID is marked as destination node information of the target SRv Policy tunnel.

S23, determining the Color value of the target SRv6Policy tunnel based on the identification of the target service.

In an embodiment, the egress router may preset and store a correspondence between the identifier of the service and a Color value, and in this embodiment, the Color value of the target SRv Policy tunnel may be determined according to the process shown in fig. 5, including the following steps:

s31, the exit router determines a target Color value corresponding to the identifier of the target service according to the corresponding relation between the identifier of the preset service and the preset Color value.

In specific implementation, the egress router may pre-configure and store a corresponding relationship between the identifier of the service and a preset Color value according to a requirement (such as service attributes of low latency, high bandwidth, and the like) of the service expected by the user on the network, for example, assuming that the service a is a normal service, the Color value corresponding to the service a may be set to Color1, the service B requires low latency, the Color value corresponding to the service B may be set to Color2, the service C requires high bandwidth, and the Color value corresponding to the service C may be set to Color3, where specific values of Color1, color2, and Color3 may be set by the user, for example, C Color1 is 10, color2 is 20, and Color3 is 30, which is not limited in this embodiment of the present application.

During implementation, the egress router may search for a target Color value corresponding to the identifier of the target service in the correspondence between the identifier of the preset service and the preset Color value.

S32, determining the target Color value as the Color value of the target SRv Policy tunnel.

In this step, the exit router takes the target Color value corresponding to the identifier of the target service as the Color value of the target SRv6Policy tunnel, so that the source IP address of the backhaul data packet (i.e. the replaced source IP address: the identifier of the target service) can be associated with the Color attribute of the SRv Policy tunnel, and further, the traffic corresponding to the service data packet can be introduced into the corresponding SRv Policy tunnel.

In another embodiment, the egress router may further preset and store a correspondence between the service identifier and the DSCP value, and set and store a correspondence between the DCSP value and the Color value.

In such an embodiment, the Color value of the target SRv Policy tunnel may be determined according to the procedure shown in fig. 6, including the following steps:

s41, determining a target DSCP value corresponding to the identifier of the target service based on the corresponding relation between the identifier of the preset service and the DSCP value.

In specific implementation, the egress router may search for a target DSCP corresponding to the target service identifier from the correspondence between the preset service identifier and the DSCP value.

And S42, determining a target Color value corresponding to the target DSCP value based on the corresponding relation between the preset DSCP value and the Color value.

In this step, after the egress router determines the target DSCP value corresponding to the target service identifier, the egress router may search for the target Color value corresponding to the target DSCP value from the preset corresponding relationship between the DSCP value and the Color value.

S43, determining the target Color value as the Color value of the target SRv Policy tunnel.

In this step, the exit router takes the target Color value corresponding to the identifier of the target service as the Color value of the target SRv Policy tunnel. Thus, the source IP address of the backhaul data packet, that is: after the identification of the target service is associated with the DSCP value, the DSCP value is associated with the Color attribute of the SRv6Policy tunnel, and further, the flow corresponding to the service data message can be introduced into the corresponding SRv Policy tunnel.

S24, determining the identification of the target SRv6Policy tunnel based on the head node information, the destination node information and the Color value of the target SRv6Policy tunnel.

In specific implementation, the head node, the destination node and the Color value can uniquely identify a SRv6Policy tunnel identifier, the corresponding relation of the head node identifier, the destination node identifier, the Color value and the SRv Policy tunnel identifier is stored in advance, and in implementation, the head node identifier, the destination node identifier and the SRv Policy tunnel identifier corresponding to the Color value of the target SRv Policy tunnel are searched from the corresponding relation of the stored head node identifier, destination node identifier, color value and SRv6Policy tunnel identifier, namely the target SRv6Policy tunnel identifier.

Assume in FIG. 2 that egress router ER2 creates N SRv Policy tunnels between ingress router IR1 and egress router ER 2: SRv6 policies 1-SRv Policy N, and the head nodes of configuration SRv6 policies 1-SRv 6Policy N for egress router ER2 are: ER2, configuring SRv6Policy 1-SRv Policy N, wherein the destination nodes are all as follows: IR1, configuring the Color value of 10 corresponding to the common service path, and SRv6Policy tunnel corresponding to the Color value of 10: SRv6Policy 1, configuring a Color value of 20 corresponding to the low latency service path, and a SRv6Policy tunnel corresponding to the Color value of 20: SRv6Policy 2, the egress router ER2 pre-configures and stores the correspondence between the service identifier and the Color value according to the requirement of the service desired by the user on the network, and assumes that the Color value corresponding to the identifier SID1 of the service 1 is 10 and the Color value corresponding to the identifier SID2 of the service 2 is 20. The egress router ER2 may further preset and store a correspondence between the service identifier and the DSCP value, and set and store a correspondence between the DCSP value and the Color value, where if the DSCP value corresponding to the service identifier 1 is DSCP1, and the Color value corresponding to the DSCP1 is 10, the Color value corresponding to the service identifier 1 determined by the egress router ER2 is 10, and if the DSCP value corresponding to the service identifier 2 is DSCP2, and the Color value corresponding to the DSCP2 is 20, the Color value corresponding to the service identifier 2 determined by the egress router ER2 is 20. Because the destination IP addresses in the backhaul data packet of the service 1 and the backhaul data packet of the service 2 are the IP addresses of the same terminal UE _ a: IPA, when terminal UE _ A accesses the computational effort network to send the data message of business 1 and business 2, its entrance router connected is IR1, the VPN SID that IR1 distributes for terminal UE _ A is VPN SID1, and establish the corresponding relation with IPA VPN SID1, IPR1 sends the corresponding relation of VPN SID1, VPN SID1 and IPA to export router ER2, then, when export router ER2 receives the return data message of business 1 and return data message of business 2, can match the VPN SID that the IPA corresponds to according to the destination IP address IPA in the return data message as: and the VPN SID1, therefore, it can be determined that the node IR1 sending the VPN SID1 is a destination node of the target SRv Policy tunnel, and since the egress router ER2 is a head node of SRv Policy tunnel and the ingress router IR1 is a destination node of SRv Policy tunnel, the egress router ER2 can determine, according to the correspondence relationship between the pre-stored head node, destination node, color value and SRv Policy tunnel identifier, that the target SRv Policy tunnel identifier corresponding to the head node ER2, the destination node IR1 and the Color value 10 (Color value corresponding to service 1) is: SRv6Policy 1, i.e., the destination SRv Policy tunnel for service 1 is identified as SRv6Policy 1, egress router ER2 may determine the identification of the destination SRv Policy tunnel for header node ER2, destination node IR1, and Color value 20 (Color value for service 2) as: SRv6Policy 2, i.e. the target SRv6Policy tunnel corresponding to traffic 2 is identified as SRv6Policy 2.

And S14, carrying out backhaul data message transmission through the SRv Policy tunnel corresponding to the target SRv6Policy tunnel identifier.

In specific implementation, after modifying a source IP address (BID) in a backhaul data packet into a Service Identifier (SID), an egress router encapsulates an IPv6 (outer layer) Header, a Segment Routing Header (SRH), and a service Header in the backhaul data packet, where the Segment Routing Header includes a target SRv6Policy tunnel identifier and a VPN SID, the service Header includes a source IP address (i.e., a target service identifier: SID) and a target IP address after replacement, and the egress router introduces traffic corresponding to the backhaul data packet into a SRv Policy tunnel corresponding to the target Rv6Policy tunnel identifier for transmission through Routing iteration. In the embodiment of the application, the route selection is performed based on the source IP address, that is, the identifier of the service, and the backhaul traffic of different services is introduced into different SRv6Policy tunnels for transmission.

As shown in fig. 2, the egress router ER2 introduces the traffic of the backhaul data packet of the service 1 into SRv6Policy 1 for transmission, and introduces the data traffic of the backhaul data packet of the service 2 into SRv6Policy 2 for transmission, thereby implementing that the backhaul traffic of the service 1 and the backhaul traffic of the service 2 are directed to different paths.

In the backhaul traffic diversion method in the computational power network provided by the embodiment of the application, an exit router in the computational power network is configured with at least two SRv Policy tunnels, the exit router receives a backhaul data packet for a target service, the backhaul data packet is sent by an edge computing node, a source IP address in the backhaul data packet for the target service is replaced from an identifier of the edge computing node to an identifier of the target service, an identifier of a target SRv Policy tunnel is determined based on the identifier of the target service, and the backhaul data packet for the target service is transmitted through a SRv Policy tunnel corresponding to the SRv6Policy tunnel identifier corresponding to the identifier of the target SRv6Policy tunnel. Therefore, when the destination IP addresses of the backhaul data packets of multiple different services are the same (that is, the backhaul data packets of different services return to the same terminal), the present application may replace the identifier of the edge computing node as the identifier of the service for each service, and then select corresponding SRv Policy for drainage according to the respective service identifier (that is, the modified source IP address) respectively, so as to implement drainage for backhaul flows of different services, and drain backhaul flows of different services to different paths.

Based on the same inventive concept, the embodiment of the present application further provides a backhaul flow diversion device in the computational power network, and as the principle of solving the problem of the backhaul flow diversion device in the computational power network is similar to the backhaul flow diversion method in the computational power network, the implementation of the device can refer to the implementation of the method, and repeated details are not repeated.

As shown in fig. 7, which is a schematic structural diagram of a backhaul traffic diversion apparatus in an computational power network provided in an embodiment of the present application, where the backhaul traffic diversion apparatus in the computational power network is applied to an egress router connected to an edge computing node in the computational power network, and the egress router is configured with at least two IPv 6-based segment routing policies SRv Policy tunnels, the apparatus includes:

a receiving unit 51, configured to receive a backhaul data packet for a target service sent by the edge computing node;

a replacing unit 52, configured to replace the source IP address in the backhaul data packet with the identifier of the target service from the identifier of the edge computing node;

a determining unit 53, configured to determine a target SRv6Policy tunnel identifier based on the identifier of the target service;

and the flow guiding unit 54 is configured to perform the backhaul data packet transmission through the SRv Policy tunnel corresponding to the target SRv6Policy tunnel identifier. A receiving unit, configured to receive a backhaul data packet for a target service, where the backhaul data packet is sent by the edge computing node;

in a possible implementation, the determining unit 53 is configured to determine, based on the identification information of the egress router, head node information of the target SRv Policy tunnel; determining destination node information of the target SRv Policy tunnel based on a destination IP address in the backhaul data message; determining a Color value of the target SRv Policy tunnel based on the identification of the target service; and determining the target SRv6Policy tunnel identification according to the head node information, the destination node information and the determined Color value.

In a possible implementation manner, the determining unit 53 is configured to determine, according to a corresponding relationship between an identifier of a preset service and a preset Color value, a target Color value corresponding to the identifier of the target service; determining the target Color value as the Color value of the target SRv Policy tunnel.

In a possible implementation manner, the determining unit 53 is configured to determine, based on a corresponding relationship between an identifier of a preset service and a DSCP value of a differentiated service code point, a target DSCP value corresponding to the identifier of the target service; determining a target Color value corresponding to the target DSCP value based on the corresponding relation between the preset DSCP value and the Color value; determining the target Color value as the Color value of the target SRv Policy tunnel.

Based on the same technical concept, an embodiment of the present application further provides an electronic device 600, and referring to fig. 8, the electronic device 600 is configured to implement the backhaul traffic diversion method in the computational power network described in the above method embodiment, where the electronic device 600 of this embodiment may include: a memory 601, a processor 602, and a computer program stored in the memory and executable on the processor, such as a backhaul traffic steering program in a computational power network. The processor, when executing the computer program, implements the steps in the above-described embodiments of the backhaul traffic steering method in each computational power network.

In the embodiment of the present application, a specific connection medium between the memory 601 and the processor 602 is not limited. In the embodiment of the present application, the memory 601 and the processor 602 are connected by a bus 603 in fig. 8, the bus 603 is represented by a thick line in fig. 8, and the connection manner between other components is merely illustrative and not limited thereto. The bus 603 may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus.

The memory 601 may be a volatile memory (volatile memory), such as a random-access memory (RAM); the memory 601 may also be a non-volatile memory (non-volatile memory) such as, but not limited to, a read-only memory (rom), a flash memory (flash memory), a Hard Disk Drive (HDD) or a solid-state drive (SSD), or the memory 601 may be any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 601 may be a combination of the above memories.

A processor 602 configured to implement the backhaul traffic diversion methods in the various exemplary computational force networks provided by the embodiments of the present application.

The embodiment of the present application further provides a computer-readable storage medium, which stores computer-executable instructions required to be executed by the processor, and includes a program required to be executed by the processor.

In some possible embodiments, the aspects of the backhaul traffic diversion method in the computational power network provided by the present application may also be implemented in the form of a program product including program code for causing an electronic device to perform the steps of the backhaul traffic diversion method in the computational power network according to various exemplary embodiments of the present application described above in this specification when the program product is run on the electronic device.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (devices), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A backhaul traffic diversion method in a computational force network is applied to an exit router connected with an edge computing node in the computational force network, and the exit router is configured with at least two IPv 6-based segment routing policies SRv Policy tunnels, and the method comprises the following steps:

determining a target SRv6Policy tunnel identifier based on the identifier of the target service;

2. The method of claim 1, wherein determining a target SRv6Policy tunnel identification based on the identification of the target traffic comprises:

3. The method of claim 2, wherein the determining the Color value of the target SRv6Policy tunnel based on the identification of the target traffic comprises:

4. The method of claim 2, wherein the determining the Color value of the target SRv6Policy tunnel based on the identification of the target traffic comprises:

5. The method of claim 1, wherein the at least two SRv6Policy tunnels are created by the egress router; alternatively, the first and second electrodes may be,

6. A backhaul traffic diversion device in a computational power network is applied to an egress router connected with an edge computing node in the computational power network, and the egress router is configured with at least two IPv 6-based segment routing policies SRv Policy tunnels, and the device comprises:

7. The apparatus of claim 6,

the determining unit is configured to determine header node information of the target SRv6Policy tunnel based on the identification information of the egress router; determining destination node information of the target SRv Policy tunnel based on a destination IP address in the backhaul data message; determining a Color value of the target SRv Policy tunnel based on the identification of the target service; and determining the target SRv6Policy tunnel identification according to the head node information, the destination node information and the determined Color value.

8. The apparatus of claim 7,

the determining unit is used for determining a target Color value corresponding to the identifier of the target service according to the corresponding relation between the identifier of the preset service and the preset Color value; determining the target Color value as the Color value of the target SRv Policy tunnel.

9. The apparatus of claim 7,

the determining unit is configured to determine, based on a correspondence between an identifier of a preset service and a DSCP value of a differentiated service code point, a target DSCP value corresponding to the identifier of the target service; determining a target Color value corresponding to the target DSCP value based on the corresponding relation between the preset DSCP value and the Color value; determining the target Color value as the Color value of the target SRv Policy tunnel.

10. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor, when executing the program, implements the backhaul traffic steering method in a computational power network according to any one of claims 1 to 5.

11. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the steps of the method for backhaul traffic steering in a computational power network according to any one of claims 1 to 5.