CN108063734A - A kind of network resource scheduling method and device - Google Patents
A kind of network resource scheduling method and device Download PDFInfo
- Publication number
- CN108063734A CN108063734A CN201711269961.2A CN201711269961A CN108063734A CN 108063734 A CN108063734 A CN 108063734A CN 201711269961 A CN201711269961 A CN 201711269961A CN 108063734 A CN108063734 A CN 108063734A
- Authority
- CN
- China
- Prior art keywords
- queue
- packet loss
- time delay
- weights
- network resource
- 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.)
- Pending
Links
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/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
Abstract
The present invention provides a kind of network resource scheduling method and device, the method S1：It monitors the rate of dequeue, time delay and feeds back to input terminal；S2：Queue scheduling updates the weights of each queue according to queue rate and the time delay dynamic of feedback.The device includes：Collecting unit, for obtaining the time delay and packet loss of data packet in intervals；Computing unit, for judging the section where time delay and packet loss and calculating real-time weights；Updating block, for refreshing queue according to real-time weights.This method carries out bandwidth resources needed for data flow pre-estimation, and dynamic adjusts the weights of each queue.
Description
Technical field
The present invention relates to field of computer technology, specifically a kind of network resource scheduling method and device.
Background technology
In the computer network for supporting a variety of service types, distribution and the scheduling of Internet resources are wherein very challenging property
Problem, various dispatching algorithms all make great efforts to obtain balance between complexity, fairness, validity and resource utilization.
Queue scheduling algorithm includes fifo queue (First In First Out, FIFO), Weighted Fair Queuing
(Weighted Fair Queuing, WFQ), deficit weighted round robin queue (Deficit Weighted Round Robin,
DWRR) etc., which kind of algorithm is taken to be required for realizing the fair allocat of bandwidth, the QOS demands for meeting different flow etc. as far as possible.
But above-mentioned algorithm is the dispatching method of single form, and be for task in itself, can not realize network provide
The dynamic regulation in source.
The content of the invention
To solve the above-mentioned problems, a kind of network resource scheduling method and device is provided, bandwidth needed for data flow is provided
Source carries out pre-estimation, and dynamic adjusts the weights of each queue.
An embodiment of the present invention provides a kind of network resource scheduling method, the method includes：
S1：It monitors the rate of dequeue, time delay and feeds back to input terminal；
S2：Queue scheduling updates the weights of each queue according to queue rate and the time delay dynamic of feedback.
Further, the method further includes：
S3：Step S1-S2 is repeated, until Internet resources are in idle condition.
Further, the specific implementation process of step S1 is：Number in the output terminal monitoring intervals of queue scheduling
According to the time delay and packet loss of bag.
Further, the specific implementation process of step S2 is：
S21：Judge the section where time delay and packet loss；
S22：According to the interval computation adjusting parameter where time delay and packet loss；
S23：Queue is refreshed according to the adjusting parameter of calculating.
Further, in step S21, the section where time delay includes：Less than minimal time delay, more than or equal to minimal time delay and
Less than or equal to maximum delay, more than maximum delay.
Further, in step S21, the section where packet loss includes：It is lost less than minimum packet loss, more than or equal to minimum
Bag rate and less than or equal to maximum packet loss, more than maximum packet loss.
Further, in step S22, the correspondence in section and adjusting parameter where time delay and packet loss is：
When time delay is more than maximum delay or packet loss is more than maximum packet loss, queue Bandwidth adjustment parameter W=g,
In, g is the bandwidth gain of queue；
When time delay is less than minimal time delay and packet loss is less than minimum packet loss, queue Bandwidth adjustment parameter W=1/g；
When time delay is between minimal time delay and maximum delay, and packet loss between minimum packet loss and maximum packet loss it
Between when, queue Bandwidth adjustment parameter be W=1.
Further, the specific implementation process of step S23 is：The queue that the input terminal of queue scheduling is fed back according to output terminal
Bandwidth adjustment parameter, calculates the weights distribution of each queue, and the weights of queue account for all queues for the new bandwidth allocation value of queue
The percentage of new bandwidth allocation value summation, and the weights of each queue are refreshed.
The embodiment of the present invention additionally provides a kind of network resource scheduling device, and the device includes：
Collecting unit, for obtaining the time delay and packet loss of data packet in intervals；
Computing unit, for judging the section where time delay and packet loss and calculating real-time weights；
Updating block, for refreshing queue according to real-time weights.
The effect provided in the content of the invention is only the effect of embodiment rather than invents all whole effects, above-mentioned
A technical solution in technical solution has the following advantages that or advantageous effect：
Feedback processing is carried out according to the time delay of queue reality and packet loss, queue input terminal is according to feedback result to distribution
Bandwidth and weights are adjusted into Mobile state, so as to reach the defects of existing queue scheduling algorithm of improvement does not ensure delay variation, and
It improves resource utilization.
Description of the drawings
Fig. 1 is the method flow diagram of the embodiment of the present invention 1；
Fig. 2 is the schematic diagram of device of the embodiment of the present invention 1；
Fig. 3 is the method flow diagram of the embodiment of the present invention 2.
Specific embodiment
In order to clarify the technical characteristics of the invention, below by specific embodiment, and its attached drawing is combined, to this hair
It is bright to be described in detail.Following disclosure provides many different embodiments or example is used for realizing the different knots of the present invention
Structure.In order to simplify disclosure of the invention, hereinafter the component and setting of specific examples are described.In addition, the present invention can be with
Repeat reference numerals and/or letter in different examples.This repetition is that for purposes of simplicity and clarity, itself is not indicated
Relation between various embodiments are discussed and/or are set.It should be noted that illustrated component is not necessarily to scale in the accompanying drawings
It draws.Present invention omits the descriptions to known assemblies and treatment technology and process to avoid the present invention is unnecessarily limiting.
Embodiment 1
As shown in Figure 1, the embodiment of the present invention 1 provides a kind of network resource scheduling method, the method includes following
Step：
S1：It monitors the rate of dequeue, time delay and feeds back to input terminal.Specific implementation process is：The output of queue scheduling
The time delay and packet loss of data packet in end monitoring intervals.
S2：Queue scheduling updates the weights of each queue according to queue rate and the time delay dynamic of feedback.It implemented
Cheng Wei：
S21：Judge the section where time delay and packet loss；Section where time delay includes：Less than minimal time delay, more than etc.
In minimal time delay and it is less than or equal to maximum delay, more than maximum delay.Section where packet loss includes：Less than minimum packet loss
Rate, more than or equal to minimum packet loss and less than or equal to maximum packet loss, more than maximum packet loss.
S22：According to the real-time weights of the interval computation where time delay and packet loss, specific implementation process is：When time delay is more than
When the maximum delay or packet loss of setting are more than maximum packet loss, queue Bandwidth adjustment parameter (w) is the bandwidth of queue at this time
Gain (g), the value of bandwidth gain are the effective bandwidth that the bandwidth actually distributed accounts for calculating with the effective bandwidth difference calculated
Percentage；When time delay is less than minimal time delay and packet loss is less than minimum packet loss, queue Bandwidth adjustment parameter is bandwidth gain
Inverse；When time delay is between minimal time delay and maximum delay, and packet loss between minimum packet loss and maximum packet loss it
Between when, queue Bandwidth adjustment parameter be 1, that is, remain unchanged.
S23：Refresh queue according to the weights of calculating, specific implementation process is：The input terminal of queue scheduling is according to output terminal
The queue Bandwidth adjustment parameter of feedback calculates the weights distribution of each queue, and the weights of queue are the new bandwidth allocation value of queue
The percentage of the new bandwidth allocation value summation of all queues is accounted for, and the weights of each queue are refreshed.
As shown in Fig. 2, the embodiment of the present invention additionally provides a kind of network resource scheduling device, the device includes acquisition
Unit, computing unit, updating block.Collecting unit is used to obtain the time delay and packet loss of data packet in intervals.Meter
Unit is calculated for judging the section where time delay and packet loss and calculating real-time weights.Updating block is used for according to real-time weights brush
New queue.
Embodiment 2
As shown in figure 3, the embodiment of the present invention 2 provides a kind of network resource scheduling method, the method includes following
Step：
S1：It monitors the rate of dequeue, time delay and feeds back to input terminal.Specific implementation process is：The output of queue scheduling
The time delay and packet loss of data packet in end monitoring intervals.
S2：Queue scheduling updates the weights of each queue according to queue rate and the time delay dynamic of feedback.It implemented
Cheng Wei：
S21：Judge the section where time delay and packet loss；Section where time delay includes：Less than minimal time delay, more than etc.
In minimal time delay and it is less than or equal to maximum delay, more than maximum delay.Section where packet loss includes：Less than minimum packet loss
Rate, more than or equal to minimum packet loss and less than or equal to maximum packet loss, more than maximum packet loss.
S22：According to the real-time weights of the interval computation where time delay and packet loss, specific implementation process is：When time delay is more than
When the maximum delay or packet loss of setting are more than maximum packet loss, queue Bandwidth adjustment parameter (w) is the bandwidth of queue at this time
Gain (g), the value of bandwidth gain are the effective bandwidth that the bandwidth actually distributed accounts for calculating with the effective bandwidth difference calculated
Percentage；When time delay is less than minimal time delay and packet loss is less than minimum packet loss, queue Bandwidth adjustment parameter is bandwidth gain
Inverse；When time delay is between minimal time delay and maximum delay, and packet loss between minimum packet loss and maximum packet loss it
Between when, queue Bandwidth adjustment parameter be 1, that is, remain unchanged.
S23：Refresh queue according to the weights of calculating, specific implementation process is：The input terminal of queue scheduling is according to output terminal
The queue Bandwidth adjustment parameter of feedback calculates the weights distribution of each queue, and the weights of queue are the new bandwidth allocation value of queue
The percentage of the new bandwidth allocation value summation of all queues is accounted for, and the weights of each queue are refreshed.
S3：Step S1-S2 is repeated, until Internet resources are in idle condition.
The embodiment of the present invention 2 additionally provides a kind of network resource scheduling device, the device as shown in Fig. 2, still,
During actual motion, three units in embodiment 2 can circular flow always, until Internet resources are in idle condition.
Although specification and drawings and examples have been carried out being described in detail to the invention, this field skill
Art personnel should be appreciated that and still the invention can be modified or replaced equivalently；And all do not depart from wound of the present invention
The technical solution for the spirit and scope made and its improvement are encompassed by among the protection domain of the invention patent.
Claims (9)
1. a kind of network resource scheduling method, it is characterized in that：The method includes：
S1：It monitors the rate of dequeue, time delay and feeds back to input terminal；
S2：Queue scheduling updates the weights of each queue according to queue rate and the time delay dynamic of feedback.
2. a kind of network resource scheduling method according to claim 1, it is characterized in that：The method further includes：
S3：Step S1-S2 is repeated, until Internet resources are in idle condition.
3. a kind of network resource scheduling method according to claim 1 or 2, it is characterized in that：The specific implementation of step S1
Cheng Wei：The time delay and packet loss of data packet in the output terminal monitoring intervals of queue scheduling.
4. a kind of network resource scheduling method according to claim 1 or 2, it is characterized in that：The specific implementation of step S2
Cheng Wei：
S21：Judge the section where time delay and packet loss；
S22：According to the interval computation adjusting parameter where time delay and packet loss；
S23：Queue is refreshed according to the adjusting parameter of calculating.
5. a kind of network resource scheduling method according to claim 4, it is characterized in that：In step S21, the area where time delay
Between include：Less than minimal time delay, more than or equal to minimal time delay and less than or equal to maximum delay, more than maximum delay.
6. a kind of network resource scheduling method according to claim 5, it is characterized in that：In step S21, where packet loss
Section includes：Less than minimum packet loss, more than or equal to minimum packet loss and less than or equal to maximum packet loss, more than maximum packet loss
Rate.
7. a kind of network resource scheduling method according to claim 6, it is characterized in that：In step S22, time delay and packet loss
The section at place and the correspondence of adjusting parameter are：
When time delay is more than maximum delay or packet loss is more than maximum packet loss, queue Bandwidth adjustment parameter W=g, wherein, g
For the bandwidth gain of queue；
When time delay is less than minimal time delay and packet loss is less than minimum packet loss, queue Bandwidth adjustment parameter W=1/g；
When time delay is between minimal time delay and maximum delay, and packet loss is between minimum packet loss and maximum packet loss
When, queue Bandwidth adjustment parameter is W=1.
8. a kind of network resource scheduling method according to claim 7, it is characterized in that：The specific implementation process of step S23
For：The queue Bandwidth adjustment parameter that the input terminal of queue scheduling is fed back according to output terminal calculates the weights distribution of each queue, team
The weights of row account for the percentage of the new bandwidth allocation value summation of all queues for the new bandwidth allocation value of queue, and to each queue
Weights refreshed.
9. a kind of network resource scheduling device, it is characterized in that：The device includes：
Collecting unit, for obtaining the time delay and packet loss of data packet in intervals；
Computing unit, for judging the section where time delay and packet loss and calculating real-time weights；
Updating block, for refreshing queue according to real-time weights.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269961.2A CN108063734A (en) | 2017-12-05 | 2017-12-05 | A kind of network resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269961.2A CN108063734A (en) | 2017-12-05 | 2017-12-05 | A kind of network resource scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108063734A true CN108063734A (en) | 2018-05-22 |
Family
ID=62135992
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711269961.2A Pending CN108063734A (en) | 2017-12-05 | 2017-12-05 | A kind of network resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108063734A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150756A (en) * | 2018-10-25 | 2019-01-04 | 重庆邮电大学 | A kind of queue scheduling weight quantization method based on SDN power telecom network |
| CN111092825A (en) * | 2018-10-23 | 2020-05-01 | 华为技术有限公司 | Method and device for transmitting message |
| CN111669339A (en) * | 2020-05-25 | 2020-09-15 | 武汉大学 | Intelligent energy station control layer service priority division and PDWRR queue scheduling method |
| CN113726562A (en) * | 2021-08-19 | 2021-11-30 | 中国电子科技集团公司第二十八研究所 | Method for evaluating network communication bandwidth required by monitoring information transmission between air traffic control systems |
| CN113906720A (en) * | 2019-06-12 | 2022-01-07 | 华为技术有限公司 | Traffic scheduling method, device and storage medium |
| CN113906720B (en) * | 2019-06-12 | 2024-05-10 | 华为技术有限公司 | Traffic scheduling method, traffic scheduling device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787424A (en) * | 2005-12-21 | 2006-06-14 | 中国科学院计算技术研究所 | Band wide redistribution method for band width changing link layering sharing and management zone |
| CN1897566A (en) * | 2005-07-14 | 2007-01-17 | 中兴通讯股份有限公司 | System and method for realizing convergent point service quality guarantee based on class grading |
| CN1960334A (en) * | 2006-09-12 | 2007-05-09 | 华为技术有限公司 | Queue dispatch method and equipment |
| CN101702667A (en) * | 2009-11-19 | 2010-05-05 | 杭州竞天数码科技有限公司 | Multi-channel synchronous working method based on multiple network modes |
| US20160308769A1 (en) * | 2015-04-14 | 2016-10-20 | Cisco Technology, Inc. | Setting delay precedence on queues before a bottleneck link based on flow characteristics |
-
2017
- 2017-12-05 CN CN201711269961.2A patent/CN108063734A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1897566A (en) * | 2005-07-14 | 2007-01-17 | 中兴通讯股份有限公司 | System and method for realizing convergent point service quality guarantee based on class grading |
| CN1787424A (en) * | 2005-12-21 | 2006-06-14 | 中国科学院计算技术研究所 | Band wide redistribution method for band width changing link layering sharing and management zone |
| CN1960334A (en) * | 2006-09-12 | 2007-05-09 | 华为技术有限公司 | Queue dispatch method and equipment |
| CN101702667A (en) * | 2009-11-19 | 2010-05-05 | 杭州竞天数码科技有限公司 | Multi-channel synchronous working method based on multiple network modes |
| US20160308769A1 (en) * | 2015-04-14 | 2016-10-20 | Cisco Technology, Inc. | Setting delay precedence on queues before a bottleneck link based on flow characteristics |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111092825A (en) * | 2018-10-23 | 2020-05-01 | 华为技术有限公司 | Method and device for transmitting message |
| CN109150756A (en) * | 2018-10-25 | 2019-01-04 | 重庆邮电大学 | A kind of queue scheduling weight quantization method based on SDN power telecom network |
| CN113906720A (en) * | 2019-06-12 | 2022-01-07 | 华为技术有限公司 | Traffic scheduling method, device and storage medium |
| CN113906720B (en) * | 2019-06-12 | 2024-05-10 | 华为技术有限公司 | Traffic scheduling method, traffic scheduling device and storage medium |
| CN111669339A (en) * | 2020-05-25 | 2020-09-15 | 武汉大学 | Intelligent energy station control layer service priority division and PDWRR queue scheduling method |
| CN111669339B (en) * | 2020-05-25 | 2022-02-15 | 武汉大学 | Intelligent energy station control layer service priority division and PDWRR queue scheduling method |
| CN113726562A (en) * | 2021-08-19 | 2021-11-30 | 中国电子科技集团公司第二十八研究所 | Method for evaluating network communication bandwidth required by monitoring information transmission between air traffic control systems |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108063734A (en) | A kind of network resource scheduling method and device | |
| CN107483363B (en) | Layered weighted polling scheduling device and method | |
| CN106294472B (en) | A kind of querying method and device of Hadoop database HBase | |
| CN104935622B (en) | A kind of method and device for message distribution, consumption, the system for Message Processing | |
| CN104079501B (en) | Queue scheduling method based on multiple priorities | |
| EP1488580B1 (en) | Method and arrangement for dinamic allocation of network resources | |
| Gedawy et al. | Cumulus: A distributed and flexible computing testbed for edge cloud computational offloading | |
| US20160380903A1 (en) | Method and apparatus for adding token in traffic shaping | |
| CN104811466B (en) | The method and device of cloud media resource allocation | |
| Pan et al. | Feedback control-based QoS guarantees in web application servers | |
| CN101765033B (en) | Dynamic time slot allocating method applied to coaxial load-bearing Ethernet equipment | |
| US8693328B2 (en) | Method and apparatus for distributing credits to multiple shapers to enable shaping traffic targets in packet communication networks | |
| CN109257303B (en) | QoS queue scheduling method and device and satellite communication system | |
| Rath et al. | Nxg02-4: An opportunistic uplink scheduling scheme to achieve bandwidth fairness and delay for multiclass traffic in wi-max (ieee 802.16) broadband wireless networks | |
| CN113342497A (en) | Task scheduling method and device, terminal equipment and computer storage medium | |
| CN105812283B (en) | Array dispatching method and device | |
| CN107423134A (en) | A kind of dynamic resource scheduling method of large-scale calculations cluster | |
| Radivilova et al. | Calculation of distributed system imbalance in condition of multifractal load | |
| EP2063580B1 (en) | Low complexity scheduler with generalized processor sharing GPS like scheduling performance | |
| CN107800647A (en) | Array dispatching method and device | |
| Zhang et al. | Scheduling latency-critical traffic: a measurement study of DRR+ and DRR++ | |
| TW201044819A (en) | Bandwidth distribution apparatus for network switch and the constribution method thereof | |
| Hajjawi et al. | Teleoperation scheduling algorithm for smart grid communications in LTE network | |
| CN113448717A (en) | Resource scheduling method and device | |
| Lee | Web Object Size satisfying mean waiting time in multiple access environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180522 |