CN101848149A - Method and device for scheduling graded queues in packet network - Google Patents
Method and device for scheduling graded queues in packet network Download PDFInfo
- Publication number
- CN101848149A CN101848149A CN201010158599A CN201010158599A CN101848149A CN 101848149 A CN101848149 A CN 101848149A CN 201010158599 A CN201010158599 A CN 201010158599A CN 201010158599 A CN201010158599 A CN 201010158599A CN 101848149 A CN101848149 A CN 101848149A
- Authority
- CN
- China
- Prior art keywords
- formation
- node
- grouping
- scheduling
- group
- 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
The invention provides a method and a device for scheduling graded queues in a packet network, wherein the method comprises the steps of: progressively grading the queues according to network performance requirements of each queue, and forming a priority queue group of a tree structure; extracting grouped category identifiers from received grouped packet headers, and classifying the groups into a queue tail according to the category identifiers; and scheduling the queues in the current priority queue group by selecting a strict priority queue scheduling method or a probability-based queue scheduling method according to the priority queue group of the tree structure. The device comprises a queue grading module, a grouping and classifying module and a queue scheduling module. The embodiment realizes enhancing the network performance of a low-priority queue while strictly ensuring the network performance of a high-priority queue.
Description
Technical field
The present invention relates to field of computer technology, relate in particular to the method and apparatus of scheduling graded queues in a kind of packet network.
Background technology
Along with the rapid growth of miscellaneous service in the network, people are concerned about more and more that to the service quality of network queue scheduling algorithm has caused network research person's extensive concern in recent years as a key technology that guarantees network validity and practicality.
Queue scheduling algorithm of the prior art comprises strict priority (Strict Priority; Hereinafter to be referred as: SP) queue scheduling algorithm and based on the queue scheduling algorithm of probability.Wherein, the SP queue scheduling algorithm is that grouping is classified, classification according to grouping is sent grouping into corresponding formation, the grouping that belongs to higher priority queues after the classification is preferentially sent, and the grouping that belongs to the lower priority formation is then waited for just robbing when the grouping of not having higher priority sends and accounted for channel.Queue scheduling algorithm based on probability then is probability of each queue assignment, when each queue scheduling, begins poll from first formation, when the formation non-NULL that is polled to, then dispatches with the probability that distributes.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art: the SP queue scheduling algorithm can guarantee the absolute priority of each formation, but its assurance for the higher priority queues network performance is a cost to sacrifice lower priority network of queues performance, and the lower priority formation may can not be scheduled for a long time when network is busy.Though based on the queue scheduling algorithm of probability the network performance of lower priority formation is had certain assurance, has cut down strictness guarantee to the network performance of higher priority queues.Therefore, these two kinds of methods can't be taken into account the network performance of higher priority queues and lower priority formation.
Summary of the invention
The invention provides the method and apparatus of scheduling graded queues in a kind of packet network, in order to solve the defective that to take into account the network performance of higher priority queues and lower priority formation in the prior art, when being implemented in the network performance of strict guarantee high-priority queue, improve the network performance of Low Priority Queuing.
The invention provides the method for scheduling graded queues in a kind of packet network, comprising:
Performance index requirements according to individual queue is divided step by step to described formation, and forms priority query's group of tree structure;
From the packets headers of the grouping that receives, extract the classification logotype of described grouping, the formation afterbody under according to described classification logotype described grouping being included into;
According to priority query's group of described tree structure, select the strict-priority scheduling method or the formation in the current described priority query group is dispatched based on the queue scheduling method of probability.
The invention provides the device of scheduling graded queues in a kind of packet network, comprising:
Module is divided in formation, is used for according to the performance index requirements of individual queue described formation being divided step by step, and forms priority query's group of tree structure;
Grouping and classifying module is used for extracting from the packets headers of the grouping that receives the classification logotype of described grouping, the formation afterbody under according to described classification logotype described grouping being included into;
The queue scheduling module is used for the priority query's group according to described tree structure, selects the strict-priority scheduling method or based on the queue scheduling method of probability the formation in the current described priority query group is dispatched.
The method and apparatus of scheduling graded queues in the packet network of the present invention, by formation being divided step by step according to the performance index requirements of individual queue in the network, and priority query's group of formation tree structure, classification logotype according to the grouping that receives is included into affiliated formation afterbody with grouping, then according to priority query's group of tree structure, select the strict-priority scheduling method or the formation in current priority query's group is dispatched based on the queue scheduling method of probability; Present embodiment has solved the defective that can't take into account the network performance of higher priority queues and lower priority formation in the prior art, has realized having improved the network performance of Low Priority Queuing in the network performance of strict guarantee high-priority queue.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do one to the accompanying drawing of required use in embodiment or the description of the Prior Art below introduces simply, apparently, accompanying drawing in describing below is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the flow chart of the method embodiment one of scheduling graded queues in the packet network of the present invention;
Fig. 2 is the flow chart of the method embodiment two of scheduling graded queues in the packet network of the present invention;
Fig. 3 is the tree structure figure of the method embodiment two medium priority set of queues of scheduling graded queues in the packet network of the present invention;
Fig. 4 is the structural representation of the device embodiment one of scheduling graded queues in the packet network of the present invention;
Fig. 5 is the structural representation of the device embodiment two of scheduling graded queues in the packet network of the present invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention clearer, below in conjunction with the accompanying drawing in the embodiment of the invention, technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
Fig. 1 is the flow chart of the method embodiment one of scheduling graded queues in the packet network of the present invention, and as shown in Figure 1, present embodiment provides the method for scheduling graded queues in a kind of packet network, can comprise the steps:
Present embodiment provides the method for scheduling graded queues in a kind of packet network, by formation being divided step by step according to the performance index requirements of individual queue in the network, and priority query's group of formation tree structure, classification logotype according to the grouping that receives is included into affiliated formation afterbody with grouping, then according to priority query's group of tree structure, select the strict-priority scheduling method or the formation in current priority query's group is dispatched based on the queue scheduling method of probability; Present embodiment has solved the defective that can't take into account the network performance of higher priority queues and lower priority formation in the prior art, has realized having improved the network performance of Low Priority Queuing in the network performance of strict guarantee high-priority queue.
Fig. 2 is the flow chart of the method embodiment two of scheduling graded queues in the packet network of the present invention, and as shown in Figure 2, present embodiment provides the method for scheduling graded queues in a kind of packet network, can comprise the steps:
Step 201, the packet class in the statistical packet network and every kind of performance index requirements that grouping is corresponding, and in buffering area, carry out buffer memory for every kind of grouping is provided with independently equal-sized formation.
In packet network, because the variation of the business that the user uses makes that the grouping kind in the packet network is also corresponding varied, as the grouping of audio frequency and video class, images category grouping etc.Before the technical scheme of carrying out present embodiment, this step is by existing all categories of grouping to add up to network internal, obtain the classification of each grouping in the packet network, and add up every kind the grouping pairing performance index requirements, network performance herein can comprise time delay, packet loss, throughput and delay variation or the like, and the corresponding performance index requirements value of concrete employing is represented in the present embodiment.Simultaneously, open up independently equal and opposite in direction for every kind of grouping counting on and buffer memory is carried out in certain formation in buffering area, the grouping size in each formation is fixing and equates.In the present embodiment, suppose to have in the network 10 kinds of groupings, then be respectively these 10 kinds of groupings and open up 10 buffer queues in buffering area, network performance is that example describes with the time delay in the present embodiment, and the delay performance for the individual queue that counts on as shown in table 1 below requires:
The delay performance of table 1 individual queue requires statistics
| The formation numbering | ??1 | ??2 | ??3 | ??4 | ??5 | ??6 | ??7 | ??8 | ??9 | ??10 |
| Delay performance requirement/ms | ??29 | ??15 | ??36 | ??22 | ??45 | ??90 | ??21 | ??80 | ??10 | ??55 |
Before carrying out queue scheduling, according to the performance index requirements of individual queue formation is divided step by step earlier, and form priority query's group of tree structure.Promptly according to the difference of formation for performance index requirements, prioritization set of queues step by step, the priority query's group that to the last once is divided into satisfies actual requirement.And the form of ready-portioned priority query group with node be illustrated in the tree structure, all be illustrated in the tree structure up to all formations with the form of leaf node.Particularly, earlier according to the scope of determining the network performance value in all formations from minimum network performance value to the highest network performance value, and be a series of little range sections with this network performance value scope division, the network performance value is close and formation that belong to same range section is classified as same priority query group.The rest may be inferred, step by step the prioritization set of queues.The priority query's group that to the last once is divided into satisfies actual requirement.Priority query's group of representing the maximum at all formation places then with a root node, root node is a father node, the several priority queries group that is divided into for the first time is expressed as corresponding child node, the child node of dividing is a father node for the first time, and the priority query's group that is divided into for the second time is expressed as the child node of corresponding father node.And the like, all be illustrated in the tree structure up to all formations with the form of the leaf node of reality.
Be that example describes still with above-mentioned table 1, when in the present embodiment formation being divided, requiring with its corresponding delay performance serves as to divide foundation, wherein, minimum requirements value to time delay is 10ms, and the peak demand value is 90ms, and the scope that instant ductility can require is 10ms-90ms, is assumed to be the A0 group in the present embodiment.Fig. 3 is the tree structure figure of the dispatching method embodiment two medium priority set of queues of graded queues in the packet network of the present invention, and then the first order in the tree structure is a root node 0, and promptly the A0 corresponding to priority query's group organizes.
The scope division that can earlier delay performance be required is two littler range sections, be 10ms-50ms, 51ms-90ms, delay performance required value according to individual queue in the above-mentioned table 1, priority query's group of dividing this moment can be assumed to be A11 group (10ms-50ms) and A12 group (51ms-90ms), wherein, the A11 group comprises formation 9,2,7,4,1,3,5, and the A12 group comprises formation 10,8,6.At this moment, formation is divided into two-stage, and the second level node 11 and 12 in the tree structure is represented A11 and A12 respectively.
According to above-mentioned classification division methods, continuation is divided group A11 of priority query and the A12 after dividing, for A11, individual queue is 10ms to the minimum requirements value of time delay, and the peak demand value is 50ms, the scope division that delay performance can be required is two littler range sections, be 10-30ms, 31-45ms, delay performance required value according to individual queue in the above-mentioned table 1, priority query's group of dividing this moment can be assumed to be A14 group (10ms-30ms) and A13 group (31ms-45ms), wherein, the A14 group comprises formation 9,2,7,4,1, the A13 group comprises formation 3,5.For A12, individual queue is 55ms to the minimum requirements value of time delay, and the peak demand value is 90ms, the scope division that delay performance can be required be two littler range sections, i.e. 55-70ms, 71-90ms are according to the delay performance required value of individual queue in the above-mentioned table 1, priority query's group of dividing this moment can be assumed to be A15 group (55ms-70ms) and A16 group (71ms-90ms), wherein, the A15 group comprises formation 8,6, and the A16 group comprises formation 10.At this moment, formation is divided into three grades, and the third level node 13,14 and 15 in the tree structure is represented A13, A14 and A15 respectively, because the A16 group includes only formation 10, then it is directly represented with node 10.
After above-mentioned two-stage division, because the A16 group only comprises a formation 10, the A13 group only comprises two formations 3 and 5, and the A15 group only comprises two formations 8 and 6, then no longer above-mentioned three groups is divided.And the A14 group still comprises 9,2,7,4,1 five formations, then according to above-mentioned classification division methods, continuation is divided A14, the scope division that delay performance can be required be two littler range sections, i.e. 10-20ms, 21-30ms are according to the delay performance required value of individual queue in the above-mentioned table 1, priority query's group of dividing this moment can be assumed to be A17 group (10ms-20ms) and A18 group (21ms-30ms), wherein, the A17 group comprises formation 9,2, and the A18 group comprises formation 7,4,1.At this moment, formation is divided into level Four, and the fourth stage node 16 and 17 in the tree structure is represented A18 and A17 respectively.Because the A17 group comprises formation 9,2, the A18 group comprises formation 7,4,1 then with node in the tree structure 9 and 2 child nodes as node 17, with node 7,4,1 child node as node 16, then can obtain Pyatyi tree structure as shown in Figure 3.
In the present embodiment, can represent leaf node with physical node, represent that with empty node non-leaf node represents that promptly physical node can be represented priority query's group that the number of queues that comprises equals 1, and empty node can represent that the number of queues that comprises is greater than priority query's group of 1.
When having grouping to transmit in the packet network, then from the packets headers of the grouping that receives, extract the classification logotype of this grouping, identify the formation of determining that this grouping is affiliated according to this classification.Particularly, this step can be obtained the affiliated formation of this grouping according to the classification logotype that divides into groups for elder generation, and judges whether the length of this formation equals the pre-set length higher limit, if, show that then this formation is full, then this grouping is abandoned, it is not carried out follow-up transmission process; If the length of formation under should grouping less than the pre-set length higher limit, then show this formation less than, the formation afterbody under then this grouping being included into is put into affiliated rear of queue with this grouping.
When carrying out queue scheduling, present embodiment can be according to priority query's group of the tree structure of above-mentioned formation, selects the strict-priority scheduling method or based on the queue scheduling method of probability the formation in current priority query's group is dispatched.Particularly, this step 204 can specifically comprise the steps: at first, search the child node of each grade of tree structure and the subordinate relation of even higher level of node, if the child node number that is subordinated to same even higher level of node is greater than 1, and described child node is physical node, then adopts based on the queue scheduling method of probability the formation in current priority query's group is dispatched; If the son node number that is subordinated to same even higher level of node is according to greater than 1, and described child node is not physical node, then adopts the Priority Queuing method that the formation in current priority query's group is dispatched; Wherein, described physical node is a leaf node.Secondly, the child node that waiting of obtaining exported the formation correspondence of grouping replaces the father node of described child node, each level from top to bottom to described tree structure repeats above-mentioned steps successively, the child node of being waited to export the formation correspondence of grouping up to the root node of described tree structure replaces, and output grouping from the formation of the child node representative that replaces described root node.
Be that example describes still with the priority query's group that forms tree structure as shown in Figure 3 herein, when carrying out this step, suppose that working as prime is the superlative degree of tree structure, present node is first node in the next stage of prime, promptly working as prime is level V, and present node is the leaf node 3 in the fourth stage.Searching present node 3 does not have child node in level V, then skip this node 3, in like manner skips node 5 yet, and present node is a node 16.Search the child node of present node 16 in level V and have 7,4,1, and be leaf node, then adopt based on the queue scheduling method of probability the formation in the node 16 corresponding priorities set of queues is dispatched, promptly child node 7,4,1 corresponding queues is dispatched.When dispatching, earlier child node 7,4,1 corresponding queues is detected,, then dispatch with corresponding probability if two or more formations are arranged simultaneously not for empty, select a formation of waiting to export grouping, promptly select a formation that is about to be scheduled; If have only a formation for empty, then directly with this formation as the formation of waiting to export grouping, promptly directly with this formation as the formation that is about to be scheduled.
Particularly, adopting when dispatching based on the queue scheduling method of probability, can be earlier according to the block length in the formation, and adopt following relational expression to set the scheduling probability of described formation:
Lm∶Ln＝Pn∶Pm????(1)
Wherein, Lm and Ln are respectively the block length among any two formation Qm and the Qn, and Pm and Pn are respectively the scheduling probability of described formation Qm and Qn.Random number according to the scheduling probability of formation and generation is at random obtained the formation of waiting to export grouping in current priority query's group, particularly, can adopt following method to carry out queue scheduling.The ratio of supposing the scheduling probability of individual queue Q1, Q2...Qn is p
1: p
2: p
3: p
4: L p
N-1: p
n, then generate and obtain first group of definite value, that is: according to this ratio
...，
Generate and obtain second group of definite value, that is: y according to above-mentioned first group of definite value again
1=x
1, y
2=y
1+ x
2, y
3=y
2+ x
3, y
4=y
3+ x
4..., y
N-1=y
N-2+ x
N-1Produce a random number R then, obtain the formation of waiting to export grouping in current priority query's group according to the relation of random number R and above-mentioned second group of definite value.If 0＜R＜y
1, that then obtains this scheduling waits that the formation of exporting grouping is Q1; If y
1＜R＜y
2, that then obtains this scheduling waits that the formation of exporting grouping is Q2; If y
2＜R＜y
3, that then obtains this scheduling waits that the formation of exporting grouping is Q3; ... if y
N-1＜R＜1, that then obtains this scheduling waits that the formation of exporting grouping is Qn.Adopt based on the queue scheduling method of probability herein child node 7,4,1 corresponding queues Q7, Q4, Q1 are dispatched, suppose that wherein block length L7, L4, L1 are respectively 30,20,50, then the scheduling probability P 7 of formation Q7, the Q4 that is provided with as can be known according to above-mentioned formula (1), Q1, P4, P1 satisfied 5: 2: 3.Then the ratio according to above-mentioned scheduling probability obtains and generates first group of definite value: 1/2,1/5 and 3/10, and the second group of definite value that generates according to first group of definite value is: 1/2,7/10.In scheduling process, produce one 0 to 1 random number R then, suppose that random number R satisfies: 0＜R＜1/2, the formation of then waiting to export grouping is 7, the formation of promptly selecting that is about to be scheduled is 7, if random number R satisfies: 1/2＜R＜7/10, the formation of then waiting to export grouping is 4, the formation of promptly selecting that is about to be scheduled is 4, if random number R satisfies: 7/10＜R＜1, the formation of then waiting to export grouping is 1, the formation of promptly selecting that is about to be scheduled is 1.Suppose to wait that through what select after the scheduling the formation of exporting grouping is 4, then with the formation 4 temporary transient nodes 16 that replace, promptly with formation 4 temporarily as present node 16 corresponding queues.
After node 16 handled, present node is moved to node 17, in like manner selecting the formation of waiting to export grouping according to said method is 9, and with formation 9 temporarily as node 17 corresponding queues.Because node 8 and 6 does not all have child node, then skips node 8 and 6, finishes the scheduling of level V.Subtract 1 when prime this moment, promptly the fourth stage handled, and present node is moved to first node of the third level, and promptly node 13.
Repeat said process and carry out the scheduling of the fourth stage,, then adopt based on the queue scheduling method of probability node 3 and 5 corresponding queues are dispatched because the child node of present node 13 in the fourth stage is 3,5, and is leaf node.The formation that waiting of supposing to select exported grouping is 5, then with formation 5 temporarily as present node 13 corresponding queues.Then present node is moved to node 14, searching the child node of present node 14 in the fourth stage is 16 and 17, and all be not physical node, then adopt the strict-priority scheduling method that node 16 and 17 corresponding queues are dispatched, suppose that the priority of node 17 corresponding queues is higher than the priority of node 16 corresponding queues, therefore the formation of selecting this moment that is scheduled is node 17 corresponding queues.And node 17 is temporarily replaced by node 9 from the above, and then the formation of selecting this moment that is scheduled is actual is node 9 corresponding queues.Then present node is moved to node 10, this node does not have child node in the fourth stage, then skip this node, and present node is moved to node 15.The child node of node 15 in the fourth stage is 8,6, and is physical node, then adopts based on the queue scheduling method of probability node 8 and 6 corresponding queues are dispatched.The formation that waiting of supposing to select exported grouping is 8, then with the formation 8 temporary transient present nodes 15 that replace.Finish the scheduling of the fourth stage this moment, when prime subtracts 1, promptly three grades handled, and present node is moved to partial first node, and promptly node 11.
Present node 0 is that 11,12, two of nodes all are empty node in the child node in prime, therefore carries out strict priority scheduling.The priority of node 11 corresponding queues is higher than the priority of node 12 corresponding queues, and therefore the formation that is scheduled is node 11 corresponding queues.And node 11 is temporarily replaced by No. 9 nodes, and therefore the formation that is scheduled is No. 9 nodes, temporarily replaces root node 0 with No. 9 nodes.Because root node 0 is last node in the first order, therefore when the prime finishing scheduling.After subtracting 1, prime is the first order, so the epicycle finishing scheduling, node 9 corresponding queues are the formation that finally is scheduled.
It is pointed out that said process is to take turns scheduling process, obtain a formation that finally is scheduled of epicycle scheduling process after the finishing scheduling, can repeat the scheduling process that said process carries out next round, to obtain the next formation that finally is scheduled.
Present embodiment provides the method for scheduling graded queues in a kind of packet network, by performance index requirements value formation is divided step by step according to individual queue in the network, and priority query's group of formation tree structure, classification logotype according to the grouping that receives is included into affiliated formation afterbody with grouping, then according to priority query's group of tree structure, select the strict-priority scheduling method or the formation in current priority query's group is dispatched based on the queue scheduling method of probability; Present embodiment has solved the defective that can't take into account the network performance of higher priority queues and lower priority formation in the prior art, has realized having improved the network performance of Low Priority Queuing in the network performance of strict guarantee high-priority queue.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
Fig. 4 is the structural representation of the device embodiment one of scheduling graded queues in the packet network of the present invention, as shown in Figure 4, present embodiment provides the device of scheduling graded queues in a kind of packet network, specifically can carry out each step among the said method embodiment one, the device of scheduling graded queues can specifically comprise formation division module 401, grouping and classifying module 402 and queue scheduling module 403 in the packet network that present embodiment provides.Wherein, formation is divided module 401 and is used for according to the performance index requirements of individual queue described formation being divided step by step, and forms priority query's group of tree structure.Grouping and classifying module 402 is used for extracting from the packets headers of the grouping that receives the classification logotype of described grouping, the formation afterbody under according to described classification logotype described grouping being included into.Queue scheduling module 403 is used for the priority query's group according to described tree structure, selects the strict-priority scheduling method or based on the queue scheduling method of probability the formation in the current described priority query group is dispatched.
Fig. 5 is the structural representation of the device embodiment two of scheduling graded queues in the packet network of the present invention, as shown in Figure 5, present embodiment provides the device of scheduling graded queues in a kind of packet network, specifically can carry out each step among the said method embodiment two, the device of scheduling graded queues is on the basis of the foregoing description one in the packet network that present embodiment provides, can also specifically comprise statistical module 501, statistical module 501 is used for packet class and every kind of performance index requirements that grouping is corresponding of statistical packet network, and carries out buffer memory for every kind of grouping is provided with independently equal-sized formation in buffering area.
Particularly, queue scheduling module 403 can specifically comprise and searches unit 413, first scheduling unit 423, second scheduling unit 433 and output acquiring unit 443.Wherein, search unit 413 and be used to search the child node of each grade of tree structure and the subordinate relation of even higher level of node.First scheduling unit 423 be used for when the child node number that be subordinated to same even higher level of node greater than 1, and described child node is physical node, then adopts based on the queue scheduling method of probability the formation in current priority query's group is dispatched.Second scheduling unit 433 be used for when the son node number that be subordinated to same even higher level of node according to greater than 1, and described child node is not physical node, then adopts the Priority Queuing method that the formation in current priority query's group is dispatched; Wherein, described physical node is a leaf node.Output acquiring unit 443 is used for the child node that waiting of obtaining exported the formation correspondence of grouping is replaced the father node of described child node, each level from top to bottom to described tree structure repeats above-mentioned steps successively, the child node of finally being waited to export the formation correspondence of grouping up to the root node of described tree structure replaces, and output grouping from the formation of the child node representative that replaces described root node.
Further, first scheduling unit 423 can comprise specifically that probability obtains subelement 4231 and subelement 4232 is obtained in formation.Wherein, probability obtain subelement 4231 be used for when the child node number that be subordinated to same even higher level of node greater than 1, and described child node according to the block length in the formation, and adopts formula (1) to set the scheduling probability of described formation when being physical node.Formation is obtained subelement 4232 and is used for obtaining the formation that described current priority query's group waits to export grouping according to the random number of the scheduling probability of described formation and generation at random.
Further, grouping and classifying module 402 can specifically comprise formation acquiring unit 412 and detecting unit 422.Wherein, formation acquiring unit 412 is used for obtaining formation under the described grouping according to described classification logotype.Whether the length that detecting unit 422 is used to detect described formation equals the pre-set length higher limit, if then abandon described grouping, otherwise described formation afterbody is included in described grouping.
Present embodiment provides the device of scheduling graded queues in a kind of packet network, by formation being divided step by step according to the performance index requirements of individual queue in the network, and priority query's group of formation tree structure, classification logotype according to the grouping that receives is included into affiliated formation afterbody with grouping, then according to priority query's group of tree structure, select the strict-priority scheduling method or the formation in current priority query's group is dispatched based on the queue scheduling method of probability; Present embodiment has solved the defective that can't take into account the network performance of higher priority queues and lower priority formation in the prior art, has realized having improved the network performance of Low Priority Queuing in the network performance of strict guarantee high-priority queue.
It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. the method for scheduling graded queues in the packet network is characterized in that, comprising:
Performance index requirements according to individual queue is divided step by step to described formation, and forms priority query's group of tree structure;
From the packets headers of the grouping that receives, extract the classification logotype of described grouping, the formation afterbody under according to described classification logotype described grouping being included into;
According to priority query's group of described tree structure, select the strict-priority scheduling method or the formation in the current described priority query group is dispatched based on the queue scheduling method of probability.
2. method according to claim 1 is characterized in that, also comprises:
Packet class in the statistical packet network and every kind of performance index requirements that grouping is corresponding, and in buffering area, carry out buffer memory for every kind of grouping is provided with independently equal-sized formation.
3. method according to claim 1 and 2, it is characterized in that, described priority query's group according to described tree structure, select the strict-priority scheduling method or the formation in the current described priority query group dispatched to comprise based on the queue scheduling method of probability:
Search the child node of each grade of tree structure and the subordinate relation of even higher level of node, if the child node number that is subordinated to same even higher level of node is greater than 1, and described child node is physical node, then adopts based on the queue scheduling method of probability the formation in current priority query's group is dispatched; If the child node number that is subordinated to same even higher level of node is greater than 1, and described child node is not physical node, then adopts the Priority Queuing method that the formation in current priority query's group is dispatched; Wherein, described physical node is a leaf node;
The child node that waiting of obtaining exported the formation correspondence of grouping replaces the father node of described child node, each level from top to bottom to described tree structure repeats above-mentioned steps successively, the child node of finally being waited to export the formation correspondence of grouping up to the root node of described tree structure replaces, and output grouping from the formation of the child node representative that replaces described root node.
4. method according to claim 3 is characterized in that, described employing is dispatched the formation in current priority query's group based on the queue scheduling method of probability and comprised:
According to the block length in the formation, and adopt following relational expression to set the scheduling probability of described formation:
Lm: Ln=Pn: Pm, wherein, Lm and Ln are respectively the block length among any two formation Qm and the Qn, and Pm and Pn are respectively the scheduling probability of described formation Qm and Qn;
According to the scheduling probability of described formation and the random number that generates at random obtain the formation of waiting to export grouping in described current priority query's group.
5. method according to claim 1 is characterized in that, describedly according to described classification logotype the formation afterbody of described grouping under being included into is comprised:
Obtain formation under the described grouping according to described classification logotype;
Whether the length that detects described formation equals the pre-set length higher limit, if then abandon described grouping, otherwise described formation afterbody is included in described grouping.
6. the device of scheduling graded queues in the packet network is characterized in that, comprising:
Module is divided in formation, is used for according to the performance index requirements of individual queue described formation being divided step by step, and forms priority query's group of tree structure;
Grouping and classifying module is used for extracting from the packets headers of the grouping that receives the classification logotype of described grouping, the formation afterbody under according to described classification logotype described grouping being included into;
The queue scheduling module is used for the priority query's group according to described tree structure, selects the strict-priority scheduling method or based on the queue scheduling method of probability the formation in the current described priority query group is dispatched.
7. device according to claim 6 is characterized in that, also comprises:
Statistical module is used for packet class and every kind of performance index requirements that grouping is corresponding of statistical packet network, and carries out buffer memory for every kind of grouping is provided with independently equal-sized formation in buffering area.
8. according to claim 6 or 7 described devices, it is characterized in that described queue scheduling module comprises:
Search the unit, be used to search the child node of each grade of tree structure and the subordinate relation of even higher level of node;
First scheduling unit, be used for when the child node number that be subordinated to same even higher level of node greater than 1, and described child node is physical node, then adopts based on the queue scheduling method of probability the formation in current priority query's group is dispatched;
Second scheduling unit, be used for when the son node number that be subordinated to same even higher level of node according to greater than 1, and described child node is not physical node, then adopts the Priority Queuing method that the formation in current priority query's group is dispatched; Wherein, described physical node is a leaf node;
The output acquiring unit, the child node that waiting of being used for obtaining exported the formation correspondence of grouping replaces the father node of described child node, each level from top to bottom to described tree structure repeats above-mentioned steps successively, the child node of finally being waited to export the formation correspondence of grouping up to the root node of described tree structure replaces, and output grouping from the formation of the child node representative that replaces described root node.
9. device according to claim 8 is characterized in that, described first scheduling unit comprises:
Probability obtains subelement, be used for when the child node number that be subordinated to same even higher level of node greater than 1, and described child node according to the block length in the formation, and adopts following relational expression to set the scheduling probability of described formation when being physical node:
Lm: Ln=Pn: Pm, wherein, Lm and Ln are respectively the block length among any two formation Qm and the Qn, and Pm and Pn are respectively the scheduling probability of described formation Qm and Qn;
Subelement is obtained in formation, is used for obtaining the formation that described current priority query's group waits to export grouping according to the random number of the scheduling probability of described formation and generation at random.
10. device according to claim 6 is characterized in that, described grouping and classifying module comprises:
The formation acquiring unit is used for obtaining formation under the described grouping according to described classification logotype;
Detecting unit, whether the length that is used to detect described formation equals the pre-set length higher limit, if then abandon described grouping, otherwise described formation afterbody is included in described grouping.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101585993A CN101848149B (en) | 2010-04-22 | 2010-04-22 | Method and device for scheduling graded queues in packet network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101585993A CN101848149B (en) | 2010-04-22 | 2010-04-22 | Method and device for scheduling graded queues in packet network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101848149A true CN101848149A (en) | 2010-09-29 |
| CN101848149B CN101848149B (en) | 2013-10-23 |
Family
ID=42772613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101585993A Expired - Fee Related CN101848149B (en) | 2010-04-22 | 2010-04-22 | Method and device for scheduling graded queues in packet network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101848149B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012109880A1 (en) * | 2011-08-04 | 2012-08-23 | 华为技术有限公司 | Queue scheduling method and device |
| CN102868633A (en) * | 2012-09-12 | 2013-01-09 | 中国联合网络通信集团有限公司 | Grouped data scheduling method and system |
| CN103514037A (en) * | 2012-06-21 | 2014-01-15 | 中兴通讯股份有限公司 | Task scheduling processing method and device |
| CN110618859A (en) * | 2019-09-10 | 2019-12-27 | 杭州秘猿科技有限公司 | Transaction pool design method supporting sequential packaging and electronic equipment |
| CN112787956A (en) * | 2021-01-30 | 2021-05-11 | 西安电子科技大学 | Method, system, storage medium and application for crowding occupation processing in queue management |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0782300A1 (en) * | 1995-12-27 | 1997-07-02 | Digital Equipment Corporation | Method and apparatus for hierarchical relative error scheduling |
| US20070086470A1 (en) * | 2005-10-03 | 2007-04-19 | Fujitsu Limited | Queue selection method and scheduling device |
| CN101272349A (en) * | 2008-05-06 | 2008-09-24 | 北京星网锐捷网络技术有限公司 | Priority level analog queue control method and device of quality service |
| CN101415242A (en) * | 2007-10-16 | 2009-04-22 | 中兴通讯股份有限公司 | System and method for scheduling wideband wireless access non-real time business |
| CN101557340A (en) * | 2009-05-07 | 2009-10-14 | 中兴通讯股份有限公司 | Method for realizing multilevel queue scheduling in data network and device |
| CN101631074A (en) * | 2009-07-30 | 2010-01-20 | 北京星网锐捷网络技术有限公司 | Multilink message sending method, device and network equipment |
-
2010
- 2010-04-22 CN CN2010101585993A patent/CN101848149B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0782300A1 (en) * | 1995-12-27 | 1997-07-02 | Digital Equipment Corporation | Method and apparatus for hierarchical relative error scheduling |
| US20070086470A1 (en) * | 2005-10-03 | 2007-04-19 | Fujitsu Limited | Queue selection method and scheduling device |
| CN101415242A (en) * | 2007-10-16 | 2009-04-22 | 中兴通讯股份有限公司 | System and method for scheduling wideband wireless access non-real time business |
| CN101272349A (en) * | 2008-05-06 | 2008-09-24 | 北京星网锐捷网络技术有限公司 | Priority level analog queue control method and device of quality service |
| CN101557340A (en) * | 2009-05-07 | 2009-10-14 | 中兴通讯股份有限公司 | Method for realizing multilevel queue scheduling in data network and device |
| CN101631074A (en) * | 2009-07-30 | 2010-01-20 | 北京星网锐捷网络技术有限公司 | Multilink message sending method, device and network equipment |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012109880A1 (en) * | 2011-08-04 | 2012-08-23 | 华为技术有限公司 | Queue scheduling method and device |
| US9521086B2 (en) | 2011-08-04 | 2016-12-13 | Huawei Technologies Co., Ltd. | Queue scheduling method and apparatus |
| CN103514037A (en) * | 2012-06-21 | 2014-01-15 | 中兴通讯股份有限公司 | Task scheduling processing method and device |
| CN103514037B (en) * | 2012-06-21 | 2018-06-01 | 中兴通讯股份有限公司 | Task scheduling processing method and device |
| CN102868633A (en) * | 2012-09-12 | 2013-01-09 | 中国联合网络通信集团有限公司 | Grouped data scheduling method and system |
| CN102868633B (en) * | 2012-09-12 | 2015-04-29 | 中国联合网络通信集团有限公司 | Grouped data scheduling method and system |
| CN110618859A (en) * | 2019-09-10 | 2019-12-27 | 杭州秘猿科技有限公司 | Transaction pool design method supporting sequential packaging and electronic equipment |
| CN110618859B (en) * | 2019-09-10 | 2021-11-16 | 杭州秘猿科技有限公司 | Transaction pool design method supporting sequential packaging and electronic equipment |
| CN112787956A (en) * | 2021-01-30 | 2021-05-11 | 西安电子科技大学 | Method, system, storage medium and application for crowding occupation processing in queue management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101848149B (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101848149B (en) | Method and device for scheduling graded queues in packet network | |
| CN101446962B (en) | Data conversion method, device thereof and data processing system | |
| US7979155B2 (en) | Sort plan optimization | |
| CN109033462A (en) | The method and system of low-frequency data item are determined in the storage equipment of big data storage | |
| CN102056306B (en) | Method and device for allocating uplink shared channel resources and communication system | |
| CN106027288A (en) | Communication traffic prediction method for distribution line information monitoring service | |
| CN101778400B (en) | Database-based telephone traffic analysis and prediction system and telephone traffic prediction method using same | |
| CN113111140A (en) | Method for rapidly analyzing multi-source marine business observation data | |
| CN110555452A (en) | network problem processing method and device based on intelligent clustering | |
| CN115063164A (en) | Intelligent prediction method for takeout business AI | |
| CN114254770A (en) | Work order generation method, device, equipment and storage medium | |
| CN115033646B (en) | Method for constructing real-time warehouse system based on Flink and Doris | |
| CN103037375A (en) | Method and device for dividing community telephone traffic scenes | |
| CN111680046B (en) | Fast storage method for high-frequency power data | |
| CN110232486A (en) | More workshop integrated dispatch methods based on K shortest path | |
| CN100473229C (en) | Method for ascertaining removed channel in CDMA colony communication system | |
| CN109271104A (en) | It is a kind of for determining the method and system of the operating status of big data storage system | |
| CN101799803B (en) | Method, module and system for processing information | |
| CN101827175A (en) | Method and system for storing sorted call bills by catalog | |
| CN101702306A (en) | Method for processing image data by display system and display system | |
| CN111090624B (en) | MES and CR plate-type customized furniture plate classification method | |
| Argon et al. | Partial pooling in tandem lines with cooperation and blocking | |
| CN109240988A (en) | For avoiding big data storage system from entering the method and system of access imbalance state | |
| CN106503118B (en) | A kind of data acquisition system and its implementation based on HC-TABLE | |
| CN112241479A (en) | Heterogeneous system data integration processing device and method |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131023 Termination date: 20140422 |