CN113973092B - Link resource scheduling method, device, computing equipment and computer storage medium - Google Patents
Link resource scheduling method, device, computing equipment and computer storage medium Download PDFInfo
- Publication number
- CN113973092B CN113973092B CN202010723672.0A CN202010723672A CN113973092B CN 113973092 B CN113973092 B CN 113973092B CN 202010723672 A CN202010723672 A CN 202010723672A CN 113973092 B CN113973092 B CN 113973092B
- Authority
- CN
- China
- Prior art keywords
- link
- scheduling
- request
- internet content
- quality
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000005457 optimization Methods 0.000 claims abstract description 55
- 238000004458 analytical method Methods 0.000 claims abstract description 34
- 238000012217 deletion Methods 0.000 claims abstract description 31
- 230000037430 deletion Effects 0.000 claims abstract description 31
- 238000012545 processing Methods 0.000 claims abstract description 24
- 238000005516 engineering process Methods 0.000 claims abstract description 21
- 238000004891 communication Methods 0.000 claims description 16
- 230000004044 response Effects 0.000 claims description 7
- 238000001514 detection method Methods 0.000 claims description 4
- 230000001934 delay Effects 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 abstract 1
- 238000013468 resource allocation Methods 0.000 description 7
- 230000008859 change Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000013459 approach Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 240000007594 Oryza sativa Species 0.000 description 1
- 235000007164 Oryza sativa Nutrition 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 238000011897 real-time detection Methods 0.000 description 1
- 235000009566 rice Nutrition 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention relates to the technical field of Internet, and discloses a link resource scheduling method, a device, computing equipment and a computer storage medium, wherein the method comprises the following steps: acquiring a request of flow scheduling of a broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling. By means of the method, the device and the system for monitoring the link state can monitor the link state in real time, can grasp the state of the resource pool in time, can fully utilize the link resources, and improves the access experience of users.
Description
Technical Field
The embodiment of the invention relates to the technical field of Internet, in particular to a link resource scheduling method, a device, computing equipment and a computer storage medium.
Background
With the high-speed development of the Internet, the requirement of the home broadband on Internet surfing experience is continuously improved, and the interconnection export links and international export resources of operators are captured and become important factors influencing the Internet surfing experience of broadband users, so that the link resources are fully and reasonably utilized, and the important challenges of current network optimization are achieved.
The existing link scheduling technology is commonly divided into the following steps: the routing drainage is carried out by a routing strategy mode, so that users are simply divided into a plurality of groups, and each group is equally divided into link resources. The simple scheduling is to order through the initial link quality (1-2 indexes such as delay) so as to achieve a certain scheduling function, but the link quality changes in real time, the priority cannot be automatically adjusted in real time, and manual intervention is needed. The main technical points of the polling scheduling are polling and hash. The technology is used as a scheduling means, and when a first effective link is found, a scheduling instruction is triggered, so that the technology has an intelligent concept in a certain sense and does not need manual intervention.
Although the conventional link scheduling technology meets the broadband service requirements of operators for a period of time, with the development of modern networks, there is a problem that resource allocation is unreasonable, so that the user surfing experience is reduced. The main limitations are as follows: whether route drainage or simple scheduling cannot reasonably distribute resources, the former only equally distributes the resources, and the defect of big rice is overcome; the latter makes certain reasonable allocation in the early stage, but due to the need of manual intervention, real-time reasonable allocation of resources cannot be achieved. Even using the polling scheduling approach, it is not without drawbacks: two links with 40% and 20% utilization rate, where 50% or less utilization rate is set as an effective link, trigger scheduling if 40% of the links are first polled, so that the effective link is found, but the effective link is not optimal, so that the balanced utilization of resources is disadvantageous.
Disclosure of Invention
In view of the foregoing, embodiments of the present invention provide a method, apparatus, computing device, and computer storage medium for scheduling link resources, which overcome or at least partially solve the foregoing problems.
According to an aspect of an embodiment of the present invention, there is provided a link resource scheduling method, including: acquiring a request of flow scheduling of a broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling.
In an alternative manner, before the quality analysis is performed on the internet content optimization link according to the request of the user, the method includes: judging whether to schedule to the Internet content optimization link; if yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request; otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
In an optional manner, the performing quality analysis on the internet content optimization link according to the request to obtain a link quality result includes: detecting time delay and packet loss rate of the internet content optimization link according to the requested destination IP, and obtaining the link quality result; and generating a link quality table item according to the link quality result.
In an alternative manner, the generating, based on the virtualization technology, a link scheduling policy according to the link quality result includes: if the link quality result is that the link quality is good, the link scheduling policy is that the link is normal; if the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion; if the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut; and if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in.
In an optional manner, the allocating link resources according to the link scheduling policy includes: if the link scheduling policy is link deletion, removing the link resources from a link resource pool; if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service; and if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
In an optional manner, after allocating the link resource according to the link scheduling policy, the method includes: and generating a link resource pool table item according to the allocated link resources for link resource selection.
In an optional manner, the processing the user request and performing traffic scheduling according to the allocated link resource matching scheduling algorithm includes: and processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
According to another aspect of the embodiment of the present invention, there is provided a link resource scheduling apparatus, including: the request acquisition module is used for acquiring a request of flow scheduling of the broadband user; the link quality analysis module is used for carrying out quality analysis on the internet content optimization link according to the request to acquire a link quality result; the virtualization module is used for generating a link scheduling strategy according to the link quality result based on a virtualization technology and allocating link resources according to the link scheduling strategy, and the scheduling strategy comprises the following steps: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and the flow scheduling module is used for processing the user request according to the allocated link resource matching scheduling algorithm and carrying out flow scheduling.
According to another aspect of an embodiment of the present invention, there is provided a computing device including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
The memory is configured to store at least one executable instruction that causes the processor to perform the steps of the link resource scheduling method described above.
According to yet another aspect of the embodiments of the present invention, there is provided a computer storage medium having stored therein at least one executable instruction for causing the processor to perform the steps of the above-described link resource scheduling method.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific embodiments of the present invention are given for clarity and understanding.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
Fig. 1 shows a flow chart of a link resource scheduling method according to an embodiment of the present invention;
fig. 2 shows a link resource allocation schematic diagram of a link resource scheduling method according to an embodiment of the present invention;
Fig. 3 is a schematic structural diagram of a link resource scheduling device according to an embodiment of the present invention;
FIG. 4 illustrates a schematic diagram of a computing device provided by an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
Fig. 1 shows a flow chart of a link resource scheduling method according to an embodiment of the present invention. The link resource scheduling method is applied to a server side, as shown in fig. 1, and comprises the following steps:
step S11: a request for traffic scheduling for a broadband user is obtained.
The request includes a source IP, a destination IP, a traffic type, etc.
Step S12: and carrying out quality analysis on the Internet content optimization link according to the request to obtain a link quality result.
Before step S12, determining whether to schedule to the internet content optimization link; if yes, executing the step of performing quality analysis on the internet content optimization link according to the request, namely executing step S12; otherwise, returning to the step of obtaining the request of the traffic scheduling of the broadband user, namely returning to step S11. Specifically, whether the traffic requested by the broadband user needs to be scheduled to the internet content optimization link can be judged according to the service type of the request. For example, if the requested service type is game, it is determined that the traffic corresponding to the request needs to be scheduled to the internet content optimization link, and step S12 is performed.
In step S12, performing time delay and packet loss rate detection on the internet content optimization link according to the requested destination IP, and obtaining the link quality result; and generating a link quality table item according to the link quality result. The generated link quality table entries are shown in table 1, and include source IP and destination IP, detection time, time delay, packet loss rate and preference level of the internet content optimized link. Wherein the source IP and destination IP are the same as the source IP and destination IP in the request.
Table 1 link quality table entries
| Source IP | Destination IP | Time delay | Packet loss rate | Time of | Priority level |
| Data1 | Data2 | Time of |
There are multiple different internet content optimization links between the source IP and the destination IP in the request, corresponding to different delays, packet loss rates, and priorities. The link quality results include: good link quality, poor link quality, and unusable link quality.
Step S13: generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft hand-off, link traffic soft hand-in, and link normal.
The mobilization strategy is divided into: link deletion, link traffic soft hand-off, link traffic soft hand-in, and link normal. In the embodiment of the invention, if the link quality result is that the link quality is good, the link scheduling policy is that the link is normal. And if the link quality results in unavailable link quality, the link scheduling strategy is link deletion. And if the link quality results from the normal state to the unavailable state, the link scheduling strategy is soft cut-out of the link traffic. And if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in. The link is the internet content optimizing link.
When link resource allocation is carried out, if the link scheduling policy is link deletion, namely the link is unavailable, a plurality of causes exist, and the link resource is removed from the link resource pool. If the link scheduling policy is soft cut-out of the link traffic, the session is gradually disconnected, and the service is smoothly cut-out, but the session is not forcibly disconnected, so that the service continuity can be ensured. If the link scheduling policy is link traffic soft hand-in, the session is gradually sent to the Internet content optimization link to perform service smooth hand-in, so that user experience can be ensured. As shown in fig. 2, the link resource allocation includes:
Step S201: and obtaining a link quality result. I.e. the obtained link quality analysis result of step S12.
Step S202: it is determined whether a link is available. If yes, go to step S203; otherwise, the process goes to step S204.
The link is available, which may be that the link quality is good, i.e. the link is in a normal state, or that the link is changed from an unavailable state to a normal state. The link is not available, either because there are various causes for the link to be unavailable or the link changes from a normal state to an unavailable state.
Step S203: and smoothly accessing the service.
When a link is available, the session is gradually sent to the available link, smooth cut-in of the service is ensured, and the use experience of a user is ensured.
Step S204: the traffic is smoothly cut out.
When the link is unavailable, the session is gradually disconnected, and the session is not forcibly disconnected, so that the service continuity is ensured.
Step S205: the link is deleted from the resource pool. And then returns to step S201.
And deleting the unavailable link from the resource pool directly after cutting out the service. Then, the process returns to step S201, and resource allocation of other links is performed again.
After the resource allocation of all links in the link quality table entry is completed, generating a link resource pool table entry shown in table 2 according to the allocated link resources for link resource selection.
Table 2 link resource pool entries
| Link | Time delay | Packet loss rate | Time of | Priority level | Current state of |
| Data1 | Data2 | Time of |
The embodiment of the invention does not care about the specific path of the link, directly measures the quality of the link according to the time delay and the packet loss rate, realizes the virtualization of the link, realizes the allocation of the link resources based on the real-time link state information, monitors the state of the real-time link and can timely master the state of a link resource pool.
Step S14: and processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling.
In the embodiment of the invention, the scheduling algorithm is combined with the link resource pool table entry to process the user request and perform traffic scheduling, wherein the scheduling algorithm comprises, but is not limited to, a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and fastest response time.
In the embodiment of the invention, the link resource pool information can be recorded and displayed in a friendly way through the visual graph. For example, in the link quality table entry and the link resource pool table entry, different colors are applied for display according to different link resource states. Such as red for the link not to be available, green for the link to be of good quality, etc.
The embodiment of the invention realizes real-time detection of the link through virtualization of the link and link quality analysis, realizes link resource allocation by applying a link flow soft cut-in/out algorithm based on real-time link state information, reduces service fluctuation, reduces the influence on the service to the minimum, protects the Internet surfing experience of users, realizes the scheduling of the service among multiple links, and ensures reasonable utilization of link resources.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
Fig. 3 is a schematic structural diagram of a link resource scheduling apparatus according to an embodiment of the present invention. As shown in fig. 3, the link resource scheduling apparatus includes: a request acquisition module 301, a link quality analysis module 302, a virtualization module 303, and a traffic scheduling module 304. Wherein:
The request acquisition module 301 is configured to acquire a request for traffic scheduling of a broadband user; the link quality analysis module 302 is configured to perform quality analysis on the internet content optimization link according to the request, and obtain a link quality result; the virtualization module 303 is configured to generate a link scheduling policy according to the link quality result based on a virtualization technology, and allocate link resources according to the link scheduling policy, where the scheduling policy includes: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; the traffic scheduling module 304 is configured to process a user request and perform traffic scheduling according to the allocated link resource matching scheduling algorithm.
In an alternative approach, the link quality analysis module 302 is further configured to: judging whether to schedule to the Internet content optimization link; if yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request; otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
In an alternative approach, the link quality analysis module 302 is configured to: detecting time delay and packet loss rate of the internet content optimization link according to the requested destination IP, and obtaining the link quality result; and generating a link quality table item according to the link quality result.
In an alternative way, the virtualization module 303 is used to: if the link quality result is that the link quality is good, the link scheduling policy is that the link is normal; if the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion; if the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut; and if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in.
In an alternative way, the virtualization module 303 is used to: if the link scheduling policy is link deletion, removing the link resources from a link resource pool; if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service; and if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
In an alternative way, the virtualization module 303 is further configured to: and generating a link resource pool table item according to the allocated link resources for link resource selection.
In an alternative manner, the traffic scheduling module 304 is configured to: and processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
The embodiment of the invention provides a non-volatile computer storage medium, which stores at least one executable instruction, and the computer executable instruction can execute the link resource scheduling method in any of the method embodiments.
The executable instructions may be particularly useful for causing a processor to:
Acquiring a request of flow scheduling of a broadband user;
Performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result;
generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal;
And processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling.
In one alternative, the executable instructions cause the processor to:
judging whether to schedule to the Internet content optimization link;
If yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request;
otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
In one alternative, the executable instructions cause the processor to:
detecting time delay and packet loss rate of the internet content optimization link according to the requested destination IP, and obtaining the link quality result;
And generating a link quality table item according to the link quality result.
In one alternative, the executable instructions cause the processor to:
If the link quality result is that the link quality is good, the link scheduling policy is that the link is normal;
If the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion;
If the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut;
And if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in.
In one alternative, the executable instructions cause the processor to:
if the link scheduling policy is link deletion, removing the link resources from a link resource pool;
if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service;
And if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
In one alternative, the executable instructions cause the processor to:
And generating a link resource pool table item according to the allocated link resources for link resource selection.
In one alternative, the executable instructions cause the processor to:
And processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
An embodiment of the present invention provides a computer program product comprising a computer program stored on a computer storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the link resource scheduling method of any of the method embodiments described above.
The executable instructions may be particularly useful for causing a processor to:
Acquiring a request of flow scheduling of a broadband user;
Performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result;
generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal;
And processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling.
In one alternative, the executable instructions cause the processor to:
judging whether to schedule to the Internet content optimization link;
If yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request;
otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
In one alternative, the executable instructions cause the processor to:
detecting time delay and packet loss rate of the internet content optimization link according to the requested destination IP, and obtaining the link quality result;
And generating a link quality table item according to the link quality result.
In one alternative, the executable instructions cause the processor to:
If the link quality result is that the link quality is good, the link scheduling policy is that the link is normal;
If the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion;
If the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut;
And if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in.
In one alternative, the executable instructions cause the processor to:
if the link scheduling policy is link deletion, removing the link resources from a link resource pool;
if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service;
And if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
In one alternative, the executable instructions cause the processor to:
And generating a link resource pool table item according to the allocated link resources for link resource selection.
In one alternative, the executable instructions cause the processor to:
And processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
FIG. 4 is a schematic diagram of a computing device according to an embodiment of the present invention, and the embodiment of the present invention is not limited to the specific implementation of the device.
As shown in fig. 4, the computing device may include: a processor 402, a communication interface (Communications Interface) 404, a memory 406, and a communication bus 408.
Wherein: processor 402, communication interface 404, and memory 406 communicate with each other via communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically perform relevant steps in the above-described link resource scheduling method embodiment.
In particular, program 410 may include program code including computer-operating instructions.
The processor 402 may be a central processing unit CPU, or an Application-specific integrated Circuit ASIC (Application SPECIFIC INTEGRATED Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The device includes one or each processor, which may be the same type of processor, such as one or each CPU; but may also be different types of processors such as one or each CPU and one or each ASIC.
Memory 406 for storing programs 410. Memory 406 may comprise high-speed RAM memory or may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
Program 410 may be specifically operable to cause processor 402 to:
Acquiring a request of flow scheduling of a broadband user;
Performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result;
generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal;
And processing the user request according to the allocated link resource matching scheduling algorithm and performing flow scheduling.
In an alternative manner, the program 410 causes the processor to:
judging whether to schedule to the Internet content optimization link;
If yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request;
otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
In an alternative manner, the program 410 causes the processor to:
detecting time delay and packet loss rate of the internet content optimization link according to the requested destination IP, and obtaining the link quality result;
And generating a link quality table item according to the link quality result.
In an alternative manner, the program 410 causes the processor to:
If the link quality result is that the link quality is good, the link scheduling policy is that the link is normal;
If the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion;
If the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut;
And if the link quality results in a change from an unavailable state to a normal state, the link scheduling strategy is a link traffic soft hand-in.
In an alternative manner, the program 410 causes the processor to:
if the link scheduling policy is link deletion, removing the link resources from a link resource pool;
if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service;
And if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
In an alternative manner, the program 410 causes the processor to:
And generating a link resource pool table item according to the allocated link resources for link resource selection.
In an alternative manner, the program 410 causes the processor to:
And processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
The embodiment of the invention obtains the request of the flow scheduling of the broadband user; performing quality analysis on the Internet content optimization link according to the request to obtain a link quality result; generating a link scheduling policy according to the link quality result based on a virtualization technology, and allocating link resources according to the link scheduling policy, wherein the scheduling policy comprises: link deletion, link traffic soft switching-in, link traffic soft switching-out and link normal; and processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, so that the link state can be monitored in real time, the state of a resource pool can be mastered in time, the link resources can be fully utilized, and the access experience of the user is improved.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general-purpose systems may also be used with the teachings herein. The required structure for a construction of such a system is apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It will be appreciated that the teachings of the present invention described herein may be implemented in a variety of programming languages, and the above description of specific languages is provided for disclosure of enablement and best mode of the present invention.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component and, furthermore, they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features but not others included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments can be used in any combination.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.
Claims (7)
1. A method for scheduling link resources, the method comprising:
Acquiring a request of flow scheduling of a broadband user;
Judging whether to schedule to an Internet content optimizing link according to the service type of the request; if yes, carrying out quality analysis on the internet content optimization link according to the request, and obtaining a link quality result; generating a link quality table item according to the link quality result, wherein the link quality table item comprises a source IP and a destination IP of an Internet content optimization link, detection time, time delay, packet loss rate and a priority; wherein the source IP and the destination IP are the same as the source IP and the destination IP in the request; a plurality of different Internet content optimization links are arranged between a source IP and a destination IP in the request, and correspond to different time delays, packet loss rates and priorities;
Virtualizing a link based on a virtualization technology, generating a link scheduling policy according to the link quality result, and allocating link resources according to the link scheduling policy, including: if the link quality result is that the link quality is good, the link scheduling policy is that the link is normal; if the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion; if the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut; if the link quality result is that the state is changed from the unavailable state to the normal state, the link scheduling strategy is soft hand-in of the link traffic;
Processing a user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, including: if the link scheduling policy is link deletion, removing the link resources from a link resource pool; if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service; and if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
2. The method according to claim 1, wherein before the quality analysis of the internet content optimized link according to the request of the user, obtaining the link quality result comprises:
judging whether to schedule to the Internet content optimization link;
If yes, executing the step of carrying out quality analysis on the internet content optimization link according to the request;
otherwise, returning to the step of acquiring the request of the flow scheduling of the broadband user.
3. The method of claim 1, wherein said allocating link resources according to said link scheduling policy is followed by:
And generating a link resource pool table item according to the allocated link resources for link resource selection.
4. The method of claim 3, wherein said processing user requests and traffic scheduling according to said link resource matching scheduling algorithm as provisioned comprises:
And processing the user request and carrying out flow scheduling by combining the scheduling algorithm matched with the link resource pool table entry, wherein the scheduling algorithm comprises a minimum connection number algorithm, a weighted minimum connection number algorithm, polling, weighted polling and the fastest response time.
5. A link resource scheduling apparatus, the apparatus comprising:
the request acquisition module is used for acquiring a request of flow scheduling of the broadband user;
The link quality analysis module is used for judging whether to schedule to the Internet content optimization link according to the service type of the request; if yes, carrying out quality analysis on the internet content optimization link according to the request, and obtaining a link quality result; generating a link quality table item according to the link quality result, wherein the link quality table item comprises a source IP and a destination IP of an Internet content optimization link, detection time, time delay, packet loss rate and a priority; wherein the source IP and the destination IP are the same as the source IP and the destination IP in the request; a plurality of different Internet content optimization links are arranged between a source IP and a destination IP in the request, and correspond to different time delays, packet loss rates and priorities;
The virtualization module is used for virtualizing a link based on a virtualization technology, generating a link scheduling policy according to the link quality result, and allocating link resources according to the link scheduling policy, and comprises the following steps: if the link quality result is that the link quality is good, the link scheduling policy is that the link is normal; if the link quality result is that the link quality is unavailable, the link scheduling strategy is link deletion; if the link quality result is changed from a normal state to an unavailable state, the link scheduling strategy is a link traffic soft cut; if the link quality result is that the state is changed from the unavailable state to the normal state, the link scheduling strategy is soft hand-in of the link traffic;
the flow scheduling module is used for processing the user request and carrying out flow scheduling according to the allocated link resource matching scheduling algorithm, and comprises the following steps: if the link scheduling policy is link deletion, removing the link resources from a link resource pool; if the link scheduling strategy is link traffic soft cut-out, gradually disconnecting the session and carrying out smooth cut-out on the service; and if the link scheduling strategy is link traffic soft hand-in, gradually sending the session to the Internet content optimization link to perform service smooth hand-in.
6. A computing device, comprising: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
The memory is configured to store at least one executable instruction that causes the processor to perform the steps of the link resource scheduling method according to any one of claims 1-4.
7. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform the steps of the link resource scheduling method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010723672.0A CN113973092B (en) | 2020-07-24 | 2020-07-24 | Link resource scheduling method, device, computing equipment and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010723672.0A CN113973092B (en) | 2020-07-24 | 2020-07-24 | Link resource scheduling method, device, computing equipment and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113973092A CN113973092A (en) | 2022-01-25 |
| CN113973092B true CN113973092B (en) | 2024-05-24 |
Family
ID=79585966
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010723672.0A Active CN113973092B (en) | 2020-07-24 | 2020-07-24 | Link resource scheduling method, device, computing equipment and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113973092B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116032895B (en) * | 2022-12-13 | 2024-12-24 | 上海元镜像信息科技有限公司 | Bypass intelligent media server scheduling method, system, equipment and medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2557882A1 (en) * | 2011-08-10 | 2013-02-13 | MIMOON GmbH | Method and apparatus for flow-optimized scheduling |
| CN104158753A (en) * | 2014-06-12 | 2014-11-19 | 南京工程学院 | Dynamic flow dispatch method and system based on software definition network |
| CN106533956A (en) * | 2016-11-08 | 2017-03-22 | 中国电子科技集团公司第七研究所 | Scheduling control method and system for plurality of relay links among communication nodes |
| CN108282419A (en) * | 2018-02-24 | 2018-07-13 | 葛晗 | A kind of network flow dispatching method and device |
| CN108989368A (en) * | 2017-05-31 | 2018-12-11 | 腾讯科技（深圳）有限公司 | A kind of control method and monitoring device of link-quality |
| CN109743259A (en) * | 2018-12-24 | 2019-05-10 | 中国联合网络通信集团有限公司 | A kind of network traffic scheduling method and device |
| CN110290178A (en) * | 2019-05-30 | 2019-09-27 | 厦门网宿有限公司 | A kind of dispatching method of data flow, electronic equipment and storage medium |
| CN110611577A (en) * | 2018-06-14 | 2019-12-24 | 中兴通讯股份有限公司 | Service fast switching method, switching device, network equipment and storage medium |
| CN111245735A (en) * | 2020-01-20 | 2020-06-05 | 中国电子科技集团公司第五十四研究所 | Flow scheduling method for ensuring service quality in SDN environment |
| CN111343097A (en) * | 2020-02-29 | 2020-06-26 | 杭州迪普科技股份有限公司 | Link load balancing method and device, electronic equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100428774B1 (en) * | 2002-01-24 | 2004-04-28 | 삼성전자주식회사 | Apparatus for Traffic Engineering Scheduling of Multi Protocol Label Switching |
| KR101104965B1 (en) * | 2008-12-19 | 2012-01-12 | 한국전자통신연구원 | Scheduling Method and Device in Base Station Considering Downlink Control Channel Resource |
-
2020
- 2020-07-24 CN CN202010723672.0A patent/CN113973092B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2557882A1 (en) * | 2011-08-10 | 2013-02-13 | MIMOON GmbH | Method and apparatus for flow-optimized scheduling |
| CN104158753A (en) * | 2014-06-12 | 2014-11-19 | 南京工程学院 | Dynamic flow dispatch method and system based on software definition network |
| CN106533956A (en) * | 2016-11-08 | 2017-03-22 | 中国电子科技集团公司第七研究所 | Scheduling control method and system for plurality of relay links among communication nodes |
| CN108989368A (en) * | 2017-05-31 | 2018-12-11 | 腾讯科技（深圳）有限公司 | A kind of control method and monitoring device of link-quality |
| CN108282419A (en) * | 2018-02-24 | 2018-07-13 | 葛晗 | A kind of network flow dispatching method and device |
| CN110611577A (en) * | 2018-06-14 | 2019-12-24 | 中兴通讯股份有限公司 | Service fast switching method, switching device, network equipment and storage medium |
| CN109743259A (en) * | 2018-12-24 | 2019-05-10 | 中国联合网络通信集团有限公司 | A kind of network traffic scheduling method and device |
| CN110290178A (en) * | 2019-05-30 | 2019-09-27 | 厦门网宿有限公司 | A kind of dispatching method of data flow, electronic equipment and storage medium |
| CN111245735A (en) * | 2020-01-20 | 2020-06-05 | 中国电子科技集团公司第五十四研究所 | Flow scheduling method for ensuring service quality in SDN environment |
| CN111343097A (en) * | 2020-02-29 | 2020-06-26 | 杭州迪普科技股份有限公司 | Link load balancing method and device, electronic equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 气象广域网双链路流量调度方法研究及实现;徐晓莉;张常亮;杨雪;;电子测量技术(第18期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113973092A (en) | 2022-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9992273B2 (en) | Intelligent load balancer selection in a multi-load balancer environment | |
| US8595722B2 (en) | Preprovisioning virtual machines based on request frequency and current network configuration | |
| US8589543B2 (en) | Virtual data center monitoring | |
| US12166844B2 (en) | Intelligent scheduling apparatus and method | |
| WO2020258920A1 (en) | Network slice resource management method and apparatus | |
| WO2021136137A1 (en) | Resource scheduling method and apparatus, and related device | |
| US20110078303A1 (en) | Dynamic load balancing and scaling of allocated cloud resources in an enterprise network | |
| CN113014611B (en) | Load balancing method and related equipment | |
| US20150052254A1 (en) | Virtual Machine Live Migration Method, Virtual Machine Deployment Method, Server, and Cluster System | |
| US10439901B2 (en) | Messaging queue spinning engine | |
| CN108933829A (en) | A kind of load-balancing method and device | |
| CN111858054A (en) | Resource scheduling system and method based on edge computing in heterogeneous environment | |
| CN112491066B (en) | Load balancing method, device, system, target load balancing equipment and medium | |
| CN111343097A (en) | Link load balancing method and device, electronic equipment and storage medium | |
| CN112703774A (en) | Network slice management | |
| US8458702B1 (en) | Method for implementing user space up-calls on java virtual machine before/after garbage collection | |
| CN115766737A (en) | Load balancing method and device and electronic equipment | |
| CN113973092B (en) | Link resource scheduling method, device, computing equipment and computer storage medium | |
| CN119440847A (en) | A load balancing scheduling method, device and electronic device for model reasoning | |
| CN107666401A (en) | A kind of configuration information obtaining method and terminal | |
| CN117992179A (en) | Distributed cloud sharing method, device, equipment and medium for multiple resource providers | |
| CN117156166A (en) | Edge node dynamic prediction scheduling system, method and computing equipment | |
| US11671486B1 (en) | Managing availability zone utilizing redundancy validation | |
| CN109670691A (en) | Method, equipment and the customer service system distributed for customer service queue management and customer service | |
| KR20140097881A (en) | Apparatus and method for load balancing using resource usage prediction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |