Network traffic configuration method, device, equipment and medium

Abstract

The invention belongs to the technical field of communication, and relates to a network traffic configuration method and device, electronic equipment and a computer readable storage medium. The network traffic configuration method at least comprises the following steps: acquiring a virtual network traffic configuration request, wherein a virtual network comprises a plurality of virtual links; acquiring information of a physical network, wherein the physical network comprises a plurality of physical links; obtaining a bandwidth demand of a virtual link and a bandwidth capacity limit of a physical link; mapping each virtual link to a plurality of actual mapping paths on a physical network by adopting a path divisible mapping algorithm; each actual mapping path comprises a plurality of physical links which are connected in sequence, and the actual mapping paths can meet the bandwidth requirements of the virtual links and the bandwidth capacity limitation of the physical links at the same time; packaging the information containing the actual mapping path in a data packet; and the data packet can be transmitted along the actual mapping path. According to the network flow configuration method, the newly added virtual link can be conveniently embedded into the physical network.

Description

Technical Field

[0001] This application belongs to the field of communication technology, and in particular relates to a network traffic configuration method, apparatus, electronic device and computer-readable storage medium. Background Technology

[0002] SDN network virtualization is a technology that virtualizes physical network resources into multiple virtual networks. It uses a virtual link mapping algorithm to map the needs of virtual networks onto the underlying physical network resources. Existing virtual link mapping algorithms use path-indivisible mapping algorithms, which treat virtual links as a whole and must be mapped to a continuous path in the physical network. This can lead to mapping failures when physical network resources are scarce, limiting the embedding of new virtual links into the physical network.

[0003] SDN network virtualization systems typically use OpenFlow-based hop-by-hop configuration for virtual link mapping, meaning that flow table rules are installed on each switch node on the physical link corresponding to the virtual link. As the number of embedded virtual networks increases, resource shortages occur on the physical network's switch nodes, affecting the allocation of flow table resources across the entire physical network. Summary of the Invention

[0004] One of the purposes of this application is to provide a network traffic configuration method, apparatus, device, and medium that facilitates the embedding of new virtual links into the physical network and saves flow table resource allocation in the physical network.

[0005] To achieve the above and other related objectives, in a first aspect, the present invention provides a network traffic configuration method, comprising the following steps:

[0006] Obtain a virtual network traffic configuration request, wherein the virtual network includes multiple virtual links;

[0007] Obtain information about the physical network, which includes multiple physical links;

[0008] Obtain the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical link;

[0009] A path-segmentable mapping algorithm is used to map each virtual link to multiple actual mapping paths on the physical network; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical links.

[0010] The information containing the actual mapping path is encapsulated in a data packet; the data packet can be transmitted along the actual mapping path.

[0011] In a second aspect, the present invention provides a network traffic configuration device, comprising:

[0012] The acquisition module is used to acquire the virtual network traffic configuration request and the physical network information; the virtual network includes multiple virtual links; the physical network includes multiple physical links; and to acquire the bandwidth requirements of the virtual links and the bandwidth capacity limits of the physical links.

[0013] The calculation module is used to obtain multiple actual mapping paths from the virtual link to the physical network using a path splittable mapping algorithm; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical links.

[0014] The transmission module encapsulates information containing the actual mapping path in a data packet; the data packet can be transmitted along the actual mapping path.

[0015] Thirdly, the present invention provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory communicatively connected to the at least one processor; wherein...

[0016] The memory stores instructions that can be executed by the at least one processor, which enables the at least one processor to perform the network traffic configuration method described above.

[0017] Fourthly, the present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the network traffic configuration method described above.

[0018] This application has at least the following beneficial effects:

[0019] This application employs a path-segmentable mapping algorithm to map a single virtual link to different paths in the physical network, thereby distributing the bandwidth requirements of the virtual link across multiple paths, thus improving the overall network bandwidth utilization and reducing the problem of virtual networks being difficult to embed due to bandwidth fragmentation.

[0020] This application encapsulates the actual mapping path information of the virtual link in the data packet, so that each physical switch on the actual mapping path can directly obtain the actual mapping path information from the data packet without the need for flow table matching and forwarding, thereby avoiding additional flow table resource consumption.

[0021] This application employs a weighted round-robin algorithm to allocate the bandwidth requirements of virtual links to different physical links according to a weight ratio, where the weight ratio is the ratio of the bandwidth requirements of different virtual links, thereby achieving load balancing.

[0022] By using a dual-rate, three-color marking method to limit the transmission rate of data packets on the physical link, bandwidth control can be achieved, thus avoiding congestion in the physical network. Attached Figure Description

[0023] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of this application and should not be regarded as a limitation of the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0024] Figure 1 This is a flowchart illustrating a network traffic configuration method according to an embodiment of this application;

[0025] Figure 2 This is a schematic diagram illustrating a virtual source routing protocol header format according to an embodiment of this application;

[0026] Figure 3 This is a schematic diagram illustrating the principle and flow of a two-ratio three-color marking method according to an embodiment of this application.

[0027] Figure 4 This is a schematic diagram of the electronic device composition in one embodiment of the present invention. Detailed Implementation

[0028] The following specific embodiments illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification. This application can also be implemented or applied through other different specific embodiments, and various details in this application can also be modified or changed based on different viewpoints and applications without departing from the spirit of this application. It should be noted that, unless otherwise specified, the following embodiments and features in the embodiments can be combined with each other.

[0029] In the description of this application, it should be noted that the terms "center," "longitudinal," "lateral," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," and "outer," etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the accompanying drawings and are only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation on this application. Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0030] This embodiment provides a network traffic configuration method, including the following steps:

[0031] Obtain a virtual network traffic configuration request. The virtual network includes multiple virtual links.

[0032] Obtain information about the physical network, which includes multiple physical links;

[0033] Obtain the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical link;

[0034] A path-segmentable mapping algorithm is used to map each virtual link to multiple actual mapping paths on the physical network; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical links.

[0035] The data packet contains information about the actual mapping path; the data packet can be transmitted along the actual mapping path.

[0036] This application employs a path-segmentable mapping algorithm to map a single virtual link to different paths in the physical network, thereby distributing the bandwidth requirements of the virtual link across multiple paths, thus improving the overall network bandwidth utilization and reducing the problem of virtual networks being difficult to embed due to bandwidth fragmentation.

[0037] Path-spliable mapping algorithms include those based on multi-commodity flow. These algorithms utilize the concept of the Multi-Commodity Flow Problem (MCFP). In the MCFP, commodity flows refer to different types of commodities transmitted from the source to the destination in a network; these commodities can be viewed as different types of data flows or network traffic.

[0038] The path-segmentable mapping algorithm for multi-commodity flows specifically includes establishing an integer linear programming model and obtaining the optimal or feasible solution from the integer linear programming model.

[0039] Integer linear programming models include defining the objective function and establishing constraints.

[0040] The objective function is the function that minimizes the physical link bandwidth resources used to calculate the actual mapped path. It can be expressed by the following formula:

[0041]

[0042] Where M is the number of virtual links k. This represents the bandwidth mapped by virtual link k on physical link (i,j). The value of k indicates the bandwidth resources consumed on the physical link. k=1 means that the bandwidth resources consumed by each physical link are set to 1. The value of k can vary depending on the material and length of the physical link.

[0043] The constraints include simultaneously satisfying the bandwidth requirements of the virtual link k and the bandwidth capacity limit of the physical link. Specifically, the bandwidth requirement of each physical link mapped from the virtual link k must be less than the maximum bandwidth requirement that the physical link can carry. This can be expressed by the following formula:

[0044]

[0045] Where M is the number of virtual links k. Let C be the bandwidth mapped by virtual link k on physical link (i,j), where k=1 indicates that the bandwidth resource consumed by each physical link is set to 1. ij This represents the bandwidth capacity of the physical link (i,j). This means that all physical links (i,j) in set L must satisfy the conditions of the above formula.

[0046] The flow of goods is bidirectional; similarly, a virtual link is a bidirectional data arc. The in-degree represents the total traffic entering a node. The out-degree represents the total traffic leaving a node. The difference between the in-degree and out-degree of the starting node of the actual mapped path is the bandwidth requirement of the virtual link. The difference between the in-degree and out-degree of intermediate nodes in the actual mapped path is 0, indicating that the amount of data entering the intermediate node equals the amount of data leaving that node, in order to maintain network traffic balance.

[0047] The formula is expressed as follows:

[0048]

[0049] in, Let d be the bandwidth that virtual link k maps to on physical link (i,j). k For the bandwidth requirement of virtual link k, δ + (i) = {j|(i,j)∈L} represents all nodes j connected to node i, and the direction of the data arc is from i to j; δ -(i) = {j|(j,i)∈L} represents all nodes j connected to node i, and the direction of the data arc j points to i; s k The source node representing virtual link k, t k This represents the destination node of virtual link k.

[0050] To establish the integer linear programming model below, the physical link bandwidth between each node is either a positive integer or 0, expressed by the following formula:

[0051]

[0052] in, Let be the bandwidth mapped by virtual link k on physical link (i,j). For each virtual link k in set M, the bandwidth mapped by all virtual links k in set M to each physical link must be a positive integer or 0. This means that all physical links in set L must satisfy the formula conditions.

[0053] For integer linear programming models, solvers (such as OR-Tools) can be used to find the optimal solution to the objective function. The optimal solution is the one that minimizes the physical link bandwidth resources used by the actual mapped path, while simultaneously satisfying the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical link.

[0054] The information containing the actual mapping path is encapsulated in the data packet; the data packet can be transmitted along the actual mapping path, so that each physical switch on the actual mapping path can directly obtain the actual mapping path information from the data packet without the need for flow table matching and forwarding, thereby avoiding additional flow table resource consumption.

[0055] Specifically, in the P4 data plane, the actual mapped path of the virtual link is encapsulated into a new protocol header (such as the NV_SR virtual source routing protocol header mentioned below) and added to the data packet, which then contains the complete path information from the ingress node to the egress node.

[0056] P4 stands for Programming Protocol-Independent Packet Processors. This protocol does not require occupying or modifying existing protocol fields; it can directly encapsulate the mapping path of a virtual link into a new protocol header and add it to the data packet. By installing a flow table rule in the ingress node or ingress switch of the mapping path, each switch on the actual mapping path can directly obtain information from the data packet.

[0057] In some embodiments of this application, reference is made to Figure 2, in this application, the designed virtual source route protocol header (NV_SR) is immediately between the Ethernet header and the IP header, and it is mainly composed of a virtualization protocol header (NV Header) and a source route protocol extension header (SRExt Header).

[0058] The main function of the virtualization protocol header is to attach a virtual network label (VirtualNetwork ID, 32bit) to the network traffic, indicating the network slice to which the traffic belongs.

[0059] The core part of the source route protocol extension header consists of two fields. The first field TTL represents the lifecycle of the NV_SR protocol header. When a data packet carrying the NV_SR protocol header passes through a switch, the TTL field will be decremented by 1. When TTL equals 0, it means the source route task has been completed, and the NV_SR extension protocol header will be automatically popped. The second field is the Port field, and the TTL value also represents the number of Port fields the current packet has. Each Port field represents the egress port value of each switch that the data packet passes through on the planned path. When the data packet arrives at the switch, the switch will parse the value of the first Port field and then forward the data packet from that port. The maximum port value that the Port field can represent is 256, which can be applied to networks of any scale.

[0060] The network traffic configuration method further includes the step of: using the weighted round-robin algorithm to allocate the bandwidth requirements of the virtual links to different physical links according to the weight ratio, and the weight ratio can be the ratio of the bandwidth requirements of different virtual links, so as to achieve load balancing.

[0061] The specific steps of using the weighted round-robin algorithm include:

[0062] Allocate bandwidth weight values to each actual mapping path (hereinafter referred to as the mapping path) And initialize the number of data packets Count passing through this virtual link, with the default value being 0. First, a default alternative path (here it is PathList[0]) will be selected, and then all alternative mapping paths will be traversed in sequence. Assume there are two consecutive alternative mapping paths Path i and Path i+1 . If the Count value is less than Weight[i], directly select the mapping path Path i . If the Count value is between Weight[i] and Weight[i + 1], that is, Weight[i] < Count ≤ Weight[i + 1], then Path i+1The mapping path will be selected. When Count exceeds the weight of all mapping paths, i.e., Count > Weight[n], the value of Count will be reset to 0, and the default mapping path PathList[0] will be selected for forwarding.

[0063] The weighted round-robin algorithm can be implemented using the registers and match action table of the P4 programmable switch, and can be deployed at the entry node of the P4 programmable switch.

[0064] The network traffic configuration method also includes the following steps: using a dual-rate three-color marking method to limit the transmission rate of data packets on the physical link, thereby achieving bandwidth control and avoiding congestion of the physical network caused by the increase in bandwidth demand of the virtual network.

[0065] In some embodiments of this application, reference is made to Figure 3 Based on the principle of Two Rate Three Color Marker (trTCM), this method measures the data packet flow of the parsed virtual network traffic and classifies packets by color according to two parameters: Peak Information Rate (PIR) and Committed Information Rate (CIR). PIR represents the highest allowed data rate of the data flow, while CIR represents the lowest allowed rate. Different levels of processing are applied to packets of different colors using priority forwarding queues.

[0066] Specifically, data flows exceeding the PIR value are marked in red. Data flows between the PIR and CIR values ​​are marked in yellow. Data flows below the CIR value are marked in green; if a packet is marked in red, it is discarded. If marked in yellow, it is placed in a lower-priority forwarding queue. If marked in green, it is placed in an even lower-priority forwarding queue.

[0067] The CIR and PIR values ​​can be set according to the system's bandwidth resource control level. Assuming a path is allocated bandwidth resource value M, if bandwidth resource control requirements are strict, then CIR = PIR = M. If bandwidth resource control requirements are relatively lenient, allowing burst traffic to temporarily occupy the bandwidth of other virtual links, then CIR = M, PIR = M + Δ, where Δ is the user's tolerance for additional bandwidth consumption.

[0068] In one embodiment, the present invention provides a network traffic configuration device, comprising:

[0069] The acquisition module is used to acquire virtual network traffic configuration requests and physical network information; the virtual network includes multiple virtual links; the physical network includes multiple physical links; and it acquires the bandwidth requirements of the virtual links and the bandwidth capacity limits of the physical links.

[0070] The calculation module is used to obtain multiple actual mapping paths from virtual links to physical networks using a path splittable mapping algorithm; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual links and the bandwidth capacity limitations of the physical links.

[0071] The transmission module encapsulates information containing the actual mapping path in a data packet; the data packet can be transmitted along the actual mapping path.

[0072] In one embodiment, the present invention provides an electronic device, such as... Figure 4 As shown, the electronic device includes at least one processor and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the above-described network traffic configuration method.

[0073] The memory and processor are connected via a bus, which can include any number of interconnecting buses and bridges, connecting various circuits of one or more processors and memories. The bus can also connect various other circuits, such as peripheral devices, voltage regulators, and power management circuits, via interfaces, as is well known in the art. Interfaces provide a connection between the bus and the transceiver, such as communication interfaces or user interfaces. The transceiver can be a single component or multiple components, such as multiple receivers and transmitters, providing a unit for communicating with various other devices over a transmission medium. Data processed by the processor is transmitted over the wireless medium via an antenna, which further receives data and transmits it to the processor.

[0074] The processor manages the bus and general processing, and also provides various functions, including timing, peripheral interfaces, voltage regulation, power management, and other control functions. Memory is used to store data used by the processor during operation.

[0075] In one embodiment of the present invention, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the network traffic configuration method embodiment described above.

[0076] Those skilled in the art will understand from the foregoing description that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing related hardware. This program is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes, but is not limited to, various media capable of storing program code, such as USB flash drives, portable hard drives, magnetic storage devices, and optical storage devices.

[0077] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, or methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules / units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or units may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection of apparatuses or modules or units may be electrical, mechanical, or other forms.

[0078] The modules / units described as separate components may or may not be physically separate. The components shown as modules / units may or may not be physical modules; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules / units can be selected to achieve the objectives of the embodiments of this application, depending on actual needs. For example, the functional modules / units in the various embodiments of this application may be integrated into one processing module, or each module / unit may exist physically separately, or two or more modules / units may be integrated into one module / unit.

[0079] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0080] The descriptions of the processes or structures corresponding to the above figures each have their own emphasis. For parts of a process or structure that are not described in detail, please refer to the relevant descriptions of other processes or structures.

[0081] The above embodiments are merely illustrative of the principles and effects of this application and are not intended to limit this application. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of this application. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in this application should still be covered by the claims of this application.

Claims

1. A network traffic configuration method, characterized in that, Includes the following steps: Obtain a virtual network traffic configuration request, wherein the virtual network includes multiple virtual links; Obtain information about the physical network, which includes multiple physical links; Obtain the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical link; A path-segmentable mapping algorithm is used to map each virtual link to multiple actual mapping paths on the physical network; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical links. The information containing the actual mapping path is encapsulated in the data packet; The data packet can be transmitted along the actual mapped path.

2. The network traffic configuration method according to claim 1, characterized in that, The path splittable mapping algorithm is a path splittable mapping algorithm based on multi-commodity flow. The path splittable mapping algorithm for multi-commodity flow includes establishing an integer linear programming model and obtaining the optimal solution or feasible solution of the integer linear programming model.

3. The network traffic configuration method according to claim 2, characterized in that, The integer linear programming model includes defining an objective function and establishing constraints. The objective function is the function that minimizes the physical link bandwidth resources used to calculate the actual mapping path. The constraints include simultaneously satisfying the bandwidth requirements of the virtual link and the bandwidth capacity limit of the physical link.

4. The network traffic configuration method according to claim 1, characterized in that, It also includes the step of: using a weighted round-robin algorithm to allocate the bandwidth requirements of the virtual links to different physical links according to a weight ratio, wherein the weight ratio is the ratio of the bandwidth requirements of different virtual links.

5. The network traffic configuration method according to claim 1, characterized in that, It also includes the step of using a two-rate three-color marking method to limit the transmission rate of the data packet on the physical link.

6. A network traffic configuration device, characterized in that, include: The acquisition module is used to acquire the virtual network traffic configuration request and the physical network information; the virtual network includes multiple virtual links; the physical network includes multiple physical links; and to acquire the bandwidth requirements of the virtual links and the bandwidth capacity limits of the physical links. The calculation module is used to obtain multiple actual mapping paths from the virtual link to the physical network using a path splittable mapping algorithm; each actual mapping path includes multiple physical links connected in sequence, and the actual mapping path can simultaneously meet the bandwidth requirements of the virtual link and the bandwidth capacity limitations of the physical links. The transmission module encapsulates information containing the actual mapping path in a data packet; The data packet can be transmitted along the actual mapped path.

7. An electronic device, characterized in that, Includes at least one processor; and, A memory communicatively connected to the at least one processor; wherein, The memory stores instructions executable by the at least one processor, which, when executed by the at least one processor, enables the at least one processor to perform the network traffic configuration method as described in any one of claims 1 to 6.

8. A computer-readable storage medium storing a computer program, wherein, When the computer program is executed by a processor, it implements the network traffic configuration method as described in any one of claims 1 to 6.

Images