Multi-protocol label switching optimization method and device, equipment and storage medium

Abstract

The invention discloses a multi-protocol label switching optimization method and device, equipment and a storage medium, and relates to the technical field of network communication, and the method comprises the steps: obtaining current network flow data and network state data; obtaining a bandwidth utilization rate, a link utilization rate and a network traffic type according to the traffic data of the network; generating optimization parameters based on the network state data, the bandwidth utilization rate, the link utilization rate and the network flow type, wherein the optimization parameters comprise a label allocation table, a target forwarding path and a bandwidth adjustment instruction; and optimizing the multi-protocol label switching network according to the optimization parameters. According to the invention, the optimization of the multi-protocol label switching protocol is completed through intelligent label management, the technical problems of resource waste and congestion delay are solved, and the efficiency and flexibility of the multi-protocol label switching network are improved.

Description

Technical Field

[0001] The present application relates to the technical field of network communications, and in particular to a multi-protocol label switching optimization method, apparatus, device, and storage medium. Background Art

[0002] In current network communications technology, MPLS (Multi-Protocol Label Switching) technology, as a key packet forwarding mechanism, has been widely adopted in telecommunications and enterprise networks. MPLS uses labels to forward packets, significantly improving network forwarding efficiency and flexibility, providing a highly efficient data transmission path for network communications. However, with the continuous expansion of network scale and the increasing complexity of network applications, existing MPLS protocol applications have gradually exposed several problems. First, the MPLS label management and exchange process can lead to frequent label allocation and recycling, which not only wastes network resources but also increases the complexity of network management. Second, in large-scale network environments, traditional MPLS switches may not be able to effectively handle complex routing calculations, leading to network congestion and latency, seriously affecting network performance. Furthermore, existing MPLS networks are relatively rigid in bandwidth allocation and scheduling, lacking dynamic adjustment capabilities and unable to adapt to changing network demands. In the face of traffic bursts or peak traffic, existing MPLS networks often struggle to quickly adjust bandwidth resources, resulting in congestion on some links and idle resources on others, resulting in a waste of network resources.

[0003] Therefore, how to optimize the MPLS protocol to improve its network efficiency and flexibility is a problem that needs to be solved urgently. Summary of the Invention

[0004] The main purpose of this application is to provide a multi-protocol label switching optimization method, device, equipment and storage medium, aiming to solve the technical problem of how to optimize the MPLS protocol to improve its network efficiency and flexibility.

[0005] To achieve the above objectives, the present application proposes a multi-protocol label switching optimization method, the method comprising:

[0006] Get current network traffic data and network status data;

[0007] Obtaining bandwidth utilization, link utilization, and network traffic type based on the network traffic data;

[0008] generating optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction;

[0009] The multi-protocol label switching network is optimized according to the optimization parameters.

[0010] In one embodiment, the step of generating optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type includes:

[0011] Perform intelligent label allocation according to the network traffic type to obtain a label allocation table;

[0012] Performing routing calculations using a preset learning model based on the link utilization and the network status data to obtain a target forwarding path;

[0013] Dynamic bandwidth scheduling is performed according to the bandwidth usage rate to obtain a bandwidth adjustment instruction.

[0014] In one embodiment, the step of performing intelligent label allocation according to the network traffic type to obtain a label allocation table includes:

[0015] Acquire historical traffic data and a label pool, wherein the label pool includes a data traffic pool and a control traffic pool;

[0016] Matching the network traffic type with the label pool to obtain a type priority;

[0017] The historical traffic data and the type priority are analyzed according to a preset label allocation strategy to obtain a label allocation table.

[0018] In one embodiment, the step of performing routing calculation based on the link utilization and the network status data using a preset learning model to obtain a target forwarding path includes:

[0019] Obtaining network delay and packet loss rate according to the network status data;

[0020] Inputting the link utilization, the network delay, and the packet loss rate into a preset learning model to obtain an updated routing table;

[0021] A target forwarding path is obtained by selecting from the updated routing table according to a preset positive feedback reward selection strategy.

[0022] In one embodiment, the bandwidth adjustment instruction includes a first bandwidth adjustment instruction and a second bandwidth adjustment instruction, and the step of performing dynamic bandwidth scheduling processing according to the bandwidth usage rate to obtain the bandwidth adjustment instruction includes:

[0023] Obtaining a first load link according to the bandwidth usage rate and a preset load threshold, wherein the first load link is a link whose bandwidth usage rate is greater than the preset bandwidth usage rate threshold;

[0024] Analyzing the first load link according to a preset load balancing strategy to obtain a first bandwidth adjustment instruction;

[0025] The traffic trend of the first load link is predicted according to a preset bandwidth prediction strategy to obtain a second bandwidth adjustment instruction.

[0026] In one embodiment, the step of optimizing the MPLS network according to the optimization parameters includes:

[0027] Allocating a label to an initial data packet entering the switch according to the label allocation table to obtain a target data packet;

[0028] The target data packet with the label is forwarded according to the target forwarding path, and during the forwarding process, the bandwidth of each link in the multi-protocol label switching network is adjusted according to the bandwidth adjustment instruction.

[0029] In one embodiment, the step of forwarding the target data packet with the label according to the target forwarding path includes:

[0030] After the forwarding is successful, monitoring the usage status and connection duration of the label corresponding to the target data packet;

[0031] When the connection duration is less than the first connection time and the usage state is an idle state, recycling the label to a label pool;

[0032] When the connection duration is greater than or equal to the first connection time and less than or equal to the second connection time, recording the idle time in the idle state according to the holding timer, and recycling the label to the label pool when the idle time exceeds the preset recycling time;

[0033] When the connection duration is greater than the second connection time, the tag is recycled to the tag pool according to a hierarchical delayed recycling strategy, wherein the hierarchical delayed recycling strategy is a strategy that extends the preset recycling duration according to an increase in tag priority.

[0034] In addition, to achieve the above objectives, the present application also proposes an optimization device for multi-protocol label switching, the device comprising:

[0035] Network monitoring module, used to obtain current network traffic data and network status data;

[0036] A data processing module, configured to obtain bandwidth utilization, link utilization, and network traffic type based on the network traffic data;

[0037] an optimization construction module, configured to generate optimization parameters based on the network status data, the bandwidth utilization, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction;

[0038] The network optimization module is used to optimize the multi-protocol label switching network according to the optimization parameters.

[0039] In addition, to achieve the above-mentioned objectives, the present application also proposes an optimization device for multi-protocol label switching, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the multi-protocol label switching optimization method as described above.

[0040] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and stores a computer program on the storage medium. When the computer program is executed by a processor, the steps of the optimization method of multi-protocol label switching as described above are implemented.

[0041] In addition, to achieve the above-mentioned object, the present application also provides a computer program product, which includes a computer program. When the computer program is executed by a processor, the steps of the multi-protocol label switching optimization method as described above are implemented.

[0042] The present application provides a method for optimizing multi-protocol label switching, the method of the present application includes: obtaining current network traffic data and network status data; obtaining bandwidth utilization, link utilization and network traffic type based on the network traffic data; generating optimization parameters based on the network status data, the bandwidth utilization, the link utilization and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path and a bandwidth adjustment instruction; optimizing the multi-protocol label switching network according to the optimization parameters. In summary, the present application completes the optimization of the multi-protocol label switching protocol through intelligent label management, solves the technical problems of resource waste and congestion delay, and improves the efficiency and flexibility of the multi-protocol label switching network. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0044] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0045] Figure 1 A flowchart of the first embodiment of the optimization method for multi-protocol label switching of the present application is provided;

[0046] Figure 2 A flowchart of the second embodiment of the optimization method for multi-protocol label switching of the present application is provided;

[0047] Figure 3 A flowchart of the third embodiment of the multi-protocol label switching optimization method provided in this application;

[0048] Figure 4 This is a schematic diagram of the module structure of the optimization device for multi-protocol label switching according to an embodiment of the present application;

[0049] Figure 5 This is a schematic diagram of the device structure of the hardware operating environment involved in the optimization method of multi-protocol label switching in the embodiment of the present application.

[0050] The purpose, features and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0051] It should be understood that the specific embodiments described herein are merely used to explain the technical solutions of the present application and are not intended to limit the present application.

[0052] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0053] The main solution of the embodiment of the present application is: obtaining current network traffic data and network status data; obtaining bandwidth utilization, link utilization and network traffic type based on the network traffic data; generating optimization parameters based on the network status data, the bandwidth utilization, the link utilization and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path and a bandwidth adjustment instruction; and optimizing the multi-protocol label switching network according to the optimization parameters.

[0054] In the current field of network communications, MPLS technology, as a key packet forwarding mechanism, has been widely adopted in telecommunications and enterprise networks. MPLS uses labels to forward packets, significantly improving network forwarding efficiency and flexibility, providing an efficient data transmission path for network communications. However, with the continuous expansion of network scale and the increasing complexity of network applications, existing MPLS protocol applications have gradually exposed some problems. First, the MPLS label management and exchange process can lead to frequent label allocation and recycling, which not only wastes network resources but also increases the complexity of network management. Second, in large-scale network environments, traditional MPLS switches may not be able to effectively handle complex routing calculations, leading to network congestion and latency, seriously affecting network performance. Furthermore, existing MPLS networks are relatively rigid in bandwidth allocation and scheduling, lacking dynamic adjustment capabilities and unable to adapt to changing network demands. In the face of traffic bursts or peak traffic, existing MPLS networks often have difficulty quickly adjusting bandwidth resources, resulting in congestion on some links and idle resources on others, resulting in a waste of network resources. Therefore, optimizing the MPLS protocol to improve its network efficiency and flexibility is an urgent issue that needs to be addressed.

[0055] It should be noted that the execution entity of this embodiment may be an MPLS optimization system, a computing service device with data processing, network communication, and program execution capabilities, or an electronic device capable of implementing the MPLS optimization functions described above, and this embodiment is not particularly limited thereto. This embodiment and the following embodiments will be described using an MPLS optimization system as an example.

[0056] Based on this, the embodiment of the present application provides an optimization method for multi-protocol label switching, referring to Figure 1 , Figure 1 This is a flowchart of the first embodiment of the optimization method for multi-protocol label switching of the present application.

[0057] In this embodiment, the MPLS optimization method includes steps S10 to S40:

[0058] Step S10: Acquire current network traffic data and network status data.

[0059] It should be noted that this step is implemented using a traffic monitoring system and network status monitoring tools deployed within the network. The traffic monitoring system collects real-time traffic data from each link in the network, including but not limited to data packet transmission volume, data packet reception volume, and transmission rate. Simultaneously, the network status monitoring tool collects key status information such as network latency, packet loss rate, and bandwidth usage. This data is transmitted to the central processing unit via a pre-defined interface or protocol for subsequent analysis and processing.

[0060] Additionally, it's important to note that network traffic data refers to information such as the total volume, rate, and direction of data packets transmitted across the network, reflecting network load. Network status data refers to key status information such as latency, packet loss rate, and bandwidth usage, reflecting network health and performance.

[0061] Step S20: Obtaining bandwidth utilization, link utilization, and network traffic type according to the network traffic data.

[0062] It should be noted that bandwidth utilization refers to the ratio of the amount of data transmitted on the current link to the total bandwidth of the link, reflecting the load of the link. Link utilization refers to the busyness of the link in a specific time period, which is usually obtained by calculating the ratio of the amount of data transmitted on the link in a specific time period to the total bandwidth of the link. In this step, the system will calculate the bandwidth utilization of each link through the network traffic data, that is, the ratio of the amount of data transmitted on the current link to the total bandwidth of the link. At the same time, the system will also analyze the utilization of the link, that is, the busyness of the link in a certain period of time. In addition, the system will also classify the network traffic according to the characteristics of the traffic data (such as source IP, destination IP, port number, etc.) to obtain different types of network traffic.

[0063] Step S30: generating optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type, wherein the optimization parameters include a label allocation table, a target forwarding path, and a bandwidth adjustment instruction.

[0064] It should be noted that in this step, the system generates optimization parameters by comprehensively analyzing network status data, bandwidth utilization, link utilization, and network traffic type. Specifically, the system calculates a label allocation table based on this data, determining which label each packet should carry and how it should be forwarded. Simultaneously, the system utilizes intelligent routing algorithms (such as deep learning or reinforcement learning) to dynamically select the optimal forwarding path and generate a target forwarding path. Furthermore, the system generates bandwidth adjustment instructions based on bandwidth utilization and link utilization to dynamically adjust bandwidth resources. For example, if analysis reveals that the bandwidth utilization of a link is excessively high and the link primarily transmits data traffic, the generated optimization parameters may include: adjusting the label allocation table to reduce the number of labels allocated to that link; selecting a link with lower latency and more sufficient bandwidth as the target forwarding path; and issuing bandwidth adjustment instructions to increase the bandwidth of that link or reduce the bandwidth of other non-critical links.

[0065] Additionally, it's important to note that the label allocation table refers to the table or set of rules that determines which label each packet should carry and how it should be forwarded. The target forwarding path refers to the optimal forwarding path dynamically selected by the system using an intelligent routing algorithm to guide packet forwarding. Bandwidth adjustment instructions refer to the instructions or set of rules generated by the system to dynamically adjust bandwidth resources based on bandwidth usage and link utilization.

[0066] Step S40: Optimizing the MPLS network according to the optimization parameters.

[0067] It's important to note that in this step, the system applies the generated optimization parameters to the MPLS network to optimize it. Specifically, the system distributes the label allocation table to each MPLS device, instructing it on how to assign labels and forward packets. Simultaneously, the system also distributes target forwarding paths and bandwidth adjustment instructions to the relevant devices, guiding them on how to select the optimal forwarding path and adjust bandwidth resources.

[0068] In a feasible implementation manner, the step S40 specifically includes:

[0069] Step S401: allocating a label to an initial data packet entering the switch according to the label allocation table to obtain a target data packet.

[0070] It should be noted that when a data packet (i.e., the initial data packet) enters an MPLS switch, the switch first checks the packet header information, including the source IP address and destination IP address. The switch searches for the label corresponding to the destination address / prefix of the data packet based on a preset label allocation table. The label allocation table is dynamically generated based on optimization parameters such as network traffic data, bandwidth utilization, link utilization, and network traffic type, aiming to improve label utilization and reduce resource consumption. After the switch assigns a label to the data packet, it adds the label to the data packet header, forming a labeled target data packet. The label serves as the identity of the data packet in the MPLS network and is used to guide the subsequent data packet forwarding process. It can be understood that the purpose of this step is to assign a label to the data packet entering the MPLS network so that it can be efficiently forwarded based on the label. Through an intelligent label allocation mechanism, label conflicts and frequent allocation and recovery operations can be reduced, thereby reducing resource waste.

[0071] It's important to note that the initial packet is the unlabeled packet that enters the MPLS switch and typically contains basic information such as the source and destination IP addresses. The target packet is the packet with a label added to the initial packet, allowing for efficient forwarding within the MPLS network.

[0072] Step S402: forwarding the target data packet with the label according to the target forwarding path, and adjusting the bandwidth of each link in the MPLS network according to the bandwidth adjustment instruction during the forwarding process.

[0073] It should be noted that MPLS switches forward labeled target packets according to the target forwarding path. The target forwarding path is the optimal path selected by an AI algorithm to reduce network latency and congestion. During the forwarding process, the MPLS switch dynamically adjusts the bandwidth of each link based on bandwidth adjustment instructions. Bandwidth adjustment instructions are generated based on real-time traffic monitoring and network status analysis to ensure optimal bandwidth resource allocation. When the packet reaches the next MPLS switch, it continues forwarding according to the label and target forwarding path, and may adjust the link bandwidth based on new bandwidth adjustment instructions.

[0074] As you can see, this step efficiently forwards labeled target packets based on the target forwarding path and bandwidth adjustment instructions, dynamically adjusting the bandwidth of each link during the forwarding process. Through intelligent routing calculation and dynamic bandwidth scheduling, network latency and congestion can be reduced, improving network performance.

[0075] This embodiment provides a method for optimizing multi-protocol label switching, which includes: obtaining current network traffic data and network status data; obtaining bandwidth utilization, link utilization, and network traffic type based on the network traffic data; generating optimization parameters based on the network status data, the bandwidth utilization, the link utilization, and the network traffic type, wherein the optimization parameters include a label allocation table, a target forwarding path, and a bandwidth adjustment instruction; and optimizing the multi-protocol label switching network based on the optimization parameters. In summary, this embodiment achieves multi-protocol label switching protocol optimization through intelligent label management, solves the technical problems of resource waste and congestion delay, and improves the efficiency and flexibility of the multi-protocol label switching network.

[0076] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above embodiment 1 can be referred to the above introduction and will not be described in detail later. Figure 2 , Figure 2 This is a flow chart of the second embodiment of the optimization method for multi-protocol label switching of the present application, wherein step S30 specifically includes:

[0077] Step S301: Execute intelligent label allocation according to the network traffic type to obtain a label allocation table.

[0078] It should be noted that in this step, the system will classify traffic according to network traffic type, such as data traffic and control traffic. Data traffic usually includes user Internet access, file transfer, etc., while control traffic includes key control protocols such as OSPF (Open Shortest Path First), BGP (Border Gateway Protocol), etc. Next, the system will use an intelligent algorithm based on load and traffic prediction to allocate labels. The algorithm will determine the allocation of labels in advance based on the status of the network (such as bandwidth usage, latency, etc.) and historical traffic data to avoid label conflicts and frequent allocation and recycling operations. Finally, the system will record the allocated label and its corresponding destination address / prefix in the label allocation table for subsequent data packet forwarding.

[0079] Step S302: performing routing calculations based on the link utilization and the network status data through a preset learning model to obtain a target forwarding path.

[0080] It should be noted that in this step, the system will first extract network status data, including network status information such as utilization, latency, and packet loss rate of each link. Then, the system will input the extracted network status data into a preset learning model for processing. The learning model can be an AI routing calculation model based on deep learning or reinforcement learning, which is used to dynamically select the optimal forwarding path. In the learning model, the system will train the model based on real-time network status and historical network traffic data so that it can learn the optimal routing strategy. Finally, the system will output the target forwarding path through the learning model and dynamically update the routing table so that the optimal target forwarding path can be selected for subsequent data packet forwarding.

[0081] It is understandable that the role of this step is to reduce network latency and avoid network congestion by dynamically selecting the optimal forwarding path, thereby improving the forwarding efficiency and reliability of the MPLS network.

[0082] Step S303: performing dynamic bandwidth scheduling according to the bandwidth usage rate to obtain a bandwidth adjustment instruction.

[0083] It should be noted that bandwidth adjustment instructions refer to instructions used to dynamically adjust the bandwidth of each link in the MPLS network, including bandwidth reallocation parameters, effective timestamps, and execution switch ID lists. Dynamic bandwidth scheduling refers to ensuring that the bandwidth of controlled traffic is not compressed (such as a minimum guarantee of 20% for OSPF traffic) through priority strategies. Specifically, in this step, the system will dynamically adjust bandwidth resources based on bandwidth utilization and the preset bandwidth scheduling algorithm. For example, when the traffic on a certain link is at a peak, the system can increase the bandwidth of the link according to the traffic prediction algorithm, or transfer part of the traffic to other low-load links. At the same time, the system also uses a prediction model to predict future traffic trends and adjust bandwidth allocation in advance to avoid the occurrence of bandwidth bottlenecks. Finally, the system will generate bandwidth adjustment instructions based on the bandwidth adjustment requirements and send them to the corresponding MPLS switches for execution.

[0084] It is understandable that the purpose of this step is to dynamically adjust bandwidth resources according to changes in network traffic and demand, thereby avoiding waste or shortage of bandwidth resources and optimizing the performance of the MPLS network.

[0085] In a feasible implementation manner, step S301 specifically includes:

[0086] Step A10: Acquire historical traffic data and a label pool, where the label pool includes a data traffic pool and a control traffic pool.

[0087] It should be noted that in this step, the system collects historical traffic data (including bandwidth utilization, latency, packet loss rate, and traffic time distribution) through the built-in traffic monitoring module and loads label resources from a pre-configured multi-level label pool. The data traffic pool is used to handle common data services (such as file transfers and web page access), while the control traffic pool is dedicated to critical control protocols (such as BGP / OSPF signaling). Furthermore, it should be noted that the label pool refers to the resource pool used to store and manage MPLS labels, which can be divided into a data traffic pool and a control traffic pool based on traffic type.

[0088] Step A20: Match the network traffic type with the label pool to obtain a type priority.

[0089] It should be noted that in this step, the system will match the acquired network traffic type (such as data traffic, control traffic, etc.) with the preset label pool. During the matching process, the system will assign different priorities to different types of traffic based on factors such as the importance of the traffic type and real-time requirements. In addition, it should be noted that type priority refers to the priority assigned to different types of traffic based on factors such as the importance of the traffic type and real-time requirements. Traffic with high priority will be given priority when allocating labels. For example, it is specifically divided into: First priority (highest): control protocol traffic (such as routing updates), forcibly assigning control traffic pool labels. Second priority (medium): real-time business traffic (such as video conferencing), dynamically assigning data traffic pool labels according to bandwidth margin. Third priority (basic): ordinary data traffic (such as file downloads), assigning labels when resources are sufficient.

[0090] Step A30: Analyze the historical traffic data and the type priority according to a preset label allocation strategy to obtain a label allocation table.

[0091] It should be noted that the preset label allocation strategy refers to the rules or algorithms for label allocation pre-set by the system, including load-based allocation, traffic prediction-based allocation, priority-based allocation and other methods. In this step, the system will call the preset intelligent allocation strategy (combined with the AI ​​prediction model), input historical traffic data and type priority, and predict the traffic trend (such as a 20% increase in bandwidth demand) in the future (such as 5 minutes) through the long-short time neural network model. At the same time, labels are allocated according to priority order, and fixed reserved labels of the control traffic pool are allocated first for the first priority type of traffic. The extended label pool resources are dynamically allocated for the second priority type of traffic (labels are reserved according to predicted demand), and the remaining labels are allocated to the third priority type of traffic. Finally, a label allocation table is generated (recording label ID, binding flow characteristics, and validity period).

[0092] It is understandable that this step can achieve intelligent label allocation, improve label utilization, and reduce label conflicts and resource consumption.

[0093] In a feasible implementation manner, step S302 specifically includes:

[0094] Step B10: Obtaining network delay and packet loss rate according to the network status data.

[0095] It's important to note that network latency refers to the time it takes for a data packet to travel from source to destination, while packet loss rate refers to the percentage of packets lost during network transmission. In this step, the system collects network-wide switch status data (including link bandwidth utilization, queue depth, packet transmission timestamps, etc.). Network latency is calculated by analyzing the time difference between ingress and egress packet transmissions. The packet loss rate is calculated by periodically comparing the packet sequence numbers at the sender and receiver, and counting the number of lost packets as a percentage of the total number of packets sent.

[0096] Step B20: Input the link utilization, the network delay, and the packet loss rate into a preset learning model to obtain an updated routing table.

[0097] It's important to note that in this step, the system normalizes the input link utilization, network latency, and packet loss rate (e.g., compressing the values ​​to the range [0, 1]). This processed data is then fed into a pre-set reinforcement learning model, which outputs a score for each candidate path. For example, the reward function can be defined as: reward = bandwidth utilization weight × utilization + latency weight × (1 / latency) + packet loss weight × (1-packet loss rate). Finally, the system generates an updated routing table based on the paths' scores, sorted by order.

[0098] In addition, it should be noted that the preset learning model refers to a reinforcement learning model trained through historical network data, while the routing table is a table that records the routing information between each node in the network, which is used to guide the forwarding path of data packets in the network.

[0099] Step B30: Selecting a target forwarding path from the updated routing table according to a preset positive feedback reward selection strategy.

[0100] It should be noted that the preset positive feedback reward selection strategy refers to a system-defined strategy or algorithm for selecting the target forwarding path from the updated routing table. For example, if the actual transmission delay of the selected path is below a threshold, a positive feedback reward (such as a score of +0.1) is added to the path. If the path is congested (packet loss rate >5%), a negative feedback penalty (a score of -0.2) is applied. Finally, the path with the highest cumulative score is determined as the target forwarding path.

[0101] Additionally, it's important to note that the system extracts the top N highest-scoring paths (N ≥ 1) from the updated routing table as the target forwarding path. As you can see, to avoid potential network bottlenecks caused by a single path, the system supports multi-path selection. This means that when traffic is high, the system automatically distributes traffic across multiple paths to ensure network load balancing.

[0102] In a feasible implementation manner, step S303 specifically includes:

[0103] Step C10: obtaining a first load link according to the bandwidth usage rate and a preset load threshold, wherein the first load link is a link whose bandwidth usage rate is greater than the preset bandwidth usage rate threshold.

[0104] It should be noted that in this step, the system first monitors the bandwidth utilization of each link in real time and compares this utilization with a preset bandwidth utilization threshold. First-load links are those whose bandwidth utilization exceeds the preset threshold, i.e., links with a high current load. Specifically, the system uses the traffic monitoring module to collect real-time bandwidth utilization data for each link, compares the collected bandwidth utilization with the preset threshold, and marks all links whose bandwidth utilization exceeds the threshold. These links are designated as first-load links.

[0105] In addition, it should be noted that the preset bandwidth usage threshold is a value set based on the actual needs and performance requirements of the network and is used to determine whether a link is overloaded. The threshold can be adjusted based on factors such as network conditions and business needs.

[0106] Step C20: Analyze the first load link according to a preset load balancing strategy to obtain a first bandwidth adjustment instruction.

[0107] It should be noted that after identifying the first load links, the system analyzes these links based on the preset load balancing policy to determine how to adjust the bandwidth of these links to achieve load balancing. Specifically, the system reads the preset load balancing policy, which includes information such as the amount of bandwidth to be increased or decreased and the time required for adjustment. The system analyzes the first load links to determine the current load status and demand of each link. Based on the load balancing policy, the system calculates the bandwidth required to be adjusted for each link and generates a first bandwidth adjustment instruction.

[0108] It can be understood that the purpose of this step is to reasonably adjust the bandwidth of the first load link (i.e., the high-load link) through the load balancing strategy to ensure that the load in the network can be evenly distributed, avoid the situation where some links are overloaded while other links are idle, and improve the overall performance and stability of the network.

[0109] Step C30: Predicting the traffic trend of the first load link according to a preset bandwidth prediction strategy to obtain a second bandwidth adjustment instruction.

[0110] It should be noted that in this step, the system will not only monitor the bandwidth utilization rate of the link in real time, but will also predict the future traffic trend of the first load link based on the preset bandwidth prediction strategy, so as to adjust the bandwidth in advance and avoid possible network congestion or delays in the future. Specifically, the system will read the preset bandwidth prediction strategy, which includes a prediction model based on historical traffic data. The future traffic trend of the first load link is predicted based on the prediction model to obtain the bandwidth demand in the future. The second bandwidth adjustment instruction (i.e., adjustment time, adjustment bandwidth amount) that needs to be adjusted is generated based on the bandwidth demand.

[0111] This embodiment achieves comprehensive optimization of intelligent label allocation, dynamic route calculation, and dynamic bandwidth scheduling. Specifically, by intelligently assigning labels based on network traffic type, dynamically calculating the optimal forwarding path based on link utilization and network status data, and performing dynamic bandwidth scheduling based on bandwidth usage, this solves the problems of inefficient label management, network congestion and latency, and inflexible bandwidth allocation in traditional MPLS protocols. This improves network resource utilization, forwarding efficiency, and reliability, thereby optimizing overall network performance.

[0112] Based on the first and second embodiments of the present application, in the third embodiment of the present application, the same or similar contents as those in the first and second embodiments can be referred to above and will not be described in detail. Figure 3 , Figure 3 This is a flow chart of the third embodiment of the optimization method for multi-protocol label switching of the present application. After the step of forwarding the target data packet with the label according to the target forwarding path, the method further includes:

[0113] Step D10: After the forwarding is successful, the usage status and connection duration of the label corresponding to the target data packet are monitored.

[0114] It should be noted that after the system successfully forwards a target packet with a label, it activates a monitoring mechanism to track the label's usage status (e.g., whether it is active and whether any packets are being forwarded with the label) and the connection duration (i.e., the time elapsed from label assignment to the current moment) in real time. Furthermore, it should be noted that the usage status refers to whether the label is currently being used by a packet, i.e., whether it is active or idle. Active status indicates that a packet is being forwarded with the label, while idle status indicates that no packet is carrying the label.

[0115] Step D20: When the connection duration is less than the first connection time and the usage state is an idle state, the label is recycled to the label pool.

[0116] It should be noted that the first connection time is a threshold set based on actual network conditions and resource management requirements, used to determine whether a tag should be recycled. During this step, the system checks the connection duration and usage status of each tag in real time. If a tag's connection duration is less than the first connection time and its usage status is idle, the system marks the tag as recyclable. The system removes the tag from its current usage and returns it to the tag pool for subsequent allocation.

[0117] It is understandable that the purpose of this step is to promptly recycle idle tags with short connection times, release tag resources, avoid resource waste, and improve tag utilization.

[0118] Step D30: When the connection duration is greater than or equal to the first connection time and less than or equal to the second connection time, the idle time in the idle state is recorded according to the timer, and when the idle time exceeds the preset recycling time, the label is recycled to the label pool.

[0119] It should be noted that the retention timer is a tool or mechanism used by the system to record the idle time of the label. The second connection time and the preset recycling time are also thresholds set according to the actual network conditions and resource management requirements, which are used to manage label resources more finely, where the second connection time is greater than the first connection time. In this step, the system sets a retention timer for each label to record the idle time of the label. When the connection time of the label is between the first connection time and the second connection time, the system starts the retention timer and starts recording the idle time. When the idle time exceeds the preset recycling time, the system marks the label as recyclable and recycles it to the label pool.

[0120] It is understandable that the role of this step is to provide more refined management for tags that have a long connection time but are temporarily idle, to avoid premature recycling that leads to insufficient resources, and to prevent waste of resources caused by long-term idleness.

[0121] Step D40: When the connection duration is greater than the second connection time, the tag is recycled to the tag pool according to a hierarchical delayed recycling strategy, wherein the hierarchical delayed recycling strategy is a strategy that extends the preset recycling duration according to an increase in tag priority.

[0122] It should be noted that in this step, when the connection duration of the tag is monitored to be greater than the preset second connection time, the system will recycle the tag to the tag pool according to the hierarchical delayed recycling strategy. The hierarchical delayed recycling strategy is a strategy that extends the preset recycling duration as the tag priority increases, that is, the higher the priority of the tag, the longer its recycling duration. For example, suppose that the system monitors that the connection duration of tag Z is 35 minutes, which is greater than the preset second connection time of 30 minutes. If the priority of tag Z is high, according to the hierarchical delayed recycling strategy, its recycling duration will be set to 10 minutes (the recycling duration of low-priority tags is 5 minutes). Then when the connection duration of tag Z reaches 35 minutes, the system will not immediately perform the recycling operation, but will wait until 40 minutes (30 minutes + 10 minutes recycling duration) before recycling.

[0123] In this embodiment, by monitoring the usage status and connection duration of the label corresponding to the target data packet and implementing intelligent label recycling strategies (including immediate recycling, recycling based on a hold timer, and hierarchical delayed recycling) according to different duration ranges and idle states, dynamic and efficient management of label resources is achieved. This solves the resource waste problem caused by the inflexible recycling mechanism in traditional MPLS label management, improves the label reuse rate and the overall utilization efficiency of network resources.

[0124] This application also provides an optimization device for multi-protocol label switching, please refer to Figure 4 , the multi-protocol label switching optimization device includes:

[0125] Network monitoring module 10, used to obtain current network traffic data and network status data;

[0126] A data processing module 20 is configured to obtain bandwidth utilization, link utilization, and network traffic type based on the network traffic data;

[0127] an optimization construction module 30, configured to generate optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction;

[0128] The network optimization module 40 is configured to optimize the MPLS network according to the optimization parameters.

[0129] The MPLS optimization device provided in this application, employing the MPLS optimization method described in the aforementioned embodiments, can address the technical problem of optimizing the MPLS protocol to improve its network efficiency and flexibility. Compared to the prior art, the MPLS optimization device provided in this application achieves the same beneficial effects as the MPLS optimization method described in the aforementioned embodiments. Other technical features of the MPLS optimization device are the same as those disclosed in the aforementioned embodiments and are not further elaborated upon here.

[0130] In one embodiment, the optimization construction module 30 is further used to perform intelligent label allocation according to the network traffic type to obtain a label allocation table; perform routing calculation through a preset learning model according to the link utilization and the network status data to obtain a target forwarding path; and perform dynamic bandwidth scheduling processing according to the bandwidth usage to obtain a bandwidth adjustment instruction.

[0131] In one embodiment, the optimization construction module 30 is also used to obtain historical traffic data and a label pool, wherein the label pool includes a data traffic pool and a control traffic pool; match the network traffic type with the label pool to obtain a type priority; and analyze the historical traffic data and the type priority according to a preset label allocation strategy to obtain a label allocation table.

[0132] In one embodiment, the optimization construction module 30 is further used to obtain network delay and packet loss rate based on the network status data; input the link utilization, the network delay and the packet loss rate into a preset learning model to obtain an updated routing table; and select a target forwarding path from the updated routing table according to a preset positive feedback reward selection strategy.

[0133] In one embodiment, the optimization construction module 30 is further used to obtain a first load link based on the bandwidth utilization rate and a preset load threshold, where the first load link is a link whose bandwidth utilization rate is greater than the preset bandwidth utilization rate threshold; analyze the first load link according to a preset load balancing strategy to obtain a first bandwidth adjustment instruction; and predict the traffic trend of the first load link according to a preset bandwidth prediction strategy to obtain a second bandwidth adjustment instruction.

[0134] In one embodiment, the network optimization module 40 is further configured to assign a label to an initial data packet entering the switch according to the label assignment table to obtain a target data packet; forward the target data packet with the label according to the target forwarding path, and adjust the bandwidth of each link in the multi-protocol label switching network according to the bandwidth adjustment instruction during the forwarding process.

[0135] In one embodiment, the network optimization module 40 is further used to monitor the usage status and connection duration of the label corresponding to the target data packet after forwarding is successful; when the connection duration is less than the first connection time and the usage status is an idle state, the label is recycled to the label pool; when the connection duration is greater than or equal to the first connection time and less than or equal to the second connection time, the idle time in the idle state is recorded according to the maintenance timer, and when the idle time exceeds the preset recycling duration, the label is recycled to the label pool; when the connection duration is greater than the second connection time, the label is recycled to the label pool according to a hierarchical delayed recycling strategy, and the hierarchical delayed recycling strategy is a strategy that extends the preset recycling duration according to the increase of the label priority.

[0136] The present application provides a multi-protocol label switching (MPLS) optimization device, comprising: 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, and the instructions are executed by the at least one processor to enable the at least one processor to perform the MPLS optimization method of the first embodiment described above.

[0137] Reference below Figure 5 , which shows a schematic diagram of the structure of an optimization device for multi-protocol label switching (MPLS) suitable for implementing the embodiments of the present application. The optimization device for MPLS in the embodiments of the present application may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 5 The MPLS optimization device shown is merely an example and should not limit the functions and scope of use of the embodiments of the present application.

[0138] like Figure 5As shown, the MPLS optimization device may include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes based on a program stored in a ROM (Read Only Memory) 1002 or a program loaded from a storage device 1003 into a RAM (Random Access Memory) 1004. RAM 1004 also stores various programs and data required for the operation of the MPLS optimization device. Processing device 1001, ROM 1002, and RAM 1004 are connected to each other via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems may be connected to I / O interface 1006: input device 1007 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output device 1008 including, for example, an LCD (Liquid Crystal Display), speaker, vibrator, etc.; storage device 1003 including, for example, a magnetic tape, hard disk, etc.; and communication device 1009. Communication device 1009 may allow the MPLS optimization device to communicate with other devices wirelessly or wired to exchange data. While the MPLS optimization device is shown with various systems, it should be understood that not all of the illustrated systems are required to be implemented or present. More or fewer systems may alternatively be implemented or present.

[0139] In particular, according to the embodiments disclosed in the present application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments disclosed in the present application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program comprising program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network via a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0140] The MPLS optimization device provided in this application, employing the MPLS optimization method described in the aforementioned embodiment, can address the technical problem of optimizing the MPLS protocol to improve its network efficiency and flexibility. Compared to the prior art, the MPLS optimization device provided in this application achieves the same beneficial effects as the MPLS optimization method described in the aforementioned embodiment. Other technical features of the MPLS optimization device are the same as those disclosed in the aforementioned embodiment and are not further elaborated upon here.

[0141] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

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

[0143] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, a computer program) stored thereon, wherein the computer-readable program instructions are used to execute the multi-protocol label switching optimization method in the above-mentioned embodiment.

[0144] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, RAM (Random Access Memory), ROM (Read Only Memory), EPROM (Erasable Programmable Read Only Memory or Flash memory), optical fiber, CD-ROM (CD-Read Only Memory, portable compact disk read-only memory), optical storage device, magnetic storage device, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0145] The computer-readable storage medium may be included in the MPLS optimization device; or may exist independently without being assembled into the MPLS optimization device.

[0146] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by a multi-protocol label switching (MPLS) optimization device, the MPLS optimization device: obtains current network traffic data and network status data; obtains bandwidth utilization, link utilization, and network traffic type based on the network traffic data; generates optimization parameters based on the network status data, the bandwidth utilization, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction; and optimizes the MPLS network based on the optimization parameters.

[0147] The computer program code for performing the operations of the present application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer can be connected to the user's computer through any type of network, including a LAN (Local Area Network) or a WAN (Wide Area Network), or can be connected to an external computer (e.g., using an Internet service provider to connect via the Internet).

[0148] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, program segment or a part of code, and the module, program segment or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order than that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0149] The modules described in the embodiments of the present application may be implemented in software or hardware, wherein the name of a module does not necessarily limit the unit itself.

[0150] The computer-readable storage medium provided in this application stores computer-readable program instructions (i.e., a computer program) for executing the aforementioned multi-protocol label switching optimization method. This computer-readable storage medium addresses the technical problem of optimizing the MPLS protocol to improve its network efficiency and flexibility. Compared to the prior art, the beneficial effects of the computer-readable storage medium provided in this application are similar to those of the multi-protocol label switching optimization method provided in the aforementioned embodiments, and are not further elaborated here.

[0151] The present application also provides a computer program product, including a computer program, which implements the steps of the above-mentioned multi-protocol label switching optimization method when executed by a processor.

[0152] The computer program product provided in this application can solve the technical problem of optimizing the MPLS protocol to improve its network efficiency and flexibility. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as those of the multi-protocol label switching optimization method provided in the above-mentioned embodiment, and will not be further elaborated here.

[0153] The above description is only part of the embodiments of the present application and does not limit the patent scope of the present application. All equivalent structural transformations made by using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect application in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A multi-protocol label switching optimization method, characterized in that: The method comprises: Get current network traffic data and network status data; Obtaining bandwidth utilization, link utilization, and network traffic type based on the network traffic data; generating optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction; The multi-protocol label switching network is optimized according to the optimization parameters.

2. The method according to claim 1, wherein The step of generating optimization parameters based on the network status data, the bandwidth usage, the link utilization, and the network traffic type comprises: Perform intelligent label allocation according to the network traffic type to obtain a label allocation table; Performing routing calculations using a preset learning model based on the link utilization and the network status data to obtain a target forwarding path; Dynamic bandwidth scheduling is performed according to the bandwidth usage rate to obtain a bandwidth adjustment instruction.

3. The method according to claim 2, wherein The step of performing intelligent label allocation according to the network traffic type to obtain a label allocation table includes: Acquire historical traffic data and a label pool, wherein the label pool includes a data traffic pool and a control traffic pool; Matching the network traffic type with the label pool to obtain a type priority; The historical traffic data and the type priority are analyzed according to a preset label allocation strategy to obtain a label allocation table.

4. The method according to claim 2, wherein The step of performing routing calculation based on the link utilization and the network status data through a preset learning model to obtain a target forwarding path includes: Obtaining network delay and packet loss rate according to the network status data; Inputting the link utilization, the network delay, and the packet loss rate into a preset learning model to obtain an updated routing table; A target forwarding path is obtained by selecting from the updated routing table according to a preset positive feedback reward selection strategy.

5. The method according to claim 2, wherein The bandwidth adjustment instruction includes a first bandwidth adjustment instruction and a second bandwidth adjustment instruction. The step of performing dynamic bandwidth scheduling processing according to the bandwidth usage rate to obtain the bandwidth adjustment instruction includes: Obtaining a first load link according to the bandwidth usage rate and a preset load threshold, wherein the first load link is a link whose bandwidth usage rate is greater than the preset bandwidth usage rate threshold; Analyzing the first load link according to a preset load balancing strategy to obtain a first bandwidth adjustment instruction; The traffic trend of the first load link is predicted according to a preset bandwidth prediction strategy to obtain a second bandwidth adjustment instruction.

6. The method according to claim 1, wherein The step of optimizing the MPLS network according to the optimization parameters includes: Allocating a label to an initial data packet entering the switch according to the label allocation table to obtain a target data packet; The target data packet with the label is forwarded according to the target forwarding path, and during the forwarding process, the bandwidth of each link in the multi-protocol label switching network is adjusted according to the bandwidth adjustment instruction.

7. The method according to claim 6, wherein After the step of forwarding the target data packet with the label according to the target forwarding path, the method further includes: After the forwarding is successful, monitoring the usage status and connection duration of the label corresponding to the target data packet; When the connection duration is less than the first connection time and the usage state is an idle state, recycling the label to a label pool; When the connection duration is greater than or equal to the first connection time and less than or equal to the second connection time, recording the idle time in the idle state according to the holding timer, and recycling the label to the label pool when the idle time exceeds the preset recycling time; When the connection duration is greater than the second connection time, the tag is recycled to the tag pool according to a hierarchical delayed recycling strategy, wherein the hierarchical delayed recycling strategy is a strategy that extends the preset recycling duration according to an increase in tag priority.

8. A multi-protocol label switching optimization device, characterized in that: The device comprises: Network monitoring module, used to obtain current network traffic data and network status data; A data processing module, configured to obtain bandwidth utilization, link utilization, and network traffic type based on the network traffic data; an optimization construction module, configured to generate optimization parameters based on the network status data, the bandwidth utilization, the link utilization, and the network traffic type, the optimization parameters including a label allocation table, a target forwarding path, and a bandwidth adjustment instruction; The network optimization module is used to optimize the multi-protocol label switching network according to the optimization parameters.

9. A multi-protocol label switching optimization device, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the multi-protocol label switching optimization method according to any one of claims 1 to 7.

10. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the multi-protocol label switching optimization method according to any one of claims 1 to 7 are implemented.

Images