CN108092910B - Data traffic scheduling method and device - Google Patents
Data traffic scheduling method and device Download PDFInfo
- Publication number
- CN108092910B CN108092910B CN201611041488.8A CN201611041488A CN108092910B CN 108092910 B CN108092910 B CN 108092910B CN 201611041488 A CN201611041488 A CN 201611041488A CN 108092910 B CN108092910 B CN 108092910B
- Authority
- CN
- China
- Prior art keywords
- flow
- proportion
- hierarchy
- period
- traffic
- 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
Images
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/10—Flow control; Congestion control
-
- 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/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/563—Data redirection of data network streams
Abstract
The invention relates to a data traffic scheduling method and a data traffic scheduling device. The method comprises the following steps: counting the total data amount and the success amount of each level in the preset number levels in the current period by taking the preset time as one period; acquiring the period actual flow proportion of each hierarchy in the current period according to the total data amount of each hierarchy in the current period; acquiring the actual success rate of each hierarchy in the current period according to the total data amount and the success amount of each hierarchy in the current period; and obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion and the actual success rate of each layer in the current period. According to the data traffic scheduling method and the data traffic scheduling device, the traffic proportion of each level is dynamically adjusted by adjusting the traffic proportion of the next period according to the actual traffic proportion of the previous period and the actual success rate, the data traffic loss is reduced, and the service quality is improved.
Description
Technical Field
The present invention relates to network technologies, and in particular, to a method and an apparatus for scheduling data traffic.
Background
When the background service is accessed by a user, a large number of access requests are generated, the background service needs to respond to the access requests, the background service receives the access requests and generates data traffic, and a large number of data traffic is generated due to a large number of access requests. In order to deal with a large amount of data traffic, a service provider usually deploys a background service in a plurality of rooms, and if a certain room fails, the service provider dispatches the data traffic to other rooms. However, when the network of the faulty computer room is an island, the data traffic will fail completely, and the quality of service will be seriously affected.
Disclosure of Invention
Based on this, it is necessary to provide a data traffic scheduling method and apparatus for solving the problem that when the network of a faulty machine room is an isolated island, data traffic fails completely, and service quality is seriously affected, so that data traffic loss can be reduced, and service quality can be improved.
A data traffic scheduling method comprises the following steps:
counting the total data amount and the success amount of each level in the preset number levels in the current period by taking the preset time as one period;
acquiring the period actual flow proportion of each hierarchy in the current period according to the total data amount of each hierarchy in the current period;
acquiring the actual success rate of each hierarchy in the current period according to the total data amount and the success amount of each hierarchy in the current period;
and obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion and the actual success rate of each layer in the current period.
A data traffic scheduling apparatus, comprising:
the counting module is used for counting the total data amount and the success amount of each level in the preset number levels in the current period by taking the preset time as one period;
a flow proportion obtaining module, configured to obtain a period actual flow proportion of each level in the current period according to a total amount of data of each level in the current period;
a success rate obtaining module, configured to obtain a cycle actual success rate of each level in the current cycle according to a total amount and a success amount of data of each level in the current cycle;
and the scheduling module is used for obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion and the actual success rate of each layer in the current period.
The data traffic scheduling method and device in this embodiment count the total data amount and the success amount of each level in the preset number of levels in the current period, obtain the actual traffic proportion and the actual success rate of each level period through the total data amount and the success amount, calculate and obtain the traffic proportion of each level in the next period according to the actual traffic proportion and the actual success rate of each level period of the current period, and adjust the traffic proportion of the next period according to the actual traffic proportion and the actual success rate of the previous period, thereby realizing dynamic adjustment of the traffic proportion of each level, reducing data traffic loss, and improving service quality.
Drawings
FIG. 1 is a schematic diagram showing an internal structure of an electronic apparatus according to an embodiment;
FIG. 2 is a flow diagram of a method for data traffic scheduling in one embodiment;
FIG. 3 is a block diagram illustrating a hierarchy divided from near to far according to distance from a traffic migration object according to one embodiment;
FIG. 4 is a diagram of data traffic scheduling in one embodiment;
FIG. 5 is a block diagram of an embodiment of a data traffic scheduler;
fig. 6 is a block diagram of a data traffic scheduling apparatus according to another embodiment;
fig. 7 is a block diagram of a data traffic scheduling apparatus in another embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It will be understood that, as used herein, the terms "first," "second," and the like may be used herein to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish one element from another. For example, a first scheduling module may be referred to as a second scheduling module, and similarly, a second scheduling module may be referred to as a first scheduling module, without departing from the scope of the present invention. The first scheduling module and the second scheduling module are both scheduling modules, but are not the same scheduling module.
Fig. 1 is a schematic diagram of an internal structure of an electronic device in one embodiment. As shown in fig. 1, the electronic device includes a processor, a nonvolatile storage medium, an internal memory, and a network interface, which are connected by a system bus. The non-volatile storage medium of the electronic device stores an operating system, and the data traffic scheduling device is used for realizing a data traffic scheduling method. The processor is used for providing calculation and control capability and supporting the operation of the whole electronic equipment. An internal memory in the electronic device provides an environment for operation of the data traffic scheduling apparatus in the non-volatile storage medium, and the internal memory may store computer-readable instructions, which when executed by the processor, may cause the processor to execute a data traffic scheduling method. The network interface is used for carrying out network communication with the server and counting the data request quantity, the success quantity and the like received by the server. The electronic device may be a personal computer, a tablet computer, a personal digital assistant, a wearable device, or the like. Those skilled in the art will appreciate that the architecture shown in fig. 1 is a block diagram of only a portion of the architecture associated with the subject application, and does not constitute a limitation on the electronic devices to which the subject application may be applied, and that a particular electronic device may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
Fig. 2 is a flowchart of a data traffic scheduling method in an embodiment. As shown in fig. 2, a method for scheduling data traffic includes:
In this embodiment, the preset time may be set as required, such as 1 minute, 2 minutes, 3 minutes, and the like. The preset time is taken as a period, which is taken as a period of statistical data flow according to the preset time. The current period refers to a period of time that is selected to be counting data traffic. The predetermined number may be set as desired, such as 2 levels, 3 levels, 4 levels, 5 levels, etc. The hierarchy refers to a hierarchy of IDCs (Internet Data centers). And dividing the internet data center into a preset number of levels from near to far according to the distance between the internet data center and the traffic migration object. The traffic migration object is a server that needs to migrate received traffic to another server.
The hierarchy divided by the distance from the traffic migration object from near to far may be a hierarchy divided by the distance range from the traffic migration object. For example, the hierarchy divided from near to far from the traffic migration object includes a first hierarchy, a second hierarchy, a third hierarchy, a fourth hierarchy, and the like. The area which is at a distance less than or equal to the first distance threshold from the traffic migration object is the first level, the area which is at a distance greater than the first distance threshold from the traffic migration object and less than or equal to the second distance threshold from the traffic migration object belongs to the second level, the area which is at a distance greater than the second distance threshold from the traffic migration object and less than or equal to the third distance threshold from the traffic migration object is the third level, and the area which is at a distance greater than the third distance threshold from the traffic migration object is the fourth level. Wherein the first distance threshold is less than the second distance threshold and the second distance threshold is less than the third distance threshold. In addition, the hierarchy may also include 2, 3, 5, etc., and is not limited to the examples herein.
The hierarchy divided from near to far according to the distance from the traffic migration object may be a hierarchy divided according to an administrative region to which the traffic migration object belongs. As shown in fig. 3, the hierarchy divided from near to far according to the distance from the traffic migration object may include local, city, country, continent, and the like, and the total amount of data counted at a later level in the hierarchy from near to far does not include the total amount of data counted at a previous level, that is, the total amount of data counted at the city is the total amount of data counted at other places except the local amount of data. Local means being in the same place as the traffic migration object, belonging to the first hierarchy. The city is the same city with the traffic migration object and belongs to the second level. Nationwide means in the same country as the traffic migration object and belongs to the third level. The continent is the same continent with the traffic migration object and belongs to the fourth level.
And counting the total data amount and the success amount of each layer in the current period, wherein the total data amount refers to the total amount of the received data requests. The amount of work is the number of successful responses to the received data request. For example, if there are 4 levels, the total amount Send and the success amount Recv of data in the current cycle of each level are counted respectively.
And 204, acquiring the period actual flow proportion of each hierarchy in the current period according to the total data amount of each hierarchy in the current period.
In this embodiment, the total data amount of each level in the current period is summed to obtain the sum of the total data amounts of all levels in the current period; and dividing the total data amount of each level in the current period by the sum of the total data amounts of all levels to obtain the period actual flow proportion of each level. The calculation formula is as follows:
the period actual flow rate ratio is (Send of the current level)/(Send sum of all levels)
And step 206, acquiring the actual success rate of the period of each hierarchy in the current period according to the total data amount and the success amount of each hierarchy in the current period.
In this embodiment, the actual success rate of a certain level is obtained by dividing the success rate of the certain level in the current period by the total data amount of the certain level. The calculation formula is as follows:
the actual success rate of the cycle (Recv at the current level)/(Send at the current level)
And 208, obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion of each layer in the current period and the actual success rate of each layer in the current period.
In this embodiment, the flow rate proportion of a certain level in the next period adjacent to the current period is obtained according to the ratio of the actual flow rate of the certain level in the current period multiplied by the actual success rate of the period multiplied by 100. The calculation formula is as follows:
the flow ratio of the next cycle is the cycle actual flow ratio and the cycle actual success rate is 100.
It should be noted that step 204 and step 206 are not in sequence.
The data traffic scheduling method in this embodiment calculates the total data amount and the success amount of each level in the preset number of levels in the current period, obtains the actual period traffic proportion and the actual period success rate of each level through the total data amount and the success amount, calculates the traffic proportion of each level in the next period according to the actual period traffic proportion and the actual period success rate of each level in the current period, and adjusts the traffic proportion of the next period according to the actual period traffic proportion and the actual success rate of the previous period, thereby achieving dynamic adjustment of the traffic proportion of each level, reducing data traffic loss, and improving service quality.
In one embodiment, step 208 may comprise: and calculating the flow proportion of the next period of each level in sequence from near to far according to the levels. The flow proportion of the next period of each hierarchy is sequentially obtained from near to far according to the hierarchies, so that the flow proportion of the hierarchy near to a flow migration object can be conveniently and timely increased subsequently, the principle of near addressing is met, and the flow proportion of the hierarchy which is closer to the hierarchy is higher.
In an embodiment, the data traffic scheduling method further includes: and when the actual success rate of the period of one level reaches a preset threshold value, increasing the flow proportion of the level.
In this embodiment, the preset threshold may be set as required, and may be a value between 95% and 100%. For example, 99% or 99.99%, etc., and the decimal point number can be adjusted according to the precision. When the calculated period actual success rate of a certain level reaches a preset threshold, the flow proportion of the level can be increased. Because the actual success rate reaches the preset threshold value, the flow proportion of the levels is increased, the levels with high success rates share more data flows, the data flows of other levels are reduced, the loss of the data flows is reduced, and the quality of the overall service is ensured.
In one embodiment, the increasing the flow rate proportion of the hierarchy comprises: increasing the flow ratio of the tier by a first flow ratio.
In this embodiment, the first traffic proportion refers to a traffic proportion increased after the actual success rate of the period of the hierarchy reaches a preset threshold. The first flow ratio may be a fixed value or a linear function with the remaining flow, etc. The fixed value can be set as desired. The linear function may be a direct proportional function, etc. If the first flow rate ratio is a fixed value, the flow rate ratio can be conveniently adjusted according to the fixed value. If the first flow rate proportion is a linear function of the residual flow rate, the flow rate proportion can be adjusted according to the residual flow rate, and the adjustment is more accurate.
In an embodiment, the data traffic scheduling method further includes: acquiring total data flow and distributed data flow to obtain residual flow; and obtaining a residual flow ratio according to the residual flow and the total data flow, and obtaining the first flow ratio according to the multiplication of the residual flow ratio and a first adjustment factor.
In this embodiment, the remaining traffic is obtained by subtracting the allocated data traffic from the total data traffic. The total amount of data traffic may be the total amount of data traffic received by the traffic migration object. The distributed data traffic refers to data traffic distributed in a hierarchy before a current hierarchy when the data traffic is calculated from near to far according to the hierarchy. The remaining flow rate is divided by the total data flow rate to obtain the remaining flow rate ratio. And multiplying the residual flow ratio by a first adjusting factor to obtain a first flow ratio. The first adjustment factor may be set as needed, for example, 10%, 8%, 9%, 15%, etc., without being limited thereto.
Taking the first adjustment factor as 10% as an example, the calculation formula is: the flow rate ratio + is 10% of the remaining flow rate.
In one embodiment, the increasing the flow rate proportion of the hierarchy comprises: and increasing the flow proportion of the hierarchy to a first preset flow proportion.
In this embodiment, the corresponding relationship between the flow ratio range and the adjusted flow ratio is preset when the power reaches the preset threshold. For example, if the success rate reaches the preset threshold, the adjusted flow rate ratio is 40% when the flow rate ratio ranges from 20% to 30%. Increasing the traffic proportion of the hierarchy includes: and acquiring the current flow proportion of the hierarchy, judging the flow proportion range in which the current flow proportion is positioned, searching the corresponding adjusted flow proportion according to the flow proportion range, and increasing the flow proportion of the hierarchy to the adjusted flow proportion. The adjusted flow rate ratio is the first preset flow rate ratio.
In one embodiment, the hierarchy is a preset number of hierarchies of dividing the internet data center from near to far according to the distance from the traffic migration object.
The data traffic scheduling method further comprises: and when the total data traffic of all the obtained levels in a period is smaller than the total data traffic, traversing all the levels from near to far, and increasing the traffic proportion of the levels when the actual success rate of the period of one level reaches a preset threshold value.
In this embodiment, the sum of the obtained data traffic of each hierarchy in one period is smaller than the total data traffic, that is, the sum of the obtained data traffic of all the hierarchies is smaller than the total data traffic. And traversing each level according to the sequence from near to far, detecting whether the period actual success rate of each level reaches a preset threshold value, and if so, increasing the flow proportion of the level. The preset threshold may be set as required, and may be a value between 95% and 100%. For example, 99% or 99.99%, etc., and the decimal point number can be adjusted according to the precision. And when the calculated period actual success rate of a certain level reaches a preset threshold value, increasing the flow proportion of the level. Because the sum of the data traffic of each level is less than the total data traffic, the traffic proportion of the level is increased by traversing each level when the actual success rate reaches a preset threshold value, so that the levels with high success rates share the data traffic more, and the quality of the total service is ensured.
Further, in one embodiment, the increasing the flow rate ratio of the hierarchy includes: increasing the flow ratio of the tier by a second flow ratio.
In this embodiment, the second traffic proportion refers to a traffic proportion increased after the actual success rate of the period of the hierarchy reaches a preset threshold. The second flow proportion may be a fixed value or a linear function with the current flow proportion of the hierarchy, etc. The fixed value can be set as desired. The linear function may be a direct proportional function, etc. If the second flow rate ratio is a fixed value, the flow rate ratio can be conveniently adjusted according to the fixed value. If the second flow rate ratio is a linear function of the remaining flow rate, the flow rate ratio can be adjusted according to the remaining flow rate, and the adjustment is more accurate.
In an embodiment, the data traffic scheduling method further includes: and multiplying the hierarchy current flow proportion by a second factor to obtain the second flow proportion.
In this embodiment, the second adjustment factor may be set as needed, for example, 10%, 8%, 9%, 15%, etc., but is not limited thereto.
In one embodiment, the increasing the flow rate proportion of the hierarchy comprises: and increasing the flow proportion of the hierarchy to a second preset flow proportion.
In this embodiment, the corresponding relationship between the flow ratio range and the adjusted flow ratio is preset when the power reaches the preset threshold. For example, if the success rate reaches the preset threshold, the adjusted flow rate ratio is 40% when the flow rate ratio ranges from 20% to 30%. Increasing the traffic proportion of the hierarchy includes: and acquiring the current flow proportion of the hierarchy, judging the flow proportion range in which the current flow proportion is positioned, searching the corresponding adjusted flow proportion according to the flow proportion range, and increasing the flow proportion of the hierarchy to the adjusted flow proportion. The adjusted flow rate ratio is the second preset flow rate ratio.
Fig. 4 is a diagram of data traffic scheduling in one embodiment. As shown in fig. 4, the total data flow of the machine room a is 100, the success rate is 85, and the success rate is 85%, then the scheduling is performed by the data flow scheduling method, the data flow proportion of the machine room a after adjustment is 85%, the remaining data flow proportion is 15% transferred to the machine rooms B, C and D, and each machine room obtains 5% of the flow of the machine room a on average, so that the data flow of the machine room a is guaranteed not to fail, and the quality of the overall service is guaranteed.
Fig. 5 is a block diagram of a data traffic scheduling apparatus in an embodiment. As shown in fig. 5, a data traffic scheduling apparatus 500 includes a statistics module 502, a traffic proportion obtaining module 504, a success rate obtaining module 506, and a scheduling module 508. Wherein:
the counting module 502 is configured to count a total amount of data and a success amount of each level in a preset number of levels in a current period, with a preset time as a period.
In this embodiment, the preset time may be set as required, such as 1 minute, 2 minutes, 3 minutes, and the like. The preset time is taken as a period, which is taken as a period of statistical data flow according to the preset time. The current period refers to a period of time that is selected to be counting data traffic. The predetermined number may be set as desired, such as 2 levels, 3 levels, 4 levels, 5 levels, etc. The hierarchy refers to the hierarchy of IDCs. And dividing the internet data center into a preset number of levels from near to far according to the distance between the internet data center and the traffic migration object. The traffic migration object is a server that needs to migrate received traffic to another server.
In the present embodiment, the hierarchy divided from near to far in terms of the distance from the traffic migration object may be a hierarchy divided in terms of the distance range from the traffic migration object. In other embodiments, the hierarchy divided from near to far from the traffic migration object may be a hierarchy divided from the administrative region to which the traffic migration object belongs.
And counting the total data amount and the success amount of each layer in the current period, wherein the total data amount refers to the total amount of the received data requests. The amount of work is the number of successful responses to the received data request.
The flow proportion obtaining module 504 is configured to obtain a period actual flow proportion of each level in the current period according to a total amount of data of each level in the current period.
In this embodiment, the flow proportion obtaining module 504 is configured to sum total data amounts of all levels in the current period to obtain a sum of total data amounts of all levels in the current period; and dividing the total data amount of each level in the current period by the sum of the total data amounts of all levels to obtain the period actual flow proportion of each level.
The success rate obtaining module 506 is configured to obtain the actual success rate of each level in the current period according to the total amount and the success amount of each level in the current period. In this embodiment, the success rate obtaining module 506 is configured to divide the success rate of a certain level in the current period by the total data amount of the certain level to obtain the actual success rate of the certain level.
The scheduling module 508 is configured to obtain a traffic proportion of each level in a next period adjacent to the current period according to the actual traffic proportion of each level in the current period and the actual success rate of each level in the current period. In this embodiment, the scheduling module 508 is configured to obtain a traffic proportion of a certain level in a next period adjacent to a current period according to a ratio of an actual period traffic of the certain level in the current period multiplied by an actual period success rate and then multiplied by 100.
The data traffic scheduling device in this embodiment counts the total data amount and the success amount of each level in the preset number of levels in the current period, obtains the actual traffic proportion and the actual success rate of each level in the period through the total data amount and the success amount, obtains the traffic proportion of each level in the next period through calculation according to the actual traffic proportion and the actual success rate of each level in the current period, and adjusts the traffic proportion of the next period according to the actual traffic proportion and the actual success rate of the previous period, thereby achieving dynamic adjustment of the traffic proportion of each level, reducing data traffic loss, and improving service quality.
In one embodiment, the scheduling module 508 is configured to calculate the traffic proportion of the next cycle of each hierarchy in order from near to far according to the hierarchy. The flow proportion of the next period of each hierarchy is sequentially obtained from near to far according to the hierarchies, so that the flow proportion of the hierarchy near to a flow migration object can be conveniently and timely increased subsequently, the principle of near addressing is met, and the flow proportion of the hierarchy which is closer to the hierarchy is higher.
Fig. 6 is a block diagram of a data traffic scheduling apparatus in another embodiment. As shown in fig. 6, a data traffic scheduling apparatus 500 includes a first adjusting module 510 in addition to a statistic module 502, a traffic proportion obtaining module 504, a success rate obtaining module 506, and a scheduling module 508. Wherein:
the first adjusting module 510 is configured to increase a traffic proportion of a level when a period actual success rate of the level reaches a preset threshold.
In this embodiment, the preset threshold may be set as required, and may be a value between 95% and 100%. For example, 99% or 99.99%, etc., and the decimal point number can be adjusted according to the precision. When the calculated period actual success rate of a certain level reaches a preset threshold, the flow proportion of the level can be increased. Because the actual success rate reaches the preset threshold value, the flow proportion of the levels is increased, the levels with high success rates share more data flows, the data flows of other levels are reduced, the loss of the data flows is reduced, and the quality of the overall service is ensured.
In one embodiment, the first adjustment module 510 is further configured to increase the flow rate ratio of the hierarchy by a first flow rate ratio.
In this embodiment, the first traffic proportion refers to a traffic proportion increased after the actual success rate of the period of the hierarchy reaches a preset threshold. The first flow ratio may be a fixed value or a linear function with the remaining flow, etc. The fixed value can be set as desired. The linear function may be a direct proportional function, etc. If the first flow rate ratio is a fixed value, the flow rate ratio can be conveniently adjusted according to the fixed value. If the first flow rate proportion is a linear function of the residual flow rate, the flow rate proportion can be adjusted according to the residual flow rate, and the adjustment is more accurate.
In one embodiment, the first adjusting module 510 is further configured to obtain a total data flow and an allocated data flow, and obtain a remaining flow; and obtaining a residual flow ratio according to the residual flow and the total data flow, and obtaining the first flow ratio according to the multiplication of the residual flow ratio and a first adjustment factor.
In this embodiment, the remaining traffic is obtained by subtracting the allocated data traffic from the total data traffic. The total amount of data traffic may be the total amount of data traffic received by the traffic migration object. The distributed data traffic refers to data traffic distributed in a hierarchy before a current hierarchy when the data traffic is calculated from near to far according to the hierarchy. The remaining flow rate is divided by the total data flow rate to obtain the remaining flow rate ratio. And multiplying the residual flow ratio by a first adjusting factor to obtain a first flow ratio. The first adjustment factor may be set as needed, for example, 10%, 8%, 9%, 15%, etc., without being limited thereto.
In one embodiment, the first adjusting module 510 is further configured to increase the flow rate ratio of the hierarchy to a first preset flow rate ratio.
In this embodiment, the corresponding relationship between the flow ratio range and the adjusted flow ratio is preset when the power reaches the preset threshold. For example, if the success rate reaches the preset threshold, the adjusted flow rate ratio is 40% when the flow rate ratio ranges from 20% to 30%. The first adjusting module 510 obtains the current flow rate proportion of the hierarchy, determines the flow rate proportion range in which the current flow rate proportion is located, finds the corresponding adjusted flow rate proportion according to the flow rate proportion range, and increases the flow rate proportion of the hierarchy to the adjusted flow rate proportion. The adjusted flow rate ratio is the first preset flow rate ratio.
In one embodiment, the hierarchy is a preset number of hierarchies of dividing the internet data center from near to far according to the distance between the internet data center and the traffic migration object;
fig. 7 is a block diagram of a data traffic scheduling apparatus in another embodiment. As shown in fig. 7, a data traffic scheduling apparatus 500 includes a traversing module 512 and a second adjusting module 514 in addition to a statistics module 502, a traffic proportion obtaining module 504, a success rate obtaining module 506, a scheduling module 508 and a first adjusting module 510.
The traversal module 512 is configured to traverse each hierarchy from near to far when the sum of the obtained data traffic of each hierarchy in a period is smaller than the total data traffic.
The second adjusting module 514 is configured to increase the traffic proportion of a level when the actual success rate of the period of the level reaches a preset threshold.
In this embodiment, the sum of the obtained data traffic of each hierarchy in one period is smaller than the total data traffic, that is, the sum of the obtained data traffic of all the hierarchies is smaller than the total data traffic. And traversing each level according to the sequence from near to far, detecting whether the period actual success rate of each level reaches a preset threshold value, and if so, increasing the flow proportion of the level. The preset threshold may be set as required, and may be a value between 95% and 100%. For example, 99% or 99.99%, etc., and the decimal point number can be adjusted according to the precision. And when the calculated period actual success rate of a certain level reaches a preset threshold value, increasing the flow proportion of the level. Because the sum of the data traffic of each level is less than the total data traffic, the traffic proportion of the level is increased by traversing each level when the actual success rate reaches a preset threshold value, so that the levels with high success rates share the data traffic more, and the quality of the total service is ensured.
In one embodiment, the second adjustment module 514 is further configured to increase the flow ratio of the tier by a second flow ratio.
In this embodiment, the second traffic proportion refers to a traffic proportion increased after the actual success rate of the period of the hierarchy reaches a preset threshold. The second flow proportion may be a fixed value or a linear function with the current flow proportion of the hierarchy, etc. The fixed value can be set as desired. The linear function may be a direct proportional function, etc. If the second flow rate ratio is a fixed value, the flow rate ratio can be conveniently adjusted according to the fixed value. If the second flow rate ratio is a linear function of the remaining flow rate, the flow rate ratio can be adjusted according to the remaining flow rate, and the adjustment is more accurate.
Further, the second adjusting module 514 is further configured to multiply the hierarchy current flow rate proportion by a second factor to obtain the second flow rate proportion.
In this embodiment, the second adjustment factor may be set as needed, for example, 10%, 8%, 9%, 15%, etc., but is not limited thereto.
In one embodiment, the second adjustment module 514 is further configured to increase the flow rate ratio of the hierarchy to a second preset flow rate ratio.
In this embodiment, the corresponding relationship between the flow ratio range and the adjusted flow ratio is preset when the power reaches the preset threshold. For example, if the success rate reaches the preset threshold, the adjusted flow rate ratio is 40% when the flow rate ratio ranges from 20% to 30%. The second adjusting module 514 obtains the current flow proportion of the hierarchy, determines the flow proportion range in which the current flow proportion is located, finds the corresponding adjusted flow proportion according to the flow proportion range, and increases the flow proportion of the hierarchy to the adjusted flow proportion. The adjusted flow rate ratio is the second preset flow rate ratio.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), or the like.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (16)
1. A data traffic scheduling method comprises the following steps:
counting the total data amount and the success amount of each level in the preset number levels in the current period by taking the preset time as one period; the success amount refers to the number of successful responses to the received data request; the preset quantity hierarchy is obtained by dividing the internet data center from near to far according to the distance between the internet data center and the traffic migration object;
dividing the total data amount of each hierarchy in the current period by the sum of the total data amounts of each hierarchy to obtain the period actual flow proportion of each hierarchy in the current period;
acquiring the actual success rate of each hierarchy in the current period according to the total data amount and the success amount of each hierarchy in the current period;
and obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion and the actual success rate of each layer in the current period.
2. The method of claim 1, further comprising:
and when the actual success rate of the period of one level reaches a preset threshold value, increasing the flow proportion of the level.
3. The method of claim 2, wherein said increasing the flow rate proportion of the hierarchy comprises: increasing the flow ratio of the tier by a first flow ratio.
4. The method of claim 3, further comprising:
acquiring total data flow and distributed data flow to obtain residual flow;
and obtaining a residual flow ratio according to the residual flow and the total data flow, and obtaining the first flow ratio according to the multiplication of the residual flow ratio and a first adjustment factor.
5. The method of claim 2, wherein said increasing the flow rate proportion of the hierarchy comprises: and increasing the flow proportion of the hierarchy to a first preset flow proportion.
6. The method according to any one of claims 1 to 5, further comprising:
and when the total data traffic of all the obtained levels in a period is smaller than the total data traffic, traversing all the levels from near to far, and increasing the traffic proportion of the levels when the actual success rate of the period of one level reaches a preset threshold value.
7. The method of claim 6, wherein said increasing the flow rate proportion of the hierarchy comprises:
increasing the flow ratio of the tier by a second flow ratio;
or increasing the flow proportion of the hierarchy to a second preset flow proportion.
8. A data traffic scheduling apparatus, comprising:
the counting module is used for counting the total data amount and the success amount of each level in the preset number levels in the current period by taking the preset time as one period; the success amount refers to the number of successful responses to the received data request; the preset quantity hierarchy is obtained by dividing the internet data center from near to far according to the distance between the internet data center and the traffic migration object;
a flow proportion obtaining module, configured to divide the total data amount of each level in the current period by the sum of the total data amounts of each level to obtain a period actual flow proportion of each level in the current period;
a success rate obtaining module, configured to obtain a cycle actual success rate of each level in the current cycle according to a total amount and a success amount of data of each level in the current cycle;
and the scheduling module is used for obtaining the flow proportion of each layer in the next period adjacent to the current period according to the actual flow proportion and the actual success rate of each layer in the current period.
9. The apparatus of claim 8, further comprising:
the first adjusting module is used for increasing the flow proportion of the hierarchy when the actual success rate of the period of the hierarchy reaches a preset threshold value.
10. The apparatus of claim 9, wherein the first adjustment module is further configured to increase the flow ratio of the tier by a first flow ratio.
11. The apparatus of claim 10, wherein the first adjusting module is further configured to obtain a total data flow and an allocated data flow to obtain a remaining flow; and obtaining a residual flow ratio according to the residual flow and the total data flow, and obtaining the first flow ratio according to the multiplication of the residual flow ratio and a first adjustment factor.
12. The apparatus of claim 10, wherein the first adjustment module is further configured to increase the flow rate proportion of the hierarchy to a first preset flow rate proportion.
13. The apparatus of claim 8, further comprising:
the traversal module is used for traversing each hierarchy from near to far when the sum of the obtained data traffic of each hierarchy in a period is smaller than the total data traffic;
and the second adjusting module is used for increasing the flow proportion of the hierarchy when the actual success rate of the period of the hierarchy reaches a preset threshold value.
14. The apparatus of claim 13, wherein the second adjustment module is further configured to increase the flow rate ratio of the tier by a second flow rate ratio; or the second adjusting module is further configured to increase the flow rate proportion of the hierarchy to a second preset flow rate proportion.
15. An electronic device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor realizes the steps of the method of any of claims 1 to 7 when executing the computer program.
16. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611041488.8A CN108092910B (en) | 2016-11-23 | 2016-11-23 | Data traffic scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611041488.8A CN108092910B (en) | 2016-11-23 | 2016-11-23 | Data traffic scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108092910A CN108092910A (en) | 2018-05-29 |
| CN108092910B true CN108092910B (en) | 2021-07-20 |
Family
ID=62170183
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611041488.8A Active CN108092910B (en) | 2016-11-23 | 2016-11-23 | Data traffic scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108092910B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113726672B (en) * | 2020-10-23 | 2024-04-02 | 天翼数字生活科技有限公司 | Method and system for self-adjusting flow control threshold |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102420741A (en) * | 2010-09-28 | 2012-04-18 | 朗讯科技投资有限公司 | Method and device for scheduling communication flow in ATCA (Advanced Telecom Computing Architecture)-based device |
| CN103443771A (en) * | 2013-01-16 | 2013-12-11 | 华为技术有限公司 | Method and device for resource dispatching among data centers |
| CN104503924A (en) * | 2014-12-16 | 2015-04-08 | 华为技术有限公司 | Area distribution method and device of tiered storage system |
| CN105471759A (en) * | 2016-01-11 | 2016-04-06 | 北京百度网讯科技有限公司 | Network traffic scheduling method and apparatus for data centers |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103944927B (en) * | 2013-01-17 | 2018-07-17 | 深圳市腾讯计算机***有限公司 | Server stretch-processing method and device |
| US10680742B2 (en) * | 2014-06-27 | 2020-06-09 | Agora Lab, Inc. | Systems and methods for improved communication packet delivery over a public network |
-
2016
- 2016-11-23 CN CN201611041488.8A patent/CN108092910B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102420741A (en) * | 2010-09-28 | 2012-04-18 | 朗讯科技投资有限公司 | Method and device for scheduling communication flow in ATCA (Advanced Telecom Computing Architecture)-based device |
| CN103443771A (en) * | 2013-01-16 | 2013-12-11 | 华为技术有限公司 | Method and device for resource dispatching among data centers |
| CN104503924A (en) * | 2014-12-16 | 2015-04-08 | 华为技术有限公司 | Area distribution method and device of tiered storage system |
| CN105471759A (en) * | 2016-01-11 | 2016-04-06 | 北京百度网讯科技有限公司 | Network traffic scheduling method and apparatus for data centers |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108092910A (en) | 2018-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108667748B (en) | Method, device, equipment and storage medium for controlling bandwidth | |
| US10798018B2 (en) | Method for operating a virtual network infrastructure | |
| CN108845874B (en) | Dynamic resource allocation method and server | |
| US10972535B2 (en) | Method and device for load balancing, and storage medium | |
| CN107124472A (en) | Load-balancing method and device, computer-readable recording medium | |
| CN110138756B (en) | Current limiting method and system | |
| CN105718397A (en) | Arbitrating Bus Transactions On A Communications Bus Based On Bus Device Health Information And Related Power Management | |
| CN114157666A (en) | Load balancing system, method, medium and device based on intelligent cloud platform | |
| CN110297698B (en) | Multi-priority dynamic current limiting method, device, server and storage medium | |
| CN107908479A (en) | A kind of node resource distribution method and device | |
| US10305974B2 (en) | Ranking system | |
| CN108459905B (en) | Resource pool capacity planning method and server | |
| CN116955455B (en) | Processing method and platform suitable for radiation monitoring system | |
| CN111147395A (en) | Network resource adjusting method and device | |
| US20090178050A1 (en) | Control of Access to Services and/or Resources of a Data Processing System | |
| CN107733805B (en) | Service load scheduling method and device | |
| CN109587072A (en) | Distributed system overall situation speed limiting system and method | |
| CN103605756A (en) | Data processing method and data processing device for on-line analysis processing | |
| CN110221775B (en) | Method and device for distributing tokens in storage system | |
| CN108092910B (en) | Data traffic scheduling method and device | |
| CN107846614B (en) | Video traffic scheduling method and device and electronic equipment | |
| CN109819449B (en) | Base station hardware resource allocation method and device based on virtual resources | |
| CN108200185B (en) | Method and device for realizing load balance | |
| US8250210B2 (en) | Balancing user registration lifetimes in a network | |
| CN113079062B (en) | Resource adjusting method and device, computer equipment and storage 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 |