CN102694740A - Method and device for scheduling queue - Google Patents
Method and device for scheduling queue Download PDFInfo
- Publication number
- CN102694740A CN102694740A CN2012102175124A CN201210217512A CN102694740A CN 102694740 A CN102694740 A CN 102694740A CN 2012102175124 A CN2012102175124 A CN 2012102175124A CN 201210217512 A CN201210217512 A CN 201210217512A CN 102694740 A CN102694740 A CN 102694740A
- Authority
- CN
- China
- Prior art keywords
- scheduler object
- state
- scheduling
- scheduler
- priority
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for scheduling a queue. The method comprises the following steps of: distributing each scheduling object to a corresponding scheduling queue according to a first-state priority level of the scheduling object; when detecting that the flow of any scheduling object is more than CIR (Committed Rate) and less than MIR (Maximum Rate), switching the scheduling object to the corresponding scheduling queue according to a second-state priority level of the scheduling object; when detecting that the flow of any scheduling object is not less than the MIR, switching the scheduling object out of the current scheduling queue; scheduling each scheduling object on the scheduling queue according to an absolute priority level of each scheduling queue; and carrying out round-robin scheduling on a plurality of the scheduling objects in the same scheduling queue according to a corresponding state quota. Based on the same invention concept, the invention further provides a device which can realize different scheduling policies through configuring different scheduling parameters, thereby improving the scheduling flexibility.
Description
Technical field
The application relates to communication technical field, particularly a kind of array dispatching method and device.
Background technology
In the data communication network network, because the upstream and downstream device bandwidth is inconsistent, generation is congested easily in the data transmission procedure, for the QoS demand that guarantees different business in the network just need be dispatched in the equipment exit the flow of different business.
The relevant dispatching method that the dispatching algorithm of usually using at present has SP, RR algorithm and derives from based on this.SP can realize priority scheduling, but possibly cause Low Priority Queuing hungry to death by high-priority queue.RR can realize proportionally still can't guaranteeing a plurality of queue schedulings the priority of formation.In order to realize scheduling strategy more flexibly, the realization that has combines SP and RR, and same priority carries out the RR scheduling with regard to formation, and the SP scheduling is carried out in the formation of different priorities.The scheduling strategy flexibly that this need provide for actual multi-service flow scheduling to a certain extent, but still can not satisfy some complicated and diversified dispatching requirement fully.In fact dispatching requirement is different and changeable fully in different application, though lack flexibility for every kind of specific dispatching algorithm of application scenarios customization can satisfy certain applications.
Summary of the invention
In view of this, the application provides a kind of array dispatching method and device, can realize different scheduling strategies through the different scheduling parameter of configuration, improves dispatching flexibility.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
A kind of array dispatching method; According to scheduling strategy is each scheduler object configuration schedules parameter; Wherein, Said scheduling parameter comprises committed rate CIR, maximum rate MIR, priority of status and state quota, and said priority of status comprises first priority of status and second priority of status, and said method comprises:
First priority of status according to each said scheduler object is assigned to corresponding scheduling queue with each scheduler object; When the flow that detects arbitrary said scheduler object during, this scheduler object is switched to corresponding scheduling queue according to second priority of status of this scheduler object greater than CIR and less than MIR; When the flow that detects arbitrary said scheduler object is not less than MIR, this scheduler object switched current place scheduling queue, wherein, the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object;
Absolute priority according to each scheduling queue is dispatched each scheduler object on the scheduling queue, and a plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm.
A kind of device, this device comprises: dispensing unit, detecting unit, allocation units and scheduling unit;
Said dispensing unit; Be used for being each scheduler object configuration schedules parameter according to scheduling strategy; Wherein, said scheduling parameter comprises committed rate CIR, maximum rate MIR, priority of status and state quota, and said priority of status comprises first priority of status and second priority of status;
Said detecting unit is used to detect the flow of each scheduler object;
Said allocation units are used for according to first priority of status of each said scheduler object of said dispensing unit configuration each scheduler object being assigned to corresponding scheduling queue; When said detection to the flow of arbitrary said scheduler object during greater than CIR and less than MIR, according to second priority of status of this scheduler object of said dispensing unit configuration this scheduler object is switched to corresponding scheduling queue; When said detection when the flow of arbitrary said scheduler object is not less than MIR, this scheduler object switched current place scheduling queue, wherein, the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object;
Said scheduling unit; Be used for each scheduler object that the above allocation units of scheduling queue distribute being dispatched, a plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm according to the absolute priority of each scheduling queue.
In sum; The application passes through according to scheduling strategy each scheduler object configuration schedules parameter for scheduling; The scheduling parameter of configuration comprises the double priority level, and according to current flow of scheduler object and the relation of CIR and MIR, confirms that this scheduler object arrives the scheduling queue of correspondence according to that priority; When scheduling, each scheduler object on the scheduling queue is dispatched according to the absolute priority of each scheduling queue; A plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm, can realize different scheduling strategies, improve dispatching flexibility through the different scheduling parameter of configuration.
Description of drawings
Fig. 1 is an array dispatching method schematic flow sheet in the embodiment of the invention;
Fig. 2 is according to the scheduling parameter of each scheduler object sketch map for each scheduler object allocation schedule formation;
Fig. 3 be the flow rate of scheduler object S1 during greater than CIR each scheduler object at the distribution condition sketch map of scheduling queue;
Fig. 4 be the flow rate of scheduler object S2 during greater than CIR each scheduler object at the distribution condition sketch map of scheduling queue;
Fig. 5 be the flow rate of scheduler object S1 during greater than MIR each scheduler object at the distribution condition sketch map of scheduling queue;
Fig. 6 is for being used for the structural representation of the device of scheduling queue in the specific embodiment of the invention.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, scheme according to the invention is done to specify further.
A kind of array dispatching method is proposed in the embodiment of the invention; Be each scheduler object configuration schedules parameter; Wherein, Said scheduling parameter comprises committed rate (CIR), maximum rate (MIR), priority of status and state quota, and said priority of status comprises first priority of status and second priority of status, and said state quota comprises the first state quota and the second state quota.When the flow of arbitrary scheduler object is not more than CIR; Confirm that this scheduler object is in first state; When the flow of arbitrary scheduler object during greater than CIR and less than MIR; Confirm that this scheduler object is in second state, when the flow of arbitrary scheduler object is not less than MIR, confirm that this scheduler object is in the third state.When arbitrary scheduler object is in first state; Its corresponding scheduling parameter is first priority of status and the first state quota; When arbitrary scheduler object was in second state, its corresponding scheduling parameter was second priority of status and the second state quota, when arbitrary scheduler object is in the third state; Owing to can not be assigned on the scheduling queue, therefore not dispose corresponding priorities and state quota.
Referring to Fig. 1, Fig. 1 is an array dispatching method schematic flow sheet in the embodiment of the invention.Concrete steps are:
Step 101 is assigned to corresponding scheduling queue according to first priority of status of each scheduler object with each scheduler object; When the flow that detects arbitrary said scheduler object during, this scheduler object is switched to corresponding scheduling queue according to second priority of status of this scheduler object greater than CIR and less than MIR; When the flow that detects arbitrary said scheduler object is not less than MIR, this scheduler object switched current place scheduling queue, wherein, the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object.
When beginning the allocation schedule object in this step; The flow of each scheduler object is bound to less than CIR, therefore all is in first state, because the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object; Like queue number is 1-10; The scope that is provided with of first priority of scheduler object and second priority is 1-10 so, therefore, arrives the scheduling queue of correspondence according to each scheduler object of first priority of status distribution of each scheduler object.Adopt the scheduler object scheduling of the two quotas of double priority level in the embodiment of the invention; Therefore when arbitrary scheduler object is in the third state; This scheduler object switched scheduling queue,, also can not dispatch the scheduler object that switches scheduling queue even no any scheduler object can be dispatched on the scheduling queue.According to actual needs, the scheduling of the scheduler object of also configurable multipriority polygamy volume, concrete realization is similar with the two quotas of double priority level, gives unnecessary details no longer in detail here.
Step 102 is dispatched the flow of the scheduler object on the scheduling queue according to the absolute priority of each scheduling queue, and a plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm.
The absolute priority of each scheduling queue can be provided with in advance in this step; Queue number like scheduling queue is more little; The absolute priority of this scheduling queue is big more; Or the queue number of scheduling queue is big more, and the absolute priority of this scheduling queue is big more, and the priority of each scheduler object also need dispose according to the priority of scheduling queue accordingly.
A plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm to be comprised: when the arbitrary scheduler object in said a plurality of scheduler objects was in first state, corresponding state quota was the first state quota; When being in second state; Corresponding state quota is the second state quota, according to the corresponding state quota of the current state of living in of said a plurality of scheduler objects each scheduler object on the same scheduling queue is carried out robin scheduling through the RR algorithm, wherein; When the flow of arbitrary scheduler object is not more than CIR; This scheduler object is in first state, and when the flow of scheduler object during greater than CIR and less than MIR, this scheduler object is in second state.
When according to second priority of status of this scheduler object this scheduler object being switched to corresponding scheduling queue in the step 101, this method further comprises:
This scheduler object is carried out second state becomes the overtime timing of first state, when said time-out time then, if this scheduler object is in first state, this scheduler object is switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, this scheduler object is carried out overtime timing again; If this scheduler object is in the third state, then this scheduler object is switched and scheduling queue, wherein, when the flow of scheduler object was not less than MIR, this scheduler object was in the third state.
In the step 101 this scheduler object is switched when scheduling queue, this method further comprises:
This scheduler object is carried out the third state becomes the overtime timing of second state, when said time-out time then, if this scheduler object is in first state, this scheduler object is switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, this scheduler object is switched to corresponding scheduling queue according to its second priority of status; If this scheduler object is in the third state, then this scheduler object is carried out overtime timing again.
The wherein setting of overtime timing can realize through the mode of token bucket when specifically realizing, knows that according to the current flow of scheduler object this scheduler object second state becomes the time of the first state needs or has the third state to become the time of the second state needs.
When the scheduling parameter of said each scheduler object configuration changes, according to the scheduling parameter of each scheduler object after changing again for each said scheduler object allocation schedule formation and dispatch.Therefore, when scheduling strategy changes, can satisfy new scheduling strategy, practice thrift cost greatly through revising scheduling parameter.
How to illustrate parameter through two examples below according to each scheduler object of scheduling strategy configuration:
Scheduling strategy one has three not service traffics of apposition, is respectively F1, F2 and F3, requires F1 to guarantee 2M at least now, but restriction F1 is no more than 5M at most, and F2 guarantees 3M at least, and the maximum bandwidth of F2 is unrestricted, and F3 guarantees 3M at least, and the maximum bandwidth of F3 is unrestricted.When F1, F2, F3 were guaranteeing in the bandwidth, priority F1 was identical with F2 and be higher than F3, and F1 is 2:3 with the quota ratio of F2.When F1, F2, F3 surpassed its assurance bandwidth, priority F3 was higher than F2 and is higher than F1.
According to above-mentioned strategy, suppose that scheduling queue number N is 6, suppose interface bandwidth 10M, creating three scheduler objects is respectively S1, S2 and S3, the scheduling parameter that each scheduler object is set is following:
S1：
CIR=2M, MIR=5M, first priority of status are that 0, the second priority of status is that 5, the first state quotas are 2K, and K is a constant factor, and the second state quota is xK, and x representes arbitrary number.
S2：
CIR=3M, MIR=10M, first priority of status are that 0, the second priority of status is that 4, the first state quotas are 3K, and the second state quota is xK.
S2：
CIR=3M, MIR=10M, first priority of status are that 2, the second priority of status are that 3, the first state quotas are xK, and the second state quota is xK.
According to above-mentioned setting; Just can realize scheduling strategy; Can know that from the scheduling strategy of supposition first priority of status of F1 and F2 is identical, thus according to priority when first state, the state quota ratio of F1 and F2 need be configured; Have only service traffics during other priority, the quota ratio all can arbitrarily.
Scheduling strategy two; Suppose for a certain reason; Require now becoming F1 and be higher than F2 and be higher than F3 for exceeding priority when guaranteeing bandwidth at F1, F2, F3, the priority when exceeding it and guaranteeing bandwidth becomes the identical F1 of being higher than with F2 of F3, and the parameter that then only need adjust S1, S2 and S3 is following:
S1：
CIR=2M, MIR=5M, first priority of status are that 0, the second priority of status is that 5, the first state quotas are xK, and the second state quota is xK.
S2：
CIR=3M, MIR=10M, first priority of status are that 1, the second priority of status is that 3, the first state quotas are xK, and the second state quota is 3K.
S3：
CIR=3M, MIR=10M, first priority of status are that 2, the second priority of status are that 3, the first state quotas are xK, and the second state quota is 3K.
By on can find out, when scheduling strategy changes, only need these six parameters of adjustment just can satisfy new scheduling strategy demand.
Be example with scheduling strategy one below,, specify the specific embodiment of the invention and how to realize queue scheduling in conjunction with accompanying drawing.
During initialization; Scheduler object S1, S2 and S3 are in first state; It is on 0 the scheduling queue that the value 0,0,2 of the priority during therefore according to each scheduler object first state is assigned to queue number with scheduler object S1 and scheduler object S2; It is on 2 the scheduling queue that scheduler object S3 is assigned to queue number, and referring to Fig. 2, Fig. 2 is according to the scheduling parameter of each scheduler object sketch map for each scheduler object allocation schedule formation.Among Fig. 2 according to the absolute priority of each scheduling queue scheduling individual queue, therefore at first scheduling be that queue number is the scheduler object on 0 the scheduling queue, two scheduler objects are arranged on this scheduling queue, and carry out the RR robin scheduling according to the ratio of 2K:3K.
When the flow rate that detects scheduler object S1 during greater than 2M and less than 5M; Confirm second state that is in of scheduler object S1; Therefore when scheduler object S1 was in second state, its second priority of status was 5, and scheduler object S being switched to queue number is 5 scheduling queue; Referring to Fig. 3, Fig. 3 be the flow rate of scheduler object S1 during greater than CIR each scheduler object at the distribution condition sketch map of scheduling queue.Simultaneously scheduler object S1 is become first state by second state and carries out overtime timing, when time-out time then, if scheduler object S1 is in first state, scheduler object S1 is switched to corresponding scheduling queue according to its first priority of status; If scheduler object S1 is in second state, scheduler object S1 is carried out overtime timing again; If scheduler object S1 is in the third state, then scheduler object S1 is switched and scheduling queue, wherein, when the flow of scheduler object was not less than MIR, scheduler object S1 was in the third state.Among Fig. 3 according to the absolute priority of each scheduling queue scheduling individual queue, therefore at first scheduling be that queue number is the scheduler object on 0 the scheduling queue, 1 scheduler object is arranged on this scheduling queue, then the scheduler object S2 on this scheduling queue is dispatched.
Behind certain hour; The flow that detects scheduler object S2 confirms that scheduler object S2 is in second state, when being in second state according to scheduler object S2 during greater than 3M and less than 10M the time; Its second priority of status is 4; Therefore scheduler object S2 being switched to queue number is 4 scheduling queue, referring to Fig. 4, Fig. 4 be the flow rate of scheduler object S2 during greater than CIR each scheduler object at the distribution condition sketch map of scheduling queue.Simultaneously scheduler object S2 is become first state by second state and carries out overtime timing, when time-out time then, if scheduler object S2 is in first state, scheduler object S2 is switched to corresponding scheduling queue according to its first priority of status; If scheduler object S2 is in second state, scheduler object S2 is carried out overtime timing again; If scheduler object S2 is in the third state, then scheduler object S2 switched and scheduling queue.Among Fig. 4 according to the absolute priority of each scheduling queue scheduling individual queue, therefore at first scheduling be that queue number is the scheduler object on 2 the scheduling queue, 1 scheduler object is arranged on this scheduling queue, then the scheduler object S3 on this scheduling queue is dispatched.
Suppose certain constantly the flow of scheduler object S1 surpassed 5M, then S1 is switched and scheduling queue, referring to Fig. 5, Fig. 5 be the flow rate of scheduler object S1 during greater than MIR each scheduler object at the distribution condition sketch map of scheduling queue.Among Fig. 5 according to the absolute priority of each scheduling queue scheduling individual queue, therefore at first scheduling be that queue number is the scheduler object on 2 the scheduling queue, 1 scheduler object is arranged on this scheduling queue, then the scheduler object S3 on this scheduling queue is dispatched.Because scheduling S1 is switched and scheduling queue, though this moment scheduling queue S2 and scheduling queue S3 do not have flow to dispatch, can scheduler object S1 yet.Simultaneously scheduler object S1 is become second state by the third state and carries out overtime timing, when time-out time then, if scheduler object S1 is in first state, scheduler object S1 is switched to corresponding scheduling queue according to its first priority of status; If scheduler object S1 is in second state, then second priority of status according to scheduler object S1 switches to corresponding scheduling queue; If scheduler object S1 is in the third state, scheduler object S1 is carried out overtime timing again.
During concrete the realization, to the differentiation of each state, can first state be made as green for easily, second state is made as yellow, and the third state is made as redness.Also can realize through other forms or color according to actual needs.
Based on same inventive concept, a kind of device is proposed also in the specific embodiment of the invention.Referring to Fig. 6, Fig. 6 is for being used for the structural representation of the device of scheduling queue in the specific embodiment of the invention.This device comprises: dispensing unit 601, detecting unit 602, allocation units 603 and scheduling unit 604.
Detecting unit 602 is used to detect the flow of each scheduler object.
Preferably,
Preferably, this device further comprises: timing unit 605.
Preferably,
Preferably, this device further comprises: confirm unit 606.
The unit of the foregoing description can be integrated in one, and also can separate deployment; A unit can be merged into, also a plurality of subelements can be further split into.
In sum; In the specific embodiment of the invention according to scheduling strategy for the scheduling each scheduler object configuration schedules parameter; The scheduling parameter of configuration comprises the double priority level, and according to current flow of scheduler object and the relation of CIR and MIR, confirms that this scheduler object arrives the scheduling queue of correspondence according to that priority; When scheduling, each scheduler object on the scheduling queue is dispatched according to the absolute priority of each scheduling queue; A plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm, can realize different scheduling strategies, improve dispatching flexibility through the different scheduling parameter of configuration.
When scheduling strategy changes, only need these six parameters of adjustment just can satisfy new scheduling strategy demand, the parameter of only revising configuration just can satisfy new scheduling strategy, has not only improved the flexibility of scheduling, has greatly practiced thrift lower deployment cost simultaneously.
The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. array dispatching method; It is characterized in that; According to scheduling strategy is each scheduler object configuration schedules parameter, and wherein, said scheduling parameter comprises committed rate CIR, maximum rate MIR, priority of status and state quota; Said priority of status comprises first priority of status and second priority of status, and said method comprises:
First priority of status according to each said scheduler object is assigned to corresponding scheduling queue with each scheduler object; When the flow that detects arbitrary said scheduler object during, this scheduler object is switched to corresponding scheduling queue according to second priority of status of this scheduler object greater than CIR and less than MIR; When the flow that detects arbitrary said scheduler object is not less than MIR, this scheduler object switched current place scheduling queue, wherein, the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object;
Absolute priority according to each scheduling queue is dispatched each scheduler object on the scheduling queue, and a plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm.
2. method according to claim 1 is characterized in that, said state quota comprises the first state quota and the second state quota;
Saidly a plurality of scheduler objects on the same scheduling queue carried out robin scheduling according to the state quota of correspondence through the RR algorithm comprise:
When the arbitrary scheduler object in said a plurality of scheduler objects was in first state, corresponding state quota was the first state quota; When being in second state; Corresponding state quota is the second state quota, according to the corresponding state quota of the current state of living in of said a plurality of scheduler objects each scheduler object on the same scheduling queue is carried out robin scheduling through the RR algorithm, wherein; When the flow of arbitrary scheduler object is not more than CIR; This scheduler object is in first state, and when the flow of arbitrary scheduler object during greater than CIR and less than MIR, this scheduler object is in second state.
3. method according to claim 2 is characterized in that, when said second priority of status according to this scheduler object switched to corresponding scheduling queue with this scheduler object, said method further comprised:
This scheduler object is carried out second state becomes the overtime timing of first state, when said time-out time then, if this scheduler object is in first state, this scheduler object is switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, this scheduler object is carried out overtime timing again; If this scheduler object is in the third state, then this scheduler object is switched and scheduling queue, wherein, when the flow of scheduler object was not less than MIR, this scheduler object was in the third state.
4. method according to claim 3 is characterized in that, said this scheduler object is switched when scheduling queue, and said method further comprises:
This scheduler object is carried out the third state becomes the overtime timing of second state, when said time-out time then, if this scheduler object is in first state, this scheduler object is switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, this scheduler object is switched to corresponding scheduling queue according to its second priority of status; If this scheduler object is in the third state, then this scheduler object is carried out overtime timing again.
5. according to the method described in any one of the claim 1-4, it is characterized in that said method further comprises:
When the scheduling parameter of said each scheduler object configuration changes, according to the scheduling parameter of each scheduler object after changing again for each said scheduler object allocation schedule formation and dispatch.
6. a device is characterized in that, this device comprises: dispensing unit, detecting unit, allocation units and scheduling unit;
Said dispensing unit; Be used for being each scheduler object configuration schedules parameter according to scheduling strategy; Wherein, said scheduling parameter comprises committed rate CIR, maximum rate MIR, priority of status and state quota, and said priority of status comprises first priority of status and second priority of status;
Said detecting unit is used to detect the flow of each scheduler object;
Said allocation units are used for according to first priority of status of each said scheduler object of said dispensing unit configuration each scheduler object being assigned to corresponding scheduling queue; When said detection to the flow of arbitrary said scheduler object during greater than CIR and less than MIR, according to second priority of status of this scheduler object of said dispensing unit configuration this scheduler object is switched to corresponding scheduling queue; When said detection when the flow of arbitrary said scheduler object is not less than MIR, this scheduler object switched current place scheduling queue, wherein, the queue number of each scheduling queue is corresponding with the value of the priority of status of scheduler object;
Said scheduling unit; Be used for each scheduler object that the above allocation units of scheduling queue distribute being dispatched, a plurality of scheduler objects on the same scheduling queue are carried out robin scheduling according to the state quota of correspondence through the RR algorithm according to the absolute priority of each scheduling queue.
7. device according to claim 6 is characterized in that,
Said dispensing unit, state quota described in the scheduling parameter of configuration comprise the first state quota and the second state quota;
Said scheduling unit is used for when arbitrary scheduler object of said a plurality of scheduler objects is in first state, and corresponding state quota is the first state quota; When being in second state; Corresponding state quota is the second state quota, according to the corresponding state quota of the current state of living in of said a plurality of scheduler objects each scheduler object on the same scheduling queue is carried out robin scheduling through the RR algorithm, wherein; When the flow of arbitrary scheduler object is not more than CIR; This scheduler object is in first state, and when the flow of scheduler object during greater than CIR and less than MIR, this scheduler object is in second state.
8. device according to claim 7 is characterized in that said device further comprises: timing unit;
Said timing unit is used for when said allocation units switch to corresponding scheduling queue according to second priority of status of this scheduler object with this scheduler object, this scheduler object being carried out second state becoming the overtime timing of first state;
Said allocation units are further used for working as said timing unit timing time-out time then, if this scheduler object is in first state, this scheduler object are switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, triggers said timing unit this scheduler object is carried out overtime timing again; If this scheduler object is in the third state, then this scheduler object is switched and scheduling queue, wherein, when the flow of scheduler object was not less than MIR, this scheduler object was in the third state.
9. device according to claim 8 is characterized in that,
Said timing unit is further used for when said allocation units this scheduler object being switched when scheduling queue, this scheduler object is carried out the third state become the overtime timing of second state;
Said allocation units are further used for working as said timing unit timing time-out time then, if this scheduler object is in first state, this scheduler object are switched to corresponding scheduling queue according to its first priority of status; If this scheduler object is in second state, this scheduler object is switched to corresponding scheduling queue according to its second priority of status; If this scheduler object is in the third state, then triggers said timing unit this scheduler object is carried out overtime timing again.
10. according to the device described in any one of the claim 6-9, it is characterized in that said device further comprises: confirm the unit;
Said definite unit, whether the scheduling parameter that is used for said each scheduler object configuration of definite said dispensing unit configuration changes;
Said allocation units; Be further used for when said definite unit confirms that the scheduling parameter of said each scheduler object configuration changes, according to the scheduling parameter of each scheduler object after changing again for each said scheduler object allocation schedule formation and trigger said scheduling unit and dispatch.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210217512.4A CN102694740B (en) | 2012-06-28 | 2012-06-28 | A kind of array dispatching method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210217512.4A CN102694740B (en) | 2012-06-28 | 2012-06-28 | A kind of array dispatching method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102694740A true CN102694740A (en) | 2012-09-26 |
| CN102694740B CN102694740B (en) | 2015-10-28 |
Family
ID=46860029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210217512.4A Active CN102694740B (en) | 2012-06-28 | 2012-06-28 | A kind of array dispatching method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102694740B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104917692A (en) * | 2015-06-26 | 2015-09-16 | 杭州华三通信技术有限公司 | Method and device for distributing tokens |
| CN109408208A (en) * | 2018-09-21 | 2019-03-01 | 深圳华大北斗科技有限公司 | Multi-task processing method, equipment, system and the storage medium of navigation chip |
| WO2024164959A1 (en) * | 2023-02-06 | 2024-08-15 | 中兴通讯股份有限公司 | Message processing method and apparatus, and electronic device and computer-readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6862265B1 (en) * | 2000-04-13 | 2005-03-01 | Advanced Micro Devices, Inc. | Weighted fair queuing approximation in a network switch using weighted round robin and token bucket filter |
| US7499398B2 (en) * | 2003-04-16 | 2009-03-03 | International Business Machines Corporation | Method and system for oversubscribing bandwidth in a communications network |
| CN101692648A (en) * | 2009-08-14 | 2010-04-07 | 中兴通讯股份有限公司 | Method and system for queue scheduling |
| CN101938403A (en) * | 2009-06-30 | 2011-01-05 | 中国电信股份有限公司 | Assurance method of multi-user and multi-service quality of service and service access control point |
| CN102036131A (en) * | 2009-09-28 | 2011-04-27 | 中兴通讯股份有限公司 | End-to-end QoS (Quality of Service) control method and device based on GPON (Gigabit Passive Optical Network) system |
-
2012
- 2012-06-28 CN CN201210217512.4A patent/CN102694740B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6862265B1 (en) * | 2000-04-13 | 2005-03-01 | Advanced Micro Devices, Inc. | Weighted fair queuing approximation in a network switch using weighted round robin and token bucket filter |
| US7499398B2 (en) * | 2003-04-16 | 2009-03-03 | International Business Machines Corporation | Method and system for oversubscribing bandwidth in a communications network |
| CN101938403A (en) * | 2009-06-30 | 2011-01-05 | 中国电信股份有限公司 | Assurance method of multi-user and multi-service quality of service and service access control point |
| CN101692648A (en) * | 2009-08-14 | 2010-04-07 | 中兴通讯股份有限公司 | Method and system for queue scheduling |
| CN102036131A (en) * | 2009-09-28 | 2011-04-27 | 中兴通讯股份有限公司 | End-to-end QoS (Quality of Service) control method and device based on GPON (Gigabit Passive Optical Network) system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104917692A (en) * | 2015-06-26 | 2015-09-16 | 杭州华三通信技术有限公司 | Method and device for distributing tokens |
| CN104917692B (en) * | 2015-06-26 | 2018-05-11 | 新华三技术有限公司 | A kind of method and apparatus for distributing token |
| CN109408208A (en) * | 2018-09-21 | 2019-03-01 | 深圳华大北斗科技有限公司 | Multi-task processing method, equipment, system and the storage medium of navigation chip |
| WO2024164959A1 (en) * | 2023-02-06 | 2024-08-15 | 中兴通讯股份有限公司 | Message processing method and apparatus, and electronic device and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102694740B (en) | 2015-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102130823B (en) | Method and network apparatus for communicating data | |
| CN104348750B (en) | The implementation method and device of QoS in OpenFlow network | |
| CN101834786B (en) | Queue scheduling method and device | |
| CN101692648B (en) | Method and system for queue scheduling | |
| CN108809707A (en) | A kind of TSN dispatching methods towards real-time application demand | |
| CN104239154B (en) | Job scheduling method and job scheduler in a kind of Hadoop clusters | |
| US11929911B2 (en) | Shaping outgoing traffic of network packets in a network management system | |
| CN102868638A (en) | Method and system for dynamically regulating bandwidth | |
| CN101427533A (en) | Broadband access network capacity management | |
| CN102521057A (en) | Resource scheduling method and device | |
| CN102594663A (en) | Queue scheduling method and device | |
| CN108809856A (en) | The traffic scheduling method of power communication heterogeneous network | |
| CN102546395B (en) | Business scheduling method and device based on L2VPN networks | |
| US20050078655A1 (en) | Hierarchical credit queuing for traffic shaping | |
| CN102694740A (en) | Method and device for scheduling queue | |
| CN109617836A (en) | The intelligent bandwidth distribution method and distribution system of satellite data transmission | |
| CN109617806A (en) | A kind of data traffic dispatching method and device | |
| Basu et al. | A reverse path-flow mechanism for latency aware controller placement in vsdn enabled 5g network | |
| CN102780630B (en) | A kind of method and apparatus realizing QoS queue based on FPGA queue | |
| CN102609307A (en) | Multi-core multi-thread dual-operating system network equipment and control method thereof | |
| CN106330710B (en) | Data stream scheduling method and device | |
| CN104094562A (en) | Reservation system for an ethernet network | |
| CN102769566B (en) | A kind of Multi-stage scheduling system configuration, variation and device | |
| CN103281258B (en) | A kind of data transmission method for uplink and device | |
| Guo et al. | Delay aware RSA algorithm based on scheduling of differentiated services with dynamic virtual topology construction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |