CN102158420A - Service traffic scheduling method based on priority queue and device thereof - Google Patents
Service traffic scheduling method based on priority queue and device thereof Download PDFInfo
- Publication number
- CN102158420A CN102158420A CN2011101366026A CN201110136602A CN102158420A CN 102158420 A CN102158420 A CN 102158420A CN 2011101366026 A CN2011101366026 A CN 2011101366026A CN 201110136602 A CN201110136602 A CN 201110136602A CN 102158420 A CN102158420 A CN 102158420A
- Authority
- CN
- China
- Prior art keywords
- priority
- bandwidth
- query
- service traffics
- 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 service traffic scheduling method based on priority queues and a device thereof. A first priority queue, a second priority queue and a third priority queue are arranged corresponding to service traffic priorities, and the first priority query and the second priority query are respectively provided with limited bandwidth. The method comprises the steps of firstly, scheduling first priority service traffic which is not higher than the limited bandwidth of the first priority queue to the first priority queue, scheduling second priority service traffic according to the method, and scheduling third priority service traffic which is not higher than link residual bandwidth to the third priority queue; secondly, scheduling the first priority service traffic which is not higher than the residual bandwidth and not scheduled to the third priority queue if link residual bandwidth still exists and the first priority service traffic is not scheduled; and thirdly, scheduling the second priority service traffic according to the method if link residual bandwidth still exists and the second priority service traffic is not scheduled. The method can improve the bandwidth availability ratio.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of service traffics dispatching method and device thereof based on Priority Queues.
Background technology
As shown in Figure 1, networking schematic diagram for tree-like convergence in the current wide area network, each subsystem (as video conferencing system, service control system, office resource system etc.) of total portion mechanism need be shared by each branch, and the service traffics of each branch's visit different sub-systems have different priority.
For example, the service traffics of the service traffics of the service traffics of accessing video conference system with high priority, access service control system with medium priority, visit office resource system have low priority.On the egress router of each branch, the service traffics that can be every kind of priority are provided with the corresponding priorities formation, and the service traffics that are high priority are provided with the formation of high top grade elder generation, the medium priority formation are set, Low Priority Queuing are set for the service traffics of low priority for the service traffics of medium priority.Wherein, can set qualification bandwidth high, the medium priority formation according to long-time average discharge, and remaining bandwidth is distributed to Low Priority Queuing.
When the service traffics with respective priority were dispatched to corresponding priority query, except that lowest priority queue, the service traffics in other each priority query should not surpass the qualification bandwidth of formation separately; For the lowest priority service traffics, then the bandwidth in these lowest priority service traffics is no more than under the situation of current link remaining bandwidth, and the lowest priority service traffics are dispatched in the lowest priority queue.When transmitting service traffics, transmit like this according to the service traffics in each priority query of priority sequential scheduling from high to low based on priority query.
The inventor finds that there is following problem at least in prior art in realizing process of the present invention:
When qualification bandwidth according to priority query, the respective priority service traffics are dispatched to after other formation except that lowest priority queue, if the remaining bandwidth of current link is more, but the lowest priority service traffics are less, then have the part bandwidth in the lowest priority queue and are not utilized the waste that causes bandwidth resources.
Scheduling as shown in Figure 2 concerns schematic diagram, supposes that the link total bandwidth is 2M, and it is 0.5M that high-priority queue limits bandwidth, and it is 1M that the medium priority formation limits bandwidth.According to scheduling relation shown in Figure 2, work as height, in, the service traffics of low priority are respectively 1M, 0.8M, 0.2M the time, the integrated dispatch effect as shown in Figure 3, there is the high-priority service flow of 0.5M to be scheduled (the 0.5M service traffics that exceed can't be scheduled), there are the medium priority service traffics of 0.8M to be scheduled (can all be scheduled), the low priority traffice flow of the 0.2M (height that is scheduled is arranged, the shared 1.3M of medium priority service traffics, residue 0.7M uses for the low priority traffice flow, be that the low priority traffice flow can all be scheduled), therefore amounting to utilized bandwidth is 1.5M, bandwidth availability ratio 1.5M/2M=75%.
Summary of the invention
The invention provides a kind of service traffics dispatching method and device thereof,, improve bandwidth availability ratio rationally to utilize bandwidth resources based on Priority Queues.
In the service traffics dispatching method based on priority query provided by the invention, corresponding service traffics priority is provided with priority first, second and the 3rd priority query from high to low, wherein, first and second priority queries are respectively arranged with the qualification bandwidth, and this method comprises:
Bandwidth is no more than first priority query limits the first priority service flow scheduling of bandwidth in first priority query, bandwidth is no more than the second priority service flow scheduling that second priority query limits bandwidth in second priority query, bandwidth is no more than in the 3rd priority service flow scheduling to the three priority queries of link remaining bandwidth;
If still have the link remaining bandwidth and also have the first priority service flow not to be scheduled, then will be no more than this remaining bandwidth and also not in the first priority service flow scheduling to the, three priority queries of scheduling;
If still have the link remaining bandwidth and also have the second priority service flow not to be scheduled, then will be no more than this remaining bandwidth and also not in the second priority service flow scheduling to the, three priority queries of scheduling.
Service traffics dispatching device based on priority query provided by the invention, be applied to the service traffics forwarding unit, corresponding service traffics priority was provided with priority first, second and the 3rd priority query from high to low during this was provided with, wherein, first and second priority queries are respectively arranged with the qualification bandwidth, and this device comprises:
First scheduler module, be used for that bandwidth is no more than first priority query and limit the first priority service flow scheduling of bandwidth to first priority query, bandwidth is no more than the second priority service flow scheduling that second priority query limits bandwidth in second priority query, bandwidth is no more than in the 3rd priority service flow scheduling to the three priority queries of link remaining bandwidth;
Second scheduler module is used for still having the link remaining bandwidth and also having under the situation that the first priority service flow is not scheduled, and will be no more than this remaining bandwidth and also not in the first priority service flow scheduling to the, three priority queries of scheduling; Afterwards, still have the link remaining bandwidth and also having under the situation that the second priority service flow is not scheduled, will be no more than this remaining bandwidth and also not in the second priority service flow scheduling to the, three priority queries of scheduling.
Compared with prior art, the present invention has the following advantages at least:
After the service traffics that will be no more than priority query's qualification bandwidth are dispatched to the corresponding priorities formation, if link bandwidth still has residue, and the high-priority service flow that is not scheduled in addition, then with the high-priority service flow scheduling in lowest priority queue, thereby under the prerequisite of the bandwidth constraints that guarantees each priority service flow, the bandwidth of each priority service flow can flexible allocation, big limit shared bandwidth, utilizes bandwidth, has improved bandwidth availability ratio.
Description of drawings
Fig. 1 is the networking schematic diagram of the tree-like convergence in the wide area network in the prior art;
Fig. 2 is that scheduling concerns schematic diagram in the prior art;
Fig. 3 is the integrated dispatch effect schematic diagram of the relation of dispatching based on Fig. 2 in the prior art;
Fig. 4 is a kind of service traffics scheduling flow figure based on Priority Queues that the embodiment of the invention provides;
Fig. 5 A and Fig. 5 B are respectively the schematic flow sheet that service traffics is dispatched to priority query that the embodiment of the invention provides;
Fig. 6 is the integrated dispatch effect schematic diagram of the embodiment of the invention;
Fig. 7 is the service traffics dispatching device schematic diagram based on Priority Queues that the embodiment of the invention provides.
Embodiment
The embodiment of the invention proposes a kind of service traffics scheduling mechanism based on Priority Queues, this scheduling mechanism can be applicable to have on the equipment (as router) of service traffics forwarding capability, by on router, using the embodiment of the invention, can rationally utilize link bandwidth resource.
Below in conjunction with accompanying drawing the embodiment of the invention is described in detail.
In the service traffics scheduling mechanism based on Priority Queues of prior art, corresponding service traffics priority is respectively arranged with the corresponding priority level formation, wherein, except that lowest priority queue, other priority query all is provided with the qualification bandwidth separately, the bandwidth of lowest priority queue is not done concrete restriction, and its maximum bandwidth deducts the already used bandwidth of other priority query for the link total bandwidth.Its service traffics scheduling process comprises: for the service traffics of other each priority of removing lowest priority, limit this priority service flow scheduling of bandwidth in this correspondence priority query with being no more than corresponding priority query, for the lowest priority service traffics, the lowest priority service traffics that bandwidth are no more than the link remaining bandwidth are dispatched in the lowest priority queue.The embodiment of the invention is improved on this basis, as shown in Figure 4, comprising:
In this step, if current also have service traffics not to be scheduled in the priority query and current remaining bandwidth in addition, then the priority of these service traffics necessarily is higher than lowest priority.
In this step, not if current not reaching in the priority query that limits bandwidth, there is the priority of a plurality of priority queries all to be lower than the service traffics of limit priority in these service traffics of not dispatching, then when select target priority query, can from these priority queries, select the highest formation of priority, also can select remaining bandwidth to be enough to hold the formation of these service traffics that need dispatch.Certainly, when these service traffics of also dispatching of scheduling arrive the target priority formation, should not surpass the qualification bandwidth (for non-lowest priority queue) or the maximum bandwidth (for lowest priority queue) of this target priority formation.
Further, after service traffics being dispatched to priority query, just can carrying out service traffics and transmit based on priority query according to above-mentioned flow process, that is, and according to the service traffics in each priority query of priority sequential scheduling from high to low.Especially, if the service traffics of different priorities are arranged in certain priority query, the service traffics of then first dispatching priority corresponding with the priority of this formation (promptly identical) are dispatched the service traffics of other priority again according to the sequencing that enters this formation.
By above flow process as can be seen, after the service traffics that will be no more than priority query's qualification bandwidth are dispatched to the corresponding priorities formation, if link bandwidth still has residue, and service traffics that are not scheduled in addition, then the service traffics that this is not scheduled are lower than in the formation of this service traffics priority to priority, thereby under the prerequisite of the bandwidth constraints that guarantees each priority service flow, the bandwidth of each priority service flow can flexible allocation, big limit shared bandwidth, utilize bandwidth, improved bandwidth availability ratio.
Be example with situation below, the above-mentioned flow process of the embodiment of the invention is described in detail with 3 priority queries.
In the present embodiment, the service traffics in the operation system have 3 priority: high, in and low priority.The division of service traffics priority can be carried out according to Different Strategies, the priority of the service traffics that for example, the priority of the service traffics of accessing video conference system is the highest, the office resource system is taken second place, visited to the priority of the service traffics of access service control system is minimum; Again for example, destination address is that the priority of the service traffics that priority priority the highest, that destination address is the service traffics of IP2 is taken second place, destination address is IP3 of service traffics of IP1 is minimum.
At first, priority according to service traffics in the operation system, physical link at egress router is provided with 3 formation (queue_1, queue_2 queue_3), is respectively high, medium and low 3 priority of each queue assignment, wherein, the priority of queue_1 is the highest, and queue_2 takes second place, and queue_3 is minimum.Be respectively queue_1 and queue_2 the qualification bandwidth is set, for queue_3 the qualification bandwidth is not set, the maximum bandwidth of queue_3 is that current link total bandwidth deducts the bandwidth that queue_1 and queue_2 have used.
When the subscriber equipment in the branch need be visited the subsystem of total portion mechanism, can send service traffics at this subsystem, service traffics are on the equipment between subscriber equipment and the egress router (as switch, router etc.), can be set up priority level sign (being provided with) as subsystem according to visit, therefore, egress router can receive the service traffics of having carried the priority level sign, and can carry out the service traffics scheduling based on above-mentioned priority query.Its scheduling process comprises: at first, service traffics are dispatched in the priority query (specifically can shown in Fig. 5 A or Fig. 5 B flow process), according to priority order from high to low, the service traffics in each priority query are transmitted processing then.
Referring to Fig. 5 A, a kind of service traffics are dispatched to the schematic flow sheet of priority query for what the embodiment of the invention provided, as shown in the figure, this flow process can comprise:
Step 510 will be no more than the high-priority service flow scheduling of qualification bandwidth of queue_1 in queue_1.
Exceed at the high-priority service flow bandwidth under the situation of queue_1 qualification bandwidth, the service traffics bandwidth that is dispatched in this step among the queue_1 equals this qualification bandwidth, and the high-priority service flow that exceeds queue_1 qualification bandwidth is scheduled among the queue_3.
Step 511 is dispatched to the medium priority service traffics that are no more than the qualification bandwidth of queue_2 among the queue_2.
Exceed in medium priority service traffics bandwidth under the situation of queue_2 qualification bandwidth, the service traffics bandwidth that is dispatched in this step among the queue_2 equals this qualification bandwidth, and the medium priority service traffics that exceed queue_2 qualification bandwidth are scheduled among the queue_3.
Step 512, according to current link remaining bandwidth, with the low priority traffice flow scheduling in queue_3.
In this step, when the schedules low priority service traffics, need at first calculate current link remaining bandwidth, if current link remaining bandwidth is not less than the low priority traffice flow bandwidth, then with the low priority traffice flow scheduling in queue_3.If current link remaining bandwidth is less than the low level service traffics earlier of disturbing, and high priority or medium priority service traffics in queue_3, have been dispatched, high priority that then will be wherein or the partial discharge in the medium priority service traffics or all flow from queue_3, remove, so that hold the low priority traffice flow, the bandwidth of the service traffics that removed is current link remaining bandwidth (if this difference, then removes whole high priorities and low priority traffice flow greater than high priority that exists among the queue_3 and low priority traffice flow bandwidth) for the low priority traffice bandwidth deducts.If current link remaining bandwidth is less than the low priority traffice flow, and do not have high priority or low priority traffice flow in queue_3, the low priority traffice flow scheduling that then will be no more than current link remaining bandwidth is in queue_3.In this step, if the queue_3 queue full then carries out packet loss according to the principle of tail drop and handles.
Wherein, the remaining bandwidth of physical link can calculate according to following formula:
The remaining bandwidth of physical link=physical link bandwidth-queue_1 is dedicated bandwidth-queue_2 dedicated bandwidth-queue_3 dedicated bandwidth.
In the above-mentioned flow process, low Priority Queues is if queue full then carries out packet loss according to the principle of tail drop and handles.
In order to simplify implementation procedure, the embodiment of the invention is further improved on the basis of flow process shown in Fig. 5 A, obtains the flow process shown in Fig. 5 B, and as shown in the figure, this flow process can comprise:
Step 520 will be no more than the high-priority service flow scheduling of qualification bandwidth of queue_1 in queue_1.Exceed at the high-priority service flow bandwidth under the situation of queue_1 qualification bandwidth, the service traffics bandwidth that is dispatched in this step among the queue_1 equals this qualification bandwidth.
Step 521 is dispatched to the medium priority service traffics that are no more than the qualification bandwidth of queue_2 among the queue_2.Exceed in medium priority service traffics bandwidth under the situation of queue_2 qualification bandwidth, the service traffics bandwidth that is dispatched in this step among the queue_2 equals this qualification bandwidth.
Step 522 will be no more than the low priority traffice flow scheduling of current link remaining bandwidth in queue_3.Exceed at the priority service flow bandwidth under the situation of current link remaining bandwidth, the service traffics bandwidth that is dispatched in this step among the queue_3 equals this link remaining bandwidth.
Step 523 is judged the current link remaining bandwidth that whether also has, and whether is also had the not high-priority service flow of scheduling, if then change step 524 over to; Otherwise change step 525 over to.
Step 524, with not the scheduling the high-priority service flow scheduling to queue_3.Wherein, the total bandwidth that is dispatched to the service traffics among the queue_3 should not surpass the maximum bandwidth (being that the total bandwidth of current link deducts the bandwidth that queue_1 and queue_2 have used) of this formation.
Step 525 is judged the current link remaining bandwidth that whether also has, and whether is also had the not medium priority service traffics of scheduling, if then change step 526 over to; Otherwise process ends.
Step 526 is dispatched to queue_3 with the medium priority service traffics of not dispatching.Wherein, the total bandwidth that is dispatched to the service traffics among the queue_3 should not surpass the maximum bandwidth (being that the total bandwidth of current link deducts the bandwidth that queue_1 and queue_2 have used) of this formation.
In the above-mentioned flow process,, dispatch in the process of the service traffics in each priority query and (promptly transmit the service traffics among the queue_1 earlier, transmit the service traffics among the queue_2 again, transmit the service traffics among the queue_3 at last) according to priority order from high to low.If except the low priority traffice flow is arranged, also have the higher priority service traffics among the queue_3, then at first send the low priority traffice flow among the queue_3, again according to the order that enters the queue_3 formation, send the service traffics of other priority.
In order more clearly to set forth technical scheme provided by the invention, be further detailed below in conjunction with concrete application.
For example, to have other service traffics of high priority be 1M, have other service traffics of medium priority is 0.8M, have other service traffics of low priority is that to allow utilized bandwidth be that to allow utilized bandwidth be that 1M, port total bandwidth are that to allow utilized bandwidth be remaining bandwidth (being the employed bandwidth of other service traffics of port total bandwidth-high priority other service traffics of employed bandwidth-medium priority) for 2M, low Priority Queues for 0.5M, middle Priority Queues for 0.2M, high Priority Queues.
By adopting technical scheme provided by the invention, it is 0.5M that high Priority Queues allows utilized bandwidth, and then having in other service traffics of high priority has 0.5M to be injected into high Priority Queues, and the 0.5M of overage is downgraded in the low Priority Queues; It is 1M that middle Priority Queues allows utilized bandwidth, and all have other service traffics of medium priority 0.8M and are injected into middle Priority Queues; It is 0.7M (0.8M that other service traffics of 0.5M-medium priority that other service traffics of 2M-high priority take take) that low Priority Queues allows utilized bandwidth, all have other service traffics of low priority 0.2M and are injected into low Priority Queues, still remain 0.5M in the low Priority Queues this moment, 0.5M distributed to other service traffics of 0.5M high priority that are downgraded to low Priority Queues.
Further, the high Priority Queues 0.5M of egress router priority scheduling, this moment, link bandwidth remained 1.5M; Priority Queues 0.8M in dispatching again, this moment, link bandwidth remained 0.7M; The low Priority Queues 0.7M of scheduling at last, this moment, the link remaining bandwidth was 0, bandwidth is utilized fully.As shown in Figure 5, for adopting the resultant effect schematic diagram after the technical scheme provided by the invention.
Based on identical technical conceive, the embodiment of the invention also provides a kind of service traffics dispatching device based on priority query.
Referring to Fig. 7, the structural representation that provides for the embodiment of the invention based on the service traffics dispatching device of priority query.The communication equipment of (as transmitting) function that this device can be applicable to have the service traffics scheduling is as router.Corresponding service traffics priority was provided with priority first, second and the 3rd priority query from high to low during this was provided with, and wherein, first and second priority queries are respectively arranged with the qualification bandwidth, and are concrete, and this device can comprise:
First scheduler module 701, be used for that bandwidth is no more than first priority query and limit the first priority service flow scheduling of bandwidth to first priority query, bandwidth is no more than the second priority service flow scheduling that second priority query limits bandwidth in second priority query, bandwidth is no more than in the 3rd priority service flow scheduling to the three priority queries of link remaining bandwidth;
Second scheduler module 702 is used for still having the link remaining bandwidth and also having under the situation that the first priority service flow is not scheduled, and will be no more than this remaining bandwidth and also not in the first priority service flow scheduling to the, three priority queries of scheduling; Afterwards, still have the link remaining bandwidth and also having under the situation that the second priority service flow is not scheduled, will be no more than this remaining bandwidth and also not in the second priority service flow scheduling to the, three priority queries of scheduling.
Said apparatus also can comprise the 3rd scheduler module 703, is used for according to priority order from high to low, and service traffics are wherein transmitted in formation one by one.Further, the 3rd scheduler module 703 can be according to priority order from high to low, formation is transmitted in the process of service traffics wherein one by one, when the service traffics in forwarding the 3rd priority query, at first transmit the 3rd priority service flow wherein, after the 3rd priority service flow is finished in forwarding, if also have other priority service flow in the 3rd priority query, then, transmit described other priority service flow according to the sequencing that enters the 3rd priority query.
In the said apparatus, second scheduler module 702 also can be used for: do not had remaining bandwidth at current link, but still had service traffics not to be dispatched under the situation in the priority query, abandoned the service traffics that also are not dispatched in the priority query.
In the said apparatus, first scheduler module 701 and second scheduler module 702 can be determined the link remaining bandwidth in such a way: deduct first priority query, second priority query and the 3rd priority query dedicated bandwidth respectively from the physical link total bandwidth, obtain the link remaining bandwidth.
Wherein, each module of apparatus of the present invention can be integrated in one, and also can separate deployment.Above-mentioned module can be merged into a module, also can further split into a plurality of submodules.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by hardware, also can realize by the mode that software adds necessary general hardware platform.Based on such understanding, technical scheme of the present invention can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, module in the accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of the foregoing description can be merged into a module, also can further split into a plurality of submodules.
The invention described above sequence number is not represented the quality of embodiment just to description.
More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, any those skilled in the art can think variation all should fall into protection scope of the present invention.
Claims (10)
1. service traffics dispatching method based on priority query, it is characterized in that corresponding service traffics priority is provided with priority first, second and the 3rd priority query from high to low, wherein, first and second priority queries are respectively arranged with the qualification bandwidth, and this method comprises:
Bandwidth is no more than first priority query limits the first priority service flow scheduling of bandwidth in first priority query, bandwidth is no more than the second priority service flow scheduling that second priority query limits bandwidth in second priority query, bandwidth is no more than in the 3rd priority service flow scheduling to the three priority queries of link remaining bandwidth;
If still have the link remaining bandwidth and also have the first priority service flow not to be scheduled, then will be no more than this remaining bandwidth and also not in the first priority service flow scheduling to the, three priority queries of scheduling;
If still have the link remaining bandwidth and also have the second priority service flow not to be scheduled, then will be no more than this remaining bandwidth and also not in the second priority service flow scheduling to the, three priority queries of scheduling.
2. the method for claim 1 is characterized in that, after each priority service flow is dispatched to priority query respectively, also comprises:
According to priority order from high to low, service traffics are wherein transmitted in formation one by one.
3. method as claimed in claim 2, it is characterized in that, according to priority order from high to low, formation is transmitted in the process of service traffics wherein one by one, when the service traffics in forwarding the 3rd priority query, at first transmit the 3rd priority service flow wherein, after the 3rd priority service flow is finished in forwarding, if also have other priority service flow in the 3rd priority query, then, transmit described other priority service flow according to the sequencing that enters the 3rd priority query.
4. the method for claim 1 is characterized in that, if current link has not had remaining bandwidth, but still has service traffics not to be dispatched in the priority query, then abandons the service traffics that also are not dispatched in the priority query.
5. as the described method of one of claim 1-4, it is characterized in that, determine the link remaining bandwidth in such a way:
From the physical link total bandwidth, deduct first priority query, second priority query and the 3rd priority query dedicated bandwidth respectively, obtain the link remaining bandwidth.
6. service traffics dispatching device based on priority query, be applied to the service traffics forwarding unit, corresponding service traffics priority was provided with priority first, second and the 3rd priority query from high to low during this was provided with, wherein, first and second priority queries are respectively arranged with the qualification bandwidth, it is characterized in that this device comprises:
First scheduler module, be used for that bandwidth is no more than first priority query and limit the first priority service flow scheduling of bandwidth to first priority query, bandwidth is no more than the second priority service flow scheduling that second priority query limits bandwidth in second priority query, bandwidth is no more than in the 3rd priority service flow scheduling to the three priority queries of link remaining bandwidth;
Second scheduler module is used for still having the link remaining bandwidth and also having under the situation that the first priority service flow is not scheduled, and will be no more than this remaining bandwidth and also not in the first priority service flow scheduling to the, three priority queries of scheduling; Afterwards, still have the link remaining bandwidth and also having under the situation that the second priority service flow is not scheduled, will be no more than this remaining bandwidth and also not in the second priority service flow scheduling to the, three priority queries of scheduling.
7. device as claimed in claim 6 is characterized in that, also comprises:
The 3rd scheduler module is used for according to priority order from high to low, and service traffics are wherein transmitted in formation one by one.
8. device as claimed in claim 7, it is characterized in that, described the 3rd scheduler module specifically is used for, according to priority order from high to low, formation is transmitted in the process of service traffics wherein one by one, when the service traffics in forwarding the 3rd priority query, at first transmit the 3rd priority service flow wherein, after the 3rd priority service flow is finished in forwarding, if also have other priority service flow in the 3rd priority query, then, transmit described other priority service flow according to the sequencing that enters the 3rd priority query.
9. device as claimed in claim 6, it is characterized in that described second scheduler module also is used for, and has not had remaining bandwidth at current link, but still have service traffics not to be dispatched under the situation in the priority query, abandon the service traffics that also are not dispatched in the priority query.
10. as the described device of one of claim 6-9, it is characterized in that, described first scheduler module and second scheduler module specifically are used for, determine the link remaining bandwidth in such a way: from the physical link total bandwidth, deduct first priority query, second priority query and the 3rd priority query dedicated bandwidth respectively, obtain the link remaining bandwidth.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101366026A CN102158420B (en) | 2011-05-25 | 2011-05-25 | Service traffic scheduling method based on priority queue and device thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101366026A CN102158420B (en) | 2011-05-25 | 2011-05-25 | Service traffic scheduling method based on priority queue and device thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102158420A true CN102158420A (en) | 2011-08-17 |
| CN102158420B CN102158420B (en) | 2013-10-23 |
Family
ID=44439615
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101366026A Active CN102158420B (en) | 2011-05-25 | 2011-05-25 | Service traffic scheduling method based on priority queue and device thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102158420B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104052681A (en) * | 2014-06-25 | 2014-09-17 | 中国联合网络通信集团有限公司 | Flow control method and device |
| CN104703203A (en) * | 2013-12-06 | 2015-06-10 | 中国电信股份有限公司 | Traffic scheduling method and device for positioning platform |
| CN104869076A (en) * | 2014-02-24 | 2015-08-26 | 中兴通讯股份有限公司 | Load balance adjusting method and device |
| CN109039953A (en) * | 2018-07-24 | 2018-12-18 | 新华三技术有限公司 | bandwidth scheduling method and device |
| CN109391555A (en) * | 2017-08-08 | 2019-02-26 | 迈普通信技术股份有限公司 | Method for dispatching message, device and communication equipment |
| CN110708242A (en) * | 2019-10-28 | 2020-01-17 | 迈普通信技术股份有限公司 | Traffic scheduling method and device, electronic equipment and storage medium |
| WO2020083301A1 (en) * | 2018-10-22 | 2020-04-30 | 中兴通讯股份有限公司 | Network slice method, computer device and storage medium |
| CN112217738A (en) * | 2020-11-04 | 2021-01-12 | 成都中科大旗软件股份有限公司 | Flow control method, system, storage medium and terminal for text and travel data service |
| CN114640638A (en) * | 2020-12-16 | 2022-06-17 | 华为技术有限公司 | Message transmission method and sending terminal equipment |
| CN117478612A (en) * | 2023-12-27 | 2024-01-30 | 成都新希望金融信息有限公司 | Flow distribution method and device and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101102275A (en) * | 2007-06-25 | 2008-01-09 | 中兴通讯股份有限公司 | Method for multi-level dispatching on Ethernet switching chip |
| CN101111070A (en) * | 2006-08-18 | 2008-01-23 | 清华大学 | Fairness resource scheduling method based on resource scheduling in broadband wireless access system |
| CN101360063A (en) * | 2008-09-10 | 2009-02-04 | 中国科学院计算技术研究所 | Service stream transmission control method and system in IP network |
-
2011
- 2011-05-25 CN CN2011101366026A patent/CN102158420B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101111070A (en) * | 2006-08-18 | 2008-01-23 | 清华大学 | Fairness resource scheduling method based on resource scheduling in broadband wireless access system |
| CN101102275A (en) * | 2007-06-25 | 2008-01-09 | 中兴通讯股份有限公司 | Method for multi-level dispatching on Ethernet switching chip |
| CN101360063A (en) * | 2008-09-10 | 2009-02-04 | 中国科学院计算技术研究所 | Service stream transmission control method and system in IP network |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104703203A (en) * | 2013-12-06 | 2015-06-10 | 中国电信股份有限公司 | Traffic scheduling method and device for positioning platform |
| CN104703203B (en) * | 2013-12-06 | 2018-05-11 | 中国电信股份有限公司 | locating platform traffic scheduling method and device |
| CN104869076A (en) * | 2014-02-24 | 2015-08-26 | 中兴通讯股份有限公司 | Load balance adjusting method and device |
| WO2015123985A1 (en) * | 2014-02-24 | 2015-08-27 | 中兴通讯股份有限公司 | Method and device for adjusting load balancing, and computer storage medium |
| CN104052681B (en) * | 2014-06-25 | 2018-09-21 | 中国联合网络通信集团有限公司 | Flow control methods and device |
| CN104052681A (en) * | 2014-06-25 | 2014-09-17 | 中国联合网络通信集团有限公司 | Flow control method and device |
| CN109391555A (en) * | 2017-08-08 | 2019-02-26 | 迈普通信技术股份有限公司 | Method for dispatching message, device and communication equipment |
| CN109039953B (en) * | 2018-07-24 | 2022-06-10 | 新华三技术有限公司 | Bandwidth scheduling method and device |
| CN109039953A (en) * | 2018-07-24 | 2018-12-18 | 新华三技术有限公司 | bandwidth scheduling method and device |
| WO2020083301A1 (en) * | 2018-10-22 | 2020-04-30 | 中兴通讯股份有限公司 | Network slice method, computer device and storage medium |
| CN110708242A (en) * | 2019-10-28 | 2020-01-17 | 迈普通信技术股份有限公司 | Traffic scheduling method and device, electronic equipment and storage medium |
| CN112217738A (en) * | 2020-11-04 | 2021-01-12 | 成都中科大旗软件股份有限公司 | Flow control method, system, storage medium and terminal for text and travel data service |
| CN114640638A (en) * | 2020-12-16 | 2022-06-17 | 华为技术有限公司 | Message transmission method and sending terminal equipment |
| CN114640638B (en) * | 2020-12-16 | 2024-05-14 | 华为技术有限公司 | Message transmission method and transmitting terminal equipment |
| CN117478612A (en) * | 2023-12-27 | 2024-01-30 | 成都新希望金融信息有限公司 | Flow distribution method and device and electronic equipment |
| CN117478612B (en) * | 2023-12-27 | 2024-03-15 | 成都新希望金融信息有限公司 | Flow distribution method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102158420B (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102158420B (en) | Service traffic scheduling method based on priority queue and device thereof | |
| US8000247B2 (en) | Bandwidth management apparatus | |
| Li et al. | Maximizing throughput for optical burst switching networks | |
| US6646986B1 (en) | Scheduling of variable sized packet data under transfer rate control | |
| US10063478B2 (en) | Switching device and control method of switching device | |
| US10263906B2 (en) | Flow scheduling device and method | |
| US9049149B2 (en) | Minimal data loss load balancing on link aggregation groups | |
| US20110274117A1 (en) | Bandwith allocation method and routing device | |
| JP2006141028A (en) | Gigabit passive optical network strict priority weighted round robin scheduling mechanism | |
| CN102521057A (en) | Resource scheduling method and device | |
| US20130044755A1 (en) | Scalable Packet Scheduling Policy for Vast Number of Sessions | |
| CN113938435B (en) | Data transmission method, device, electronic equipment, storage medium and program product | |
| US10075391B2 (en) | Flexible deterministic binary scheduler | |
| CN1565143A (en) | Distributed transmission of traffic flows in communication networks | |
| US9128755B2 (en) | Method and apparatus for scheduling resources in system architecture | |
| CN104022965A (en) | Message dequeue scheduling method and equipment thereof | |
| US7602797B2 (en) | Method and apparatus for request/grant priority scheduling | |
| CN102769566B (en) | A kind of Multi-stage scheduling system configuration, variation and device | |
| CN112367708B (en) | Network resource allocation method and device | |
| CN109150755B (en) | Space-based data link satellite-borne message scheduling method and device | |
| Xie et al. | An efficient adaptive search algorithm for scheduling real-time traffic | |
| Abdelli et al. | Time Petri net based performance evaluation of traffic scheduling in WIMAX networks | |
| KR20070060552A (en) | Method and apparatus for packet scheduling using adaptation round robin | |
| Houmaidi et al. | Contention resolution and QoS provisioning using sparse fiber delay lines in WDM networks | |
| Francini et al. | Enhanced weighted round robin schedulers for bandwidth guarantees in packet networks |
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 | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: Xinhua three Technology Co., Ltd. Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base Patentee before: Huasan Communication Technology Co., Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190627 Address after: Room 101, 1st floor, No. 1 Building, No. 8 Courtyard, Yongjiabei Road, Haidian District, Beijing 100094 Patentee after: Beijing Huasan Communication Technology Co., Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: Xinhua three Technology Co., Ltd. |
|
| TR01 | Transfer of patent right |