Link congestion scheduling methods, devices, equipment, media and procedures
By acquiring congested relay links of high-priority slices and adjusting traffic priorities, the problem of path quality degradation of high-priority slices caused by link congestion is solved, realizing fine-grained adjustment of link congestion and path quality assurance of high-priority slices.
Patent Information
- Application Number
- CN202211020941.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-08-24
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2042-08-24
AI Technical Summary
In low-latency, high-security, and elastic high-bandwidth hybrid Internet slices, the path quality of high-priority slices may be inverted when links are congested, and direct re-optimization using existing technologies may lead to a decline in path quality.
By acquiring all congested relay links in the links traversed by high-priority slices, the traffic that needs to be adjusted is calculated, and the slice traffic is adjusted from low to high priority to relieve congestion and ensure the path quality of high-priority slices.
It enables fine-grained adjustment of link congestion, maximizing the path quality of high-priority slices while allowing low-priority slices to use the optimal path.
Smart Images

Figure CN117675711B_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of computer technology, and in particular to a link congestion scheduling method, apparatus, computer device, readable storage medium, and program. Background Technology
[0002] Currently, when constructing low-latency, high-reliability, elastic, high-bandwidth, hybrid internet slicing systems, link congestion easily occurs when multiple slices are simultaneously carried by a link because there are no upper limit bandwidth constraints for each slice. To ensure the transmission quality of high-priority slices, the duration of congestion for high-priority slice services needs to be minimized. Existing technical solutions generally directly re-optimize the tunnel itself corresponding to the congested slice. This may result in a "reverse" path quality phenomenon for high-priority slices. Summary of the Invention
[0003] This disclosure provides a link congestion scheduling method, apparatus, computer device, readable storage medium, and program, relating to the field of computer technology. It adjusts slices according to different priorities, enabling fine-grained adjustment of link congestion.
[0004] This disclosure provides a link congestion scheduling method, including: obtaining a first congested relay link among all links traversed by a first priority slice; obtaining a first flow required to relieve congestion of the first congested relay link; obtaining the slice to be adjusted based on the first flow; and adjusting the flow in the slice to be adjusted corresponding to the first flow to relieve congestion of the first congested relay link.
[0005] In one embodiment, obtaining the first congested relay link among all links traversed by the first priority slice includes: monitoring the latency, packet loss rate, and jitter of the first priority slice to obtain the first congested relay link.
[0006] In one embodiment, obtaining the first flow required to relieve congestion of the first congestion relay link includes: obtaining the first flow required to relieve congestion of the first congestion relay link based on the total bandwidth of the first congestion relay link, the current bandwidth utilization of the first congestion relay link, the utilization threshold of the first congestion relay link, and the bandwidth reservation of the first congestion relay link.
[0007] In one embodiment, obtaining the slices to be adjusted based on the first traffic includes: sorting the slices passing through the first congested relay link according to priority; and determining the slices to be adjusted that can be used to draw out the first traffic in order of priority from low to high.
[0008] In one embodiment, determining the slice that needs adjustment and can retrieve the first traffic in order of priority from low to high includes: when there are multiple slices of the same priority among the slices that can retrieve the first traffic, the slice that already has a sub-slice is selected as the slice that needs adjustment.
[0009] In one embodiment, determining the slices that can retrieve the first flow and need adjustment in order of priority from low to high includes: when there are multiple slices with the same priority among the slices that can retrieve the first flow, the slice with a flow rate close to the first flow rate is selected as the slice to be adjusted.
[0010] In one embodiment, determining the slices that can retrieve the first traffic and require adjustment in order of priority from low to high includes: if the total traffic of the third-priority slices is less than the first traffic, determining all the third-priority slices and some of the second-priority slices that can retrieve the first traffic as slices that require adjustment in order of priority from low to high.
[0011] In one embodiment, adjusting the traffic corresponding to the first traffic in the slice to be adjusted to relieve the congestion of the first congestion relay link includes: adjusting the traffic corresponding to the first traffic in the slice to be adjusted to the first receiving link to relieve the congestion of the first congestion relay link; wherein, the utilization rate of the first receiving link after receiving the first traffic is less than or equal to the utilization rate threshold of the first receiving link.
[0012] This disclosure provides a link congestion scheduling device, comprising: an acquisition module for acquiring a first congested relay link among all links traversed by a first priority slice; an acquisition module further for acquiring a first flow required to relieve congestion of the first congested relay link; an acquisition module further for acquiring a slice to be adjusted based on the first flow; and an adjustment module for adjusting the flow corresponding to the first flow in the slice to be adjusted to relieve congestion of the first congested relay link.
[0013] This disclosure provides a computer device including a processor, a memory, and an input / output interface. The processor is connected to both the memory and the input / output interface. The input / output interface is used to receive and output data, the memory is used to store computer programs, and the processor is used to invoke the computer programs so that the computer device executes any of the methods described in the above embodiments.
[0014] This disclosure provides a computer-readable storage medium storing a computer program adapted to be loaded and executed by a processor, such that a computer device having a processor performs the method described in any of the above embodiments.
[0015] This disclosure provides a computer program product, including a computer program that, when executed by a processor, implements the method as described in any of the above embodiments.
[0016] The link congestion scheduling method of this application obtains the first congested relay link among all links traversed by the first priority slice; obtains the first flow required to relieve the congestion of the first congested relay link; obtains the slice to be adjusted based on the first flow; and adjusts the flow corresponding to the first flow in the slice to be adjusted to relieve the congestion of the first congested relay link. This method can achieve fine-grained adjustment of link congestion and maximize the path quality of high-priority slices. Attached Figure Description
[0017] To more clearly illustrate the technical solutions in the embodiments of this disclosure or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0018] Figure 1 This illustrates a typical scenario of low latency, high reliability, elastic high bandwidth, and hybrid Internet slicing links;
[0019] Figure 2 This is a flowchart of a link congestion scheduling method provided in an embodiment of this disclosure;
[0020] Figure 3 This illustrates a scenario of a low-latency, high-security, flexible, high-bandwidth, hybrid Internet slicing link according to an embodiment of this disclosure;
[0021] Figure 4 It shows the relationship with Figure 3 The implementation examples correspond to the scenarios of adjusted low-latency, high-security, elastic high-bandwidth, and Internet hybrid slicing links;
[0022] Figure 5 This illustrates a scenario of a low-latency, high-security, flexible, high-bandwidth, hybrid Internet slicing link according to an embodiment of this disclosure;
[0023] Figure 6 This is a schematic diagram of the structure of a link congestion scheduling device provided in an embodiment of this disclosure;
[0024] Figure 7 This is a schematic diagram of the structure of a computer device provided in an embodiment of this disclosure. Detailed Implementation
[0025] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.
[0026] In this embodiment of the disclosure, for SRv6 (Segment Routing IPv6, where IPv6 is an abbreviation for Internet Protocol Version 6) Policy hybrid slices, the first congested relay link among all links traversed by the first priority slice can be obtained; the first traffic required to relieve congestion of the first congested relay link can be obtained; the slice to be adjusted can be obtained based on the first traffic; and the traffic corresponding to the first traffic in the slice to be adjusted can be adjusted to relieve congestion of the first congested relay link, thereby achieving fine-grained adjustment of link congestion, maximizing the path quality of high-priority slices, while ensuring the path quality of high-priority slices, and allowing low-priority slices to use the optimal path.
[0027] The following is a brief explanation of some of the terms used in this disclosure:
[0028] Network slicing is an on-demand networking method that allows operators to separate multiple virtual end-to-end networks on a unified infrastructure. Services are carried using SRv6 Policy tunnels with different priorities, and a single link can carry multiple slices. The slices in this application include at least low-latency, high-guarantee slices, elastic high-bandwidth slices, and internet slices, with priorities corresponding to high, medium, and low priorities, respectively. High-priority slices typically carry latency-sensitive, high-value, mission-critical services for VIP (very important person) customers; medium-priority slices typically carry high-bandwidth services, such as autonomous driving data migration to the cloud; and low-priority slices are for internet services.
[0029] A link is a passive, point-to-point physical connection. In wired communication, a link refers to the physical line between two nodes, such as a cable or optical fiber. In radio communication, a link refers to the spatial path through which electromagnetic waves propagate between a base station and a terminal. A slice can be connected by multiple links.
[0030] In this application, a tunnel refers to a channel that carries different slices. A link can have multiple tunnels carrying different slices.
[0031] Figure 1This illustrates a typical scenario of low latency, high reliability, elastic high bandwidth, and hybrid Internet slicing links.
[0032] refer to Figure 1 P (Provider Router) is a core layer device. A provider router is a backbone network routing device that the service provider does not connect to any CE (Customer Edge) routers; it is equivalent to a Label Switching Router (LSR). PE (Provider Edge Router) is the provider's edge device, the edge router of the service provider's backbone network; it is equivalent to a Label Edge Router (LER). The PE router connects the CE router and the P router and is the most important network node. Traffic from user 105 flows into the user network through the PE router, or flows to the network backbone (e.g., Internet 106, China Telecom Cloud 107, and third-party cloud 108) through the PE router. CE (Customer Edge Router) is a user edge device, the user-end router connected to the service provider. The CE router provides service access to users by connecting to one or more PE routers. A CE router is typically an IP router that establishes an adjacency relationship with the connected PE router. GW (Gateway) is a gateway. SDN (Software Defined Network) is a software-defined network. RR (Route Reflector) is a route reflector. SDN Controller 104 manages and adjusts slices via RR109. R (Router) stands for Router. Telemetry is the technology used. Internet 106 stands for Internet. BGP-LS (Border Gateway Protocol-Link state) is the Border Gateway Protocol-Link state. VLAN (Virtual Local Area Network) is a Virtual Local Area Network. QinQ is Stacked VLAN or Double VLAN. EVPN (Ethernet Virtual Private Network) is an Ethernet Virtual Private Network. L3VPN (Layer 3 Virtual Private Network) is a Layer 3 Virtual Private Network.
[0033] exist Figure 1In the diagram, 101 is a high-priority, low-latency, high-guarantee slice; 102 is a medium-priority, elastic, high-bandwidth slice; and 103 is a low-priority, internet slice. When high-priority slice 101, medium-priority slice 102, and low-priority slice 103 pass through the P3-PE3 relay link simultaneously, congestion is more likely to occur. Once congestion occurs, it will affect the transmission of traffic in high-priority slice 101. In existing technology, once the relay link of a high-priority slice becomes congested, the path of the high-priority slice is re-optimized. However, the re-optimized path may not be optimal for the high-priority slice in terms of latency, packet loss rate, metric, hop count, and other SLA (Service Level Agreement) indicators. It is possible that the link quality indicators such as latency of the "low-latency, high-guarantee" slice are worse than those of the low- and medium-priority slices, resulting in a "path quality inversion" phenomenon for the high-priority slice.
[0034] Figure 2 This is a flowchart illustrating a link congestion scheduling method provided in this disclosure. The method provided in this disclosure can be... Figure 1 The SDN controller 104 in the embodiment may execute the commands, or may be executed by any other terminal and / or server with computing capabilities, and this disclosure is not limited thereto.
[0035] like Figure 2 As shown, the method provided in this disclosure embodiment may include the following steps.
[0036] In step S210, the first congested relay link among all links traversed by the first priority slice is obtained.
[0037] In this step, the SDN controller obtains the first congested relay link among all links traversed by the first priority slice. Here, the first priority slice is, for example, a high-priority slice, the second priority slice is, for example, a medium-priority slice, and the third priority slice is, for example, a low-priority slice. For example, Figure 1In the process of identifying a congested relay link (P3-PE3) in high-priority slice 101, the first congested relay link (P3-PE3) among all links in the PE1-P1-P3-PE3 range is retrieved. This first congested relay link can be any congested relay link. In one embodiment, the SDN controller monitors the latency, packet loss rate, and jitter of the first priority slice using techniques such as telemetry, Twamp (Two-Way Active Measurement Protocol) detection, and flow monitoring to identify the first congested relay link. In other embodiments, the first congested relay link can also be obtained by monitoring the traffic of each relay link. If the high-priority slice links are not congested, the medium-priority slice links are then examined.
[0038] In step S220, the first flow rate required to relieve congestion of the first congested relay link is obtained.
[0039] In this step, the SDN controller obtains the first flow required to relieve congestion on the first congested relay link. This first flow can be obtained based on the total bandwidth of the first congested relay link, its current bandwidth utilization, its utilization threshold, and its bandwidth reservation. The first flow can be determined using the following formula (1):
[0040] First traffic = Total bandwidth * (Current bandwidth utilization - Utilization threshold + Bandwidth reserve) (1)
[0041] Among them, total bandwidth, current bandwidth utilization, utilization threshold and bandwidth reservation all refer to the total bandwidth, current bandwidth utilization, utilization threshold and bandwidth reservation of the first congested relay link.
[0042] Figure 3 This illustrates a scenario of a low-latency, high-security, flexible, high-bandwidth, hybrid Internet slicing link according to one embodiment of this disclosure.
[0043] refer to Figure 3 The physical bandwidth between relay links P3 and PE3 is 100G, the utilization threshold is 80%, and the bandwidth reservation is 4%. The traffic of high-priority slice 301 is 50G, the traffic of medium-priority slice 302 is 15G, and the traffic of low-priority slices 303 and 304 is 18G, with a total slice traffic of 83G, which exceeds the traffic threshold of 80G. Therefore, according to formula (1), the first traffic adjustment required to relieve the congestion of the P3-PE3 relay link is 100*(83%-80%+4%)=7G.
[0044] In step S230, the slice to be adjusted is obtained based on the first flow rate.
[0045] In this step, the SDN controller obtains the slices that need adjustment based on the first traffic. In one embodiment, slices passing through the first congested relay link can be sorted by priority; then, slices that can be adjusted to accommodate the first traffic are determined in ascending order of priority.
[0046] For example, refer to Figure 3 The high-priority slice 301, medium-priority slice 302, and low-priority slices 303 and 304 are sorted by priority as follows: low-priority slice 303 (10G), low-priority slice 304 (8G), medium-priority slice 302 (15G), and high-priority slice 301 (50G). The slices that can retrieve the first flow of 7G are determined to be either low-priority slice 303 (10G) or low-priority slice 304 (8G) according to their priority from low to high. In one embodiment, when multiple slices of the same priority exist among those capable of retrieving the first flow, the slice with a flow rate close to the first flow rate is preferentially selected as the slice to be adjusted. Figure 3 In one embodiment, a low-priority slice 304 (8G) can be selected as the slice to be adjusted in order to bring out the first flow rate 7G.
[0047] In one embodiment, when multiple slices of the same priority exist among the slices capable of retrieving the first traffic, the slice with existing sub-slicing is preferentially selected as the slice to be adjusted. For example, if the low-priority slice 303 (10G) has sub-slicing traffic in P4-PE3, the low-priority slice 303 (10G) can be preferentially selected as the slice to be adjusted to avoid splitting the low-priority slice 304 (8G) to other trunk links.
[0048] In one embodiment, if the total traffic of the third-priority slices is less than the first-priority traffic, all third-priority slices capable of drawing the first-priority traffic and some second-priority slices are selected as slices to be adjusted, in ascending order of priority. For example, if the first-priority traffic is 19G, then the total traffic of low-priority slice 303 (10G) and low-priority slice 304 (8G) is 18G < 19G. In this case, low-priority slice 303 (10G), low-priority slice 304 (8G), and medium-priority slice 302 (15G) are selected as slices to be adjusted.
[0049] In step S240, the traffic corresponding to the first traffic in the slice to be adjusted is adjusted to relieve the congestion of the first congested relay link.
[0050] In this step, the SDN controller adjusts the traffic corresponding to the first traffic in the slice to be adjusted to relieve congestion on the first congested relay link. For example, refer to... Figure 3 Adjust the 7G segment in the lower-priority slice 304 (8G) that corresponds to the first traffic 7G to relieve congestion in the relay link P3-PE3.
[0051] In one embodiment, the traffic corresponding to the first traffic in the slice to be adjusted is transferred to the first receiving link to relieve the congestion of the first congestion relay link; wherein the utilization rate of the first receiving link after receiving the first traffic is less than or equal to the utilization rate threshold of the first receiving link.
[0052] Figure 4 It shows the relationship with Figure 3 The implementation example corresponds to the scenario of adjusted low latency and high security, elastic high bandwidth, and Internet hybrid slicing links.
[0053] refer to Figure 4 The adjustment requires modifying the low-priority slice 304 (8G), which is divided into low-priority slice 3041 (1G) and low-priority slice 3042 (7G). The adjustment involves transferring the 7G segment of the low-priority slice 304 (8G) corresponding to the first traffic 7G to relay link P4-PE3 to relieve congestion on relay link P3-PE3. The utilization rate of relay link P4-PE3 after receiving the first traffic 7G must be less than or equal to the utilization threshold of relay link P4-PE3.
[0054] The link congestion scheduling method in the above embodiments of this application obtains the first congested relay link among all links traversed by the first priority slice; obtains the first flow required to relieve the congestion of the first congested relay link; obtains the slice to be adjusted based on the first flow; and adjusts the flow corresponding to the first flow in the slice to be adjusted to relieve the congestion of the first congested relay link. This method can achieve fine-grained adjustment of link congestion, maximize the path quality of high-priority slices, and ensure that low-priority slices can also use the optimal path while ensuring the path quality of high-priority slices.
[0055] The link congestion scheduling method of this disclosure will be described below with reference to specific embodiments.
[0056] Figure 5 This illustrates a scenario of a low-latency, high-security, flexible, high-bandwidth, hybrid Internet slicing link according to one embodiment of this disclosure.
[0057] exist Figure 5 The example illustrates a scenario where users implement differentiated service delivery based on SRv6 Policy via a carrier's backbone network leased line. For example... Figure 5As shown, assuming the physical bandwidth of the links between backbone network devices is 50G, the backbone network carries service traffic from low-latency, high-guarantee slice 501 (high priority), elastic high-bandwidth slice 502 (medium priority), and internet slices 5031, 5032, 5041, and 5042 (low priority), representing different priority slices. Internet slices 5031 and 5032 are different sub-slices of the same slice; internet slices 5041 and 5042 are also different sub-slices of the same slice. The traffic volume of low-latency, high-guarantee slice 501 is 10G, the traffic volume of elastic high-bandwidth slice 502 is 5G, the traffic volume of internet slices 5031 is 18G, 5032 is 2G, 5041 is 12G, and 5042 is 3G.
[0058] The bandwidth utilization threshold for the link is 80%. On the P3-PE3 link, the total traffic has reached 10 + 5 + 18 + 12 = 45G, and 45G / 50G = 90%, which exceeds the 80% bandwidth utilization threshold. This triggers the Srv6 Policy's link congestion scheduling. The specific process of link congestion scheduling is as follows:
[0059] The SDN controller 104 tuning module continuously monitors all links PE1-P1-P3-PE3 traversed by the high-priority slice path. It detects abnormalities in high-priority slice latency, packet loss rate, and jitter. Further investigation reveals that the current bandwidth utilization of the relay link between P3 and PE3 has reached 90%, exceeding the link bandwidth utilization threshold of 80%, thus triggering link congestion scheduling. The SDN controller 104 tuning module searches for all Srv6 policies passing through the congested relay circuit P3-PE3 and finds four Srv6 policy tunnels: high-priority slice 501, medium-priority slice 502, low-priority slice 5031, and low-priority slice 5041. Sorted by priority from lowest to highest: low-priority slice 5031 is 18G, low-priority slice 5041 is 12G, medium-priority slice 502 is 5G, and high-priority slice 501 is 10G. The SDN controller 104 tuning module calculates the first amount of traffic that needs to be diverted to relieve congestion on the congested link (assuming a bandwidth reservation of 4%).
[0060] The initial traffic required to clear congestion = total link bandwidth * (current link bandwidth utilization – utilization threshold + bandwidth reservation)
[0061] Therefore: First data usage = 50G * (90% - 80% + 4%) = 7G
[0062] Following the principle of prioritizing slices with traffic closest to the first priority slice, the SDN controller 104 tuning module selects the slice with traffic closest to 7G within the low-priority slices. Low-priority slice 5041 (12G) is closest to 7G, therefore it is selected as the slice to be adjusted. The SDN controller 104 tuning module calls the SDN controller 104 routing module to tune low-priority slice 5041 (removing 7G of traffic). The SDN controller 104 routing module performs link congestion scheduling on low-priority slice 5041. The link congestion scheduling follows the order of "adjusting traffic weight > traffic splitting > traffic offloading." Adjusting traffic weight means that if a slice capable of removing the first priority slice exists as a sub-slice, for example, if low-priority slice 5041 has a sub-slice 5042, adjusting the traffic from 5041 to 5042 changes the ratio between 5041 and 5042; this is called adjusting traffic weight. Traffic splitting means that if a slice does not have sub-slices, it is split into at least two sub-slices to achieve traffic adjustment. Traffic offloading refers to directly unloading the slice.
[0063] In one embodiment, when splitting traffic (paths), links whose remaining physical bandwidth of the link containing the pre-split slice is less than or equal to the weight ratio of the split slice are preferentially considered as target links. For example, if the total traffic of the pre-split slice is 8G and the pre-split weight ratio is 2G:6G = 1:3, with 6G of traffic split to the target link; if the remaining physical bandwidth of the link containing the pre-split slice is 5G, then links with a remaining physical bandwidth greater than or equal to 15G are preferentially selected as target links.
[0064] Figure 5 The implementation can be achieved by adjusting the weights. For example, the weight ratio of low-priority slices 5041 and 5042 is adjusted as follows:
[0065] Before adjustment: 5041:5042 = 12:3 = 4:1
[0066] After adjustment: 5041:5042 = (12-7):(3+7) = 1:2
[0067] By adjusting the weight ratio of low-priority slices 5041 and 5042, the traffic of low-priority slice 504 is adjusted from the original 5041:5042 = 12G:3G to 5041:5042 = 5G:10G. After the adjustment, the link bandwidth traffic of P3-PE3 decreases to 10+5+18+5 = 38G, and the current bandwidth utilization becomes 38G / 50G = 76% < 80%. Therefore, the congestion on link P3-PE3 is relieved.
[0068] Figure 5In this embodiment, by obtaining the congested relay links among all links traversed by high-priority links; obtaining the first flow required to relieve congestion of the congested relay links; obtaining the slices to be adjusted based on the first flow; and adjusting the flow corresponding to the first flow in the slices to be adjusted by adjusting the weights to relieve congestion of the relay links, fine-grained adjustment of link congestion can be achieved, maximizing the path quality of high-priority slices, while ensuring the path quality of high-priority slices, low-priority slices can also use the optimal path.
[0069] In other embodiments, if low- and medium-priority slice traffic that can be redirected from the link cannot relieve congestion, then the link of the high-priority slice is re-optimized. The high-priority slice is a slice with primary and backup protection, and the re-optimization of the high-priority slice does not involve methods such as weight adjustment or path splitting.
[0070] Figure 6 This is a schematic diagram of the structure of a link congestion scheduling device provided in an embodiment of this disclosure.
[0071] like Figure 6 As shown, the link congestion scheduling device 600 provided in this embodiment may include:
[0072] The acquisition module 610 is used to acquire the first congested relay link among all links traversed by the first priority slice;
[0073] The acquisition module 610 is also used to acquire the first flow required to relieve the congestion of the first congested relay link;
[0074] The acquisition module 610 is also used to acquire the slice that needs to be adjusted based on the first flow;
[0075] The adjustment module 620 is used to adjust the traffic corresponding to the first traffic in the slice to be adjusted in order to relieve the congestion of the first congested relay link.
[0076] Figure 6 The link congestion scheduling device obtains the first congested relay link among all links traversed by the first priority slice through the acquisition module; obtains the first flow required to relieve the congestion of the first congested relay link; obtains the slice to be adjusted based on the first flow; and the adjustment module adjusts the flow corresponding to the first flow in the slice to be adjusted to relieve the congestion of the first congested relay link. This enables fine-grained adjustment of link congestion, maximizing the path quality of high-priority slices, while ensuring the path quality of high-priority slices, and allowing low-priority slices to use the optimal path.
[0077] In one embodiment, the acquisition module 610 is further configured to monitor the latency, packet loss rate, and jitter of the first priority slice to acquire the first congested relay link.
[0078] In one embodiment, the acquisition module 610 is further configured to acquire the first traffic required to relieve the congestion of the first congestion relay link based on the total bandwidth of the first congestion relay link, the current bandwidth utilization of the first congestion relay link, the utilization threshold of the first congestion relay link, and the bandwidth reservation of the first congestion relay link.
[0079] In one embodiment, the acquisition module 610 is further configured to sort the slices passing through the first congested relay link according to priority; and determine the slices that need to be adjusted and can be used to retrieve the first traffic in order of priority from low to high.
[0080] In one embodiment, the acquisition module 610 is further configured to, when there are multiple slices of the same priority among the slices that can retrieve the first traffic, preferentially select the slice that already has a sub-slice as the slice that needs to be adjusted.
[0081] In one embodiment, the acquisition module 610 is further configured to, when there are multiple slices of the same priority among the slices that can retrieve the first flow, preferentially select the slice whose flow is close to the first flow as the slice to be adjusted.
[0082] In one embodiment, the acquisition module 610 is further configured to determine, in order of increasing priority, all third-priority slices and some second-priority slices that can retrieve the first traffic as slices to be adjusted when the total traffic of the third-priority slices is less than the first traffic.
[0083] In one embodiment, the adjustment module 620 is further configured to adjust the traffic corresponding to the first traffic in the slice to be adjusted to the first receiving link to relieve the congestion of the first congestion relay link; wherein the utilization rate of the first receiving link after receiving the first traffic is less than or equal to the utilization rate threshold of the first receiving link.
[0084] See Figure 7 , Figure 7 This is a schematic diagram of the structure of a computer device 700 provided in an embodiment of this disclosure. For example... Figure 7 As shown, the computer device in this embodiment may include one or more processors 701, a memory 702, and an input / output interface 703. The processor 701, memory 702, and input / output interface 703 are connected via a bus 704. The memory 702 stores a computer program, which includes program instructions. The input / output interface 703 receives and outputs data, such as for data interaction between the host machine and the computer device, or for data interaction between various virtual machines within the host machine. The processor 701 executes the program instructions stored in the memory 702.
[0085] The processor 701 can perform the following operations:
[0086] Obtain the first congested relay link among all links traversed by the first priority slice; obtain the first traffic adjustment required to relieve the congestion of the first congested relay link; obtain the slice to be adjusted based on the first traffic; adjust the traffic in the slice to be adjusted corresponding to the first traffic to relieve the congestion of the first congested relay link.
[0087] In some feasible implementations, the processor 701 may be a central processing unit (CPU), but it can also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.
[0088] The memory 702 may include read-only memory and random access memory, and provides instructions and data to the processor 701 and input / output interface 703. A portion of the memory 702 may also include non-volatile random access memory. For example, the memory 702 may also store device type information.
[0089] In practice, the computer device can execute the implementation methods provided by the steps in the above embodiments through its built-in functional modules. For details, please refer to the implementation methods provided by the steps in the above embodiments, which will not be repeated here.
[0090] This disclosure provides a computer device including a processor, an input / output interface, and a memory. The processor retrieves a computer program from the memory and executes the steps of the method shown in the above embodiments to perform a transmission operation.
[0091] This disclosure also provides a computer-readable storage medium storing a computer program adapted to be loaded by a processor and execute the methods provided in the steps of the above embodiments. Specific implementations of the steps in the above embodiments can be found therein and will not be repeated here. Furthermore, the beneficial effects of using the same method will not be repeated here either. For technical details not disclosed in the embodiments of the computer-readable storage medium involved in this disclosure, please refer to the description of the method embodiments of this disclosure. As an example, the computer program can be deployed to execute on a single computer device, or on multiple computer devices located in one location, or on multiple computer devices distributed across multiple locations and interconnected via a communication network.
[0092] The computer-readable storage medium can be the apparatus provided in any of the foregoing embodiments or the internal storage unit of the computer device, such as the hard disk or memory of the computer device. The computer-readable storage medium can also be an external storage device of the computer device, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device. Furthermore, the computer-readable storage medium can include both internal storage units and external storage devices of the computer device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.
[0093] This disclosure also provides a computer program product or computer program that includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the methods provided in the various alternative embodiments described above.
[0094] The terms "first," "second," etc., used in the specification, claims, and drawings of this disclosure are used to distinguish different objects, not to describe a specific order. Furthermore, the term "comprising," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or device that includes a series of steps or units is not limited to the listed steps or modules, but may optionally include steps or modules not listed, or may optionally include other step units inherent to these processes, methods, apparatuses, products, or devices.
[0095] Those skilled in the art will 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 each example have been generally described in terms of functionality. 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 disclosure.
[0096] The methods and related apparatuses provided in this disclosure are described with reference to the method flowcharts and / or structural diagrams provided in this disclosure. Specifically, each block of the method flowchart and / or structural diagram, as well as combinations of blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions are provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable transmission device to create a machine, such that the instructions, which execute via the processor of the computer or other programmable transmission device, generate instructions for implementing the process. Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable transmission device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The functions specified in one or more boxes. These computer program instructions may also be loaded onto a computer or other programmable transmission device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable device for implementing the process. Figure 1 A process or multiple processes and / or structures illustrate the steps of the functions specified in one or more boxes.
[0097] The above-disclosed embodiments are merely preferred embodiments of this disclosure and should not be construed as limiting the scope of this disclosure. Therefore, any equivalent variations made in accordance with the claims of this disclosure shall still fall within the scope of this disclosure.
Claims
1. A link congestion scheduling method, characterized in that, include: Obtain the first congested relay link among all links traversed by the first priority slice; Obtain the first flow adjustment required to relieve congestion on the first congested relay link; The slices that need to be adjusted are obtained based on the first flow rate; Adjust the traffic in the slice that needs adjustment that corresponds to the first traffic to relieve congestion in the first congestion relay link; The step of obtaining the first flow adjustment required to relieve congestion on the first congested relay link includes: The first traffic required to relieve the congestion of the first congestion relay link is obtained based on the total bandwidth of the first congestion relay link, the current bandwidth utilization rate of the first congestion relay link, the utilization rate threshold of the first congestion relay link, and the bandwidth reservation of the first congestion relay link. The step of obtaining the slice to be adjusted based on the first traffic includes: The slices passing through the first congested relay link are sorted by priority; The slices that need adjustment are determined in order of priority from low to high, and which can retrieve the first flow.
2. The method according to claim 1, characterized in that, The first congested relay link among all links traversed to obtain the first priority slice includes: The latency, packet loss rate, and jitter of the first priority slice are monitored to obtain the first congested relay link.
3. The method according to claim 1, characterized in that, The slices that need adjustment, determined in ascending order of priority, are those capable of eliciting the first flow rate: If there are multiple slices of the same priority among the slices that can retrieve the first traffic, the slice that already has a sub-slice is selected first as the slice that needs to be adjusted.
4. The method according to claim 1, characterized in that, The slices that need adjustment and can be used to retrieve the first flow, determined in ascending order of priority, include: If there are multiple slices of the same priority among the slices that can retrieve the first flow, the slice with a flow rate close to the first flow rate is selected as the slice to be adjusted.
5. The method according to claim 1, characterized in that, The slices that need adjustment and can be used to retrieve the first flow, determined in ascending order of priority, include: If the total traffic of the third priority slice is less than the first traffic, all third priority slices and some second priority slices that can retrieve the first traffic are determined as the slices to be adjusted, in order of priority from low to high.
6. The method according to claim 1, characterized in that, Adjusting the traffic corresponding to the first traffic in the slice to be adjusted to relieve congestion of the first congested relay link includes: Adjust the traffic corresponding to the first traffic in the slice to be adjusted to the first receiving link to relieve the congestion of the first congestion relay link; Wherein, the utilization rate of the first receiving link after receiving the first traffic is less than or equal to the utilization rate threshold of the first receiving link.
7. A link congestion scheduling device, characterized in that, include: The acquisition module is used to acquire the first congested relay link among all links traversed by the first priority slice; The acquisition module is also used to acquire the first flow required to relieve congestion of the first congested relay link; The acquisition module is also used to acquire the slice that needs to be adjusted based on the first traffic. An adjustment module is used to adjust the traffic corresponding to the first traffic in the slice to be adjusted in order to relieve the congestion of the first congestion relay link; The acquisition module is further configured to acquire the first traffic that needs to be diverted to relieve the congestion of the first congestion relay link based on the total bandwidth of the first congestion relay link, the current bandwidth utilization rate of the first congestion relay link, the utilization rate threshold of the first congestion relay link, and the bandwidth reservation amount of the first congestion relay link. The acquisition module is further configured to sort the slices passing through the first congestion relay link according to priority; and determine the slices that need to be adjusted that can retrieve the first traffic in order of priority from low to high.
8. A computer device, characterized in that, Includes processor, memory, and input / output interfaces; The processor is connected to the memory and the input / output interface respectively, wherein the input / output interface is used to receive data and output data, the memory is used to store computer programs, and the processor is used to call the computer programs so that the computer device executes the method according to any one of claims 1-6.
9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program adapted to be loaded and executed by a processor, such that a computer device having the processor performs the method according to any one of claims 1-6.
10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method described in any one of claims 1-6.
Citation Information
Patent Citations
Traffic scheduling method, traffic scheduling device and network device
CN105991474A
Method and system for end-to-end admission and congestion control based on network slicing
US20200068430A1
