CN101557340A - Method for realizing multilevel queue scheduling in data network and device - Google Patents
Method for realizing multilevel queue scheduling in data network and device Download PDFInfo
- Publication number
- CN101557340A CN101557340A CNA2009100838408A CN200910083840A CN101557340A CN 101557340 A CN101557340 A CN 101557340A CN A2009100838408 A CNA2009100838408 A CN A2009100838408A CN 200910083840 A CN200910083840 A CN 200910083840A CN 101557340 A CN101557340 A CN 101557340A
- Authority
- CN
- China
- Prior art keywords
- priority
- message
- strict
- module
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for realizing multilevel queue scheduling in a data network. The method comprises the following steps of: sending the message into the tail part of a corresponding queue according to the priority of the received message; if the exit direction of the current network is not congested, forwarding the message received currently; otherwise, according to the queue scheduling mode of strict priority queues, weighted fair queues and idle queues which are preset, firstly executing scheduling processing flow of the strict priority queues; then, if the exit direction of the current network also has residual bandwidth, executing scheduling processing flow of the weighted fair queues; and then, if the exit direction of the current network also has residual bandwidth, carrying out forward processing to the messages in the idle queues. The invention also provides a device used for realizing multilevel queue scheduling in the data network. The method can lead the messages without need of guarantee not to preempt the bandwidth, thus improving the flexible application capability of queue scheduling.
Description
Technical field
The present invention relates to the queue scheduling technology, relate in particular to method and the device of realizing multilevel queue scheduling in a kind of data network.
Background technology
The data volume that current network is handled is increasing, and network congestion is very common.The congested flow that makes can not in time obtain resource, is the source of causing service performance to descend.Network takes place must manage and control it when congested, and common methods is to use queue technology, also can be described as queuing policy, and these queuing policys are used for handling the situation that requirement to bandwidth has surpassed the total bandwidth that network can provide.
The key technology of in above-mentioned queuing policy, using generally be strict-priority (SP, StrictPriority) and Weighted Fair Queuing (WRR, Weighted Round Robin), or both combinations.Wherein, SP classifies to message, classification by message is sent message into corresponding formation, the message that belongs to higher priority queues after the classification will preferentially be sent, and the message that belongs to the lower priority formation will be tried to be the first at the message that higher priority queues takes place to be belonged to when congested network.The characteristics of SP are the absolute priorities that guarantee each formation, but when network was busy, the lower priority formation may can not get service for a long time.WRR sets weights for each formation, according to weights allocation schedule chance, for requiring the weights bigger than higher queue assignment, for requiring the less weights of lower queue assignment, so just can guarantee that every kind of message can both obtain service.But still there is following drawback in WRR: the service that the message that, may cause guaranteeing obtains can not meet the demands; Two, for some messages that need not guarantee, can not have under the situation of high-priority queue, make these messages that need not guarantee bandwidth-hogging not fully.
At present, prior art generally is with SP and the WRR use that combines.As shown in Figure 1, on equipment such as switch, be the SP+WRR pattern with the queue scheduling pattern configurations, the service configuration of the message that must guarantee becomes the SP pattern, and the service configuration of remaining message becomes the WRR pattern.As being that 7 message is sent into SP with priority P (P=Priority), remaining message such as priority P are that 0 message is sent into WRR; Wherein, the priority of SP, WRR from high to low.When network takes place when congested, the message among the SP will preferentially be transmitted, and the message among the WRR will be forwarded in proportion according to the weights that distribute; So just solve the drawback one that simple use WRR causes, but still can not solve drawback two well.
Summary of the invention
In view of this, method and the device of realizing multilevel queue scheduling is provided to provide in a kind of data network main purpose of the present invention, can make not bandwidth-hogging of the message that need not guarantee, thereby improves the flexible Application ability of queue scheduling.
For achieving the above object, technical scheme of the present invention is achieved in that
Realize the method for multilevel queue scheduling in a kind of data network, comprising:
When the Way out of detection current network is congested,, at first carry out the strict-priority scheduling processing flow according to this queue scheduling pattern of pre-configured strict-priority, Weighted Fair Queuing and idle queues;
After the strict-priority scheduling processing flow finished, whether the Way out that detects current network existed remaining bandwidth, if exist, then carried out the Weighted Fair Queuing handling process; Otherwise, finish current handling process;
After the Weighted Fair Queuing handling process finished, whether the Way out that detects current network existed remaining bandwidth, if exist, then the message in the idle queues was transmitted processing; Otherwise, finish current handling process.
Wherein, before the congestion condition of the Way out that detects current network, described method further comprises: according to the message of receiving with priority described message is sent into corresponding rear of queue.
Wherein, described strict-priority scheduling processing flow comprises:
Enter highest-priority queue;
Detect in the current priority formation whether have message,, then transmit the message in the current priority formation if exist; Otherwise, detect the priority query that whether has time one-level in the strict-priority, if exist, then change the priority query of time one-level over to, continue to carry out the strict-priority scheduling; Otherwise, finish current handling process;
After the message in transmitting the current priority formation, whether the Way out that detects current network exists remaining bandwidth, if there is no, then finishes current handling process; Otherwise, detect the priority query that whether has time one-level in the strict-priority, if exist, then change the priority query of time one-level over to, continue to carry out the strict-priority scheduling; Otherwise, finish current handling process.
Wherein, described Weighted Fair Queuing handling process comprises:
Whether the message number of judging all priority queries in the Weighted Fair Queuing greater than the remaining bandwidth of current network outlet direction, if then transmit message in the Weighted Fair Queuing according to pre-configured weights; Otherwise, transmit all messages in the Weighted Fair Queuing.
Wherein, utilization strict-priority technology or Weighted Fair Queuing technology or both combinations in the described idle queues.
Realize the device of multilevel queue scheduling in a kind of data network, comprising:
First detection module is used to detect the Way out of current network when congested, triggers the strict-priority scheduler module;
The strict-priority scheduler module, be used for when the Way out of current network is congested, according to this queue scheduling pattern of pre-configured strict-priority, Weighted Fair Queuing and idle queues, at first carry out the strict-priority scheduling processing flow;
Second detection module is used for after the strict-priority scheduling processing flow finishes, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers the Weighted Fair Queuing module; Otherwise, finish current handling process;
The Weighted Fair Queuing module is used to carry out the Weighted Fair Queuing handling process;
The 3rd detection module is used for after the Weighted Fair Queuing handling process finishes, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers the idle queues processing module; Otherwise, finish current handling process; And
The idle queues processing module is used for the message of idle queues is transmitted processing.
Wherein, described device further comprises: the message classifying module, be used for before the congestion condition of the Way out that detects current network, according to the message of receiving with priority described message is sent into corresponding rear of queue.
Wherein, described strict-priority scheduler module further comprises:
Highest-priority queue enters submodule, is used to enter highest-priority queue;
First detection sub-module is used for detecting the current priority formation and whether has message, if exist, then triggers message and transmits submodule; Otherwise, trigger second detection sub-module;
Message is transmitted submodule, is used for transmitting the message of current priority formation;
Second detection sub-module is used for detecting the priority query whether strict-priority exists time one-level, if exist, then triggers priority query's processing sub of time one-level; Otherwise, finish current handling process;
Priority query's processing sub of inferior one-level is used to change over to the priority query of time one-level, continues to carry out the strict-priority scheduling; And
The 3rd detection sub-module is used for after message is transmitted the message of submodule forwarding current priority formation, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers second detection sub-module; Otherwise, finish current handling process.
Wherein, described Weighted Fair Queuing module further comprises:
The message number is judged submodule, and whether the message number that is used for judging all priority queries of Weighted Fair Queuing is greater than the remaining bandwidth of current network outlet direction, if then trigger first message and transmit submodule; Otherwise, trigger second message and transmit submodule;
First message is transmitted submodule, is used for transmitting according to pre-configured weights the message of Weighted Fair Queuing; And
Second message is transmitted submodule, is used for transmitting all messages of Weighted Fair Queuing.
Wherein, described idle queues processing module is strict-priority scheduler module or Weighted Fair Queuing module or strict-priority scheduler module and Weighted Fair Queuing module.
As can be seen from the above technical solutions, the present invention realizes that the method for multilevel queue scheduling is by newly-increased one-level idle queues on existing two-stage formation basis, the message that need not guarantee is sent into idle queues, can make not bandwidth-hogging of the message that need not guarantee like this, satisfy user's demand better, thereby perfect prior art has improved the flexible Application ability in the row scheduling of actual networking squadron.
Description of drawings
Fig. 1 is the topological diagram of prior art queue scheduling;
Fig. 2 is the topological diagram of queue scheduling of the present invention;
Fig. 3 realizes the method flow diagram of multilevel queue scheduling for the present invention;
Fig. 4 is the flow chart of SP scheduling of the present invention;
Fig. 5 is the flow chart of WRR scheduling of the present invention;
Fig. 6 realizes the device schematic diagram of multilevel queue scheduling for the present invention;
Fig. 7 is the composition schematic diagram of SP scheduler module of the present invention;
Fig. 8 is the composition schematic diagram of WRR scheduler module of the present invention.
Embodiment
Below technical scheme of the present invention is described in further detail.
As shown in Figure 2, basic thought of the present invention is: in existing two-stage formation is on the SP+WRR basis, newly-increased one-level formation, and for the time being with this formation called after idle queues, and the priority of SP, WRR, idle queues is from high to low.When network takes place messages that need not guarantee to be sent to separately in the idle queues when more congested, like this, the message forwarding order changes SP → WRR → idle queues into by existing SP → WRR, so that the message that need not guarantee bandwidth-hogging not.
As shown in Figure 3, the present invention realizes that the method for multilevel queue scheduling may further comprise the steps:
Wherein, equipment can be switch or router etc.
SP, WRR and idle queues are according to priority divided, and for example, priority P is divided into 7 grades altogether, are that 7 and 6 formation classifies as SP with P; With P is that 5 and 4 formation classifies as WRR; With P is that 3 to 1 formation classifies as idle queues.In actual applications, specifically P can be decided according to the actual requirements for which formation what formation classifies as.
Described corresponding formation refers to the formation identical with priority of messages.
Wherein, the SP scheduling processing flow will be elaborated in conjunction with Fig. 4 hereinafter.
Step 307 is carried out the WRR scheduling processing flow.
Wherein, the WRR scheduling processing flow will be elaborated in conjunction with Fig. 5 hereinafter.
Step 309 is transmitted processing to the message in the idle queues.
Need to prove that idle queues inside also can use queue technologies such as SP or WRR or SP and combining of WRR, to realize the flexible dispatching of idle queues.If the queue scheduling pattern configurations of idle queues inside is the SP+WRR pattern, then the message pass-through mode in the idle queues can be with reference to Fig. 4 and flow process shown in Figure 5.Message in the idle queues is the message that need not guarantee.
After this queue scheduling is finished, wait for receiving next time message and beginning it is handled from step 302.
Can find by above flow process, after the multilevel queue scheduling technical configuration is finished,, all should begin it is handled from step 302 for the message of receiving at every turn.In addition, the priority of changing if desired in the multilevel queue scheduling technology is sorted out, and then can change as required after the former configuration of multilevel queue scheduling technology, the message of receiving is handled again.
Fig. 4 is the flow chart of SP scheduling of the present invention.Dispatches according to absolute priority when SP scheduling is meant scheduling, have only with the message in the high-priority queue send finish after, could send the message in the Low Priority Queuing.As shown in Figure 4, the flow process of SP scheduling may further comprise the steps:
Step 401 enters highest-priority queue.
Whether step 402 exists message to need to transmit in the formation of detection current priority, if exist, then execution in step 403; Otherwise, execution in step 405.
The message in the current priority formation is transmitted in step 403～404, and whether the Way out that detects current network afterwards exists remaining bandwidth, if exist, then execution in step 405; Otherwise, finish current handling process.
Step 405 detects the priority query that whether has time one-level among the SP, if exist, then execution in step 406; Otherwise, finish current handling process.
Step 406 changes the priority query of time one-level over to from the current priority formation, returns step 402 afterwards, continues to carry out the SP scheduling.
As shown in Figure 5, the flow process of WRR scheduling may further comprise the steps:
Whether step 501, the message number of judging all priority queries among the WRR be greater than the remaining bandwidth of current network outlet direction, if then execution in step 502; Otherwise, execution in step 503.
Step 502 is transmitted message among the WRR in proportion according to pre-configured weights.
Step 503 is directly transmitted all messages among the WRR.
For realizing the method for above-mentioned multilevel queue scheduling, the corresponding device of realizing multilevel queue scheduling in a kind of data network that provides of the present invention, as shown in Figure 6, this device comprises:
The 3rd detection module 70 is used for after the WRR scheduling processing flow finishes, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers idle queues processing module 80; Otherwise, finish current handling process; And
Idle queues processing module 80 is used for the message of idle queues is transmitted processing.
Wherein, described SP scheduler module 40 further comprises as shown in Figure 7:
Highest-priority queue enters submodule 41, is used to enter highest-priority queue;
Message is transmitted submodule 43, is used for transmitting the message of current priority formation;
Priority query's processing sub 45 of inferior one-level is used to change over to the priority query of time one-level, continues to carry out the SP scheduling; And
The 3rd detection sub-module 46 is used for after message is transmitted the message of submodule forwarding current priority formation, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers second detection sub-module 44; Otherwise, finish current handling process.
Wherein, described WRR scheduler module 60 further comprises as shown in Figure 8:
The message number is judged submodule 61, and whether the message number that is used for judging all priority queries of WRR is greater than the remaining bandwidth of current network outlet direction, if then trigger first message and transmit submodule 62; Otherwise, trigger second message and transmit submodule 63;
First message is transmitted submodule 62, is used for transmitting according to pre-configured weights the message of WRR; And
Second message is transmitted submodule 63, is used for transmitting all messages of WRR.
In addition, idle queues processing module 80 can be SP scheduler module or WRR scheduler module or SP scheduler module and WRR scheduler module.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.
Claims (10)
1, realize the method for multilevel queue scheduling in a kind of data network, it is characterized in that this method comprises:
When the Way out of detection current network is congested,, at first carry out the strict-priority scheduling processing flow according to this queue scheduling pattern of pre-configured strict-priority, Weighted Fair Queuing and idle queues;
After the strict-priority scheduling processing flow finished, whether the Way out that detects current network existed remaining bandwidth, if exist, then carried out the Weighted Fair Queuing handling process; Otherwise, finish current handling process;
After the Weighted Fair Queuing handling process finished, whether the Way out that detects current network existed remaining bandwidth, if exist, then the message in the idle queues was transmitted processing; Otherwise, finish current handling process.
2, realize the method for multilevel queue scheduling in the data network according to claim 1, it is characterized in that, before the congestion condition of the Way out that detects current network, described method further comprises: according to the message of receiving with priority described message is sent into corresponding rear of queue.
3, realize the method for multilevel queue scheduling in the data network according to claim 1, it is characterized in that described strict-priority scheduling processing flow comprises:
Enter highest-priority queue;
Detect in the current priority formation whether have message,, then transmit the message in the current priority formation if exist; Otherwise, detect the priority query that whether has time one-level in the strict-priority, if exist, then change the priority query of time one-level over to, continue to carry out the strict-priority scheduling; Otherwise, finish current handling process;
After the message in transmitting the current priority formation, whether the Way out that detects current network exists remaining bandwidth, if there is no, then finishes current handling process; Otherwise, detect the priority query that whether has time one-level in the strict-priority, if exist, then change the priority query of time one-level over to, continue to carry out the strict-priority scheduling; Otherwise, finish current handling process.
4, realize the method for multilevel queue scheduling in the data network according to claim 1, it is characterized in that described Weighted Fair Queuing handling process comprises:
Whether the message number of judging all priority queries in the Weighted Fair Queuing greater than the remaining bandwidth of current network outlet direction, if then transmit message in the Weighted Fair Queuing according to pre-configured weights; Otherwise, transmit all messages in the Weighted Fair Queuing.
5, realize the method for multilevel queue scheduling in the data network according to claim 1, it is characterized in that, utilization strict-priority technology or Weighted Fair Queuing technology or both combinations in the described idle queues.
6, realize the device of multilevel queue scheduling in a kind of data network, it is characterized in that this device comprises:
First detection module is used to detect the Way out of current network when congested, triggers the strict-priority scheduler module;
The strict-priority scheduler module, be used for when the Way out of current network is congested, according to this queue scheduling pattern of pre-configured strict-priority, Weighted Fair Queuing and idle queues, at first carry out the strict-priority scheduling processing flow;
Second detection module is used for after the strict-priority scheduling processing flow finishes, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers the Weighted Fair Queuing module; Otherwise, finish current handling process;
The Weighted Fair Queuing module is used to carry out the Weighted Fair Queuing handling process;
The 3rd detection module is used for after the Weighted Fair Queuing handling process finishes, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers the idle queues processing module; Otherwise, finish current handling process; And
The idle queues processing module is used for the message of idle queues is transmitted processing.
7, realize the device of multilevel queue scheduling in the data network according to claim 6, it is characterized in that, described device further comprises: the message classifying module, be used for before the congestion condition of the Way out that detects current network, according to the message of receiving with priority described message is sent into corresponding rear of queue.
8, realize the device of multilevel queue scheduling in the data network according to claim 6, it is characterized in that described strict-priority scheduler module further comprises:
Highest-priority queue enters submodule, is used to enter highest-priority queue;
First detection sub-module is used for detecting the current priority formation and whether has message, if exist, then triggers message and transmits submodule; Otherwise, trigger second detection sub-module;
Message is transmitted submodule, is used for transmitting the message of current priority formation;
Second detection sub-module is used for detecting the priority query whether strict-priority exists time one-level, if exist, then triggers priority query's processing sub of time one-level; Otherwise, finish current handling process;
Priority query's processing sub of inferior one-level is used to change over to the priority query of time one-level, continues to carry out the strict-priority scheduling; And
The 3rd detection sub-module is used for after message is transmitted the message of submodule forwarding current priority formation, and whether the Way out that detects current network exists remaining bandwidth, if exist, then triggers second detection sub-module; Otherwise, finish current handling process.
9, realize the device of multilevel queue scheduling in the data network according to claim 6, it is characterized in that described Weighted Fair Queuing module further comprises:
The message number is judged submodule, and whether the message number that is used for judging all priority queries of Weighted Fair Queuing is greater than the remaining bandwidth of current network outlet direction, if then trigger first message and transmit submodule; Otherwise, trigger second message and transmit submodule;
First message is transmitted submodule, is used for transmitting according to pre-configured weights the message of Weighted Fair Queuing; And
Second message is transmitted submodule, is used for transmitting all messages of Weighted Fair Queuing.
10, realize the device of multilevel queue scheduling in the data network according to claim 6, it is characterized in that described idle queues processing module is strict-priority scheduler module or Weighted Fair Queuing module or strict-priority scheduler module and Weighted Fair Queuing module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100838408A CN101557340B (en) | 2009-05-07 | 2009-05-07 | Method for realizing multilevel queue scheduling in data network and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100838408A CN101557340B (en) | 2009-05-07 | 2009-05-07 | Method for realizing multilevel queue scheduling in data network and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101557340A true CN101557340A (en) | 2009-10-14 |
| CN101557340B CN101557340B (en) | 2011-09-21 |
Family
ID=41175290
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100838408A Expired - Fee Related CN101557340B (en) | 2009-05-07 | 2009-05-07 | Method for realizing multilevel queue scheduling in data network and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101557340B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848149A (en) * | 2010-04-22 | 2010-09-29 | 北京航空航天大学 | Method and device for scheduling graded queues in packet network |
| CN102201984A (en) * | 2011-05-06 | 2011-09-28 | 中兴通讯股份有限公司 | Queue scheduling method and device |
| CN102594662A (en) * | 2012-01-20 | 2012-07-18 | 中兴通讯股份有限公司 | Realization method and device of quality of service |
| CN102594654A (en) * | 2011-01-17 | 2012-07-18 | 中兴通讯股份有限公司 | Method and device for queue scheduling |
| CN104410584A (en) * | 2014-12-16 | 2015-03-11 | 上海斐讯数据通信技术有限公司 | QoS queue level scheduling method |
| CN106708607A (en) * | 2015-11-12 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Congestion control method and apparatus for message queue |
| CN106789739A (en) * | 2017-02-24 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | A kind of multistage multiple row can configure schedule management method and system |
| CN108259375A (en) * | 2018-02-27 | 2018-07-06 | 盛科网络（苏州）有限公司 | A kind of implementation method and device of the dynamic load sharing of queue level |
| CN108632162A (en) * | 2017-03-22 | 2018-10-09 | 华为技术有限公司 | A kind of array dispatching method and forwarding unit |
| CN109474958A (en) * | 2018-11-30 | 2019-03-15 | 四川安迪科技实业有限公司 | Method based on intelligent optimization satellite business stream between main website and end station under DAMA mode |
| CN111638986A (en) * | 2020-06-02 | 2020-09-08 | 中电科航空电子有限公司 | QoS queue scheduling method, device, system and readable storage medium |
| CN111865838A (en) * | 2020-07-21 | 2020-10-30 | 深圳市风云实业有限公司 | Multichannel data transmission system of signal |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100466593C (en) * | 2003-01-13 | 2009-03-04 | 华为技术有限公司 | Method of implementing integrated queue scheduling for supporting multi service |
| CN100463451C (en) * | 2005-12-29 | 2009-02-18 | 中山大学 | Multidimensional queue dispatching and managing system for network data stream |
-
2009
- 2009-05-07 CN CN2009100838408A patent/CN101557340B/en not_active Expired - Fee Related
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848149B (en) * | 2010-04-22 | 2013-10-23 | 北京航空航天大学 | Method and device for scheduling graded queues in packet network |
| CN101848149A (en) * | 2010-04-22 | 2010-09-29 | 北京航空航天大学 | Method and device for scheduling graded queues in packet network |
| CN102594654A (en) * | 2011-01-17 | 2012-07-18 | 中兴通讯股份有限公司 | Method and device for queue scheduling |
| CN102594654B (en) * | 2011-01-17 | 2016-01-20 | 中兴通讯股份有限公司 | A kind of method and apparatus of queue scheduling |
| CN102201984A (en) * | 2011-05-06 | 2011-09-28 | 中兴通讯股份有限公司 | Queue scheduling method and device |
| CN102594662A (en) * | 2012-01-20 | 2012-07-18 | 中兴通讯股份有限公司 | Realization method and device of quality of service |
| CN104410584A (en) * | 2014-12-16 | 2015-03-11 | 上海斐讯数据通信技术有限公司 | QoS queue level scheduling method |
| CN106708607B (en) * | 2015-11-12 | 2020-12-22 | 创新先进技术有限公司 | Congestion control method and device for message queue |
| CN106708607A (en) * | 2015-11-12 | 2017-05-24 | 阿里巴巴集团控股有限公司 | Congestion control method and apparatus for message queue |
| CN106789739A (en) * | 2017-02-24 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | A kind of multistage multiple row can configure schedule management method and system |
| CN108632162A (en) * | 2017-03-22 | 2018-10-09 | 华为技术有限公司 | A kind of array dispatching method and forwarding unit |
| CN108259375A (en) * | 2018-02-27 | 2018-07-06 | 盛科网络（苏州）有限公司 | A kind of implementation method and device of the dynamic load sharing of queue level |
| CN108259375B (en) * | 2018-02-27 | 2021-11-26 | 苏州盛科通信股份有限公司 | Method and device for realizing dynamic load sharing of queue level |
| CN109474958A (en) * | 2018-11-30 | 2019-03-15 | 四川安迪科技实业有限公司 | Method based on intelligent optimization satellite business stream between main website and end station under DAMA mode |
| CN111638986A (en) * | 2020-06-02 | 2020-09-08 | 中电科航空电子有限公司 | QoS queue scheduling method, device, system and readable storage medium |
| CN111865838A (en) * | 2020-07-21 | 2020-10-30 | 深圳市风云实业有限公司 | Multichannel data transmission system of signal |
| CN111865838B (en) * | 2020-07-21 | 2022-03-08 | 深圳市风云实业有限公司 | Multichannel data transmission system of signal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101557340B (en) | 2011-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101557340B (en) | Method for realizing multilevel queue scheduling in data network and device | |
| CN104079501B (en) | Queue scheduling method based on multiple priorities | |
| CN108259383B (en) | Data transmission method and network equipment | |
| CN101848167B (en) | Weighted fair queue dispatching method and device based on category | |
| CN101692648B (en) | Method and system for queue scheduling | |
| CN101179486B (en) | Computer network data packet forwarded CAR queue management method | |
| US8144588B1 (en) | Scalable resource management in distributed environment | |
| CN1819577A (en) | Communication traffic management systems and methods | |
| CN101436987A (en) | Method and apparatus for scheduling and configuring QoS service | |
| US9439102B2 (en) | Transmitting apparatus, transmission method, and transmission system | |
| CN102231697A (en) | Bandwidth dispatching method of message queues as well as message reporting method and device | |
| CN103152289B (en) | A kind of multilevel service quality dispatching method and device | |
| US8379518B2 (en) | Multi-stage scheduler with processor resource and bandwidth resource allocation | |
| CN103581056A (en) | Method for achieving congestion management in network communication through layered queue scheduling | |
| CN101616096B (en) | Method and device for scheduling queue | |
| CN101562841A (en) | Service scheduling method, device and system thereof | |
| CN100525245C (en) | Device and method for multi-service grouping data dispatching | |
| CN105915468A (en) | Service scheduling method and device | |
| WO2002091757A1 (en) | A scheduling method of realizing the quality of service of router in integrated service | |
| CN102333026A (en) | Message forwarding method and device | |
| JP2001197110A (en) | Traffic control method | |
| CN107404454B (en) | Call quality adjusting method and device | |
| CN100531203C (en) | Method for ensuring service quality in multi protocol label switching protocol | |
| CN106789739A (en) | A kind of multistage multiple row can configure schedule management method and system | |
| CN110247859B (en) | Data sending method and device based on AIRT-ROS node |
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 |
Granted publication date: 20110921 Termination date: 20190507 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |