CN1889521A - Data dispatching method and system - Google Patents
Data dispatching method and system Download PDFInfo
- Publication number
- CN1889521A CN1889521A CNA2006100993151A CN200610099315A CN1889521A CN 1889521 A CN1889521 A CN 1889521A CN A2006100993151 A CNA2006100993151 A CN A2006100993151A CN 200610099315 A CN200610099315 A CN 200610099315A CN 1889521 A CN1889521 A CN 1889521A
- Authority
- CN
- China
- Prior art keywords
- queue
- formation
- scheduling unit
- scheduling
- subordinate
- 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
Abstract
A data dispatching method includes carrying out dispatch on queuing queue by upper-level dispatching unit and outputting dispatched queue to lower-level dispatching unit, detecting idle state information of received queue by lower-level dispatching unit and selecting and outputting one non-empty queue according to detected result.
Description
Technical field
The present invention relates to network communications technology field, relate in particular to a kind of data dispatching method and system.
Background technology
Transfer of data in the communication system is through the situation of regular meeting's appearance queuing, and different system bearing data flow waiting systems are transmitted and handled it, and at this moment system just need divide according to certain priority and dispatch the data flow of waiting in line.
System can carry out concrete regulation and adjustment according to user's needs, the type of data flow to the division of priority.Such as, real-time interactive data flow in data communication requires low delay, low jitter, non real-time interactive data stream requires to postpone can be bigger, but shake must be little, therefore the dispatching priority of real-time interactive data flow is set to be higher than the dispatching priority of non real-time interactive data stream, so just can guarantee the requirement separately of real-time interactive data flow and non real-time interactive data stream simultaneously.
The data rate of existing communication is more and more higher, and the data stream scheduling algorithm of participating in queuing is also become increasingly complex, and the time of dispatching algorithm computing is also more and more longer.In this case, need to improve the disposal ability of scheduler.
If the operation time (Tsch) that each scheduling is transmitted is less than data flow average arrival time (Tcin) then data flow need not be lined up substantially or only just can obtain serving with very short queuing time at interval; If but Tsch is greater than Tcin, the length of formation will constantly extend.
For communication system, Tsch is very contingent greater than the situation of Tcin, in order to reduce Tsch as far as possible, can improve scheduling frequency by the method that increases a plurality of scheduler concurrent workings to data flow, improve interior dispatching of unit interval to data flow.
At present, prior art provides the scheme of two kinds of raising scheduler performances, will describe respectively below.
First kind of implementation is: the overall performance that improves scheduler by the method that increases a plurality of scheduler concurrent workings.Along with the increase of the scheduler number of concurrent working, increase the dispatching of data flow is also corresponding thereupon.
When two schedulers are dispatched data stream, can produce " air-conditioning degree " (some the time scheduler chooses is the formation of a free time, wasted the dispatcher meeting) situation, if continue to increase the scheduler number, when improving schedule speed, the air-conditioning degree also can be more and more serious, wasted the dispatching of system to a certain extent.
Second kind of implementation is: utilize advanced semiconductor technology to improve the disposal ability of single scheduler as far as possible.
But because the performance of this scheduler depends critically upon semi-conductive technology, cost is very high, is difficult in actual applications promoting.And along with the raising of dispatching algorithm method complexity, the difficulty that this single high-performance dispatch device is realized is increasing.
Summary of the invention
The purpose of this invention is to provide a kind of data dispatching method and system,, improve dispatching efficiency to reduce the situation of data dispatch process output empty queue.
The objective of the invention is to be achieved through the following technical solutions:
A kind of data dispatching method is applied to a kind of data dispatch system, and described data dispatch system comprises subordinate's scheduling unit and a plurality of higher level's scheduling unit, and this method comprises:
A, higher level's scheduling unit are dispatched queue queue, and the formation that will be scheduled exports subordinate's scheduling unit to;
B, subordinate's scheduling unit detect the idle condition information of the formation that receives, and select a non-empty queue output according to testing result.
Described step B comprises:
B1, when the formation that is received when subordinate's scheduling unit is busy formation, subordinate's scheduling unit is with described busy queue scheduling output.
Described step B comprises:
B2, when the formation that is received when subordinate's scheduling unit is busy formation, subordinate's scheduling unit selects a busy formation to replace idle queues output from queue queue.
Described step B2 comprises:
B21, subordinate's scheduling unit carry out state-detection to the individual queue that is in queueing condition, and when queue queue comprises busy formation, subordinate's scheduling unit is selected a busy formation output from the formation that is in queueing condition.
Described step B2 comprises:
B22, subordinate's scheduling unit carry out state-detection to the individual queue that is in queueing condition, and when queue queue does not comprise busy formation, subordinate's scheduling unit is selected an idle queues output from the formation that is in queueing condition.
Subordinate's scheduling unit is to adopt the method for the heavy robin scheduling of cum rights to select a busy queue scheduling output from the formation that is in queueing condition among the described step B22.
Higher level's scheduling unit and subordinate's scheduling unit are according to predefined dispatching method scheduling queue from queue queue, wherein, predefined dispatching method is: poll WRR, the poll RR that cum rights is heavy, dynamic poll DRR, the WFQ of fair-queueing, SHVC and/or strict priority SP dispatching method that cum rights is heavy.
A kind of data dispatch system comprises at least one higher level's scheduling unit, and described system also comprises subordinate's scheduling unit, and described subordinate scheduling unit comprises:
The formation detection module is used to detect whether the formation that higher level's scheduling unit sends is empty queue;
The queue scheduling module is used for according to the status detection result from the formation of higher level's scheduling unit being selected one group of non-empty queue output.
Described queue scheduling module comprises:
Idle scheduling sublayer module is used for when detecting the formation that is scheduled and be empty queue from one group of non-empty queue of queue queue's scheduling output;
Busy scheduling sublayer module is used for exporting this formation when detecting the formation that is scheduled for non-empty queue.
As seen from the above technical solution provided by the invention, the present invention makes the less situation that the air-conditioning degree occurs of final scheduling result by subordinate's scheduling unit is set, and improves the dispatching efficiency of whole scheduler under situation about raising the cost not significantly.
Description of drawings
Figure 1 shows that the schematic diagram that formation among the embodiment one of dispatching method of the present invention and the information of being correlated with formation are transmitted in different scheduling units;
Figure 2 shows that the flow chart of the embodiment one of data dispatching method of the present invention;
Figure 3 shows that subordinate's scheduling unit workflow diagram in the embodiment of the invention one;
Figure 4 shows that the schematic diagram of dispatching patcher embodiment one of the present invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is described in detail.
Core of the present invention is that higher level's scheduling unit is dispatched queue queue, and the formation that will be scheduled exports subordinate's scheduling unit to; Subordinate's scheduling unit detects the idle condition information of the formation that receives, and selects a non-empty queue output according to testing result, to avoid exporting empty queue, improves dispatching efficiency.
Say that more specifically higher level's scheduling unit scheduling among the present invention is in formation or a plurality of higher level's scheduling unit of queueing condition dispatches the formation that is in queueing condition in turn, and exports the formation that is scheduled to the subordinate scheduling unit; Subordinate's scheduling unit detects the state information by the individual queue of higher level's scheduling unit scheduling, when formation is a non-empty queue, then directly with this formation output, when formation is empty queue, then subordinate's scheduling unit detects the state information of current each queue queue, directly select one group of non-empty queue output from queue queue, the formation that makes the present invention dispatch output is non-empty queue.
Owing to there are a plurality of non-empty queue that are in queueing condition, so need from a plurality of non-empty queue, select when higher level's scheduling unit and subordinate's scheduling unit scheduling among the present invention.
The present invention has set in advance dispatching algorithm for higher level's scheduling unit and subordinate's scheduling unit, and predefined dispatching algorithm comprises cum rights heavy poll WRR, poll RR, dynamic poll DRR, the WFQ of fair-queueing that cum rights is heavy, the dispatching algorithms such as dummy clock SHVC, strict priority SP of finalizing the design.
The detailed process of data dispatching method embodiment one provided by the invention is described below in conjunction with Fig. 1, Fig. 2 and Fig. 3:
As shown in Figure 1, after queue queue entered queue circuit, higher level's scheduling unit obtained the queue state information that scheduling unit needs from queue queue;
The state information of the scheduling result of higher level's scheduling unit and scheduling result is sent to subordinate's scheduling unit by higher level's scheduling unit then;
Subordinate's scheduling unit not only receives the information from higher level's scheduling unit, can also obtain the information of queue queue when receiving empty queue from the formation of ranking at higher level's scheduling unit;
Subordinate's scheduling unit is finally selected one group of non-empty queue output from received higher level's scheduling unit output queue or from queue queue, finish the scheduling output procedure.
In conjunction with Fig. 1, may further comprise the steps as the scheduling process of Fig. 2, dispatching method embodiment one of the present invention shown in Figure 3.
Described step 1 comprises that higher level's scheduling unit detects and safeguard state information and two processes of higher level's scheduling unit scheduling output queue of individual queue.
Higher level's scheduling unit detects and safeguards that the detailed process of state information of individual queue is as follows.
Higher level's scheduling unit detects all formations that are in queueing condition when first queue queue being dispatched, and determines that each queue queue is empty queue or is non-empty queue.
Owing to all have a plurality of non-empty queue basically in the queue queue, therefore when the scheduling non-empty queue, need determine the order of queue scheduling output.Therefore, higher level's scheduling unit after detecting the idle condition of each queue queue also the priority to each non-empty queue detect so that according to the priority orders scheduling output individual queue of each non-empty queue.
Formulating of individual queue priority according to the actual system design demand, for example the shortest for the delay that guarantees speech data, the speech data formation can be decided to be high priority, the formation of other data is decided to be low priority.
According to actual conditions, queue priority has multiple formulation standard, and what enumerated among the present invention is the part example only, and the formulation of priority is not limited to above-mentioned example.
When each scheduling computing began, all quene states at that time of the scheduler collection in higher level's scheduling unit were such as the idle condition of voice, email data queue.The data of these collections will be as the input parameter of higher level's scheduler computing.
Higher level's scheduling unit detect and safeguard the state information of individual queue after will dispatch output queue, its process is as follows.
In to the scheduling of queue queue output, because the schedule speed of single scheduling unit is limited, when the higher scheduling output speed of needs, higher level's scheduling unit need use a plurality of schedulers to dispatch in turn, and the concrete quantity of scheduler is determined according to actual conditions.
In the embodiment of the invention two, the maximum output speed of output port is 125M cell/s, and should the maximum output speed immutable, and system clock frequency is 250MHz, and promptly each clock cycle is 4ns.
All need to gather 4 formation idle conditions and therefrom select a formation because each scheduler of higher level's scheduling unit begins to finish to scheduling from scheduling among this embodiment, supposing to finish once to dispatch needs 4 clock cycle (16ns) at least, and schedule speed is up to 62.5M cell/s when using a scheduler separately.
Because the maximum output speed of output port is 125M cell/s, in order to make full use of output port, need in the embodiment of the invention two every through scheduling result of 2 clock cycle (8ns) output (with the q_sel[1:0 of 2bit] represent the queue number of choosing, on behalf of the uplink scheduling device, sel_vld oneself think that q_sel is an effective value, high level is effective), reaching speed is 125M cell/s.
Therefore need use higher level's scheduler A and higher level's scheduler device B in turn formation to be dispatched in higher level's scheduling unit, the schedule speed to formation is doubled like this, has realized scheduling result of per 2 clock cycle output.
It is 4 ranks that the priority of the queue queue in the embodiment of the invention two is divided into, and is respectively class3, class2, class1, class0 from low to high.
Present embodiment is represented the idle condition of individual queue in 4 formations respectively with 4 one bits: if a parameter of a formation correspondence is 1, represent that then this formation is empty queue; If the corresponding parameters position is 0, represent that then this formation is a non-empty queue.
In the priority of the embodiment of the invention one is divided, the class0 formation is the highest formation of priority (such as voice queue), carry out strict priority scheduling (SP between it and other formation, strictpriorty), as long as having priority in the formation is the formation of class0, then Tiao Du result just must be that selection priority is the data output of the formation of class0;
For priority is the formation of class1, class2, class3, its priority is lower than class0, present embodiment is followed the heavy fair robin scheduling (WRR, weightedround robin) of cum rights to the scheduling of these formations, and its dispatch weight is respectively a: b: c.If the idle condition parameter of three formations of class1/2/3 all is 0, promptly individual queue all is not empty, if (a+b+c) inferior scheduling is carried out in three formations altogether, formation 1 obtains a scheduling so, and formation 2 obtains b scheduling, and formation 3 obtains c scheduling.
Figure 3 shows that the detailed process of step 2.
After subordinate's scheduling unit receives the formation of higher level's scheduling unit scheduling output, need to detect the state of the formation that receives, determine that the formation that receives is idle queues or busy formation.
For the formation of different conditions, subordinate's scheduling unit adopts corresponding processing method.
Step 22, the formation that is received when subordinate's scheduling unit are idle queues, and subordinate's scheduling unit detects the state of queue queue, and select formation output.
Wherein, described step 22 comprises:
The described individual queue that is in queueing condition is meant the queue queue of being dispatched by higher level's scheduling unit not yet at higher level's scheduling unit place.
Subordinate's scheduling unit directly carries out state-detection to the formation that is in higher level's scheduling unit, determines the idle condition of individual queue.
After determining busy formation, also need the priority of each busy formation is detected, so that when scheduling output, determine the priority of output.
Subordinate's scheduling unit is selected a busy formation output from the individual queue that is in queueing condition.
Use the heavy robin scheduling method of cum rights when subordinate's scheduling unit selects a busy queue scheduling to export in the described step 221.
Because in step 221, subordinate's scheduling unit has been determined the busy formation in the queue queue, and determined the output priority of busy formation, therefore when higher level's scheduling unit output empty queue, subordinate's scheduling unit according to priority order is selected a non-empty queue scheduling output from queue queue, guarantee that the formation of final output is a non-empty queue.
As described in the embodiment of the invention one, when using two-level scheduler cell scheduling dateout, and higher level's scheduling unit is when comprising two schedulers, and the scheduling situation of its data is as shown in table 1:
| Cycle | The data that arrive | Queuing situation before the scheduling | Dispatching process | Scheduling back queuing situation |
| 0 | High priority | 0 group of the highest priority of 1 group normal priority | Scheduler A checks the formation situation | 0 group of the highest priority of 1 group normal priority |
| 1 | Normal priority | 1 group of the highest priority of 1 group normal priority | Scheduler B checks the formation situation | 1 group of the highest priority of 1 group normal priority |
| 2 | Normal priority | 2 groups of the highest priority of 1 group normal priorities | Scheduler A schedules high priority data; Scheduler C exports the high-priority data of A scheduling as final scheduling result; | 2 groups of 0 group of normal priorities of high priority |
| 3 | Normal priority | 3 groups of 0 group of normal priorities of high priority | Scheduler B schedules high priority data; There is not high-priority data in the formation; Scheduler C exports one group of general priority data as final scheduling result; | 2 groups of 0 group of normal priorities of high priority |
| 4 | High priority | 2 groups of the highest priority of 1 group normal priorities | Scheduler A scheduling normal priority data; Scheduler C exports the normal priority data as final scheduling result; | 1 group of the highest priority of 1 group normal priority |
Table 1
As can be seen from Table 1, the situation of air-conditioning degree can appear in the scheduler A of use higher level scheduling unit and scheduler B when queue queue is carried out " once scheduling ", therefore the embodiment of the invention two is after " once scheduling ", scheduler C by subordinate's scheduling unit carries out " two times scheduling " to the formation of " once scheduling " output, greatly reduces the possibility of output idle queues by " two times scheduling " embodiment of the invention two.
But owing to only comprise a spot of idle queues under normal operation in the queue queue, so the situation in the step 222 seldom occurs.
Below in conjunction with Fig. 1 and Fig. 4 data dispatch provided by the invention system is described:
Figure 4 shows that the embodiment one of data dispatch of the present invention system, comprise a plurality of higher level's scheduling units, described system also comprises subordinate's scheduling unit, and subordinate's scheduling unit comprises:
The formation detection module is used to detect whether the formation that higher level's scheduling unit sends is empty queue;
The queue scheduling module is used for according to the status detection result from the formation of higher level's scheduling unit is selected one group of non-empty queue.
Described queue scheduling module comprises:
Idle scheduling sublayer module is used for when detecting the formation that is scheduled and be empty queue from one group of non-empty queue of queue queue's scheduling output;
Busy scheduling sublayer module is used for exporting this formation when detecting the formation that is scheduled for non-empty queue.
In system of the present invention, higher level's scheduling unit exports subordinate's scheduling unit to according to the queue scheduling that priority orders will be in queueing condition; Subordinate's scheduling unit is detected by the state of state detection module to the reception formation after receiving the formation that is scheduled, and determines whether the formation that is received is idle queues; Whether after the free time, the queue scheduling module of subordinate's scheduling unit is selected a busy formation output in definite formation; When formation is busy, subordinate's scheduling unit is directly exported this formation, and when formation is idle, subordinate's scheduling unit is not exported this empty queue, non-empty queue output of scheduling from queue queue.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.
Claims (9)
1, a kind of data dispatching method is applied to a kind of data dispatch system, and described data dispatch system comprises subordinate's scheduling unit and a plurality of higher level's scheduling unit, it is characterized in that this method comprises:
A, higher level's scheduling unit are dispatched queue queue, and the formation that will be scheduled exports subordinate's scheduling unit to;
B, subordinate's scheduling unit detect the idle condition information of the formation that receives, and select a non-empty queue output according to testing result.
2, a kind of data dispatching method according to claim 1 is characterized in that, described step B is specially:
B1, when the formation that is received when subordinate's scheduling unit is busy formation, subordinate's scheduling unit is with described busy queue scheduling output.
3, a kind of data dispatching method according to claim 1 is characterized in that, described step B is specially:
B2, when the formation that is received when subordinate's scheduling unit is busy formation, subordinate's scheduling unit selects a busy formation to replace idle queues output from queue queue.
4, a kind of data dispatching method according to claim 3 is characterized in that, described step B2 is specially:
B21, subordinate's scheduling unit carry out state-detection to the individual queue that is in queueing condition, and when queue queue comprises busy formation, subordinate's scheduling unit is selected a busy formation output from the formation that is in queueing condition.
5, a kind of data dispatching method according to claim 3 is characterized in that, described step B2 is specially:
B22, subordinate's scheduling unit carry out state-detection to the individual queue that is in queueing condition, and when queue queue does not comprise busy formation, subordinate's scheduling unit is selected an idle queues output from the formation that is in queueing condition.
6, a kind of data dispatching method according to claim 4 is characterized in that, subordinate's scheduling unit is to adopt the method for the heavy robin scheduling of cum rights to select a busy queue scheduling output from the formation that is in queueing condition among the described step B21.
7, according to any described a kind of data dispatching method in the claim 1 to 6, it is characterized in that, higher level's scheduling unit and subordinate's scheduling unit are according to predefined dispatching method scheduling queue from queue queue, wherein, predefined dispatching method is: poll WRR, the poll RR that cum rights is heavy, dynamic poll DRR, the WFQ of fair-queueing, SHVC and/or strict priority SP dispatching method that cum rights is heavy.
8, a kind of data dispatch system comprises at least one higher level's scheduling unit, it is characterized in that described system also comprises subordinate's scheduling unit, and described subordinate scheduling unit comprises:
The formation detection module is used to detect whether the formation that higher level's scheduling unit sends is empty queue;
The queue scheduling module is used for according to the status detection result from the formation of higher level's scheduling unit being selected one group of non-empty queue output.
9, a kind of data dispatch according to claim 8 system is characterized in that described queue scheduling module comprises:
Idle scheduling sublayer module is used for when detecting the formation that is scheduled and be empty queue from one group of non-empty queue of queue queue's scheduling output;
Busy scheduling sublayer module is used for exporting this formation when detecting the formation that is scheduled for non-empty queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100993151A CN100456744C (en) | 2006-07-13 | 2006-07-13 | Data dispatching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100993151A CN100456744C (en) | 2006-07-13 | 2006-07-13 | Data dispatching method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1889521A true CN1889521A (en) | 2007-01-03 |
| CN100456744C CN100456744C (en) | 2009-01-28 |
Family
ID=37578780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100993151A Expired - Fee Related CN100456744C (en) | 2006-07-13 | 2006-07-13 | Data dispatching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100456744C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102271093A (en) * | 2011-09-14 | 2011-12-07 | 湖南科技大学 | Dynamic round-robin packet scheduling method with high fairness and efficiency |
| CN101860472B (en) * | 2009-04-09 | 2012-08-22 | 华为技术有限公司 | Data scheduling method, switchboard and network system |
| CN102685251A (en) * | 2012-05-31 | 2012-09-19 | 苏州阔地网络科技有限公司 | Message scheduling control method and system of web conference |
| CN102685252A (en) * | 2012-05-31 | 2012-09-19 | 苏州阔地网络科技有限公司 | Method and system for information control of netmeeting |
| CN101753608B (en) * | 2008-12-09 | 2013-06-05 | 中国移动通信集团公司 | Dispatching method and system of distributed system |
| CN110109755A (en) * | 2016-05-17 | 2019-08-09 | 青岛海信移动通信技术股份有限公司 | The dispatching method and device of process |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE60128413T2 (en) * | 2000-03-02 | 2008-01-17 | Alcatel Lucent | Featured priority queue scheduler |
| CN1225097C (en) * | 2001-06-22 | 2005-10-26 | 北京天助基业科技发展有限公司 | Internet data scheduling method and equipment |
-
2006
- 2006-07-13 CN CNB2006100993151A patent/CN100456744C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753608B (en) * | 2008-12-09 | 2013-06-05 | 中国移动通信集团公司 | Dispatching method and system of distributed system |
| CN101860472B (en) * | 2009-04-09 | 2012-08-22 | 华为技术有限公司 | Data scheduling method, switchboard and network system |
| CN102271093A (en) * | 2011-09-14 | 2011-12-07 | 湖南科技大学 | Dynamic round-robin packet scheduling method with high fairness and efficiency |
| CN102685251A (en) * | 2012-05-31 | 2012-09-19 | 苏州阔地网络科技有限公司 | Message scheduling control method and system of web conference |
| CN102685252A (en) * | 2012-05-31 | 2012-09-19 | 苏州阔地网络科技有限公司 | Method and system for information control of netmeeting |
| CN110109755A (en) * | 2016-05-17 | 2019-08-09 | 青岛海信移动通信技术股份有限公司 | The dispatching method and device of process |
| CN110109755B (en) * | 2016-05-17 | 2023-07-07 | 青岛海信移动通信技术有限公司 | Process scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100456744C (en) | 2009-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1889521A (en) | Data dispatching method and system | |
| CN106533982B (en) | The dynamic queue's dispatching device and method borrowed based on bandwidth | |
| CN102448147B (en) | Method and device for accessing wireless service | |
| CN110308967B (en) | Workflow cost-delay optimization task allocation method based on hybrid cloud | |
| CN1135798C (en) | Packet exchange equipment in data network and method thereof | |
| CN1214168A (en) | Efficient output-request packet switch and method | |
| CN1819577A (en) | Communication traffic management systems and methods | |
| CN1788459A (en) | Medium access control in master-slave systems | |
| CN101557340B (en) | Method for realizing multilevel queue scheduling in data network and device | |
| CN1263262C (en) | System and method for processing bandwidth allocation messages | |
| CN1805365A (en) | Web service QoS processor and handling method | |
| CN1819523A (en) | Parallel interchanging switching designing method | |
| CN102594663A (en) | Queue scheduling method and device | |
| CN101035067A (en) | Flow control implementation method and device based on the output queue | |
| CN1866927A (en) | Information switching realizing system and method and scheduling algorithm | |
| EP2740245A1 (en) | A scalable packet scheduling policy for vast number of sessions | |
| CN1618216A (en) | Hierarchical credit queuing for traffic shaping | |
| CN1780265A (en) | Flow controlling method for message system | |
| CN102098217B (en) | Probability-based multipriority queue scheduling method | |
| CN1925457A (en) | Device and method for multi-service grouping data dispatching | |
| CN1968270A (en) | Resource access method and apparatus | |
| CN1643874A (en) | Scheduling using quantum and deficit values | |
| CN106921586A (en) | A kind of data flow shaping methods, data dispatching method and device | |
| CN102402416A (en) | Method and device for setting dequeueing sequence of element | |
| CN102469602A (en) | Method for user multi-service dispatching |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090128 |