CN109347764A - Scheduling method, system and medium for realizing bandwidth matching - Google Patents
Scheduling method, system and medium for realizing bandwidth matching Download PDFInfo
- Publication number
- CN109347764A CN109347764A CN201811152179.7A CN201811152179A CN109347764A CN 109347764 A CN109347764 A CN 109347764A CN 201811152179 A CN201811152179 A CN 201811152179A CN 109347764 A CN109347764 A CN 109347764A
- Authority
- CN
- China
- Prior art keywords
- queue
- credit
- value
- credit balance
- scheduling
- 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
- 238000000034 method Methods 0.000 title claims abstract description 24
- 239000013589 supplement Substances 0.000 claims description 51
- 230000001502 supplementing effect Effects 0.000 claims description 14
- 230000000295 complement effect Effects 0.000 claims description 12
- 230000006735 deficit Effects 0.000 claims description 12
- 238000009434 installation Methods 0.000 claims description 6
- 230000008901 benefit Effects 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 4
- 230000001960 triggered effect Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 abstract description 3
- 239000003550 marker Substances 0.000 abstract 2
- 238000004364 calculation method Methods 0.000 abstract 1
- 101100221606 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) COS7 gene Proteins 0.000 description 8
- 101100221605 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) COS6 gene Proteins 0.000 description 6
- 101000964746 Homo sapiens Zinc finger protein 69 Proteins 0.000 description 4
- 102100040717 Zinc finger protein 69 Human genes 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 101100007331 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) COS3 gene Proteins 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/623—Weighted service order
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a scheduling method, a system and a medium for realizing bandwidth matching, which comprises the following steps: an initial quota step: initializing and setting respective credit quota values of the plurality of queues according to respective preconfigured weight values of the plurality of queues, and setting the credit quota value of each queue as a credit allowance value of each queue according to the credit quota value; and a queue scheduling step: judging whether each queue can be scheduled or not to obtain a schedulable queue; and scheduling according to the credit balance value of each schedulable queue and the priority level of each queue to obtain the scheduled queue and the current credit balance value of the queue. In the implementation process of the algorithm, the calculation of the credit balance adopts a leaky bucket algorithm with a marker bit, the marker bit can conveniently represent the red condition of the leaky bucket, and the credit balance represented by the leaky bucket is combined, so that each service flow can be scheduled strictly according to the preset bandwidth.
Description
Technical field
The present invention relates to digital information transmission technical fields, and in particular, to a kind of dispatching method for realizing bandwidth match,
System and medium.
Background technique
With the expansion of network size, the growth of user, the different business stream carried on network wants service quality
It asks and is also very different.In general, the QoS mass of every Business Stream by queuing scheduling mechanism realize, the mechanism it is main
Purpose is to provide for each Business Stream certain quality of service guarantee (such as bandwidth, time delay and delay variation, packet loss), scheduling
The basic function of device is exactly network trunk node or router how to be selected from one or more queues it is next to be forwarded
Grouping.
One effective queuing scheduling mechanism depends on the dispatching algorithm that it is used, and measures the performance indicator master of dispatching algorithm
Have: equitable degree, delay character, the isolation characteristic to malicious stream, link bandwidth utilization rate, complexity etc..At present in interchanger
The common queue scheduling algorithm of middle application has SP, RR, WRR etc..
SP scheduling:
Strict priority scheduling is scheduled out team's forwarding fully according to the priority of queue, Priority Service high priority
Non-empty queue.As shown in Figure 1, if COS7 queue not empty, scheduling COS7 queue first；If COS7 queue empty, dispatches COS6
Queue；If COS5 queue is dispatched by COS6 queue empty；And so on.
RR scheduling:
Polling dispatching is according to queue sequence, since schedules high priority queue, successively dispatches entire set of queues, recycles past
Multiple, individual queue scheduling has equal opportunities.As shown in Figure 1, successively dispatching non-empty queue from COS7 queue to COS0 queue.
WRR scheduling:
Weight Round Robin is to be polled scheduling according to preset weighted value to each queue, from schedules high priority team
Column start, and successively dispatch entire set of queues.If the scheduling times of some queue reach default weighted value, in other queue schedulings
Number no longer triggers scheduling when not up to presetting weighted value.As shown in Fig. 2, from COS3 queue to COS0 queue, according to weighted value 4
Scheduling is polled to 1.Dispatching sequence is as shown in Figure 2.
Queue scheduling algorithm SP is suitable for application simply, very high to certain application services requirement, and other business are relatively not
High application, advantage are that configuration is simple, the bandwidth of absolute guarantee's high-priority applications.The disadvantage is that it cannot be guaranteed that outside high priority
Service obtains reasonable bandwidth, thus the service quality of the various applications of guarantee that cannot be fair.
RR scheduling is directed to number of data frames, carries out same indiscriminate circulation to different Packet Service queues and adjusts
Degree service, such scheduling mode is fair for isometric service queue, but the business in network is to be grouped structure by random length
At, therefore different queues is likely to have different block lengths, as a result the big service queue of block length receives more
Service, be that unfairness is produced between queue, WRR be based on poll, only be greater than 1 polling cycle time on
It is fair to embody, but when queued packets differ in size formula, the bandwidth allocation that it can not be fair.
WDRR scheduling is according to data frame length adjust automatically scheduling strategy, to reach and band shared by every Packet Service
Width matching solves RR and WRR and dispatches the unfairness being grouped to random length, and is well suited for being applied to different business distribution not
Same bandwidth.
Summary of the invention
For the defects in the prior art, the object of the present invention is to provide a kind of dispatching method for realizing bandwidth match, be
System and medium.
A kind of dispatching method for realizing bandwidth match provided according to the present invention, comprising:
Initial quota step: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are each
From credit quota value the credit balance of individual queue is set the credit quota value of individual queue to according to the credit quota value
Value；
Queue scheduling step: judge whether individual queue is schedulable, obtain schedulable queue；According to the letter of each schedulable queue
It is scheduled with the priority of remaining sum value and individual queue height, the current credit balance value of queue and queue after being dispatched；
It supplements judgment step with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judging whether to need
Carry out credit supplement: if so, continuing to execute into credit supplement step；Otherwise, then queue scheduling step is returned to continue to hold
Row；
Credit supplements step: supplementing the current credit balance value of all queues, after the completion of supplement, returns to queue tune
Degree step continues to execute.
Preferably, the queue scheduling step includes:
Empty queue judgment step: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, acquisition can
Scheduling queue is continued to execute into credit scheduling steps；Otherwise, then determine that all queues are schedulable, dispatch and walk into credit
Suddenly it continues to execute；
Credit scheduling steps: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to default
The priority height of queue successively dispatch the queue that credit balance value is greater than 0, adjust according to the sequence of priority from high to low
After spending successfully, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling respectively, as working as individual queue
Preceding credit balance value.
Preferably, the judgment step of supplementing with money includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so,
It is continued to execute into credit supplement step；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so,
Then the queue to credit balance value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, return queue scheduling step after
It is continuous to execute；Otherwise, then queue scheduling step is returned to continue to execute.
Preferably, the credit supplement step includes:
Credit deficit judgment step: whether the current credit balance value for judging the queue being added is negative value, if so, adopting
It takes deficit to supply processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit
Credit balance value in remaining sum value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit
Quota value, the current credit balance value after being supplemented；
Credit overflows judgment step: whether the current credit balance value after judging supplement is greater than credit quota value: if so,
Current credit balance value after supplement is arranged is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then defeated
Current credit balance value after supplementing out.
A kind of scheduling system for realizing bandwidth match provided according to the present invention, comprising:
Initial quota module: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are each
From credit quota value the credit balance of individual queue is set the credit quota value of individual queue to according to the credit quota value
Value；
Queue scheduling module: judge whether individual queue is schedulable, obtain schedulable queue；According to the letter of each schedulable queue
It is scheduled with the priority of remaining sum value and individual queue height, the current credit balance value of queue and queue after being dispatched；
It supplements judgment module with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judging whether to need
Carry out credit supplement: if so, triggering credit complementary module；Otherwise, then queue scheduling module is triggered；
Credit complementary module: supplementing the current credit balance value of all queues, after the completion of supplement, triggers queue tune
Spend module.
Preferably, the queue scheduling module includes:
Empty queue judgment module: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, acquisition can
Scheduling queue triggers credit scheduler module；Otherwise, then determine that all queues are schedulable, trigger credit scheduler module；
Credit scheduler module: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to default
The priority height of queue successively dispatch the queue that credit balance value is greater than 0, adjust according to the sequence of priority from high to low
After spending successfully, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling respectively, as working as individual queue
Preceding credit balance value.
Preferably, the judgment module of supplementing with money includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so,
Trigger credit complementary module；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so, to credit
Queue of the remaining sum value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, triggers queue scheduling module；Otherwise, then it touches
It transmits and uses scheduler module.
Preferably, the credit complementary module includes:
Credit deficit judgment module: whether the current credit balance value for judging the queue being added is negative value, if so, adopting
It takes deficit to supply processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit
Credit balance value in remaining sum value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit
Quota value, the current credit balance value after being supplemented；
Credit overflows judgment module: whether the current credit balance value after judging supplement is greater than credit quota value: if so,
Current credit balance value after supplement is arranged is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then defeated
Current credit balance value after supplementing out.
A kind of computer readable storage medium for being stored with computer program provided according to the present invention, the computer journey
The step of dispatching method described in any of the above embodiments for realizing bandwidth match is realized when sequence is executed by processor.
Compared with prior art, the present invention have it is following the utility model has the advantages that
1, weighting difference polling priority queue scheduling algorithm is solved by the credit quota value distributed for each Business Stream
RR scheduling, WRR dispatch the unjustness in variable-length packets environment, original without increasing RR, WRR algorithm during realization
Complexity.Even if the volume of services that the different each service queues of block length obtain is not more than its quota, so that each industry be isolated
Influencing each other between business.
2, during the realization of algorithm, the calculating of credit balance uses the token bucket algorithm with flag bit, flag bit energy
The convenient deficit situation for indicating leaky bucket can make each Business Stream in strict accordance with pre-set bandwidths in conjunction with the credit balance that leaky bucket indicates
It is dispatched.
Detailed description of the invention
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, other feature of the invention,
Objects and advantages will become more apparent upon:
Fig. 1 is the scheduling schematic diagram of 8 COS queues provided by the invention.
Fig. 2 is that the WRR of 4 COS queues provided by the invention dispatches schematic diagram.
Fig. 3 is that the WDRR for 8 COS queues that preference of the present invention provides dispatches schematic diagram.
Specific embodiment
The present invention is described in detail combined with specific embodiments below.Following embodiment will be helpful to the technology of this field
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that the ordinary skill of this field
For personnel, without departing from the inventive concept of the premise, several changes and improvements can also be made.These belong to the present invention
Protection scope.
A kind of dispatching method for realizing bandwidth match provided according to the present invention, comprising:
Initial quota step: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are each
From credit quota value the credit balance of individual queue is set the credit quota value of individual queue to according to the credit quota value
Value；Further, the unit of the credit balance value and credit quota value is as unit of byte Byte.
Queue scheduling step: judge whether individual queue is schedulable, obtain schedulable queue；According to the letter of each schedulable queue
It is scheduled with the priority of remaining sum value and individual queue height, the current credit balance value of queue and queue after being dispatched；
It supplements judgment step with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judging whether to need
Carry out credit supplement: if so, continuing to execute into credit supplement step；Otherwise, then queue scheduling step is returned to continue to hold
Row；
Credit supplements step: supplementing the current credit balance value of all queues, after the completion of supplement, returns to queue tune
Degree step continues to execute.
Specifically, the queue scheduling step includes:
Empty queue judgment step: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, acquisition can
Scheduling queue is continued to execute into credit scheduling steps；Otherwise, then determine that all queues are schedulable, dispatch and walk into credit
Suddenly it continues to execute；
Credit scheduling steps: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to default
The priority height of queue successively dispatch the queue that credit balance value is greater than 0, adjust according to the sequence of priority from high to low
After spending successfully, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling respectively, as working as individual queue
Preceding credit balance value.
Specifically, the judgment step of supplementing with money includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so,
It is continued to execute into credit supplement step；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so,
Then the queue to credit balance value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, return queue scheduling step after
It is continuous to execute；Otherwise, then queue scheduling step is returned to continue to execute.
Specifically, the credit supplement step includes:
Credit deficit judgment step: whether the current credit balance value for judging the queue being added is negative value, if so, adopting
It takes deficit to supply processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit
Credit balance value in remaining sum value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit
Quota value, the current credit balance value after being supplemented；Further, it is carried out using the method for highest order expression flag bit,
I.e. 1 data indicates credit balance value more than actual use bit wide.Further, queue is indicated using data [n:0],
Wherein data [n-1:0] is credit balance value, and data [n] is the positive and negative mode bit of data data, when data [n] is 0, is indicated just
Number indicates negative when data [n] is 1.
Credit overflows judgment step: whether the current credit balance value after judging supplement is greater than credit quota value: if so,
Current credit balance value after supplement is arranged is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then defeated
Current credit balance value after supplementing out.
The scheduling system provided by the invention for realizing bandwidth match, the tune for the realization bandwidth match that can be given through the invention
The step process of degree method is realized.The dispatching method for realizing bandwidth match can be interpreted as institute by those skilled in the art
State a preference for realizing the scheduling system of bandwidth match.
A kind of scheduling system for realizing bandwidth match provided according to the present invention, comprising:
Initial quota module: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are each
From credit quota value the credit balance of individual queue is set the credit quota value of individual queue to according to the credit quota value
Value；
Queue scheduling module: judge whether individual queue is schedulable, obtain schedulable queue；According to the letter of each schedulable queue
It is scheduled with the priority of remaining sum value and individual queue height, the current credit balance value of queue and queue after being dispatched；
It supplements judgment module with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judging whether to need
Carry out credit supplement: if so, triggering credit complementary module；Otherwise, then queue scheduling module is triggered；
Credit complementary module: supplementing the current credit balance value of all queues, after the completion of supplement, triggers queue tune
Spend module.
Specifically, the queue scheduling module includes:
Empty queue judgment module: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, acquisition can
Scheduling queue triggers credit scheduler module；Otherwise, then determine that all queues are schedulable, trigger credit scheduler module；
Credit scheduler module: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to default
The priority height of queue successively dispatch the queue that credit balance value is greater than 0, adjust according to the sequence of priority from high to low
After spending successfully, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling respectively, as working as individual queue
Preceding credit balance value.
Specifically, the judgment module of supplementing with money includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so,
Trigger credit complementary module；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so, to credit
Queue of the remaining sum value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, triggers queue scheduling module；Otherwise, then it touches
It transmits and uses scheduler module.
Specifically, the credit complementary module includes:
Credit deficit judgment module: whether the current credit balance value for judging the queue being added is negative value, if so, adopting
It takes deficit to supply processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit
Credit balance value in remaining sum value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit
Quota value, the current credit balance value after being supplemented；
Credit overflows judgment module: whether the current credit balance value after judging supplement is greater than credit quota value: if so,
Current credit balance value after supplement is arranged is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then defeated
Current credit balance value after supplementing out.
A kind of computer readable storage medium for being stored with computer program provided according to the present invention, the computer journey
The step of dispatching method described in any of the above embodiments for realizing bandwidth match is realized when sequence is executed by processor.
The present invention is more specifically illustrated below by preference.
Embodiment 1:
The realization principle of weighting difference polling priority queue scheduling algorithm is: there is a weighted value in each priority query,
The respective bandwidth for determining each activity queue in each scheduling, is similar to credit card mechanism, each priority query is not
It is similar to the different credit card of each own credit line of each priority query with weighted value, credit line determines every
The bandwidth of queue consumption.Then scheduling is polled according to the credit quota of each priority query and credit balance state,
Middle credit quota determines by preconfigured weighted value, can be as unit of byte, and credit balance is used to indicate credit quota
Accumulation and Expenditure Levels, are scheduled by the state of credit balance to determine how.Wherein, the calculating of credit balance uses
Token bucket algorithm with flag bit.
Weighting difference polling priority queue scheduling algorithm, specific step is as follows:
1, when initial, each queue initializes respective credit quota according to the weighted value of configuration, credit balance at this time
Equal to credit quota, the unit of credit balance and credit quota is as unit of byte Byte.
2, the high-priority queue that credit balance is greater than 0 is dispatched first, after dispatching successfully, the credit of the priority query
Remaining sum subtracts the length of data frame, then dispatches the secondary high-priority queue that credit balance is greater than 0, and so on.
3, when the credit balance value of some queue is less than or equal to 0, then the queue stops scheduling, waits credit balance value big
It could be dispatched again when 0.On how indicating the problem of credit balance is negative, highest order, which can be used, indicates flag bit
Method carry out, i.e., 1 data indicate credit balance value, such as data [n:0] more than actual use bit wide, wherein
Data [n-1:0] is credit balance value, and data [n] is the positive and negative mode bit of data data, when data [n] is 0, indicates positive number,
When data [n] is 1, negative is indicated.
4, when the credit balance value of each queue is both less than equal to 0 or each queue is sky, the letter of all queues
(current credit balance value adds credit quota value) is supplemented with remaining sum value.In calculating process, it should be noted that two o'clock, first is that
The credit balance value recalculated should be not more than set credit quota value, second is that should take if credit balance value is negative value
Deficit supplies processing, and increased credit quota value first supplies the negative value of credit balance, and then residual value is then added in credit balance value.
As shown in figure 3, the credit quota value of COS7 and COS6 queue is three times of COS5 to COS0, COS7 and COS6 queue
Corresponding leaky bucket depth is also three times of COS5 to COS0, so when each queue scheduling 12KB data volume, COS7 and COS6
The also surplus 24KB of the credit balance of queue, moreover it is possible to continue to be dispatched, and the credit balance of COS5 to COS0 queue is 0, not
It can be dispatched.When COS7 and COS6 queue continues to scheduled 24KB data volume, the credit balance of the two queues at this time is 0,
Then trigger the supplement of all queue credit remaining sum values.Queue assignments all in this way to bandwidth ratio is exactly credit quota value ratio.
One skilled in the art will appreciate that in addition to realizing system provided by the invention in a manner of pure computer readable program code
It, completely can be by the way that method and step be carried out programming in logic come so that provided by the invention other than system, device and its modules
System, device and its modules are declined with logic gate, switch, specific integrated circuit, programmable logic controller (PLC) and insertion
The form of controller etc. realizes identical program.So system provided by the invention, device and its modules may be considered that
It is a kind of hardware component, and the knot that the module for realizing various programs for including in it can also be considered as in hardware component
Structure；It can also will be considered as realizing the module of various functions either the software program of implementation method can be Hardware Subdivision again
Structure in part.
Specific embodiments of the present invention are described above.It is to be appreciated that the invention is not limited to above-mentioned
Particular implementation, those skilled in the art can make a variety of changes or modify within the scope of the claims, this not shadow
Ring substantive content of the invention.In the absence of conflict, the feature in embodiments herein and embodiment can any phase
Mutually combination.
Claims (9)
1. a kind of dispatching method for realizing bandwidth match characterized by comprising
Initial quota step: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are respective
Credit quota value sets the credit quota value of individual queue to the credit balance value of individual queue according to the credit quota value；
Queue scheduling step: judge whether individual queue is schedulable, obtain schedulable queue；More than the credit of each schedulable queue
The priority of volume value and individual queue height is scheduled, the current credit balance value of queue and queue after being dispatched；
Supplement judgment step with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judge whether to need into
Row credit supplement: if so, being continued to execute into credit supplement step；Otherwise, then queue scheduling step is returned to continue to execute；
Credit supplements step: supplementing the current credit balance value of all queues, after the completion of supplement, returns to queue scheduling step
Suddenly it continues to execute.
2. the dispatching method according to claim 1 for realizing bandwidth match, which is characterized in that the queue scheduling step packet
It includes:
Empty queue judgment step: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, obtaining schedulable
Queue is continued to execute into credit scheduling steps；Otherwise, then determine that all queues are schedulable, into credit scheduling steps after
It is continuous to execute；
Credit scheduling steps: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to preset team
The priority height of column is successively dispatched the queue that credit balance value is greater than 0, is scheduled to according to the sequence of priority from high to low
After function, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling, the current letter as individual queue respectively
With remaining sum value.
3. the dispatching method according to claim 1 for realizing bandwidth match, which is characterized in that described to supplement judgment step packet with money
It includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so, into
Credit supplement step continues to execute；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so, right
Queue of the credit balance value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, returns to queue scheduling step and continues to hold
Row；Otherwise, then queue scheduling step is returned to continue to execute.
4. the dispatching method according to claim 1 for realizing bandwidth match, which is characterized in that the credit supplements step packet
It includes:
Credit deficit judgment step: whether the current credit balance value for judging the queue being added is negative value, if so, taking red
Word supplies processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit balance
Credit balance value in value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit quota
Value, the current credit balance value after being supplemented；
Credit overflows judgment step: whether the current credit balance value after judging supplement is greater than credit quota value: if so, setting
Current credit balance value after supplement is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then benefit is exported
Current credit balance value after filling.
5. a kind of scheduling system for realizing bandwidth match characterized by comprising
Initial quota module: according to the respective preconfigured weighted value of multiple queues, the multiple queues of Initialize installation are respective
Credit quota value sets the credit quota value of individual queue to the credit balance value of individual queue according to the credit quota value；
Queue scheduling module: judge whether individual queue is schedulable, obtain schedulable queue；More than the credit of each schedulable queue
The priority of volume value and individual queue height is scheduled, the current credit balance value of queue and queue after being dispatched；
Supplement judgment module with money: according to the current credit balance value of queue and queue after the scheduling of acquisition, judge whether to need into
Row credit supplement: if so, triggering credit complementary module；Otherwise, then queue scheduling module is triggered；
Credit complementary module: supplementing the current credit balance value of all queues, after the completion of supplement, triggers queue scheduling mould
Block.
6. the scheduling system according to claim 5 for realizing bandwidth match, which is characterized in that the queue scheduling module packet
It includes:
Empty queue judgment module: judge whether there is empty queue in individual queue: if so, stopping scheduling empty queue, obtaining schedulable
Queue triggers credit scheduler module；Otherwise, then determine that all queues are schedulable, trigger credit scheduler module；
Credit scheduler module: according to the credit balance value of the schedulable queue of acquisition and each schedulable queue, according to preset team
The priority height of column is successively dispatched the queue that credit balance value is greater than 0, is scheduled to according to the sequence of priority from high to low
After function, the credit balance value of individual queue is subtracted to the length of the data frame of individual queue scheduling, the current letter as individual queue respectively
With remaining sum value.
7. the scheduling system according to claim 5 for realizing bandwidth match, which is characterized in that described to supplement judgment module packet with money
It includes:
Judge whether that all queues are that the current credit balance value of empty or all queues is respectively less than equal to 0: if so, triggering
Credit complementary module；Otherwise, then the queue that current credit balance value is less than or equal to 0 is judged whether there is: if so, to credit balance
Queue of the value less than or equal to 0 stops scheduling, obtains remaining schedulable queue, triggers queue scheduling module；Otherwise, then letter is triggered
Use scheduler module.
8. the scheduling system according to claim 5 for realizing bandwidth match, which is characterized in that the credit complementary module packet
It includes:
Credit deficit judgment module: whether the current credit balance value for judging the queue being added is negative value, if so, taking red
Word supplies processing, i.e., increased credit quota value is first supplied to the negative value of credit balance, residual value is then then added to credit balance
Credit balance value in value, after being supplemented；Otherwise, then the current credit balance value for the queue being added is added into credit quota
Value, the current credit balance value after being supplemented；
Credit overflows judgment module: whether the current credit balance value after judging supplement is greater than credit quota value: if so, setting
Current credit balance value after supplement is equal to credit quota value, the current credit balance value after output supplement；Otherwise, then benefit is exported
Current credit balance value after filling.
9. a kind of computer readable storage medium for being stored with computer program, which is characterized in that the computer program is located
The step of reason device realizes the dispatching method described in any one of Claims 1-4 for realizing bandwidth match when executing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811152179.7A CN109347764A (en) | 2018-09-29 | 2018-09-29 | Scheduling method, system and medium for realizing bandwidth matching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811152179.7A CN109347764A (en) | 2018-09-29 | 2018-09-29 | Scheduling method, system and medium for realizing bandwidth matching |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109347764A true CN109347764A (en) | 2019-02-15 |
Family
ID=65308120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811152179.7A Pending CN109347764A (en) | 2018-09-29 | 2018-09-29 | Scheduling method, system and medium for realizing bandwidth matching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109347764A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113824652A (en) * | 2020-06-19 | 2021-12-21 | 华为技术有限公司 | Method and device for scheduling queue |
| CN114363267A (en) * | 2020-09-30 | 2022-04-15 | 华为技术有限公司 | Queue scheduling method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621478A (en) * | 2009-08-07 | 2010-01-06 | 中兴通讯股份有限公司 | Method and device for array dispatch |
| US20160142331A1 (en) * | 2014-11-14 | 2016-05-19 | Xpliant | Packet scheduling using hierarchical scheduling process with priority propagation |
-
2018
- 2018-09-29 CN CN201811152179.7A patent/CN109347764A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621478A (en) * | 2009-08-07 | 2010-01-06 | 中兴通讯股份有限公司 | Method and device for array dispatch |
| US20160142331A1 (en) * | 2014-11-14 | 2016-05-19 | Xpliant | Packet scheduling using hierarchical scheduling process with priority propagation |
Non-Patent Citations (1)
| Title |
|---|
| 乔俊超: "流量管理中队列调度算法研究", 《电视技术》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113824652A (en) * | 2020-06-19 | 2021-12-21 | 华为技术有限公司 | Method and device for scheduling queue |
| WO2021254475A1 (en) * | 2020-06-19 | 2021-12-23 | 华为技术有限公司 | Method and apparatus for scheduling queue |
| EP4156614A4 (en) * | 2020-06-19 | 2023-11-08 | Huawei Technologies Co., Ltd. | Method and apparatus for scheduling queue |
| CN113824652B (en) * | 2020-06-19 | 2024-04-30 | 华为技术有限公司 | Method and device for scheduling queues |
| CN114363267A (en) * | 2020-09-30 | 2022-04-15 | 华为技术有限公司 | Queue scheduling method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1774714B1 (en) | Hierarchal scheduler with multiple scheduling lanes | |
| US9042224B2 (en) | Method and system for weighted fair queuing | |
| CN106533982B (en) | The dynamic queue's dispatching device and method borrowed based on bandwidth | |
| EP2464058B1 (en) | Queue scheduling method and apparatus | |
| US8339949B2 (en) | Priority-aware hierarchical communication traffic scheduling | |
| US7929438B2 (en) | Scheduler pipeline design for hierarchical link sharing | |
| CN101414958B (en) | Method and apparatus for scheduling business | |
| US7843940B2 (en) | Filling token buckets of schedule entries | |
| US20090207846A1 (en) | Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule | |
| CN109639596A (en) | A kind of Scheduling of Gateway method for vehicle-mounted CAN-CANFD hybrid network | |
| CN109347764A (en) | Scheduling method, system and medium for realizing bandwidth matching | |
| CN111400206A (en) | Cache management method based on dynamic virtual threshold | |
| CN100593312C (en) | Scheduling using quantum and deficit values | |
| CN100456744C (en) | Data dispatching method and system | |
| CN105978824A (en) | Frame queue scheduling traffic shaping method and system | |
| US7385987B1 (en) | Scheduling system and method for multi-level class hierarchy | |
| US8467401B1 (en) | Scheduling variable length packets | |
| US7599381B2 (en) | Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group | |
| CN103546392A (en) | Single queue cycle dispatching method and device | |
| CN102594670B (en) | Multiport multi-flow scheduling method, device and equipment | |
| Tokmakov et al. | A case for data centre traffic management on software programmable ethernet switches | |
| Luangsomboon et al. | A round-robin packet scheduler for hierarchical max-min fairness | |
| EP1774721B1 (en) | Propagation of minimum guaranteed scheduling rates | |
| Chen et al. | A Fair Queue Scheduling Algorithm Based on Pre-allocation of Quantum Keys | |
| CN117938855A (en) | Method and system for supplying and distributing containerized service resources for cloud edge computing network system |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190215 |
|
| RJ01 | Rejection of invention patent application after publication |