CN1134136C - Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit - Google Patents
Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit Download PDFInfo
- Publication number
- CN1134136C CN1134136C CNB011106786A CN01110678A CN1134136C CN 1134136 C CN1134136 C CN 1134136C CN B011106786 A CNB011106786 A CN B011106786A CN 01110678 A CN01110678 A CN 01110678A CN 1134136 C CN1134136 C CN 1134136C
- Authority
- CN
- China
- Prior art keywords
- probability
- drop
- service
- business
- occupied bandwidth
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a single queue managing mechanism for providing the distinguished services for users on the internet. The mechanism overcomes the ubiquitous problems that the bandwidth allocation between grade services can not be better maintained, or the actual service quality of the users in higher service grade is lower than the service quality of the user in lower service grade in the same mechanism, etc. The mechanism can make the measured bandwidth compared to the allocated bandwidth by measuring the occupied bandwidth of each service type so that discarding strategy indication and guiding discarding probability are generated for each service type. Consequently, the service is guided to carry out the forestalling adjustment, the given room adjustment or the maintaining invariable state, and the required adjustment. Moreover, an RED is referred to figure out the discarding probability in the process of the operation, and simultaneously, the method of the discarding packet can be determined.
Description
Technical field
How the present invention relates to is providing the queue management mechanism that (DifServ) served in difference to the user on the internet better, it is had any different in the service queue manager having overcome existing RED class, router can't carry out effective bandwidth to be safeguarded simultaneously, also overcome CBQ Class Queue manager and be used to distinguish service Time Bandwidth management defective really up to the mark, what can guarantee high-priority users effectively always obtains higher service quality, the principle of high charge/high priority/high quality-of-service is realized better in the pricing system of the feasible Service Operation of having any different, more can be accepted, help the popularization of the service of having any different on network by the client.
Background technology
What the internet adopted at present is the network service mechanism of a general justice and do one's best (best effort), the network user is not provided the assurance of any relevant service quality.Ways of services supplied has although it is so guaranteed the popularization of Network, but has also hindered carrying out of some new technologies that network service quality is had relatively high expectations and new business simultaneously, and therefore being necessary for the network user provides service quality to a certain degree to guarantee.Integrated service (IntServ) and the service of having any different (DifServ) are two basic frameworks of the quality of providing services on the Internet of generally acknowledging at present, the former be based on connection and the latter is based on the grade of service.Integrated service can be satisfied the meticulous quality of service requirement of user, but network must write down each connection, also must have a powerful admittance control (AC:Admission Control) to match, related complex network controlled function makes it be very difficult to realize.The service of having any different is lower to the requirement of network control function, therefore be easier to keep network extensibility, its subject matter is owing to lack necessary accommodating control function, when the user who uses high-grade service is too much, uses the higher resulting active service quality of user of the grade of service might be lower than those on the contrary and use the lower user of the grade of service.
The mechanism that present existing network provides the difference service comprises scheduling and two kinds of schemes of queue management.Two kinds of implementation methods of many formations and single formation are arranged again in the queue management scheme, and design that the present invention provides and realization are a kind of implementations based on single queue management.RIO is the modular design of existing implementation based on single queue management, it abandons (RED) queue management mechanism to the randomly and early of knowing and has carried out minor modifications, calculate the discarded ratio of packet of different business grade respectively with the oblique line of two Different Slope and terminal, the basic thought train of thought of other work (WRED etc.) only is that two oblique lines with RIO are generalized to many oblique lines to adapt to a plurality of grades of service.Subject matter based on the queue management of RIO is the division of Control Network resource between the grade of service well.
Summary of the invention
The objective of the invention is to provide a cover can instruct randomly and early to abandon (CGRED:Class Guided RED) queue management device (being designated hereinafter simply as CGRED) for the classification that Transmission Control Protocol type (comprising the friendly agreements of various TCP) user provides the difference service.The CGRED service that kept having any different is simple, the characteristics that extensibility is good, and high grade of service user's active service quality is inferior to low grade of service user's problem in the service that prevented from simultaneously to have any different.
The invention provides a kind of classification instructs randomly and early to abandon queue management device, be used for the queue management based on single buffer memory of router at the allocated bandwidth strategy of the grade of service that has the differentiated services network maintaining network to assign and configuration of routers, it is characterized in that comprising following seven types processing unit: the service class separator, extract the service class sign that each grouping is demarcated, and grouping is directed to corresponding business class processing unit according to this service class sign; The service class processing unit is estimated the occupied bandwidth of every class business, and according to input instruct probability and drop policy indication, produce the packet dropping probability of this service class; Drop policy and instruct the probability maker produces new service class drop policy indication according to the service class occupied bandwidth from the Service Processing Unit input, and upgrades service class and instruct drop probability; Packet admission abandons control unit, arrives grouping for each, produces a random number, if this random number less than the packet dropping probability of grouping place service class then abandon this grouping, otherwise arrives buffer unit with packet admission; Buffer unit, the memory cell of FIFO form tissue is for the grouping of being admitted provides spatial cache; Standard RED drop probability estimation unit, the algorithm that provides with RED is estimated the average queue length and the RED drop probability of buffer unit; And timer, produce the pulse that indicates timing arrival by predefined timing gap periods ground.
Instruct randomly and early to abandon in the queue management device in classification, be respectively service class processing unit of each service class separate configurations, each service class processing unit comprises: instantaneous occupied bandwidth statistical module, measure each timing at interval in the instantaneous occupied bandwidth of service class; The occupied bandwidth estimation module is come level and smooth instantaneous occupied bandwidth from instantaneous occupied bandwidth statistical module input by low-pass filter, obtains the estimation occupied bandwidth of current this service class, outputs to drop policy and instructs the probability maker; And packet dropping probability generation module, periodically receive from drop policy and the indication of service class drop policy and the service class that instruct the input of probability maker and instruct drop probability, for the newly arrived grouping of each this service class, obtain current RED drop probability from standard RED drop probability estimation unit, and offer packet admission by following algorithm computation and abandon the packet dropping probability that control unit uses: seize adjustment if the service class drop policy is designated as, then packet dropping probability instructs little one of numerical value in drop probability and the current RED drop probability for the current business class, if the service class drop policy is designated as to make a concession and adjusts, then packet dropping probability instructs big one of numerical value in drop probability and the current RED drop probability for the current business class, if being designated as, the service class drop policy need not adjust, then packet dropping probability equals current RED drop probability, after calculating end, upgrade the current business class with the packet dropping probability that calculates and instruct drop probability.
Drop policy and to instruct the probability maker be that classification instructs randomly and early to abandon centralized control unit in the queue management device, it is when producing the drop policy indication, business to a given grade, if current should business the estimation occupied bandwidth less than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be lower than this business greater than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed seizes adjustment; If current should business the estimation occupied bandwidth greater than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be higher than this business less than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed makes a concession adjustment; Otherwise indicate that with drop policy indication current this business need not adjust; The business that priority is the highest need not be done and make a concession adjust and the minimum business of priority need not be done and seizes adjustment.
Drop policy and the current business class that instructs the probability maker at first to obtain each service class from each service class processing unit when drop probability is instructed in generation instruct drop probability, and adaptively the current drop probability that instructs is upgraded: when seizing when adjusting by two gradient directions, instruct the computational methods of drop probability to be: to instruct drop probability=instruct drop probability * update coefficients * (1-should business normalization occupied bandwidth)+update coefficients * (1-priority is lower than the total occupied bandwidth of all professional normalization of this business), when making a concession adjustment, instruct the computational methods of drop probability to be: to instruct drop probability=instruct drop probability * update coefficients * (1-should business normalization occupied bandwidth)+update coefficients * (1-priority is higher than the total occupied bandwidth of all professional normalization of this business), when this business need not be adjusted, instruct drop probability constant, the normalization occupied bandwidth of an above-mentioned grade of service is the ratio of its actual occupied bandwidth with institute's distributions bandwidth, and the total occupied bandwidth of the normalization of one group of grade of service by the occupied bandwidth sum of all grades of service in the group and in organizing all grades of service the ratio of distribution bandwidth sum.
The present invention has following good effect: it is an effective queue management device that provides the difference service on the internet to the user that classification instructs randomly and early to abandon queue management device, it realizes simple, very strong extensibility is arranged, system is I'm well, simultaneously can keep the absolute priority of high-grade business for the inferior grade business, therefore can be more reasonable so that provide the difference service to the user, more can be accepted by the user.
Description of drawings
Fig. 1 has provided classification and has instructed randomly and early to abandon the main composition of queue management device and the block diagram of operation principle.
Fig. 2 has provided the main composition of instantaneous occupied bandwidth statistical module in the service class processing unit and the block diagram of operation principle.
Fig. 3 has provided the main composition of occupied bandwidth estimation module in the service class processing unit and the block diagram of operation principle.
Fig. 4 has provided the main composition of packet dropping probability generation module in the service class processing unit and the block diagram of operation principle.
Fig. 5 has provided packet admission and has abandoned the main composition of control unit and the block diagram of operation principle.
Fig. 6 has provided the grouping drop policy and has instructed the main composition of probability maker and the block diagram of operation principle.
Fig. 7 has provided the grouping drop policy and has instructed main composition and the work of importing locking and pretreatment module in the probability maker
The block diagram of principle.
Fig. 8 has provided the grouping drop policy and has instructed the main composition of judgement computing module in the probability maker and the side of operation principle
Block diagram.
Embodiment
In solution of the present invention, for being provided with the indication of drop policy and one, each grade of service instructs loss ratio, in queue management enforcement, the actual occupied bandwidth of each grade business of periodic measurement.Business to each grade, according to the actual occupied bandwidth of measuring and the difference of predefined distribution bandwidth, adopt the drop policy indication to indicate that current this service needed is seized adjustment, yielding adjustment maybe need not be adjusted, and with instructing the concrete adjustment amount of drop probability regulation.When implementing to the abandoning of grouping, indicate and instruct the value of loss ratio according to the drop policy of the grouping place grade of service, and the drop probability currency that calculates according to average queue length of reference standard RED, calculate the concrete drop probability that is applied to each grouping, and whether abandon this grouping with this probability judgement.
In the measurement of the professional actual occupied bandwidth of each grade, adopted the instantaneous occupied bandwidth of measuring Fixed Time Interval, and, can effectively prevent owing to adjust the time jitter that waits other factors to cause by the method that low-pass filter is guarded.
Business for each given grade has adopted following drop policy indication principle:
Seize adjustment: if current should business the estimation occupied bandwidth less than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be lower than this business greater than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed seizes adjustment;
Make a concession to adjust: if current should business the estimation occupied bandwidth greater than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be higher than this business less than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed makes a concession adjustment;
Need not adjust: if not above-mentioned two kinds of situations, then indicate that with the drop policy indication current this business need not adjust;
The business that priority is the highest need not be done to make a concession and adjust;
The business that priority is minimum need not be done and seize adjustment.
Adopted the adaptive algorithm of drop policy guiding to upgrade to instructing drop probability, its renewal has two gradient directions, is respectively the total occupied bandwidth of all professional normalization that this professional normalization occupied bandwidth and priority are lower than this business when seizing this two gradient directions when adjusting; Be respectively the total occupied bandwidth of all professional normalization that this professional normalization occupied bandwidth and priority are higher than this business when making a concession this two gradient directions when adjusting.
When concrete grouping is implemented to abandon, adopt the drop policy indication and instructed loss ratio to guide the algorithm of standard RED, promptly go out a RED drop probability with standard RED algorithm computation according to present average queue length, after receiving a grouping, at first check the drop policy indication of the grouping place grade of service, indication is done according to drop policy:
If this is designated as and need not adjusts, then also the value that instructs drop probability of this grade of service is set at the RED drop probability as the actual drop probability of this grouping with the RED drop probability;
If this is designated as and seizes adjustment, whether that then checks this grade of service instructs drop probability less than the RED drop probability, if less than then with this grade of service instruct the actual drop probability of drop probability as this grouping, otherwise also the value that instructs drop probability of this grade of service is set at the RED drop probability as the actual drop probability of this grouping with the RED drop probability;
If this is designated as to make a concession and adjusts, whether that then checks this grade of service instructs drop probability greater than the RED drop probability, if greater than then with this grade of service instruct the actual drop probability of drop probability as this grouping, otherwise also the value that instructs drop probability of this grade of service is set at the RED drop probability as the actual drop probability of this grouping with the RED drop probability.From the calculation criterion of top packet dropping probability as can be seen, there are two mode of operations in system, when the indication of the drop policy of all service class is need not adjust the time, system is controlled by RED, we claim that at this moment system works is in the RED pattern, adjust or make a concession when adjusting when the drop policy that has service class is designated as to seize, we claim system works at instructional model.Owing to adopted under drop policy control, instruct the drop probability initial value with the guiding of RED drop probability, when abandoning, grouping, make CGRED of the present invention that control precision well be arranged with instructing drop probability to define the method for RED drop probability, insensitive to the selection of Control Parameter.Specifically system forms a balance point to high-grade professional inclination on the RED mode of operation, system by 2 grades of service, if total occupied bandwidth of the high grade of service is greater than its total assigned bandwidth simultaneously, and total occupied bandwidth of the low grade of service is less than its total assigned bandwidth, then guidance mechanism is not done any adjustment, system controls by RED fully, the control of RED tendency is that the speed with all streams pulls to unanimity, if at this moment the single current speed of the high grade of service is higher than the single current speed of the low grade of service, then under the control of RED, system is to the direction adjustment of total occupied bandwidth of the total occupied bandwidth that reduces the high grade of service and the low grade of service of increase, in case system enters total occupied bandwidth of the high grade of service less than its total assigned bandwidth, perhaps total occupied bandwidth of the low grade of service is greater than its total assigned bandwidth, then system enters instructional model, guidance mechanism will play a role, and guarantee the bandwidth occupancy ratio of upper-lower hierarchy business; Otherwise if at this moment the single current speed of the high grade of service is lower than the single current speed of the grade of service, then under the control of RED, system is to the direction adjustment of the total occupied bandwidth that increases the high grade of service with the total occupied bandwidth that reduces the low grade of service, up to transferring the speed of all streams neat, system is in the RED pattern always, if there is not the variation of external load, then system will be equilibrated at this state always; On the other hand, if total occupied bandwidth of the high grade of service is less than its total assigned bandwidth, perhaps total occupied bandwidth of the low grade of service is greater than its total assigned bandwidth, then guidance mechanism comes into force, and system will be to the direction adjustment of the total occupied bandwidth that increases the high grade of service with the total occupied bandwidth that reduces the low grade of service.This point just, make that actual occupied bandwidth that CGRED can guarantee high grade of service user can be not obviously (except that since RED algorithm itself can bring the fluctuation of throughput) be lower than grade of service user's actual occupied bandwidth.
The present invention is described in detail for the contrast accompanying drawing below.
The present invention is the queue management mechanism of implementing at a network node, therefore the parameter of network node is done following supposition:
Physical parameter:
Outbound bandwidth W;
Buffer storage length B;
Setup parameter:
The parameter of standard RED:
Minimum quene threshold Lmin;
Maximum queue thresholding Lmax;
Slope Maxp reciprocal;
Grade of service parameter:
Service class set: S={0,1 ..., N-1},
The grade of service class: the height of supposing the grade of service here is consistent with the label of service class, i.e. service class s
Grade be higher than all labels other service class less than s, as the grade of service class 1
Be higher than service class 0, the grade of service class 4 is higher than service class 0,1,2 and 3 etc.;
The allocated bandwidth coefficient of service class:
Determined to distribute to every class
Professional bandwidth ratio, the distribution bandwidth ratio of service class s is r
s
The distribution bandwidth of service class: (W
0, W
1..., W
N-1), W
s=r
sW is a bandwidth of distributing to service class s; For unification, all adopting in superincumbent all bandwidth parameters bps is unit.
The formation of CGRED is with reference to Fig. 1, by service class separator, service class processing unit (containing instantaneous occupied bandwidth statistical module, occupied bandwidth estimation module, packet dropping probability generation module), drop policy with instruct probability maker, timer, packet admission to abandon control unit, buffer unit and standard RED drop probability estimation unit 7 parts and form.Service class separator, drop policy wherein and instruct probability maker, timer, packet admission to abandon control unit, buffer unit and standard RED drop probability estimation unit and in system, have only one respectively, instantaneous occupied bandwidth statistical module, occupied bandwidth estimation module and three modules of packet dropping probability generation module are formed a service class processing unit, and system will be provided with a such service class processing unit respectively for each service class.
The grouping of arrival system at first is separated to different service class processing units by the type of service that the service class separator is demarcated by grouping; Instantaneous occupied bandwidth statistical module in the service class processing unit carries out counting by the block length weighting to the grouping of this service class of arriving, when timer indicates predetermined fixed time interval arrival by output, the occupied bandwidth estimation module that instantaneous occupied bandwidth statistical module delivers count value to this service class processing unit, and to the count value zero clearing of this module; The occupied bandwidth estimation module adopts the instantaneous occupied bandwidth statistical value of the method for low-pass filter from original occupied bandwidth estimated value and new input, calculates the occupied bandwidth estimated value that makes new advances, and this value is outputed to drop policy and instructs the probability maker; Drop policy and instruct the probability maker after receiving the occupied bandwidth estimated value that all service class processing units are delivered, for each service class calculates the value that drop probability was indicated and instructed to drop policy, and this value is delivered the packet dropping probability generation module of corresponding service class processing unit respectively; The packet dropping probability generation module of service class processing unit writes down drop policy and instructs probability maker drop policy that deliver, that be applicable to this service class to indicate and instruct the value of drop probability, and can receive the RED drop probability that standard RED drop probability estimation unit is sent at any time, when the grouping of this service class arrives, the packet dropping probability generation module indicates, instructs the value and the RED drop probability of drop probability according to drop policy, calculate the actual drop probability of this grouping, and this probability is delivered packet admission abandon control unit; Packet admission abandons the actual drop probability of control unit according to a grouping of receiving, implements the admittance of this grouping is abandoned control, and buffer unit is sent in the grouping of being admitted; Standard RED drop probability estimation unit is being monitored the actual queue length of buffer unit always, RED algorithm according to standard calculates average queue length from actual queue length, and calculate the RED drop probability according to average queue length, send the packet dropping probability generation module of all service class processing units; The timer of system is a cycle timer, and it produces by predefined timing gap periods ground and indicates the pulse that regularly arrives.Now by the unit that function and the realization division of CGRED is as follows: timer: timer is a cycle timer, it produces by predefined timing gap periods ground and indicates the pulse that regularly arrives, represent predefined timing at interval with τ below, and claim the incident that regularly arrives be timer then.The service class separator: the function of service class separator is to extract the service class sign that each grouping is demarcated, and according to this service class sign grouping is directed to corresponding business class processing unit.Dividing into groups, how bearer service class sign is not within invention of the present invention, can consider to carry this sign with the TOS field of packets headers in the IP grouping.The service class processing unit: the service class processing unit by instantaneous occupied bandwidth add up, occupied bandwidth is estimated and packet dropping probability produces three modules and forms.It is identical that the inside of the employed service class processing unit of all different business classes constitutes, the service class processing unit of the service class of different brackets is by the drop policy that the packet dropping probability generation module is received value of indicating and different the causing of value of instructing drop probability in the different behaviors that this grade business of processing is shown fully.The function division of each module is as follows:
Instantaneous occupied bandwidth statistical module: the formation of instantaneous occupied bandwidth statistical module is made up of block length extraction unit, instantaneous occupied bandwidth register, adder and output latch as shown in Figure 2.Being input as of it arrives grouping and timer signal then, is output as the instantaneous occupied bandwidth value of locking.Instantaneous occupied bandwidth register has a weighted count value w, the block length extraction unit extracts the length l (p) that arrives grouping, and by adder count value w that instantaneous occupied bandwidth register is deposited and block length l (p) addition that arrives grouping, the w+l of w=as a result (P) after the addition feeds back to instantaneous occupied bandwidth register lock.When predefined timing arrived at interval, timer then signal instantaneous occupied bandwidth value that instantaneous occupied bandwidth register is deposited was locked output latch, and simultaneously with the zero clearing of instantaneous occupied bandwidth register.The algorithm flow that instantaneous occupied bandwidth statistical module is realized is as follows:
Timer is then:
Locking current count value w;
To instantaneous occupied bandwidth register zero clearing: w=0;
P arrives as grouping:
Extract the length of grouping P, be designated as l (P) bit;
Upgrade the value of instantaneous occupied bandwidth register: w=w+l (P); In order to guarantee the statistical accuracy of instantaneous occupied bandwidth statistical module, the fixed time interval that timer is set can guarantee that preferably the business of smallest allocation of bandwidth has the grouping of the average packet length more than 10 in a timing interval.
The occupied bandwidth estimation module: the formation of occupied bandwidth estimation module is seen accompanying drawing 3, is made up of occupied bandwidth estimation register, 1/ τ, α and three multipliers of 1-α and an adder.The input of occupied bandwidth estimation module is the instantaneous occupied bandwidth statistical value w from instantaneous occupied bandwidth statistical module, and output is the occupied bandwidth estimated value
Occupied bandwidth estimation register is deposited the occupied bandwidth estimated value
When timer then, after the occupied bandwidth estimation module is received the instantaneous occupied bandwidth statistical value w that instantaneous occupied bandwidth statistical module delivers, calculate new occupied bandwidth estimated value with following formula:
This occupied bandwidth estimated value that calculates
Feeding back to occupied bandwidth and estimate register lock, output to drop policy and instruct the probability maker, also is the new occupied bandwidth estimated service life of next fixed time interval on the other hand.The parameter alpha here is the low-pass filter coefficient, can select in 0.5 to 0.999, and coefficient is big more, the occupied bandwidth that estimates is level and smooth more, but the inertia of system is increased, reduce the reaction speed of system to load variations, therefore suggestion is at first selected between 0.9 and 0.99.Accompanying drawing 3 has provided a kind of possible specific implementation method, and the instantaneous occupied bandwidth statistical value w order of input is by obtaining behind 1/ τ and 1-α two multipliers
Be input to an input port of adder, and leave the current occupied bandwidth estimated value that occupied bandwidth is estimated register in
After through the α multiplier, obtain
Be input to another input port of adder, adder obtains after importing additions with two
The value that obtains after this addition is sent to occupied bandwidth and estimates register, as new occupied bandwidth estimated value, locks occupied bandwidth and estimates register.
The packet dropping probability generation module: the formation of packet dropping probability generation module is seen Fig. 4, by instructing drop probability register, drop policy indicator register, 3 to select 1 selector, output latch, minimum value calculator and maximum value calculator to form, the input variable of packet dropping probability generation module comprises from drop policy and instructs the drop policy indication g of probability maker and instruct drop probability q
g, from the RED drop probability q of packet dropping probability generation module standard RED drop probability estimation unit
RAnd arrive index signal from the grouping of service class separator, output signal comprise be sent to that packet admission abandons control unit arrive the corresponding actual drop probability q of grouping with each
P, and return drop policy and instruct the probability maker as calculate next instruct the drop probability initial value instruct the drop probability value.Timer then after, can receive from drop policy and instruct the drop policy indication g that the probability maker newly sends here and instruct drop probability q
g, the packet dropping probability generation module is respectively with the drop policy indicator register with instruct these two values of drop probability register lock.The packet dropping probability generation module calculates respectively by minimum value calculator and maximum value calculator always and instructs drop probability q
gWith RED drop probability q
RBetween minimum value m=min{q
R, q
gAnd maximum M=max{q
R, q
g, the minimum value m=min{q that calculates
R, q
g, maximum M=max{q
R, q
gAnd RED drop probability q
RBe connected respectively to the different input ports of selector, and drop policy indication g is connected to the control port of selector, when the value of g for need not adjust the time, selector output end mouth value is q
RWhen the value of g was adjusted for making a concession, selector output end mouth value was M=max{q
R, q
g; When the value of g was adjusted for seizing, selector output end mouth value was m=min{q
R, q
g.After one of this service class grouping P arrived, the grouping that the service class separator produces arrived index signal, and output latch is locked in the output of selector, as be sent to that packet admission abandons control unit with this arrivals corresponding actual drop probability q that divides into groups
p, grouping simultaneously arrives index signal and also the output of selector is locked and instruct the drop probability register, as the new drop probability value q that instructs
gThe output port that instructs the drop probability register always with drop policy with instruct the probability maker to link to each other, for drop policy with instruct the probability maker that the new initial value that provides when instructing drop probability is being provided.The algorithm flow that packet dropping probability generation module shown in Figure 4 is realized is as follows:
P arrives when grouping:
If g=seizes adjustment, q then
P=min{q
R, q
g;
If g=makes a concession adjustment, then q
p=max{q
R, q
g;
If g=need not adjust, then q
P=q
R
Make q
g=q
PWith the algorithm flow of top equivalence be:
P arrives when grouping:
Make q
P=q
R
If ((g=seizes and adjusts and q
R＞q
g) or (g=makes a concession and adjusts and q
R＜q
g)), then make q
P=q
g
Otherwise make q
g=q
RPacket admission abandons control unit: packet admission abandons the formation of control unit with reference to Fig. 5, is made up of tandom number generator, comparator and switch module, and the input that packet admission abandons control unit is to arrive grouping P, and the actual drop probability q corresponding with it
p, the output that packet admission abandons control unit is the grouping of admitting.The arrival of each grouping will trigger tandom number generator and produce one independently at 0,1 equally distributed random number x, the actual drop probability q of the value of x and grouping
PDelivered to the input port of comparator respectively, if the value of x is less than the actual drop probability q of grouping
pThen comparator is output as 0, otherwise is 1.The output of comparator is used for controlling a switch, the data input of switch is to arrive grouping, switch has two output ports, Oa and Ob, when the control of switch was input as 1, output Oa linked to each other with input, output Ob hangs empty, when the control of switch was input as 0, output Ob linked to each other with input, and output Oa hangs empty.Abandon in the control unit in packet admission, switch Ob output port sky is connect, and the Oa output port is received buffer unit as the output port of whole unit.Packet admission shown in Figure 5 abandons the algorithm flow that control unit is achieved as follows:
P arrives when grouping:
Produce one at 0,1 equally distributed random number x.
If x＜q
p, then abandon grouping P;
Otherwise admit grouping P.Drop policy and instruct the probability maker: drop policy and the formation that instructs the probability maker are with reference to Fig. 6, and by an input locking and pretreatment module, and a plurality of judgement computing module is formed.Each service class is corresponding to a judgement computing module, and the internal structure of all judgement computing modules all is identical.The formation of input locking and pretreatment module is made up of register and adder with reference to Fig. 7.Shown in Figure 7 is the input locking and the pretreatment module of 4 service class, and the structure of the module of a plurality of service class is similar.Register in input locking and the pretreatment module is divided into two groups: one group of bandwidth W that is used for locking system for each service class configuration
j, another group is used for locking the latest estimated of occupied bandwidth estimator when each timing signal arrives
Adder is calculated the distribution bandwidth summation U that grade is higher than all business of this business at each service class j
jWith the estimated bandwidth summation
And grade is lower than the distribution bandwidth summation V of all business of this business
jWith the estimated bandwidth summation
The W of all service class
j,
U
j,
V
j, and
Output as input locking and pretreatment module.The input locking that pairing judgement computing module of service class is only relevant with this service class and the output of pretreatment module link to each other, the pairing judgement computing module of service class j be input as W
j,
U
j,
V
j, and
The formation of judgement computing module is made up of comparator/divider unit, logical block and computing unit with reference to Fig. 8.Corresponding to comparator/divider unit of U, W, V the comparative result of built-in comparator is sent into three input ports of a, b, c of logical block respectively, if
A=1 then, otherwise a=0; If
B=1 then, otherwise b=0; Same if
C=1 then, otherwise c=0.Logical block is achieved as follows logic computing function: if the b=1 and the a=0 of input then export g=and make a concession adjustment; If the b=0 and the c=1 of input then export g=and seize adjustment; Other input condition output g=need not adjust.The value g that computing unit calculates delivers to the g input port of computing unit simultaneously on the one hand as the drop policy indication output of this service class.Comparator/divider unit is with the result of calculation of built-in divider
With
Also deliver to b, a and the c input port of computing unit respectively, instruct the value of drop probability register also to be returned to the p input port of computing unit simultaneously in this service class packet dropping probability generation module.Computing unit is according to the value of these five input ports, calculate make new advances instruct drop probability value q; If g=makes a concession and adjusts then q=p-(l-a)/Maxp
b+ (l-b)/Maxp
rIf seizing, g=adjusts then q=p-(l-a)/Maxp
b+ (l-c)/Maxp
rIf g=need not adjust then q=p, wherein Maxp
bAnd Maxp
rBe respectively that this service class is higher than the adaptive updates coefficient on the total occupied bandwidth both direction of all the professional normalization tonsure of (being lower than) this business at normalization occupied bandwidth and priority.As summary, drop policy and instruct the probability maker timer then after, receive the occupied bandwidth estimated value to each service class of delivering from each service class processing unit
And according to the distribution bandwidth { W of predefined each service class
i: 0≤i＜N}, calculate the drop policy indication { g that each service class processing unit is given in loopback respectively
i: 0≤i＜N} and instruct drop probability { q
g (i): 0≤i＜N}.The algorithm flow that calculates is as follows:
For service class i:
g
i=need not adjust;
If
And
Then
g
i=make a concession and adjust;
If
And
G then
i=seize adjustment;
Above to instructing the update coefficients { Maxp in the drop probability adaptive updates algorithm
i b: 0≤i＜N} and { Maxp
i r: 0≤i＜N} can select between 30 to 500.When system loading changes not quite or be frequent, can select number greatly, with the assurance control precision, otherwise select less number, to obtain quick response to load variations.Buffer unit and standard RED drop probability estimation unit: buffer unit is identical with the corresponding unit that the standard RED drop probability estimation unit and the RED queue management of standard are adopted, buffer unit will divide into groups to be sent to link through output port in the mode of FIFO for the grouping of being admitted provides spatial cache.Standard RED drop probability estimation unit is according to the instantaneous length computation average queue length of buffer unit, and according to the Lmin of buffer threshold up and down and the Lmax of average queue length and setting, and slope Maxp reciprocal calculates RED drop probability q
R, and at any time result calculated is offered the packet dropping probability generation module of all service class processing units.
Claims (4)
1, a kind of classification instructs randomly and early to abandon queue management device, be used for the queue management based on single buffer memory of router at the allocated bandwidth strategy of the grade of service that has the differentiated services network maintaining network to assign and configuration of routers, it is characterized in that comprising following seven types processing unit: the service class separator, extract the service class sign that each grouping is demarcated, and grouping is directed to corresponding business class processing unit according to this service class sign; The service class processing unit is estimated the occupied bandwidth of every class business, and according to input instruct probability and drop policy indication, produce the packet dropping probability of this service class; Drop policy and instruct the probability maker according to the service class occupied bandwidth from the Service Processing Unit input, produces new service class drop policy indication, and the renewal service class instructs drop probability; Packet admission abandons control unit, arrives grouping for each, produces a random number, if this random number less than the packet dropping probability of grouping place service class then abandon this grouping, otherwise arrives buffer unit with packet admission; Buffer unit, the memory cell of FIFO form tissue is for the grouping of being admitted provides spatial cache; Standard RED drop probability estimation unit, the algorithm that provides with RED is estimated the average queue length and the RED drop probability of buffer unit; And timer, produce the pulse that indicates timing arrival by predefined timing gap periods ground.
2, instruct randomly and early to abandon queue management device according to the described classification of claim 1, it is characterized in that: be respectively wherein said service class processing unit of each service class separate configurations, each service class processing unit comprises: instantaneous occupied bandwidth statistical module, measure each timing at interval in the instantaneous occupied bandwidth of service class; The occupied bandwidth estimation module is come level and smooth instantaneous occupied bandwidth from instantaneous occupied bandwidth statistical module input by low-pass filter, obtains the estimation occupied bandwidth of current this service class, outputs to drop policy and instructs the probability maker; And packet dropping probability generation module, periodically receive from drop policy and the indication of service class drop policy and the service class that instruct the input of probability maker and instruct drop probability, for the newly arrived grouping of each this service class, obtain current RED drop probability from standard RED drop probability estimation unit, and offer packet admission by following algorithm computation and abandon the packet dropping probability that control unit uses: seize adjustment if the service class drop policy is designated as, then packet dropping probability instructs little one of numerical value in drop probability and the current RED drop probability for the current business class, if the service class drop policy is designated as to make a concession and adjusts, then packet dropping probability instructs big one of numerical value in drop probability and the current RED drop probability for the current business class, if being designated as, the service class drop policy need not adjust, then packet dropping probability equals current RED drop probability, after calculating end, upgrade the current business class with the packet dropping probability that calculates and instruct drop probability.
3, instruct randomly and early to abandon queue management device according to the described classification of claim 1, it is characterized in that: wherein said drop policy and instruct the probability maker when producing the drop policy indication, business to a given grade, if current should business the estimation occupied bandwidth less than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be lower than this business greater than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed seizes adjustment; If current should business the estimation occupied bandwidth greater than the summation of estimation occupied bandwidth of all business of distributing bandwidth and priority to be higher than this business less than corresponding summation of distributing bandwidth, then indicate that with the drop policy indication current this service needed makes a concession adjustment; Otherwise indicate that with drop policy indication current this business need not adjust; The business that priority is the highest need not be done and make a concession adjust and the minimum business of priority need not be done and seizes adjustment.
4, instruct randomly and early to abandon queue management device according to the described classification of claim 1, it is characterized in that: wherein said drop policy and the current business class that instructs the probability maker at first to obtain each service class from each service class processing unit when drop probability is instructed in generation instruct drop probability, and adaptively the current drop probability that instructs is upgraded: when seizing when adjusting by two gradient directions, instruct the computational methods of drop probability to be: to instruct drop probability=instruct drop probability-update coefficients * (1-should business normalization occupied bandwidth)+update coefficients * (1-priority is lower than the total occupied bandwidth of all professional normalization of this business), when making a concession adjustment, instruct the computational methods of drop probability to be: to instruct drop probability=instruct drop probability-update coefficients * (1-should business normalization occupied bandwidth)+update coefficients * (1-priority is higher than the total occupied bandwidth of all professional normalization of this business), when this business need not be adjusted, instruct drop probability constant, the normalization occupied bandwidth of an above-mentioned grade of service is the ratio of its actual occupied bandwidth with institute's distributions bandwidth, and the total occupied bandwidth of the normalization of one group of grade of service by the occupied bandwidth sum of all grades of service in the group and in organizing all grades of service the ratio of distribution bandwidth sum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011106786A CN1134136C (en) | 2001-04-17 | 2001-04-17 | Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011106786A CN1134136C (en) | 2001-04-17 | 2001-04-17 | Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1380771A CN1380771A (en) | 2002-11-20 |
| CN1134136C true CN1134136C (en) | 2004-01-07 |
Family
ID=4658754
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011106786A Expired - Fee Related CN1134136C (en) | 2001-04-17 | 2001-04-17 | Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1134136C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101491024B (en) * | 2006-07-07 | 2012-06-20 | 日本电气株式会社 | Estimation method, device, and program, and network measuring system |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7149738B2 (en) * | 2002-12-16 | 2006-12-12 | International Business Machines Corporation | Resource and data administration technologies for IT non-experts |
| CN1297098C (en) * | 2003-05-09 | 2007-01-24 | 华为技术有限公司 | System flow controlling method |
| CN101383752B (en) * | 2007-09-04 | 2011-12-07 | 中兴通讯股份有限公司 | Method for network QoS control |
| CN102185732B (en) * | 2011-04-13 | 2013-07-17 | 瑞斯康达科技发展股份有限公司 | Method and system for testing active queue management parameters of communication equipment |
| US20130308458A1 (en) * | 2012-05-18 | 2013-11-21 | Alcatel-Lucent Usa Inc. | System And Method For Implementing Active Queue Management Enhancements For Variable Bottleneck Rates |
| CN103580958B (en) * | 2013-11-08 | 2016-08-24 | 国家电网公司 | A kind of adaptive hierarchical method of the router grade of service in powerline network |
| CN106789722A (en) * | 2015-11-23 | 2017-05-31 | 深圳市中兴微电子技术有限公司 | A kind of method for controlling network congestion and device |
| CN109257244B (en) * | 2017-07-14 | 2021-12-07 | 北京国双科技有限公司 | Transmission control method, device and system for user behavior data |
| CN118018417A (en) * | 2022-11-09 | 2024-05-10 | 中兴通讯股份有限公司 | Network traffic speed limiting method, device, central control equipment and storage medium |
-
2001
- 2001-04-17 CN CNB011106786A patent/CN1134136C/en not_active Expired - Fee Related
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101491024B (en) * | 2006-07-07 | 2012-06-20 | 日本电气株式会社 | Estimation method, device, and program, and network measuring system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1380771A (en) | 2002-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100463451C (en) | Multidimensional queue dispatching and managing system for network data stream | |
| US6594234B1 (en) | System and method for scheduling traffic for different classes of service | |
| US6788697B1 (en) | Buffer management scheme employing dynamic thresholds | |
| US7974208B2 (en) | System and method for router queue and congestion management | |
| US7289447B2 (en) | Method and packet-level device for traffic regulation in a data network | |
| CN1913488A (en) | Predictive congestion management in a data communications switch using traffic and system statistics | |
| CN1541474A (en) | System and method of differentiated queuing in routing system | |
| CN1593044A (en) | Method and system for congestion avoidance in packet switching devices | |
| CN1781287A (en) | Methods and devices for flexible bandwidth allocation | |
| CN1134136C (en) | Method for implementing hierarchical direction to randomly and early discard queue management mechanism and circuit | |
| CN1514609A (en) | Rate control based on class and using multithreshold leakage unit | |
| CN1300490A (en) | Apparatus and method for monitoring data flow at node on a network | |
| US8248932B2 (en) | Method and apparatus for fairly sharing excess bandwidth and packet dropping amongst subscribers of a data network | |
| CN103259743A (en) | Method and device for controlling output flow based on token bucket | |
| CN106302228B (en) | The transfer control method of task based access control perception in a kind of data center network | |
| CN102811176B (en) | A kind of data flow control method and device | |
| CN108809856A (en) | The traffic scheduling method of power communication heterogeneous network | |
| CA2462793C (en) | Distributed transmission of traffic streams in communication networks | |
| CN101714947A (en) | Extensible full-flow priority dispatching method | |
| CN102271083A (en) | Communication control apparatus and shaping apparatus | |
| CN1625157A (en) | Policing device | |
| CN1638362A (en) | Parallel data link layer controllers in a network switching device | |
| EP1526686B1 (en) | Switching unit with scalable and QoS aware flow control | |
| WO2002098047A2 (en) | System and method for providing optimum bandwidth utilization | |
| CN1518296A (en) | Method of implementing integrated queue scheduling for supporting multi service |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |