CN110896365B - Traffic scheduling method in network node, server and storage medium - Google Patents
Traffic scheduling method in network node, server and storage medium Download PDFInfo
- Publication number
- CN110896365B CN110896365B CN201911326612.9A CN201911326612A CN110896365B CN 110896365 B CN110896365 B CN 110896365B CN 201911326612 A CN201911326612 A CN 201911326612A CN 110896365 B CN110896365 B CN 110896365B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- bandwidth
- target
- operator line
- user
- 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 46
- 238000004590 computer program Methods 0.000 claims description 6
- 238000002372 labelling Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 abstract description 3
- HRULVFRXEOZUMJ-UHFFFAOYSA-K potassium;disodium;2-(4-chloro-2-methylphenoxy)propanoate;methyl-dioxido-oxo-$l^{5}-arsane Chemical compound [Na+].[Na+].[K+].C[As]([O-])([O-])=O.[O-]C(=O)C(C)OC1=CC=C(Cl)C=C1C HRULVFRXEOZUMJ-UHFFFAOYSA-K 0.000 description 9
- 230000003068 static effect Effects 0.000 description 5
- 238000007726 management method Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention relates to the technical field of network communication, and discloses a traffic scheduling method in a network node, a server and a storage medium. In the invention, the user bandwidth of a target customer channel accessed through each operator line in a target area and the bandwidth cost of each operator line are counted; generating a scheduling strategy according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, wherein the scheduling strategy is used for scheduling at least part of the target user bandwidth to the target operator line, and the bandwidth cost of the operator line to which the target user bandwidth belongs is higher than the bandwidth cost of the target operator line; when the preset service quality condition is met, scheduling the user bandwidth according to a scheduling strategy; the bandwidth cost is reduced while the service quality is ensured.
Description
Technical Field
The embodiment of the invention relates to the technical field of network communication, in particular to a traffic scheduling method in a network node, a server and a storage medium.
Background
A CDN service provider (CDN Content Delivery Network) may construct a plurality of Network nodes to provide services for each customer, where each Network node has multiple operator line outlets, a bandwidth upper limit of each operator line is planned according to a peak bandwidth, and different operator lines have different bandwidth costs. When a user IP in a certain autonomous system accesses a webpage through a network node, an operator line outlet in the network node can be determined through a static routing strategy, and the operator line carries the bandwidth amount required when the user IP accesses the webpage.
The inventor finds that at least the following problems exist in the prior art: the costs of the operator lines are different, and when the operator line outlet is configured for each user IP through the static routing policy, the operator line cost is not considered.
Disclosure of Invention
An object of embodiments of the present invention is to provide a method, a server, and a storage medium for traffic scheduling in a network node, so that bandwidth cost is reduced while quality of service is guaranteed.
In order to solve the above technical problem, an embodiment of the present invention provides a method for scheduling traffic in a network node, including the following steps: counting user bandwidths of target customer channels accessed by each operator line and bandwidth costs of each operator line in a target area; generating a scheduling strategy according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, wherein the scheduling strategy is used for scheduling at least part of the target user bandwidth to the target operator line, and the bandwidth cost of the operator line to which the target user bandwidth belongs is higher than the bandwidth cost of the target operator line; and when the preset service quality condition is met, scheduling the user bandwidth according to the scheduling strategy.
An embodiment of the present invention further provides a server, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the above-described method of traffic scheduling in a network node.
Embodiments of the present invention also provide a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the method for traffic scheduling in a network node is implemented.
Compared with the prior art, the embodiment of the invention can acquire the user bandwidth condition borne by each operator line in the target area by counting the user bandwidth of the target customer channel respectively accessed by each operator line in the target area; according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, a scheduling strategy is generated, the scheduling strategy is used for scheduling at least part of the target user bandwidth to the target operator line, the cost of the operator line to which the target user bandwidth belongs is higher than that of the target operator line, namely, the user bandwidth corresponding to the operator line with higher bandwidth cost is drawn to the operator line with lower cost, so that the bandwidth cost is reduced, and the user bandwidth is scheduled according to the scheduling strategy only when the preset service quality condition is met, so that the service quality is ensured.
In addition, before scheduling the user bandwidth according to the scheduling policy, the method further includes: labeling each operator line in advance; scheduling the user bandwidth according to the scheduling policy specifically includes: determining a target operator line according to a scheduling strategy; and marking the same label value on the corresponding IP data packet requested by the user according to the label value of the target operator line, so that a core switch in the network node selects the target operator line for the user request according to the label value. The user flow is dragged to a target operator line in a labeling mode, a static routing table does not need to be changed, the feasibility is high, the routing table information is not changed through a method of labeling an IP data packet, and the operability is high.
In addition, the preset quality of service condition at least includes that the remaining bearer bandwidth of the target operator line is greater than the user bandwidth to be scheduled. And the residual bearing bandwidth is the maximum value of the target user bandwidth which can be borne by the target operator line. And considering the bearing bandwidth of the target operator line, scheduling the target operator line only when the target operator line can bear the scheduling bandwidth, and ensuring that the target operator line cannot run high continuously.
In addition, the remaining bearer bandwidth of the target operator line is obtained by: the remaining bearer bandwidth is the upper bandwidth limit x the preset scheduling fraction-the real-time bandwidth already carried. The reason that a scheduling proportion is set, instead of using the residual bandwidth of the target operator line for carrying the user bandwidth corresponding to the newly scheduled user by one hundred percent, is to reserve a part of service capacity for the target operator line to cope with the emergency situation, and prevent the target operator line from having high concurrent user requests suddenly to cause poor network quality of the operator line.
In addition, the preset service quality condition at least comprises an off-peak time period when the current time period is the target customer channel. The scheduling strategy is effective only when the current time is in the off-peak time period, and the scheduling strategy is not effective in the peak time period, so that the stability of the line is ensured, and the service quality can be ensured.
In addition, after the user bandwidth is scheduled according to the scheduling policy, the method further comprises the following steps: and when the network delay of the target operator line is detected to be larger than a preset threshold value, controlling the scheduling strategy to be invalid, so that the carrier operator line of the target user bandwidth is recovered to be the default operator line. The network delay of the target operator line is too large, which indicates that the network quality is not good, and at the moment, the control scheduling strategy is invalid, so that the bandwidth burden of the target operator line is not increased, and the service quality is ensured.
In addition, the target operator line corresponds to one or more scheduling strategies, and each scheduling strategy corresponding to the target operator is used for respectively scheduling at least part of user bandwidth accessing the target customer channel through each operator line to the target operator line; after the user bandwidth is scheduled according to the scheduling policy, the method further comprises the following steps: and when detecting that the residual bearing bandwidth of the target operator line is less than zero, controlling each scheduling strategy corresponding to the target operator line to be invalid one by one until the residual bearing bandwidth of the target operator line is more than zero or all scheduling strategies on the target operator line are invalid. When the line condition of the target operator line is detected to be poor, the scheduling strategy corresponding to the target operator line is controlled to be invalid, so that each operator line does not run high as much as possible, and meanwhile, the service quality of each operator line is ensured.
In addition, controlling each scheduling policy corresponding to the target operator line to be invalid one by one specifically includes: and controlling each scheduling strategy corresponding to the target operator line to lose effectiveness according to the sequence of the scheduling bandwidth from small to large. The scheduling strategy is controlled to be invalid according to the sequence of the bandwidth from small to large, so that the cost of an operator line can be reduced to the maximum extent while the service quality is ensured.
In addition, after the scheduling policy fails, the method further includes: recording the time when the scheduling strategy fails; the preset service quality condition at least comprises the following steps: and the time from the failure of the last scheduling strategy is greater than a preset threshold value.
In addition, the draw ratio of bandwidth scheduled to the target carrier line to the target user bandwidth is set by the operator. The traction ratio is set by an operator according to requirements, so that the method is more friendly to the operator and can flexibly change the traction ratio according to the requirements.
Drawings
One or more embodiments are illustrated by the corresponding figures in the drawings, which are not meant to be limiting.
Fig. 1 is a method for scheduling traffic in a network node according to a first embodiment of the present invention;
fig. 2 is a method for traffic scheduling in a network node according to a second embodiment of the present invention;
fig. 3 is a schematic diagram of a server structure provided in accordance with a third embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not constitute any limitation to the specific implementation manner of the present invention, and the embodiments may be mutually incorporated and referred to without contradiction.
A first embodiment of the present invention relates to a method for traffic scheduling in a network node. The embodiment is applied to each edge server node of a CDN service provider, and mainly aims at traffic scheduling in one network node, and each network node can schedule traffic in the network node according to the method provided by the embodiment of the invention, so that the effect of reducing bandwidth cost while ensuring service quality is achieved. In the embodiment, the user bandwidth of the target customer channel accessed by each operator line and the bandwidth cost of each operator line in the target area are counted; generating a scheduling strategy according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, wherein the scheduling strategy is used for scheduling at least part of the target user bandwidth to the target operator line, and the bandwidth cost of the operator line to which the target user bandwidth belongs is higher than the bandwidth cost of the target operator line; when the preset service quality condition is met, scheduling the user bandwidth according to a scheduling strategy; the bandwidth cost can be reduced while the service quality is ensured. The following describes implementation details of the traffic scheduling method in the network node according to this embodiment in a specific manner, and the following description is only provided for facilitating understanding of the implementation details and is not necessary for implementing this embodiment.
The method of scheduling traffic in a network node according to the present embodiment is illustrated in fig. 1, and is specifically described below.
In particular, within a network node, there are multiple outlets of operator lines, and the network node is accessible to users in multiple areas; when each user in a certain area accesses a certain application or webpage (target customer channel) through each operator outlet on the network node, the bandwidth of each operator line accessed by the users in the area can be counted. In the real-time mode, one area is used as a target area, the traffic scheduling platform can collect user access logs periodically collected by the real-time data collection center, and the user bandwidths of the target customer channels respectively accessed by each operator line in the target area can be counted through the user access logs. In actual implementation, the IP segments corresponding to the users in each area are different, so that the users belonging to the target area can be determined through the user IP recorded in the user log, the bandwidth required by each user in the target area to access the target client channel and the carrier operator line can be obtained, and the user bandwidth in the target area to access the target client channel through each operator line is counted. The bandwidth cost of each operator line is stored in the basic data configuration center, and the traffic scheduling platform can obtain the bandwidth cost of each operator line by accessing the basic data configuration center.
For example, in a network node, three operator outlets, a mobile operator line outlet a, a unicom operator line outlet B, and a telecom operator line outlet C are configured, and a target customer channel is a first channel. The user bandwidth of the target customer channel in the target area is obtained through statistics in the following mode: the traffic scheduling platform filters user access logs belonging to a target area by collecting user access logs periodically collected by a real-time data collection center, for example, in the target area, 10 users access a target customer channel through a mobile operator line outlet A, 12 users access the target customer channel through a communication operator line outlet B, and 9 users access the target customer channel through a telecommunication operator line outlet C; when the user bandwidth of the target customer channel is accessed through each operator line in the statistical target area, the total user bandwidth required by 10 users accessing the target customer channel through the mobile operator line outlet A, the total user bandwidth required by 12 users accessing the target customer channel through the telecom operator line outlet B and the total user bandwidth required by 9 users accessing the target customer channel through the telecom operator line outlet C can be respectively counted according to the access log of each user.
102, generating a scheduling policy according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, wherein the scheduling policy is used for scheduling at least part of the target user bandwidth to the target operator line, and the bandwidth cost of the operator line to which the target user bandwidth belongs is higher than the bandwidth cost of the target operator line.
Specifically, after counting user bandwidths of target customer channels accessed by respective operator lines in a target area, the traffic scheduling platform may adjust bandwidths carried on the respective operator lines according to overall conditions of the respective operator lines, and allocate a portion of the user bandwidth scheduling on the high-cost operator line to the low-cost operator line, that is, generate a scheduling policy. In this scheduling policy, the user bandwidth on the high-cost operator line is the target user bandwidth, and the low-cost operator line is the target operator line. In practical implementation, more than one scheduling policy is generated by the traffic scheduling platform, for example, a part of user bandwidths on two operator lines with relatively high cost are both scheduled to the same operator line with relatively low cost, or a part of user bandwidths on a certain operator line with relatively high cost are respectively scheduled to two operator lines with relatively low cost, and a scheduling policy is generated each time a user bandwidth on a certain operator line is scheduled to another operator line; that is to say, the traffic scheduling platform may generate one or more scheduling policies for each operator line, but when each operator line is used as a target operator line, the principle of the specific scheduling process is the same, and therefore, this embodiment is described with one of the operator lines being used as the target operator line.
Taking the network node provided with three operator outlets, namely, the mobile operator line outlet a, the unicom operator line outlet B, the telecom operator line outlet C and the target customer channel, which are mentioned in the step 101, as an example; after the user bandwidths of the line outlets of the operators are counted, a scheduling policy can be generated according to the user bandwidths of the line outlets of the operators and the charging information of the lines of the operators, for example, the bandwidth cost of the line outlet B of the Unicom operator is higher than that of the line outlet C of the telecom operator, the total user bandwidth required by 12 users accessing the target customer channel through the line outlet B of the Unicom operator is used as the target user bandwidth, the traffic scheduling platform can obtain the preset traction ratio input by the operator through the UI management interface, and schedule a part of the target user bandwidth to the line outlet C of the telecom operator according to the ratio. The traction proportion of the bandwidth scheduled to the target operator line in the bandwidth of the target user is set by the operator according to experience, and the traffic scheduling platform acquires the traction proportion through the UI management interface and schedules the bandwidth according to the traction proportion. The traction ratio is set by an operator according to requirements, so that the method is more friendly to the operator and can flexibly change the traction ratio according to the requirements.
And 103, when the preset service quality condition is met, scheduling the user bandwidth according to the scheduling strategy.
Specifically, before the user bandwidth is scheduled according to the scheduling strategy, labeling is carried out on each operator line in advance; and label values are printed on the lines of each operator in advance, so that the lines of each operator can be distinguished conveniently. When the user bandwidth is scheduled according to the scheduling strategy, a target operator line is determined according to the scheduling strategy, and then the same label value is marked on the IP data packet of the corresponding user request according to the label value of the target operator line, so that a core switch in a network node can select the target operator line for the user request according to the label value.
In practical implementation, the scheduling policy is stored in a scheduling policy list, and a specific scheduling policy record in the scheduling policy list may include attributes such as a client domain name, an IP segment, a tag value of a target operator line, a scheduling ratio, and the like. Examples of scheduling policy records in two scheduling policy lists are given in table 1 below. When the user bandwidth is scheduled according to the scheduling policy, the scheduling policy matched with the user channel (i.e. the client domain name) and the region to which the user requests to access and the region to which the user belongs need to be found first, then a label value is marked on the IP data packet requested by the user according to the matched scheduling policy, so that a core switch in a network node selects a corresponding operator line for the user request according to the label value, and if the matched scheduling policy does not exist, the operator line corresponding to the user request is controlled to be a default operator line.
TABLE 1
In the process of scheduling user bandwidth according to the scheduling policy, after receiving a user request, a user IP corresponding to the user request and an accessed client domain name can be obtained, so that a region number corresponding to the obtained user IP and an accessed user channel are matched with the client domain name and the IP section in the scheduling policy list, a matched scheduling policy can be obtained, and a corresponding scheduling policy is obtained and a label value of a target operator line is obtained; and marking the same label value on the IP data packet requested by the user according to the label value of the target operator line, so that a core switch in the network node can pull the user request to the target operator line according to the label value in the IP data packet.
In practical implementation, the label value marked for each operator line is a DSCP value (DSCP, Differentiated Services Code Point differential service Code Point), in the service class TOS identifier byte of each packet IP header, the used 6 bits and the unused 2 bits are used, and priority is distinguished by an encoding value), and the core switch in the network node can pull the user request to the corresponding operator line according to the DSCP value.
In addition, the traffic scheduling platform can obtain the static routing table information through the switch in the BGP node, and the outlet IP of the default operator line is the destination IP address in the data packet. When the matched scheduling policy is not detected, it indicates that the received user request has no corresponding scheduling policy, at this time, a default operator line may be directly adopted, and the traffic scheduling platform may implement pulling the user request to the default operator line by setting the DSCP value in the IP data packet to 0.
Still taking the above-mentioned three operator line exits as an example, the three operator line exits are respectively marked with a DSCP value in advance, the tag value of the mobile operator line exit a is 01000000, the tag value of the unicom operator line exit B is 10000000, and the tag value of the telecom operator line exit C is 11000000, when a user request needs to be dragged to the mobile operator line exit a, the DSCP value is marked on the packet service type field of the user request, and the content of the tag value is 01000000, so that after the core switch parses the DSCP value, the user request can be dragged to the operator line exit a. By the method of labeling the IP data packet, the information of the routing table is not changed, and the operability is strong.
In addition, after the scheduling policy is generated, the user band is not scheduled immediately according to the scheduling policy, but a certain service quality condition is satisfied, for example, the service quality condition includes an off-peak time period in which the current time period is a target client channel, the scheduling policy is only validated if the current time period is the off-peak time period, and the scheduling policy is not validated in the peak time period, so that the line stability is ensured, and the service quality can be ensured. Assume that the peak time of the target customer channel is 9 a: 00 to 16 pm: 00; then, only in the afternoon 16: 00 to the next morning 9: 00, this scheduling policy will only take effect, whereas in the morning 9: 00 to 16 pm: 00, each user accesses the target customer channel through the default operator line outlet of the static routing strategy. For another example, the preset qos condition may include that the remaining bearer bandwidth of the target operator line is greater than the user bandwidth to be scheduled, the remaining bearer bandwidth is a maximum value of the target operator line capable of bearing the target user bandwidth, and the user bandwidth to be scheduled is a product of the target user bandwidth and a preset ratio. And considering the bearing bandwidth of the target operator line, scheduling only when the target operator line can bear the scheduling bandwidth, and ensuring that the target operator line does not run high continuously.
In practical implementation, the remaining bearer bandwidth of the target carrier line is the upper bandwidth limit x the preset scheduling proportion, the real-time bandwidth already carried. Wherein the preset scheduling proportion can be set by an operator. For example, the scheduling ratio set by the operator is 80%, the bandwidth upper limit of the target operator line is 100KB, the real-time bandwidth carried is 45KB, and the remaining carrying bandwidth of the target operator line is 100KB by 80% -45 KB by 35 KB. The scheduling proportion is set to prevent a user corresponding to a user bandwidth already carried by a target operator line from suddenly having a high concurrent bandwidth demand, that is, to prevent the user bandwidth on the line from suddenly increasing, that is, a scheduling proportion is set, instead of using the remaining bandwidth of the target operator line to carry the user bandwidth corresponding to a user newly scheduled by one hundred percent, a part of service capability is reserved for the target operator line to cope with an emergency situation, and the target operator line itself is prevented from suddenly having a high concurrent user request to cause poor network quality of the operator line.
In the above example, the bandwidth upper limit information of each operator line may be obtained from the basic data configuration center, and the real-time bearer bandwidth of each operator line may be acquired by the real-time data acquisition center.
Compared with the prior art, the embodiment can acquire the user bandwidth condition borne by each operator line in the target area by counting the user bandwidth of the target customer channel respectively accessed by each operator line in the target area; according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, a scheduling strategy is generated, the scheduling strategy is used for scheduling at least part of the target user bandwidth to the target operator line, the cost of the operator line to which the target user bandwidth belongs is higher than that of the target operator line, namely, the user bandwidth corresponding to the operator line with higher bandwidth cost is drawn to the operator line with lower cost, so that the bandwidth cost is reduced, and the user bandwidth is scheduled according to the scheduling strategy only when the preset service quality condition is met, so that the service quality is ensured.
A second embodiment of the present invention relates to a method for scheduling traffic in a network node, and the second embodiment is the same as the first embodiment or the first embodiment, and mainly differs in that: in the second embodiment of the present invention, when the line condition of the target operator line is detected to be bad, the scheduling policy corresponding to the target operator line is controlled to be invalid. As shown in fig. 2, the flowchart of the present embodiment includes:
And step 203, when the preset service quality condition is met, scheduling the user bandwidth according to the scheduling strategy.
And 204, when detecting that the residual bearer bandwidth of the target operator line is less than zero, controlling the scheduling strategies corresponding to the target operator line to be invalid one by one until the residual bearer bandwidth of the target operator line is greater than zero or all the scheduling strategies on the target operator line are invalid.
Specifically, the target operator line corresponds to one or more scheduling policies, and each scheduling policy corresponding to the target operator is used to schedule, at least partially, the user bandwidth accessing the target customer channel through each operator line onto the target operator line. When the user required bandwidth of the target operator line is suddenly increased, the remaining bearer bandwidth of the user required bandwidth may be less than zero, that is, the real-time bandwidth on the target operator line exceeds the capability of the target operator line to load the user bandwidth scheduled on other lines, the target operator line runs high, at this time, the scheduling policies corresponding to the target operator line are controlled to be invalid one by one until the remaining bearer bandwidth of the target operator line is greater than zero or all the scheduling policies on the target operator line are invalid, and the service quality of the target operator line can be ensured. The scheduling policies corresponding to the control target operator line are invalidated one by one, and specifically, the scheduling policies corresponding to the control target operator line are invalidated in the order of the scheduling bandwidths from small to large. The scheduling strategy is controlled to be invalid according to the sequence of the bandwidth from small to large, so that the cost of an operator line can be reduced to the maximum extent while the service quality is ensured. In practical implementation, when the number of running high times of the target operator is greater than the preset threshold, each scheduling policy corresponding to the line of the target operator is controlled to be invalid, so that the problem that the real-time bandwidth of the target operator is too high only within a short time to perform task recovery due to an unexpected situation can be avoided, and resources are wasted.
In actual implementation, when it is detected that the network delay of the target operator line is greater than a preset threshold, the scheduling policy may also be controlled to fail, so that the carrier operator line of the target user bandwidth is restored to the default operator line. The network delay of the target operator line is too long, which indicates that the network quality is not good, and at the moment, the control scheduling strategy is invalid, so that the bandwidth burden of the target operator line is not increased, and meanwhile, the service quality is ensured.
In practical implementation, the specific method for controlling the scheduling policy to fail may be to remove the DSCP value originally marked for the user access data packet, that is, to control the DSCP value of the user access data packet to be 0. In this way, the core switch will pull the user request onto the default route.
Compared with the prior art, the method and the system have the advantages that when the line condition of the target operator line is detected to be poor, the scheduling strategy corresponding to the target operator line is controlled to be invalid, so that each operator line cannot run high as much as possible, and meanwhile, the service quality of each operator line is guaranteed.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
A third embodiment of the invention relates to a server, as shown in fig. 3, comprising at least one processor 301; and a memory 302 communicatively coupled to the at least one processor 301; the memory 302 stores instructions executable by the at least one processor 301, and the instructions are executed by the at least one processor 301, so that the at least one processor 301 can execute the traffic scheduling method in the network node.
Where the memory 302 and the processor 301 are coupled in a bus, the bus may comprise any number of interconnected buses and bridges, the buses coupling one or more of the various circuits of the processor 301 and the memory 302. The bus may also connect various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the transceiver. The transceiver may be one element or a plurality of elements, such as a plurality of receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. The data processed by the processor 301 is transmitted over a wireless medium through an antenna, which further receives the data and transmits the data to the processor 301.
The processor 301 is responsible for managing the bus and general processing and may also provide various functions including timing, peripheral interfaces, voltage regulation, power management, and other control functions. And memory 302 may be used to store data used by processor 301 in performing operations.
A fourth embodiment of the present invention relates to a computer-readable storage medium storing a computer program. The computer program realizes the above-described method embodiments when executed by a processor.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
Claims (12)
1. A method for traffic scheduling in a network node, comprising:
counting user bandwidths of target customer channels accessed by each operator line in a target area and bandwidth costs of each operator line;
generating a scheduling policy according to the user bandwidth of each operator line in the target area and the bandwidth cost of each operator line, wherein the scheduling policy is used for scheduling at least part of target user bandwidth to a target operator line, and the bandwidth cost of the operator line to which the target user bandwidth belongs is higher than the bandwidth cost of the target operator line;
when the preset service quality condition is met, scheduling the user bandwidth according to the scheduling strategy;
and when detecting that the residual bearing bandwidth of the target operator line is less than zero, controlling each scheduling strategy corresponding to the target operator line to be invalid one by one until the residual bearing bandwidth of the target operator line is more than zero or all scheduling strategies on the target operator line are invalid.
2. The method according to claim 1, further comprising, before said scheduling user bandwidth according to the scheduling policy:
labeling each operator line in advance;
the scheduling of the user bandwidth according to the scheduling policy specifically includes:
determining a target operator line according to the scheduling strategy;
and marking the same label value on the corresponding IP data packet requested by the user according to the label value of the target operator line, so that a core switch in the network node selects the target operator line for the user request according to the label value.
3. The method of traffic scheduling in a network node according to claim 1,
the preset service quality condition at least comprises that the residual bearing bandwidth of the target operator line is larger than the user bandwidth to be scheduled, wherein the residual bearing bandwidth is the maximum value of the target operator line capable of bearing the target user bandwidth.
4. The method of claim 3, wherein the remaining bearer bandwidth of the target operator line is obtained by:
the remaining bearer bandwidth is the upper bandwidth limit x the preset scheduling fraction-the real-time bandwidth already carried.
5. The method of traffic scheduling in a network node according to claim 1,
the preset quality of service conditions include at least an off-peak time period when the current time period is the target customer channel.
6. The method of traffic scheduling in a network node according to claim 1, further comprising, after said scheduling user bandwidth according to said scheduling policy:
and when detecting that the network delay of the target operator line is greater than a preset threshold value, controlling the scheduling strategy to be invalid, so that the carrier operator line of the target user bandwidth is recovered to be a default operator line.
7. The method of traffic scheduling in a network node according to claim 1,
the target operator line corresponds to one or more scheduling policies, and each scheduling policy corresponding to the target operator line is used for respectively scheduling at least part of the user bandwidth accessing the target customer channel through each operator line to the target operator line.
8. The method of traffic scheduling in a network node according to claim 1,
the controlling of the respective scheduling policies corresponding to the target operator line to be invalid one by one specifically includes:
and controlling each scheduling strategy corresponding to the target operator line to fail according to the sequence of the scheduling bandwidth from small to large.
9. The method according to any of claims 6 to 8, further comprising, after the scheduling policy fails:
recording the time when the scheduling strategy fails;
the preset service quality condition at least comprises the following steps: and the time from the failure of the last scheduling strategy is greater than a preset threshold value.
10. The method of traffic scheduling in a network node according to claim 1,
the pull proportion of the bandwidth scheduled to the target operator line to the target user bandwidth is set by the operator.
11. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method of traffic scheduling within a network node according to any of claims 1 to 10.
12. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method for traffic scheduling in a network node according to any of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911326612.9A CN110896365B (en) | 2019-12-20 | 2019-12-20 | Traffic scheduling method in network node, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911326612.9A CN110896365B (en) | 2019-12-20 | 2019-12-20 | Traffic scheduling method in network node, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110896365A CN110896365A (en) | 2020-03-20 |
| CN110896365B true CN110896365B (en) | 2022-09-02 |
Family
ID=69788901
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911326612.9A Active CN110896365B (en) | 2019-12-20 | 2019-12-20 | Traffic scheduling method in network node, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110896365B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111479137B (en) * | 2020-04-16 | 2022-02-18 | 广州酷狗计算机科技有限公司 | Method and device for providing line address, server and storage medium |
| CN111756646B (en) * | 2020-07-08 | 2023-09-29 | 腾讯科技（深圳）有限公司 | Network transmission control method, device, computer equipment and storage medium |
| CN111818588B (en) * | 2020-07-30 | 2022-05-17 | 中国联合网络通信集团有限公司 | User access method and access network equipment |
| CN113132151A (en) * | 2021-03-10 | 2021-07-16 | 上海翌旭网络科技有限公司 | Method for reducing bandwidth total cost of CDN (content delivery network) by fully utilizing free points of multiple machine rooms |
| CN115412738B (en) * | 2021-05-26 | 2023-09-08 | 广西三方大供应链技术服务有限公司 | Scheduling method and device of server and storage medium |
| CN115086244B (en) * | 2022-06-16 | 2024-06-18 | 平安付科技服务有限公司 | Bandwidth allocation method, device, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106412043A (en) * | 2016-09-20 | 2017-02-15 | 网宿科技股份有限公司 | CDN flow guide method and device |
| WO2018133306A1 (en) * | 2017-01-22 | 2018-07-26 | 华为技术有限公司 | Dispatching method and device in content delivery network |
| CN110445723A (en) * | 2019-07-02 | 2019-11-12 | 网宿科技股份有限公司 | A kind of network data dispatching method and fringe node |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395683B (en) * | 2017-06-26 | 2021-06-04 | 网宿科技股份有限公司 | Method for selecting return path and server |
| CN109428820B (en) * | 2017-08-29 | 2021-12-24 | 贵州白山云科技股份有限公司 | Multi-line routing method and system |
| CN109040190B (en) * | 2018-07-02 | 2022-03-22 | 咪咕文化科技有限公司 | Scheduling method, device and computer readable storage medium |
| CN109787921B (en) * | 2019-03-19 | 2022-09-09 | 网宿科技股份有限公司 | CDN bandwidth scheduling method, acquisition and scheduling server and storage medium |
| CN110198344A (en) * | 2019-05-05 | 2019-09-03 | 网宿科技股份有限公司 | A kind of resource regulating method and system |
| CN110474852B (en) * | 2019-08-01 | 2023-06-20 | 网宿科技股份有限公司 | Bandwidth scheduling method and device |
-
2019
- 2019-12-20 CN CN201911326612.9A patent/CN110896365B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106412043A (en) * | 2016-09-20 | 2017-02-15 | 网宿科技股份有限公司 | CDN flow guide method and device |
| WO2018133306A1 (en) * | 2017-01-22 | 2018-07-26 | 华为技术有限公司 | Dispatching method and device in content delivery network |
| CN110445723A (en) * | 2019-07-02 | 2019-11-12 | 网宿科技股份有限公司 | A kind of network data dispatching method and fringe node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110896365A (en) | 2020-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110896365B (en) | Traffic scheduling method in network node, server and storage medium | |
| KR102339054B1 (en) | Flexible ethernet-based service flow transmission method and apparatus, and communication system | |
| EP1993231B1 (en) | Allocation method, system and device for network resource in communication network | |
| CN102138301B (en) | Reasonable employment management method and system | |
| US8254252B2 (en) | Bandwidth control apparatus | |
| CN103248451B (en) | Service rate control method and system and equipment | |
| US20100085874A1 (en) | Bandwidth allocation method and apparatus | |
| CN109818881B (en) | CDN bandwidth scheduling method, acquisition and scheduling server and storage medium | |
| CN101729379B (en) | Method for metropolitan area network admission control and equipment and system | |
| US20020069291A1 (en) | Dynamic configuration of network devices to enable data transfers | |
| CN102726031A (en) | Content processing method, device and system | |
| CN103532873B (en) | flow control policy applied to distributed file system | |
| CN110769466B (en) | Information sending and receiving method, service and network quality regulation method, device and equipment | |
| CA3076119C (en) | Packet transmission method and apparatus | |
| CN101146039A (en) | Device for automatically adjusting bandwidth and its adjusting method | |
| WO2020119682A1 (en) | Load sharing method, control plane entity, and repeater | |
| CN113840330A (en) | Method for establishing connection, gateway equipment, network system and scheduling center | |
| WO2019029704A1 (en) | Network object management method and apparatus therefor | |
| EP4120657A1 (en) | System and method for prioritizing network traffic in a distributed environment | |
| CN104303457A (en) | Allocating bandwidth in a network | |
| US20240097982A1 (en) | Data transmission method, user equipment, and storage medium | |
| KR20120055947A (en) | Method and apparatus for providing Susbscriber-aware per flow | |
| EP3923536A1 (en) | Computer implemented method for allocating wireless network and adaptive video streaming resources | |
| CN112491631B (en) | Method, device, equipment and storage medium for guaranteeing service QOS | |
| JP2004038788A (en) | Data distributing method, device, program, and recording medium |
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 |