WO2020073685A1

WO2020073685A1 - Forwarding path determining method, apparatus and system, computer device, and storage medium

Info

Publication number: WO2020073685A1
Application number: PCT/CN2019/092617
Authority: WO
Inventors: 方皓; 于泳
Original assignee: 平安科技（深圳）有限公司
Priority date: 2018-10-11
Filing date: 2019-06-25
Publication date: 2020-04-16
Also published as: CN109039919B; CN109039919A

Abstract

Embodiments of the present application provide a forwarding path determination method and apparatus, a computer device, and a storage medium. The method comprises: if a data flow is received, obtaining a key node through which the data flow reaches a destination address and a flow label corresponding to the key node; encapsulating packets of an IPv4 format corresponding to the data flow into packets of an IPv6 format; writing the flow label corresponding to the key node into a flow label field of the packets of the IPv6 format; according to the corresponding relationship between the flow label in the flow label field and a node address, forwarding the packets of the IPv6 format to the node address corresponding to each key node according to the writing order of the flow labels, and finally forwarding to the destination address.

Description

Method, device, system, computer equipment and storage medium for determining forwarding path

This application requires the priority of the Chinese patent application submitted to the China Patent Office on October 11, 2018, with the application number 201811185377.3 and the invention titled "Method, device, system, computer equipment, and storage medium for determining the forwarding path". Incorporated by reference in this application.

Technical field

The present application relates to the field of data processing technology, and in particular, to a forwarding path determination method, device, computer equipment, and storage medium.

Background technique

At present, data packets in the network mainly select the best path through hops, metric, cost, or comprehensive comparison. Path forwarding strategies such as RIP (Routing Information Protocol), IGRP (Interior Gateway Routing Protocol, internal gateway routing protocol) and other protocols are based on the number of hops to select the best path, IS-IS and other protocols The path forwarding strategy is to select the best path through the metric value. The path forwarding strategy corresponding to the protocols such as EIGRP (Enhanced Interior Gateway Routing Protocol, enhanced internal gateway routing protocol) and OSPF (Open Shortest Path First) is To select the best path through generational value, there are some protocols such as BGP (Border Gateway Protocol, Border Gateway Protocol), TE and other protocols corresponding to the path forwarding strategy is a comprehensive comparison to select the best path. Internal gateway protocols (such as RIP, OSPF, IS-IS, IGRP, EIGRP) select the best path by considering the number of hops or considering a single influencing factor. The algorithm for selecting the best path has shortcomings, such as the number of hops ignores bandwidth and delay The value, delay, bandwidth and backup path are ignored. The BGP protocol has strong control capabilities in the calculation of the optimal path but lacks dynamic path calculation capabilities. TE has strong path control capabilities and intelligent routing capabilities but has high complexity and weak path control capabilities.

Summary of the invention

Embodiments of the present application provide a forwarding path determination method, device, computer equipment, and storage medium, which enable data traffic to be forwarded according to a path where a designated key node is located, which is convenient for efficient fault location and troubleshooting.

In a first aspect, an embodiment of the present application provides a method for determining a forwarding path. The method includes:

If data traffic is received, obtain the key nodes that the data traffic needs to pass to reach the destination address and the flow marks corresponding to the key nodes; encapsulate the IPv4 format data packets corresponding to the data traffic into IPv6 format data packets; Write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is written in the order of the key nodes that need to pass through to reach the destination address ; According to the corresponding relationship between the flow label and the node address in the flow label field, forward the IPv6 format data packet to each key node address in the order in which the flow label is written, and finally forward to the destination address.

In a second aspect, an embodiment of the present application provides an apparatus for determining a forwarding path. The apparatus includes a unit corresponding to executing the method described in the first aspect.

In a third aspect, an embodiment of the present application provides a computer device, the computer device includes a memory, and a processor connected to the memory;

The memory is used to store a computer program, and the processor is used to run the computer program stored in the memory to perform the method described in the first aspect.

According to a fourth aspect, an embodiment of the present application provides a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, implements the method described in the first aspect.

BRIEF DESCRIPTION

FIG. 1 is a schematic flowchart of a forwarding path determination method provided by an embodiment of the present application;

2 is a schematic flowchart of a forwarding path determination method provided by another embodiment of the present application;

3 is a schematic sub-flow diagram of a method for determining a forwarding path provided by another embodiment of the present application;

4 is a schematic diagram of an application scenario provided by an embodiment of the present application;

5 is a schematic block diagram of a forwarding path determination apparatus provided by an embodiment of the present application;

6 is a schematic block diagram of an apparatus for determining a forwarding path according to another embodiment of the present application;

7 is a schematic block diagram of a forwarding unit provided by another embodiment of the present application;

8 is a schematic block diagram of a computer device provided by an embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, but not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the scope of protection of this application.

The forwarding path determination method in the embodiment of the present application may be applied to a network that needs to control data traffic, such as the Internet or a local area network. The following uses the data center Internet as an example.

The data center interconnection network may be the data center interconnection network where banks and large enterprises are located. The data center interconnection network includes multiple data centers, distributed in different cities, and these data centers need to communicate with each other. The data center interconnection network also includes multiple routers. The forwarding path determination method is applied to routers in the data center interconnection network to forward data traffic from the source address to the destination address. Among them, there is no special indication that the addresses in this application, such as source address and destination address, are all IP addresses. It should be pointed out that each router can also independently implement each step of the forwarding path determination method, that is, each router has a function of implementing each step of the forwarding path determination method.

FIG. 1 is a schematic flowchart of a forwarding path determination method provided by an embodiment of the present application. As shown in FIG. 1, the method includes S101-S104.

S101: If data traffic is received, obtain a key node that the data traffic needs to pass to reach the destination address and a flow mark corresponding to the key node.

After receiving the data traffic, the router obtains the key nodes that the data traffic needs to pass through to reach the destination address and the flow labels corresponding to the key nodes before forwarding the data traffic. Among them, a node refers to a router, and each router corresponds to a node. The key node can also be understood as the necessary node that needs to pass through to reach the destination address. Among them, each router stores a configuration file, and the configuration file stores the flow mark corresponding to the key node that the data traffic needs to pass through to reach the destination address. Set the flow mark corresponding to the key node that the data traffic needs to pass to reach the destination address in the configuration file in advance. If a certain data flow is sent from a source address in Shenzhen to a destination address in Beijing, key nodes include Wuhan, Shanghai, and Beijing. Then the corresponding flow labels are the corresponding flow labels of Wuhan, Shanghai, and Beijing. Among them, it should be noted that the data traffic exists in the form of data packets.

S102: Encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet.

Specifically, the IPv4 format data packet corresponding to the data traffic is encapsulated into an IPv6 format data packet through tunneling technology. Tunneling technology refers to a mechanism that encapsulates IPv6 packets as data in IPv4 packets when necessary, so that IPv6 packets can be transmitted on existing IPv4 infrastructure (mainly IPv4 routers). That is, IPv4 is used as a tunnel carrier, and the entire IPv6 data packet is encapsulated in the IPv4 data packet, so that the encapsulated data packet can still be forwarded in the network. If node A wants to send IPv6 packets to node B, but there is a sea of IPv4 between them, first, both ends need to be configured to establish a tunnel. For example, when node A sends an IPv6 packet to node B, node A as the beginning of the tunnel encapsulates the IPv6 packet in an IPv4 packet that uses node B's IPv4 address as the destination address and the source address is its own IPv4 address, and It is sent out, and the sent data packet reaches the Node B through IPv4 forwarding just like a normal IPv4 data packet. After receiving this data packet, Node B releases the IPv4 encapsulation, and takes out the IPv6 data packet to be processed by its own IPv6 protocol stack.

S103: Write the flow label corresponding to the key node into the flow label field of the IPv6 format data packet. Wherein, the flow marks corresponding to the key nodes are written in the order of the key nodes that need to pass through to reach the destination address.

There is a Flow field in the IPv6 packet, which occupies fixed bits, such as 20 bits, and this field is the flow label field. Among them, the domain can also be understood as a field, that is, there is a flow label field in the IPv6 data packet. The Flow field in the IPv6 packet can be used to identify various forms of flow. Since the Flow field can be customized, this field is used to identify the flow label corresponding to the key node. In this way, the combination of IPv4 and IPv6 is compatible with mainstream IPv4 applications and IPv6 flow label customization. Among them, it should be noted that the flow label corresponding to the key node is written into the flow label field, rather than the IP address corresponding to the key node is written into the flow label field, because the size of the flow label field Limited, if you write an IP address, the IP address that the flow label field can hold is limited; if you write a flow tag, you can record multiple flow tags. Among them, it should be noted that the flow marks corresponding to the key nodes are written in the order of the key nodes that need to pass through to reach the destination address. If a certain data flow is sent from a source address in Shenzhen to a destination address in Beijing, and the key nodes include Wuhan, Shanghai, and Beijing, the flow labels corresponding to the key nodes are also written in the order corresponding to Wuhan, Shanghai, and Beijing.

An implementation scenario of writing the flow label corresponding to the key node into the flow label field of the IPv6 format data packet is: on the interface displaying the data flow information, receiving a data flow selected by the user, and receiving the data from the user Flow setting / input key node, according to the flow mark corresponding to the pre-saved key node, write the flow mark corresponding to the set / input key node to the flow label field of the IPv6 format packet, set / The key nodes entered are saved in the configuration file. In some other implementation scenarios, it is also possible to directly read the data set in the configuration file without manual participation and complete automatically.

S104. According to the correspondence between the flow label and the node address in the flow label field, forward the IPv6 format data packet to the node address corresponding to each key node in the order in which the flow label is written, and finally forward to the Describe the destination address.

The correspondence relationship between the flow label and the node address will be set in advance, such as what is the node address corresponding to a certain flow label, and the node address is represented by an IP address. The correspondence between the flow label and the node address is stored in each router. Among them, a flow label corresponds to a node address, for example, the flow labels corresponding to Wuhan, Shanghai, and Beijing correspond to an IP address in Wuhan, Shanghai, and Beijing, respectively. These node addresses exist in the data center interconnection network, and are hardware device addresses in the data center interconnection network, such as router IP addresses. If the flow mark is written in the order of Wuhan, Shanghai, and Beijing, the IPv6 format data packet is first forwarded to the node address corresponding to Wuhan, and then forwarded from the node address corresponding to Wuhan to the node address corresponding to Shanghai, and then Forwarded from the node address corresponding to Shanghai to the node address corresponding to Beijing, and finally forwarded to the destination address. Among them, it should be noted that there may be many routers between the router that forwards the data traffic and the router corresponding to the key node, and there may be many routers between every two key nodes, such as between Wuhan and Shanghai There may be many routers. The path forwarding strategy between the router that forwards the data traffic and the key node is forwarded according to the existing path forwarding strategy, and the path forwarding strategy between every two key nodes is also forwarded according to the existing path forwarding strategy. Among them, the path forwarding strategy is a forwarding strategy corresponding to different protocols, such as RIP and OSPF.

In this way, data traffic is forwarded according to the path where the designated key node is located, and the path forwarding strategy between key nodes is not specifically limited. If a certain data flow is lost, you can check the path of the key node specified by the data flow, which is convenient for efficient fault location and troubleshooting, and at the same time, it can analyze the data flow and make a reasonable prediction.

2 is a schematic flowchart of a forwarding path determination method provided by another embodiment of the present application. As shown in FIG. 2, the method includes S201-S206. In this embodiment, the differences from the embodiment in FIG. 1 are mainly explained. For the description of the same steps as in FIG. 1, please refer to the description in the embodiment in FIG. 1, which will not be repeated here.

S201: If data traffic is received, obtain the type of the data traffic.

The preset type may be a preset priority. If the router receives data traffic, obtain the priority of the data traffic. In some embodiments, the preset type may also be other specific types set in advance, such as a user-defined type. If the router receives data traffic, the type data of the data traffic is obtained. Among them, the preset priority and the preset specific type are saved in the configuration file.

S202. Determine whether the type of the data traffic is a preset type.

If the preset type is a preset priority, it is determined whether the type of data traffic is the preset type, that is, whether the priority of the data traffic is the preset priority. If the preset type is another specific type preset by the user, then it is determined whether the type of data traffic is the preset type, that is, whether the type of the data traffic is other specific types preset. To determine whether the type of the data traffic is a preset type is to filter some data traffic, and only further processes the preset type of data traffic. If the type of data traffic is the preset type, step S203 is executed, it can be understood that the data traffic of the preset type is simply forwarded in the order corresponding to the designated key node, and the preset data traffic type and path The corresponding association relationship of the forwarding strategy selects the corresponding path forwarding strategy for forwarding. If the type of data traffic is not the preset type, it is forwarded according to the ordinary data packet.

In other embodiments, it is not necessary to determine whether the data traffic type is a preset type, that is, after step S201 is executed, then the key nodes that need to pass through the data traffic to reach the destination address and the flows corresponding to the key nodes are obtained in step S203 mark. It can be understood that all data traffic is designated as key nodes, and all data traffic is forwarded in the order corresponding to the designated key nodes, but it will also be associated with the path forwarding strategy according to the preset data traffic type. The relationship selects the corresponding path forwarding strategy for forwarding.

S203. If the type of the data traffic is a preset type, obtain a key node that the data traffic needs to pass through to reach the destination address and a flow mark corresponding to the key node.

The flow mark corresponding to the key node is stored in the configuration file. In this embodiment, the flow mark of the key node corresponding to the preset type of data traffic is stored in the configuration file. In this way, the configuration file has two functions: identifying a predetermined type of data traffic, and obtaining a flow mark corresponding to a key node corresponding to the predetermined type of data traffic.

S204: Encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet.

S205. Write the flow label corresponding to the key node to the flow label field of the IPv6 format data packet. Wherein, the flow marks corresponding to the key nodes are written in the order of the key nodes that need to pass through to reach the destination address.

S206, according to the correspondence relationship between the flow label and the node address in the flow label field, the correspondence relationship between the data traffic type and the path forwarding policy saved in each node, and according to the order of writing the flow label, the IPv6 format The data packet is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.

Each node (router) stores the correspondence relationship between the data traffic type and the path forwarding strategy, where the nodes include key nodes. It can be understood that different path forwarding strategies can be used for different types of data traffic. Among them, the corresponding relationship between the data traffic type and the path forwarding strategy in each router can be the same or different. For example, in a router, the data traffic type is A, and the path forwarding strategy is AA. In another router , The data traffic is A, and the path forwarding strategy is BB. Among them, it should be noted that there may be many routers and forwarding paths between the router that forwards the data traffic and the router corresponding to the key node, and between every two key nodes.

In this way, the preset type of data traffic is forwarded according to the path where the designated key node is located, which is convenient for efficient fault location and troubleshooting, and the traffic analysis and reasonable prediction of the preset type of data traffic. At the same time, different types of data traffic are forwarded according to different path forwarding strategies, and a variety of different types of data traffic are forwarded more targeted to achieve personalized traffic forwarding to meet the needs of different users.

In an embodiment, as shown in FIG. 3, step S206 includes the following steps S301-S307.

S301: Obtain the first flow label in the flow label field, and according to the correspondence between the flow label and the node address, use the node address corresponding to the first flow label as the destination address of the next hop, and according to the saved It is assumed that the correspondence relationship between the data traffic type and the path forwarding strategy determines the path forwarding strategy required for the IPv6 format data packet to be forwarded to the destination address of the next hop.

It should be noted that the next hop destination address does not really refer to the address of the next router that the data traffic needs to pass through, but the address of the router corresponding to the set key node.

S302. Forward the data packet in the IPv6 format from the current router to the destination address of the next hop according to the determined path forwarding strategy.

The determined path forwarding strategy refers to the path forwarding strategy from the current router to the next router (not the router corresponding to the next hop destination address). It should be noted that there may be multiple routers, multiple forwarding paths, and multiple different path forwarding strategies between the current router and the router corresponding to the destination address of the next hop. In some other embodiments, no matter how many routers exist between the current router and the router corresponding to the destination address of the next hop, the data traffic is forwarded according to the same path forwarding strategy (determined path forwarding strategy) . In this case, it can be understood that all routers between the current router and the router corresponding to the destination address of the next hop are set to the same path forwarding strategy for the data traffic.

S303: After the IPv6 format data packet reaches the destination address of the next hop, delete the flow label corresponding to the destination address of the next hop from the flow label field.

Because it is in the network, the network situation is very complicated. The purpose of deleting the flow label is to simplify the processing and facilitate the processing of the destination address of the next hop.

S304: Determine whether the value in the flow label field is empty. If the value in the flow label field is not empty, return to step S301. If the value in the flow label field is empty, step S305 is executed.

Among them, if there is a flow label in the flow label field, it means that the data packet corresponding to the data flow has not reached the destination. Since the flow label corresponding to the destination address of the next hop has been deleted, the first flow label in the flow label field is obtained, and the destination address corresponding to the first flow label is used as the destination address of the next hop. And determine the path forwarding strategy to be used to the destination address of the next hop. If the value in the flow label field is blank, it means that the data traffic has reached the destination, such as Beijing, but may not have reached the destination address, that is, the destination address in the IPV4 data packet.

S305: Determine whether the current router address is the same as the destination address. If the current router address is the same as the destination address, step S306 is performed; if the current router address is not the same as the destination address, step S307 is performed. If the current router address is the same as the destination address, it means that the data traffic has reached the destination address. If the current router address is different from the destination address, it means that the data traffic has reached the destination (a destination can include multiple IP addresses, and multiple IP addresses include a destination address), but not yet Reach the destination address.

S306. Determine that the destination address has been reached. It can be understood that the destination address is the address corresponding to the key node.

S307: Determine the path forwarding strategy corresponding to the IPv6 format data packet according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy, and according to the determined path forwarding strategy, convert the data in the IPv6 format The packet is sent to the destination address.

As shown in FIG. 4, it is a schematic diagram of an application scenario provided by an embodiment of the present application. In this application scenario, an initial user (source address) in Shenzhen sends a data traffic, and router A in Shenzhen receives the data traffic and finds that the data traffic needs to be sent to a destination user in Beijing. The address corresponding to the destination user Is the destination address. Among them, the key nodes that need to pass through include router B in Wuhan, router C in Shanghai, and router D in Beijing. In Router A, Router B, Router C, and Router D, the key nodes corresponding to the preset types of data traffic, the flow labels corresponding to the key nodes, and the correspondence between the flow labels corresponding to the key nodes and the node addresses are stored Correspondence relationship between preset data traffic types and path forwarding strategies.

In Router A, the IPv4 format data packet (including the destination address) corresponding to the data traffic is encapsulated into an IPv6 format data packet, and the flow label corresponding to the key node is written into the flow label field of the IPv6 format data packet. Obtain the first flow label in the flow label field in the IPv6 format packet, that is, the flow label corresponding to Router B. According to the correspondence between the flow label and the node address in the flow label field, the preset data traffic type saved Correspondence relationship with the path forwarding strategy, the IPv6 format data packet is forwarded to the router B according to the corresponding path forwarding strategy. After receiving the IPv6 format data packet, Router B deletes the flow label corresponding to Router B from the flow label field. Router B finds that the destination address is not its own, so it obtains the first flow label in the data packet, that is, the corresponding flow label of Router C. According to the correspondence between the flow label and the node address in the flow label field, the saved preset The corresponding relationship between the data traffic type and the path forwarding strategy forwards the IPv6 format data packet to Router C according to the corresponding path forwarding strategy. Follow the same method to forward data traffic from router C to router D. After receiving the IPv6 format packet, Router D finds that the destination address is not its own, and the value in the flow label field is empty, then Router D will change the IPv6 according to the corresponding relationship between the saved preset data traffic type and the path forwarding strategy. The formatted data packet is forwarded to the destination user according to the corresponding path forwarding strategy. The destination user finds that the destination address is consistent with its own address, and then receives the data traffic.

It should be noted that there may be multiple routers and forwarding paths between Router A and Router B, Router B and Router C, and Router C and Router D. It should also be noted that the functions implemented in each router described above can be implemented independently in Router A, Router B, Router C, and Router D, that is, each router can implement the sum of the functions described in the above four routers.

It should be noted that the schematic diagram in FIG. 4 is only an example, to facilitate understanding of the solution in the embodiment of the present application, in other embodiments, FIG. 4 may further include more networks and routers.

In some embodiments, the key node may also be a terminal device, and the terminal device may implement a function of forwarding data traffic, and also save corresponding data. The terminal equipment includes a user terminal, a server, and so on.

FIG. 5 is a schematic block diagram of a forwarding path determination apparatus provided by an embodiment of the present application. The device includes a unit corresponding to the method for determining the forwarding path. It should be noted that since each router can implement the sum of the functions described in the above method embodiments, the device can be separately configured in a router or a terminal device, and the terminal device can implement the data traffic forwarding function Terminal Equipment. At the same time, for the convenience of understanding, the following device embodiments are still described according to the step flow. Specifically, as shown in FIG. 5, the device 50 includes a flow label acquisition unit 501, an encapsulation unit 502, a flow label writing unit 503 and a forwarding unit 504.

The flow label obtaining unit 501 is configured to obtain, if data traffic is received, a key node that the data traffic needs to pass through to reach the destination address and a flow label corresponding to the key node.

The encapsulating unit 502 is configured to encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet. Specifically, the encapsulating unit 502 encapsulates the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet through a tunnel technology.

A flow mark writing unit 503, used to write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is required to reach the destination address Written by the order of key nodes.

The forwarding unit 504 is configured to forward the data packet in the IPv6 format to the node corresponding to each key node according to the correspondence relationship between the flow label and the node address in the flow label field, in the order in which the flow label is written The address is finally forwarded to the destination address.

6 is a schematic block diagram of a forwarding path determination apparatus provided by another embodiment of the present application. Specifically, as shown in FIG. 6, the device 60 includes a type acquisition unit 601, a type judgment unit 602, a flow label acquisition unit 603, a packaging unit 604, a flow label writing unit 605, and a forwarding unit 606. Among them, the difference from the embodiment of FIG. 5 lies in: the type acquisition unit 601, the type judgment unit 602, and the forwarding unit 606. The type acquisition unit 601, type judgment unit 602, and forwarding unit 606 will be described below. For other units, please refer to the description in the embodiment of FIG. 5, which will not be repeated here.

The type obtaining unit 601 is configured to obtain the type of the data flow if data flow is received.

The type determining unit 602 is configured to determine whether the type of the data traffic is a preset type. If the type of the data traffic is a preset type, then the flow mark acquisition unit 603 is triggered.

The flow label obtaining unit 603 is used to obtain the key nodes that the data traffic needs to pass through to reach the destination address and the flow labels corresponding to the key nodes.

The forwarding unit 606 is specifically configured to, according to the correspondence relationship between the flow label and the node address in the flow label domain, the corresponding relationship between the saved preset data traffic type and the path forwarding strategy, in order of writing the flow label The data packet in the IPv6 format is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.

In an embodiment, as shown in FIG. 7, the forwarding unit 606 includes a forwarding strategy determination unit 701, a forwarding next hop unit 702, a deletion unit 703, a value judgment unit 704, an address judgment unit 705, an arrival determination unit 706, and a forwarding purpose Address unit 707.

The forwarding strategy determination unit 701 is used to obtain the first flow label in the flow label field, and according to the correspondence between the flow label and the node address, use the node address corresponding to the first flow label as the destination address of the next hop And determine the path forwarding strategy to be used for forwarding the data packet in the IPv6 format to the destination address of the next hop according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy.

The forwarding next hop unit 702 is configured to forward the data packet in the IPv6 format from the current router to the destination address of the next hop according to the determined path forwarding strategy.

The deleting unit 703 is configured to delete the flow label corresponding to the destination address of the next hop from the flow label field after the IPv6 format data packet reaches the destination address of the next hop.

The value judgment unit 704 is used to judge whether the value in the flow label field is empty. If the value in the flow label field is not empty, a forwarding strategy determination unit 701 and a forwarding next hop unit 702 are triggered.

The address determining unit 705 is configured to determine whether the current router address is the same as the destination address if the value in the flow label field is empty.

The arrival determination unit 706 is configured to determine that the destination address has been reached if the current router address is the same as the destination address.

The forwarding destination address unit 707 is used to determine the correspondence of the IPv6 format data packet according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy if the current router address is different from the destination address A path forwarding strategy, and according to the determined path forwarding strategy, send the data packet in the IPv6 format to the destination address.

It should be noted that those skilled in the art can clearly understand that the specific implementation process of the above device and each unit can refer to the corresponding descriptions in the foregoing method embodiments.

The above device can be implemented in the form of a computer program, and the computer program can be run on a computer device as shown in FIG. 8.

FIG. 8 is a schematic block diagram of a computer device provided by an embodiment of the present application. The device is a router or terminal. The device 80 includes a processor 802, a memory, and a network interface 803 connected through a system bus 801, where the memory may include a non-volatile storage medium 804 and an internal memory 805.

The non-volatile storage medium 804 may store an operating system 8041 and a computer program 8042. When the computer program 8042 stored in the non-volatile storage medium is executed by the processor 802, the foregoing forwarding path determination method can be implemented. The processor 802 is used to provide computing and control capabilities and support the operation of the entire device 80. The internal memory 805 provides an environment for the operation of the computer program in the non-volatile storage medium. When the computer program is executed by the processor 802, the processor 802 can execute the foregoing forwarding path determination method. The network interface 803 is used for network communication. Those skilled in the art may understand that the structure shown in FIG. 8 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the device 80 to which the solution of the present application is applied. The specific device 80 may Include more or less components than shown in the figure, or combine certain components, or have a different arrangement of components.

Wherein, the processor 802 is used to run a computer program stored in a memory to implement any embodiment of the foregoing forwarding path determination method.

It should be understood that in the embodiment of the present application, the so-called processor 802 may be a central processing unit (Central Processing Unit, CPU), and the processor may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP) , Application Specific Integrated Circuit (Application Program Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

A person of ordinary skill in the art may understand that all or part of the processes in the method for implementing the above embodiments may be completed by instructing relevant hardware through a computer program. The computer program may be stored in a storage medium, and the storage medium may be a computer-readable storage medium. The computer program is executed by at least one processor in the computer system to implement the process steps of the above method embodiments.

Therefore, the present application also provides a storage medium. The storage medium may be a computer-readable storage medium, and the computer-readable storage medium includes a non-volatile computer-readable storage medium. The storage medium stores a computer program that, when executed by the processor, implements any embodiment of the foregoing forwarding path determination method.

The storage medium may be various computer-readable storage media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a magnetic disk, or an optical disk.

In the several embodiments provided in this application, it should be understood that the disclosed device, device, and method may be implemented in other ways. For example, the device embodiments described above are only schematic, and the division of the units is only a division of logical functions, and there may be other divisions in actual implementation. Those skilled in the art can clearly understand that for the convenience and conciseness of the description, the specific working processes of the devices, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments, which are not repeated here. The above is only the specific implementation of this application, but the scope of protection of this application is not limited to this, any person skilled in the art can easily think of various equivalents within the technical scope disclosed in this application Modifications or replacements, these modifications or replacements should be covered within the scope of protection of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

A method for determining a forwarding path includes:

If data traffic is received, obtain the key nodes that the data traffic needs to pass to reach the destination address and the flow labels corresponding to the key nodes;

Encapsulate the data packet in the IPv4 format corresponding to the data flow into a data packet in the IPv6 format;

Write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is written in the order of the key nodes that need to pass through to reach the destination address ;

According to the correspondence relationship between the flow label and the node address in the flow label field, the IPv6 format data packet is forwarded to the node address corresponding to each key node in the order in which the flow label is written, and finally forwarded to the destination address.
The method of claim 1, wherein the method further comprises:

If data traffic is received, obtain the type of data traffic;

According to the correspondence between the flow label and the node address in the flow label field, the IPv6 format data packet is forwarded to the node address corresponding to each key node in the order in which the flow label is written, and finally forwarded to the Describe the destination address, including:

According to the correspondence relationship between the flow label and the node address in the flow label field, the corresponding relationship between the preset data traffic type and the path forwarding policy saved in each node, according to the order in which the flow label is written, the IPv6 format The data packet is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.
The method according to claim 2, wherein, according to the correspondence relationship between the flow label and the node address in the flow label field, the correspondence relationship between the preset data traffic type saved in each node and the path forwarding policy, According to the order in which the flow tags are written, the IPv6 format data packets are forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy and finally forwarded to the destination address, including:

Obtain the first flow label in the flow label field, and use the node address corresponding to the first flow label as the destination address of the next hop according to the correspondence between the flow label and the node address, and according to the saved preset data The corresponding relationship between the traffic type and the path forwarding strategy determines the path forwarding strategy required for forwarding the IPv6 formatted data packet to the destination address of the next hop;

Forward the data packet in the IPv6 format from the current router to the destination address of the next hop according to the determined path forwarding strategy;

After the IPv6 format data packet reaches the destination address of the next hop, delete the flow label corresponding to the destination address of the next hop from the flow label field;

Determine whether the value in the flow label field is empty;

If the value in the flow label field is not empty, return to the step of obtaining the first flow label in the flow label field;

If the value in the flow label field is empty, determine whether the current router address is the same as the destination address;

If the address of the current router is the same as the destination address, it is determined that the destination address has been reached.
The method of claim 3, wherein the method further comprises:

If the current router address is not the same as the destination address, the path forwarding strategy corresponding to the IPv6 format data packet is determined according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy, and according to the determined Path forwarding strategy, sending the IPv6 format data packet to the destination address.
The method according to claim 2, wherein after the step of acquiring the type of the data traffic, the method further comprises:

Determine whether the type of the data flow is a preset type;

If the type of the data traffic is a preset type, the step of acquiring the key node that the data traffic needs to pass through to reach the destination address and the flow label corresponding to the key node is performed.
The method according to claim 1, wherein the encapsulating the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet includes:

The IPv4 format data packet corresponding to the data traffic is encapsulated into an IPv6 format data packet through tunneling technology.
The method according to claim 1, wherein, before the step of acquiring the data node, the key node that the data traffic needs to pass through to reach the destination address and the flow label corresponding to the key node are acquired, the method further include:

Set the flow mark corresponding to the key node that the data flow needs to pass through to reach the destination address in the configuration file, and save the configuration file.
The method according to claim 1, wherein the writing of the flow mark corresponding to the key node to the flow label field of the IPv6 format packet includes:

Receiving key nodes set or input by users on IPv6 format data packets;

According to the flow mark corresponding to the pre-stored key node, the flow mark corresponding to the set or input key node is written into the flow label field of the IPv6 format data packet.
A forwarding path determination device, including:

A flow mark obtaining unit, used to obtain the key node that the data flow needs to pass through to reach the destination address and the flow mark corresponding to the key node if the data flow is received;

An encapsulation unit, configured to encapsulate the IPv4 format data packet corresponding to the data flow into an IPv6 format data packet;

A flow mark writing unit, used to write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is passed according to the need to reach the destination address The order of the key nodes is written;

The forwarding unit is used to forward the IPv6 format data packet to the node address corresponding to each key node according to the correspondence relationship between the flow label and the node address in the flow label field in the order in which the flow label is written Forward to the destination address.
The forwarding path determination device according to claim 9, wherein the forwarding path determination device further comprises:

A type obtaining unit, configured to obtain the type of the data flow if data flow is received;

The forwarding unit is specifically configured to, according to the correspondence relationship between the flow label and the node address in the flow label field, the corresponding relationship between the saved preset data traffic type and the path forwarding strategy, in order of writing the flow label The IPv6 format data packet is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.
A computer device including a memory and a processor connected to the memory; wherein the memory is used to store a computer program; the processor is used to run the computer program stored in the memory to execute The following steps:

If data traffic is received, obtain the key nodes that the data traffic needs to pass to reach the destination address and the flow labels corresponding to the key nodes;

Encapsulate the data packet in the IPv4 format corresponding to the data flow into a data packet in the IPv6 format;

Write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is written in the order of the key nodes that need to pass through to reach the destination address ;

According to the correspondence relationship between the flow label and the node address in the flow label field, the IPv6 format data packet is forwarded to the node address corresponding to each key node in the order in which the flow label is written, and finally forwarded to the destination address.
The computer device according to claim 11, wherein the processor further performs the following steps:

If data traffic is received, obtain the type of data traffic;

The processor executes the forwarding of the IPv6 format data packet to the node corresponding to each key node according to the correspondence relationship between the flow label and the node address in the flow label field When the address is finally forwarded to the destination address, the specific steps are as follows:

According to the correspondence relationship between the flow label and the node address in the flow label field, the corresponding relationship between the preset data traffic type and the path forwarding policy saved in each node, according to the order in which the flow label is written, the IPv6 format The data packet is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.
The computer device according to claim 12, wherein the processor performs the preset data traffic type and path stored in each node according to the correspondence between the flow label and the node address in the flow label field The corresponding association relationship of the forwarding strategy, according to the order in which the flow tags are written, forwards the IPv6 format data packet to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwards to the destination address The specific steps are as follows:

Obtain the first flow label in the flow label field, and use the node address corresponding to the first flow label as the destination address of the next hop according to the correspondence between the flow label and the node address, and according to the saved preset data The corresponding relationship between the traffic type and the path forwarding strategy determines the path forwarding strategy required for forwarding the IPv6 formatted data packet to the destination address of the next hop;

Forward the data packet in the IPv6 format from the current router to the destination address of the next hop according to the determined path forwarding strategy;

After the IPv6 format data packet reaches the destination address of the next hop, delete the flow label corresponding to the destination address of the next hop from the flow label field;

Determine whether the value in the flow label field is empty;

If the value in the flow label field is not empty, return to the step of obtaining the first flow label in the flow label field;

If the value in the flow label field is empty, determine whether the current router address is the same as the destination address;

If the address of the current router is the same as the destination address, it is determined that the destination address has been reached.
The computer device according to claim 13, wherein the processor further performs the following steps:

If the current router address is not the same as the destination address, the path forwarding strategy corresponding to the IPv6 format data packet is determined according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy, and according to the determined Path forwarding strategy, sending the IPv6 format data packet to the destination address.
The computer device according to claim 12, wherein after the processor performs the step of acquiring the type of the data traffic, the processor further performs the following steps:

Determine whether the type of the data flow is a preset type;

If the type of the data traffic is a preset type, the processor executes the step of acquiring a key node that the data traffic needs to pass through to reach the destination address and a flow label corresponding to the key node.
The computer device according to claim 11, wherein the processor specifically performs the following steps when performing the step of encapsulating the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet:

The IPv4 format data packet corresponding to the data traffic is encapsulated into an IPv6 format data packet through tunneling technology.
The computer device according to claim 11, wherein the processor executes the step of acquiring, if data traffic is received, a key node that the data traffic needs to pass through to reach the destination address and a flow label corresponding to the key node Previously, the processor also performed the following steps:

Set the flow mark corresponding to the key node that the data flow needs to pass through to reach the destination address in the configuration file, and save the configuration file.
The computer device according to claim 11, wherein the processor specifically executes the following steps when performing the step of writing the flow tag corresponding to the key node to the flow label field of the IPv6 format packet :

Receiving key nodes set or input by users on IPv6 format data packets;

According to the flow mark corresponding to the pre-stored key node, the flow mark corresponding to the set or input key node is written into the flow label field of the IPv6 format data packet.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:

If data traffic is received, obtain the key nodes that the data traffic needs to pass to reach the destination address and the flow labels corresponding to the key nodes;

Encapsulate the data packet in the IPv4 format corresponding to the data flow into a data packet in the IPv6 format;

Write the flow mark corresponding to the key node into the flow label field of the IPv6 format packet, wherein the flow mark corresponding to the key node is written in the order of the key nodes that need to pass through to reach the destination address ;

According to the correspondence relationship between the flow label and the node address in the flow label field, the IPv6 format data packet is forwarded to the node address corresponding to each key node in the order in which the flow label is written, and finally forwarded to the destination address.
The computer-readable storage medium of claim 19, wherein the processor further implements the following steps:

If data traffic is received, obtain the type of data traffic;

The processor executes the forwarding of the IPv6 format data packet to the node corresponding to each key node according to the correspondence relationship between the flow label and the node address in the flow label field When the address is finally forwarded to the destination address, the specific steps are as follows:

According to the correspondence relationship between the flow label and the node address in the flow label field, the corresponding relationship between the preset data traffic type and the path forwarding policy saved in each node, according to the order in which the flow label is written, the IPv6 format The data packet is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.