CN101232455A - Congestion control method and apparatus - Google Patents
Congestion control method and apparatus Download PDFInfo
- Publication number
- CN101232455A CN101232455A CNA2008100577028A CN200810057702A CN101232455A CN 101232455 A CN101232455 A CN 101232455A CN A2008100577028 A CNA2008100577028 A CN A2008100577028A CN 200810057702 A CN200810057702 A CN 200810057702A CN 101232455 A CN101232455 A CN 101232455A
- Authority
- CN
- China
- Prior art keywords
- sdu
- receives
- service
- buffer queue
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a congestion controlling method, wherein, when received SDU is determined not to belong to UGS, the packet loss probability is calculated according to an improved RED algorithm; when the packet loss treatment is determined according to the packet loss probability, when the service type of the received SDU is determined to be nrtPS or BE, the received SDU is discarded; when the service type of the SDU is determined to be ErtPS or rtPS, the longest-running SDU in the buffering queue in the SDU corresponding to the service type of the received SDU is discarded, and the received SDU is put into the buffering queue. The method simultaneously provides a device for realizing congestion control, the method and the device can fully consider the effect of queue length, the quality change of the channel and retention data on the congestion control, the QoS guarantee of the wireless communication service is provided from the aspect of the congestion control.
Description
Technical field
The present invention relates to the BWA field, relate in particular to a kind of jamming control method and device.
Background technology
High speed development along with wireless communication technology, wireless communication technology becomes necessary tool in people's routine work and the life gradually, various radio communication services arise at the historic moment, simultaneously, the demand that guarantees for the service quality (QoS, Quality of Service) of radio communication service is also strong day by day.
Below, introduce in the prior art the reason of congested generation in the communication system: all have certain buffer memory in the general communication system, in order to pending data such as to deposit.When the data rate that enters communication system during greater than the data rate that sends from communication system, buffer memory will be taken gradually, can't receive the data that enter communication system again, and then communication system will take place congested.
IEEE802.16 is a kind of air interface protocol of supporting that high-speed radio inserts.Micro-wave access to global intercommunication (WiMAX, Worldwide Interoperability for Microwave Access) system etc. is a kind of BWA based on IEEE802.16, the IEEE802.16 protocol definition standard of link layer wherein (MAC, Media Access Control) and physical layer.BWA based on IEEE802.16 generally can take place congested in both cases:
First kind of situation is because data sudden causes congested.This kind situation is more common in packet network, data service in the packet network has paroxysmal characteristics, be that packet is not evenly to arrive, but may have only the low volume data bag to arrive in a certain period, another section period then has the lot of data bag to arrive.In general, above-mentioned when congested when taking place, can alleviate the part congestion situation by traffic shaping, also can pass through earlier detection (RED at random, Random Early Detection) and Weighted random earlier detection queue management mechanisms such as (WRED, Weighted Random Early Detection) carry out comparatively effective congested control.Wherein, traffic shaping is used to be processed into the speed and capacity of network service, and shaping is finished between egress and ingress usually; Traffic shaping has two kinds of typical methods: leak bucket and mark bucket.The RED algorithm be a kind of commonly used, avoid congested queue management mechanism, the concrete algorithm of RED is:
p_Red＝P_max*(Q_Len-min_len)/(max_len-min_len)；
Wherein, the drop probabilities of p_Red for using the RED algorithm computation to obtain, min_len represents minimum queue length, and max_len represents maximum queue length, and P_max represents the benchmark drop probabilities, and Q_Len represents length of buffer queue.Wherein, P_max is a preset value, generally sets according to the traffic carrying capacity of the carrying nrtPS that sets in the applied system of this method and BE or ErtPS and rtPS.Wherein, herein and the length of buffer queue Q_Len, the maximum queue length max_len that are hereinafter mentioned, minimum queue length min_len etc. all be for the total length of all type of service corresponding cache formations.
In the queue management mechanism that uses the RED algorithm, by calculating drop probabilities, optionally abandon data according to type of service priority, make the average length of length of buffer queue keep less, happen suddenly caused congested to regulate ephemeral data.Wred algorithm provides the characteristic identical with RED, and the priority according to type of service optionally abandons data equally.
Second kind of situation is because the IEEE802.16 agreement has been introduced Adaptive Modulation and Coding (AMC for the utilance that improves air bandwidth, Adaptive Modulation and Coding) mechanism and cause congested, that is: for certain MS, BWA can change the modulation coding mode of up-downgoing according to the channel quality of wireless channel, and the channel quality of wireless channel is variable at any time, medium access control (MAC) the layer bit number that identical physical layer bandwidth can be carried is variable, the throughput of promptly eating dishes without rice or wine is variable, when channel quality descends suddenly, data in the buffer memory have little time to send, and the data on upper strata are when arriving successively, and system will take place congested.So even the packet that needs send smoothly arrives, situations such as the also possible channel quality variation owing to wireless channel of BWA, bandwidth minimizing take place congested, and traffic shaping also can't be alleviated take place in this case congested.
In addition, because IEEE802.16 has comparatively perfect QoS mechanism, can support real time business and non-real-time service, and 5 kinds of types of service have been defined, be respectively: Unsolicited Grant Service (UGS, UnsolicitedGrant Service), Kuo Zhan real-time polling service (ErtPS, Extended real-time Polling Service), real-time polling service (rtPS, real-time Polling Service), non-real-time polling service (nrtPS, non-real-time Polling Service) and Best-Effort service (BE, Best Effort).Wherein, UGS, ErtPS, rtPS are real time business; NrtPS and BE are non-real-time service.The IEEE802.16 agreement is that various types of traffic has defined qos parameter separately to support better QoS; Except UGS, the qos parameter of other types of service has all defined priority; Qos parameter to real time business has all defined maximum delay, and described maximum delay is used to define the delay requirement of real time business.In view of this, above-mentioned 5 kinds of types of service of definition have different priority, and the difference of priority is also arranged between the data of identical services type, make the data of different service types and service with different priority levels type, and the time that takies buffer memory is different.Because the data that priority is high more generally all can preferentially be sent after arriving buffer memory, especially the data of real time business.When load is heavier, the data that priority is low more, the chance that is forwarded is just more little, and the time that stays in the buffer memory will be long more, and when channel quality did not take a turn for the better, described data just may become " slow-witted data ", took spatial cache and can not get forwarding.When not having corresponding mechanism to improve above-mentioned situation, " slow-witted data " may get more and more, and spatial cache is corresponding fewer and feweri, and BWA may be forced to abandon the data of high priority.
According to the above, other are about congestion control method in above-mentioned RED algorithm, wred algorithm or the prior art, nearly all be to focus on the control length of buffer queue alleviating the data congestion that data burst brings, and be difficult to avoid since the data of the channel quality variation of wireless channel or low priority not have transmission to be trapped in the buffer memory caused congested.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of jamming control method and device, can take into full account of the influence of the delay data of length of buffer queue, variations and low priority, provide the QoS of radio communication service to guarantee from congested control aspect congested control.
For achieving the above object, technical scheme of the present invention is achieved in that
The invention provides a kind of jamming control method, this method comprises:
A, when determining that the service data unit SDU that receives does not belong to Unsolicited Grant Service UGS, use the improved RED of earlier detection at random algorithm computation drop probabilities;
B, determine to carry out packet loss when handling, when type of service is non-real-time polling service nrtPS or Best-Effort service BE under the SDU that determines to receive, abandon the SDU that receives according to drop probabilities; When determining type of service under the SDU that receives for the real-time polling service ErtPS of expansion or real-time polling service rtPS, abandon time SDU at most among the SDU of type of service correspondence under the SDU that receives, in buffer queue, and the SDU that receives is put into buffer queue.
Wherein, step B further comprises: when determining not carry out the packet loss processing according to drop probabilities, the SDU that receives is put into buffer queue.
Further comprise before the steps A: the MAC layer connects under the SDU that determines to receive according to the attribute of the SDU that receives, and should connect pairing service quality QoS parameter, and determine the congestion control parameter of the described SDU correspondence that receives according to described qos parameter.
The improved RED algorithm computation of described use drop probabilities is specially:
p_Red＝P_max×(Q_Len-min_len)/(max_len-min_len)；
p＝(R_in/R_out)×p_Red；
Wherein, the drop probabilities of p for using improved RED algorithm computation to obtain, the drop probabilities of p_Red for using the RED algorithm computation to obtain, min_len represents the minimum queue length of buffer queue, max_len represents the maximum queue length of buffer queue, and P_max represents the benchmark drop probabilities, and Q_Len represents length of buffer queue, R_in represents the speed of joining the team, and R_out expresses group speed.
Step B further comprises: when determining that the SDU that receives belongs to UGS, the SDU that receives is put into buffer queue.
Further comprise after the step B:
C1, calculating and renewal join the team speed, go out group speed and length of buffer queue.
After the step C1, further comprise:
C2, determine the alarming threshold of total buffer memory capacity greater than buffer memory capacity, and total buffer memory capacity is greater than duration of described alarming threshold during greater than time threshold, abandon SDU in the buffer queue from low to high according to the priority of type of service, be not more than described alarming threshold up to total buffer memory capacity.
Further comprise after the step B:
C3, the SDU in the buffer queue is dispatched, the SDU that will send forms protocol service unit PDU, afterwards, sends described PDU, calculates and upgrades group speed.
The present invention provides a kind of device of realizing congested control simultaneously, and this device comprises: sort module and congested control module, wherein,
Sort module is used for determining the pairing qos parameter of this SDU according to the attribute of the SDU that receives, and described SDU and described qos parameter thereof are sent to congested control module;
Congested control module, be used for the described qos parameter sent according to the sort module that receives, determine the congestion control parameter and the affiliated type of service of the SDU correspondence that receives, determine the packet loss scheme according to type of service under the SDU that receives, when determining not abandon the SDU that receives, the SDU that receives is put into buffer queue; When determining to abandon the SDU that receives, directly abandon the SDU that receives; Under determining to abandon the SDU that receives among the SDU of type of service correspondence in buffer queue during at most SDU of time, abandon the described time at most SDU and the SDU that receives put into buffer queue.
Wherein, described packet loss scheme is specially:
When determining that the SDU that receives belongs to UGS, do not abandon the SDU that receives;
When determining that the SDU that receives does not belong to UGS, use improved RED algorithm computation drop probabilities, when determining that according to the drop probabilities that obtains needs carry out the packet loss processing, when determining that the SDU that receives belongs to nrtPS or BE, abandon the SDU that receives, when determining that the SDU that receives belongs to ErtPS or rtPS, abandon under the SDU that receives among the pairing SDU of type of service time SDU at most in buffer queue, and the SDU that receives is put into buffer queue; When determining that according to described drop probabilities needs do not carry out the packet loss processing, the SDU that receives is put into buffer queue.
This device further comprises:
The queue monitor module, be used to calculate and upgrade SDU the speed of joining the team, go out group speed and length of buffer queue, afterwards, described information is sent to congested control module; Also be used for when total buffer memory capacity greater than the alarming threshold of buffer memory capacity and total buffer memory capacity greater than duration of described alarming threshold during the overtime threshold value, clear up SDU in the buffer queue from low to high by the priority of type of service, be not more than described alarming threshold up to total buffer memory capacity.
This device further comprises:
Scheduler module, the SDU that is used for buffer queue will be sent forms PDU, and described PDU is sent to output module;
Output module is used to send the described PDU that receives, and calculates group speed according to the business datum amount that is sent, and goes out group speed and sends to congested control module described.
Jamming control method provided by the present invention and device, use improved RED algorithm computation drop probabilities, and in the described improved RED algorithm except the same with the RED algorithm, calculate outside the drop probabilities by length of buffer queue, also carry out the calculating of drop probabilities with the ratio that goes out group speed according to the speed of joining the team, when variations, dynamically update out group speed, and then dynamically update drop probabilities, reach unanimity thereby making joins the team speed and go out group speed, reach the purpose of control length of buffer queue, and alleviated the Congestion Level SPCC of system; According to different types of service, use different packet loss schemes, provide the QoS of radio communication service to guarantee from congested control aspect; In addition, in the present invention, when length of buffer queue reaches the time threshold of setting greater than duration of maximum queue length, abandon service data unit (SDU in the buffer queue according to the priority order from low to high of type of service, service data unit), to clear up the lower-priority data that is trapped in for a long time in the buffer queue, thereby, when not recovering when the unexpected variation of the channel quality of system and in the long time, make the lower-priority data that enters buffer queue but can't send can not occupy buffer queue for a long time, reduced and owing to spatial cache diminishes congested possibility has taken place in such cases.
Description of drawings
Fig. 1 is a jamming control method schematic flow sheet of the present invention;
Fig. 2 is a congestion control device structural representation of the present invention.
Embodiment
Basic thought of the present invention is: when determining that the SDU that receives does not belong to UGS, use improved RED algorithm computation drop probabilities, when determining that according to the drop probabilities that calculates needs carry out packet loss, according to the difference of type of service, use different packet loss schemes; When determining that the SDU that receives belongs to UGS, directly the SDU that receives is put into buffer queue.
Below, be described with reference to the accompanying drawings the realization of jamming control method of the present invention and device by specific embodiment.
Fig. 1 is a jamming control method schematic flow sheet of the present invention, and as shown in Figure 1, this method comprises:
Step 101: determine that according to the attribute of the SDU that receives the MAC layer connects under the SDU, and described MAC layer connects pairing qos parameter.
Wherein, can determine that according to the attribute of the SDU that receives the MAC layer connects under the SDU, also just obtain this MAC layer and connected corresponding qos parameter, comprise in the qos parameter: type of service; The maximum speed Vmax that guarantees; The minimum speed Vmin that guarantees.Wherein, the minimum of BE business guarantees that speed Vmin is 0.Can obtain the pairing predefine parameter of corresponding service type cache weights W_serv according to type of service and User Priority, the value of described parameter cache weights W_serv can rule of thumb be worth definite, and User Priority is high more, and this value is big more.
Wherein, described SDU can be the IP packet or the packet of Ethernet etc.Described attribute comprises: source address, destination address, port numbers etc.
Wherein, specifically how to carry out SDU and be categorized into the MAC connection, and obtain the existing explanation in existing IEEE802.16 agreement and WiMAX related protocol of its qos parameter, repeat no more here according to described attribute.
Step 102:, obtain the congestion control parameter of this SDU according to the pairing qos parameter of determining of SDU.
Wherein, described congestion control parameter comprises: parameters such as minimum queue length min_len, maximum queue length max_len and benchmark drop probabilities P_max.
Below, listing a kind of method of obtaining above-mentioned congestion control parameter, this method is specially:
Suppose that congested control time granularity is Δ t, the total buffer memory capacity of system is Mt, and the total throughput of system is Vt, and wherein, described system is the applied system of jamming control method of the present invention, so,
The length of buffer queue that guarantees the maximum assurance of this MAC layer connection speed QoS is Vmax * Δ t, guarantees that the length of buffer queue of the minimum assurance of this MAC layer connection speed QoS is Vmin * Δ t.
According to the fair allocat principle, this MAC floor connects the system cache district maximum that can obtain and is:
Mc_max＝k1×Mt×W_serv×Vmax/Vt
Minimum value is:
Mc_max＝k1×Mt×W_serv×Vmin/Vt
Wherein, k1 is the total buffer memory capacity alarming threshold coefficient of system, and 0＜k1＜1 generally is made as 0.85 with k1 in actual applications; The parameter cache weights of W_serv for obtaining according to traffic flow types and user gradation has been described in step 101, repeats no more here.
If Mc_max＜=Vmax * Δ t then, gets maximum queue length and is:
max_len＝Mc_max。
At this moment, can regard as the total buffer memory capacity of designed system has problem, generally should alarm.How to realize that specifically described alarm belongs to known technology, repeat no more here.
Further segmentation with this understanding, if Mc_max＜=Vmin * Δ t, at this moment, the total buffer memory capacity of system is the most abominable, then gets minimum queue length and is:
min_len＝max(k3×Mc_max，Mc_min)
Wherein, k3 is a configuration parameter, can be called professional memory protect thresholding, generally is chosen to be 0.7.
If Mc_max (Vmin * Δ t, Vmax * Δ t] interval, but during Mc_min＜=Vmin * Δ t, get minimum queue length and be:
min_len＝max(Vmin×Δt，k3×Mc_max)
If Mc_max and Mc_min all (Vmin * Δ t, Vmax * Δ t] interval, then, get minimum queue length and be:
min_len＝max(Mc_min，k3×Mc_max)
Otherwise, when Mc_max＞Vmax * Δ t, get maximum queue length and be:
man_len＝min(Mc_max，k2×Vmax×Δt)
Wherein, k2 is a configuration parameter, can be called business and overflow Upper threshold, is traditionally arranged to be 2.
With this understanding, further when Mc_max＞k4 * Vmax * Δ t, this moment, system resource was the most sufficient, chose minimum queue length and was:
min_len＝max(k4×Vmax×Δt，Mc_min)
When Mc_max＜=k4 * Vmax * Δ t, can choose minimum queue length and be:
min_len＝max(Vmax×Δt，Mc_min)
Wherein, k4 is a configuration parameter, can be called business and overflow Lower Threshold, must satisfy k4＜k2, is traditionally arranged to be 1.2.
P_max generally chooses the value that equates with k1.
More than, provided a kind of reference method that obtains described congestion control parameter, but, jamming control method provided by the present invention is in the process that realizes, the acquisition methods of the above congestion control parameter that provides is provided, can independently selects corresponding congestion control parameter acquisition methods in the prior art.
Step 103: judge whether the affiliated type of service of the SDU that receives is UGS, if UGS, then execution in step 109; If not UGS, then execution in step 104.
Step 104: utilize the pairing minimum queue length of SDU, maximum queue length and current cache queue length, the speed of joining the team receive and go out parameter such as group speed, according to improved RED algorithm computation drop probabilities.
Described improved RED algorithm is specially:
p_Red＝P_max×(Q_Len-min_len)/(max_len-min_len)；
p＝(R_in/R_out)×p_Red；
Wherein, the drop probabilities of p for using improved RED algorithm computation to obtain, the drop probabilities of p_Red for using the RED algorithm computation to obtain, min_len represents minimum queue length, max_len represents maximum queue length, and P_max represents the benchmark drop probabilities, and Q_Len represents length of buffer queue, R_in represents the speed of joining the team, and R_out expresses group speed.P_max is a preset value, generally sets according to the traffic carrying capacity of the carrying nrtPS that sets in the applied system of this method and BE or ErtPS and rtPS.
Maximum queue length and minimum queue length are referred to as queue length threshold.
Drop probabilities p is the same except the drop probabilities p_RED that goes out with the RED algorithm computation, outside the queue length relevant with buffer queue is relevant, and also with the speed R_in that joins the team with to go out group ratio of speed R_out relevant.As R_in during greater than R_out, drop probabilities p will become greatly, and as R_in during less than R_out, drop probabilities p will diminish, and R_in and R_out are reached unanimity.
Step 105: judge whether that according to drop probabilities p needs carry out packet loss and handle, carry out packet loss if desired and handle that then execution in step 106; Handle as not needing to carry out packet loss, then execution in step 109.
Step 106: according to the qos parameter that obtains of step 101, judge the affiliated type of service of SDU that receives, if be nrtPS or BE, then execution in step 107; If be ErtPS or rtPS, then execution in step 108.
Step 107: abandon the SDU that receives, afterwards, execution in step 110.
Wherein, also record is very known in the prior art specifically how to abandon SDU, repeats no more here.
Step 108: abandon under the SDU that receives among the pairing SDU of type of service, the SDU at most of the time in buffer queue, then, execution in step 109.
Wherein, it is very known in the prior art specifically how to abandon under the SDU in buffer queue time SDU at most, repeats no more here.
Step 109: the SDU that receives is put into buffer queue, afterwards, execution in step 110.
Wherein, it is very known in the prior art specifically how SDU to be put into buffer queue, repeats no more here.
Step 110: calculate and upgrade the speed of joining the team, go out group speed and length of buffer queue, afterwards, execution in step 111 and 114.
Wherein, when changing this step over to by step 107, because the SDU that receives is dropped, therefore, the SDU that this is not received when speed is joined the team in calculating charges in the number of joining the team.When changing this step over to by step 109, because the SDU that receives is placed in the buffer queue, then calculate when joining the team speed, this SDU is charged in the number of joining the team; And, owing to carried out step 108, therefore, at this moment, when calculating group speed, also need the quantity of the SDU that will abandon to add in group number.The described number of joining the team represents to put into the quantity of the SDU of buffer queue, the calculating of the speed that is used to join the team; Describedly go out the quantity that group number represents to leave the SDU of buffer queue, be used to the calculating of group speed.
Wherein, specifically how to upgrade join the team speed and length of buffer queue and can use correlation technique of the prior art, repeat no more here.
More than for the pairing buffer queue of type of service under the SDU is carried out the congestion control method flow process, and step 111～step 113 is the monitoring flow process to the total buffer memory capacity of system under the jamming control method of the present invention, and, from step 110 as can be seen, when having SDU to put into buffer queue, all need the monitoring flow process of execution in step 111～step 113 at every turn.
Step 111: judge the total buffer memory capacity of system whether greater than the alarming threshold of buffer memory capacity, as greater than as described in alarming threshold, then execution in step 112, as alarming threshold as described in being not more than, then current flow process finishes.
Wherein, with reference to the acquisition methods of the congestion control parameter that is provided in the step 102, the alarming threshold of buffer memory capacity is generally: k1 * Mt, and, 0＜k1＜1.
Step 112: judge the total buffer memory capacity of system greater than time that described alarming threshold continued whether greater than time threshold, as greater than time threshold, then execution in step 113, as are not more than time threshold, then monitor flow process and finish.
Step 113: abandon SDU in the buffer queue from low to high by the priority of type of service, less than threshold value, current flow process finishes up to the total buffer memory capacity of system.
Wherein, being provided with of described threshold value can be used correlation technique of the prior art, repeats no more here.
Step 114: by channel quality and described qos parameter etc. the SDU in the buffer queue is dispatched, the SDU that needs are sent forms protocol Data Unit (PDU).
Wherein, specifically how SDU is dispatched and how SDU to be formed PDU very known in the prior art, repeat no more here.
Step 115: send described PDU, and, to calculate and upgrade group speed, current flow process finishes.
Wherein, specifically how to calculate and upgrade describedly to go out group speed and can use correlation technique of the prior art, repeat no more here.
Method provided by the present invention goes for the BWA based on IEEE802.16.
Fig. 2 is a congestion control device structural representation of the present invention, and as shown in Figure 1, this device comprises sort module 210, congested control module 220, queue monitor module 230, scheduler module 240 and output module 250, wherein,
Sort module 210 is used for the attribute according to the SDU that receives, determines the pairing qos parameter of the SDU that receives, and described qos parameter and the SDU that receives are sent to congested control module 220.
Wherein, can use the corresponding business data-interface to connect upper layer network, receive SDU from the upper strata.
Congested control module 220, be used for determining the packet loss scheme according to the type of service parameter that described qos parameter comprised that the sort module 210 that receives is sent, also be used for determining congestion control parameter according to described qos parameter, when determining not abandon the SDU that receives, the described SDU that receives is put into buffer queue; When determining to abandon the SDU that receives, directly abandon described SDU; Under determining to abandon the SDU that receives, in buffer queue, during at most SDU of time, abandon described SDU and the SDU that receives is put into buffer queue among the SDU of type of service correspondence.
Wherein, described packet loss scheme comprises:
When the SDU that determines to receive belongs to the UGS type of service, determine that this SDU does not need to abandon;
When the SDU that determines to receive does not belong to the UGS type of service, congestion control parameter according to the SDU correspondence that receives, utilize improved RED algorithm computation drop probabilities, determine whether that according to the drop probabilities that obtains needs carry out packet loss and handle, when determining that need carry out packet loss handles, when determining that the SDU that receives belongs to nrtPS or BE, abandon the SDU that receives, when determining that the SDU that receives belongs to ErtPS or rtPS, abandon under the described SDU among the pairing SDU of type of service time SDU at most in buffer queue, and the SDU that receives is put into buffer queue; When determining that according to drop probabilities needs do not carry out the packet loss processing, the SDU that receives is put into buffer queue.
Queue monitor module 230, be used to calculate and upgrade SDU the speed of joining the team, go out group speed and length of buffer queue, afterwards described information is sent to congested control module 220; Also be used for when total buffer memory capacity greater than the alarming threshold of buffer memory capacity and total buffer memory capacity greater than duration of described alarming threshold during the overtime threshold value, clear up data in the buffer queue from low to high by the priority of type of service, be not more than described alarming threshold up to total buffer memory capacity.
Scheduler module 240 is used for according to channel quality and described qos parameter etc. the SDU that buffer queue 230 will send being formed PDU, and described PDU is sent to output module 250.
Output module 250 is used to send the described PDU that receives, and calculates group speed according to the business datum amount that is sent and send to congested control module 220.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.
Claims (12)
1. a jamming control method is characterized in that, this method comprises:
A, when determining that the service data unit SDU that receives does not belong to Unsolicited Grant Service UGS, use the improved RED of earlier detection at random algorithm computation drop probabilities;
B, determine to carry out packet loss when handling, when type of service is non-real-time polling service nrtPS or Best-Effort service BE under the SDU that determines to receive, abandon the SDU that receives according to drop probabilities; When determining type of service under the SDU that receives for the real-time polling service ErtPS of expansion or real-time polling service rtPS, abandon time SDU at most among the SDU of type of service correspondence under the SDU that receives, in buffer queue, and the SDU that receives is put into buffer queue.
2. jamming control method according to claim 1 is characterized in that step B further comprises: when determining not carry out the packet loss processing according to drop probabilities, the SDU that receives is put into buffer queue.
3. jamming control method according to claim 1, it is characterized in that, further comprise before the steps A: the MAC layer connects under the SDU that determines to receive according to the attribute of the SDU that receives, and should connect pairing service quality QoS parameter, and determine the congestion control parameter of the described SDU correspondence that receives according to described qos parameter.
4. jamming control method according to claim 1 is characterized in that, the improved RED algorithm computation of described use drop probabilities is specially:
p_Red＝P_max×(Q_Len-min_len)/(max_len-min_len)；
p＝(R_in/R_out)×p_Red；
Wherein, the drop probabilities of p for using improved RED algorithm computation to obtain, the drop probabilities of p_Red for using the RED algorithm computation to obtain, min_len represents the minimum queue length of buffer queue, max_len represents the maximum queue length of buffer queue, and P_max represents the benchmark drop probabilities, and Q_Len represents length of buffer queue, R_in represents the speed of joining the team, and R_out expresses group speed.
5. jamming control method according to claim 1 is characterized in that step B further comprises: when determining that the SDU that receives belongs to UGS, the SDU that receives is put into buffer queue.
6. according to each described jamming control method of claim 1 to 5, it is characterized in that, further comprise after the step B:
C1, calculating and renewal join the team speed, go out group speed and length of buffer queue.
7. jamming control method according to claim 6 is characterized in that, after the step C1, further comprises:
C2, determine the alarming threshold of total buffer memory capacity greater than buffer memory capacity, and total buffer memory capacity is greater than duration of described alarming threshold during greater than time threshold, abandon SDU in the buffer queue from low to high according to the priority of type of service, be not more than described alarming threshold up to total buffer memory capacity.
8. according to each described jamming control method of claim 1 to 5, it is characterized in that, further comprise after the step B:
C3, the SDU in the buffer queue is dispatched, the SDU that will send forms protocol service unit PDU, afterwards, sends described PDU, calculates and upgrades group speed.
9. device of realizing congested control is characterized in that this device comprises: sort module and congested control module, wherein,
Sort module is used for determining the pairing qos parameter of this SDU according to the attribute of the SDU that receives, and described SDU and described qos parameter thereof are sent to congested control module;
Congested control module, be used for the described qos parameter sent according to the sort module that receives, determine the congestion control parameter and the affiliated type of service of the SDU correspondence that receives, determine the packet loss scheme according to type of service under the SDU that receives, when determining not abandon the SDU that receives, the SDU that receives is put into buffer queue; When determining to abandon the SDU that receives, directly abandon the SDU that receives; Under determining to abandon the SDU that receives among the SDU of type of service correspondence in buffer queue during at most SDU of time, abandon the described time at most SDU and the SDU that receives put into buffer queue.
10. device according to claim 9 is characterized in that, described packet loss scheme is specially:
When determining that the SDU that receives belongs to UGS, do not abandon the SDU that receives;
When determining that the SDU that receives does not belong to UGS, use improved RED algorithm computation drop probabilities, when determining that according to the drop probabilities that obtains needs carry out the packet loss processing, when determining that the SDU that receives belongs to nrtPS or BE, abandon the SDU that receives, when determining that the SDU that receives belongs to ErtPS or rtPS, abandon under the SDU that receives among the pairing SDU of type of service time SDU at most in buffer queue, and the SDU that receives is put into buffer queue; When determining that according to described drop probabilities needs do not carry out the packet loss processing, the SDU that receives is put into buffer queue.
11., it is characterized in that this device further comprises according to claim 9 or 10 described devices:
The queue monitor module, be used to calculate and upgrade SDU the speed of joining the team, go out group speed and length of buffer queue, afterwards, described information is sent to congested control module; Also be used for when total buffer memory capacity greater than the alarming threshold of buffer memory capacity and total buffer memory capacity greater than duration of described alarming threshold during the overtime threshold value, clear up SDU in the buffer queue from low to high by the priority of type of service, be not more than described alarming threshold up to total buffer memory capacity.
12., it is characterized in that this device further comprises according to claim 9 or 10 described devices:
Scheduler module, the SDU that is used for buffer queue will be sent forms PDU, and described PDU is sent to output module;
Output module is used to send the described PDU that receives, and calculates group speed according to the business datum amount that is sent, and goes out group speed and sends to congested control module described.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100577028A CN101232455B (en) | 2008-02-04 | 2008-02-04 | Congestion control method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100577028A CN101232455B (en) | 2008-02-04 | 2008-02-04 | Congestion control method and apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101232455A true CN101232455A (en) | 2008-07-30 |
| CN101232455B CN101232455B (en) | 2011-05-11 |
Family
ID=39898638
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100577028A Expired - Fee Related CN101232455B (en) | 2008-02-04 | 2008-02-04 | Congestion control method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101232455B (en) |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010034226A1 (en) * | 2008-09-08 | 2010-04-01 | 华为技术有限公司 | Method and device for buffer overflow control |
| CN101442453B (en) * | 2008-12-22 | 2011-01-05 | 北京星网锐捷网络技术有限公司 | Method and system for testing random early detection function |
| CN102170663A (en) * | 2011-05-23 | 2011-08-31 | 迈普通信技术股份有限公司 | 3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service |
| CN101783747B (en) * | 2009-12-30 | 2012-06-27 | 福建星网锐捷网络有限公司 | Method and network for measuring length of buffer queue |
| CN102868577A (en) * | 2012-10-09 | 2013-01-09 | 盛科网络（苏州）有限公司 | Weighted random early detection (WRED) automated testing method and device |
| CN104468382A (en) * | 2014-12-10 | 2015-03-25 | 中国科学院声学研究所 | Self-adaption selection method of congestion control algorithm module and system of congestion control algorithm module |
| WO2015169048A1 (en) * | 2014-05-05 | 2015-11-12 | 中兴通讯股份有限公司 | Queue management method and device |
| CN105611309A (en) * | 2015-12-22 | 2016-05-25 | 北京奇虎科技有限公司 | Video transmission method and device |
| CN106027411A (en) * | 2016-06-30 | 2016-10-12 | 广东睿江云计算股份有限公司 | Data processing method and device for cloud host system based on QOS |
| CN106101014A (en) * | 2016-06-03 | 2016-11-09 | 广东睿江云计算股份有限公司 | A kind of cloud main-machine communication queue support method based on QoS and system |
| CN106488505A (en) * | 2015-08-24 | 2017-03-08 | 中兴通讯股份有限公司 | A kind of data pack transmission method and device, communication system |
| WO2017088582A1 (en) * | 2015-11-23 | 2017-06-01 | 深圳市中兴微电子技术有限公司 | Network congestion control method and apparatus, and storage medium |
| CN107333163A (en) * | 2017-06-29 | 2017-11-07 | 上海鋆创信息技术有限公司 | A kind of method for processing video frequency and device, a kind of terminal and storage medium |
| CN107979491A (en) * | 2017-11-20 | 2018-05-01 | 烽火通信科技股份有限公司 | The processing method and processing system of a kind of alarm data |
| CN108363633A (en) * | 2018-01-15 | 2018-08-03 | 北京五八信息技术有限公司 | Control method, apparatus, equipment and the readable storage medium storing program for executing of Activity quantity |
| CN108391289A (en) * | 2018-05-31 | 2018-08-10 | 京信通信***（中国）有限公司 | A kind of jamming control method and base station |
| CN108519909A (en) * | 2018-03-02 | 2018-09-11 | 阿里巴巴集团控股有限公司 | A kind of stream data processing method and device |
| CN109347702A (en) * | 2018-11-13 | 2019-02-15 | 天津津航计算技术研究所 | Utilize the method for Ethernet length of buffer queue prediction UDP Congestion Level SPCC |
| CN109818874A (en) * | 2017-11-21 | 2019-05-28 | 华为技术有限公司 | Data transmission method, equipment and computer storage medium |
| CN110471785A (en) * | 2019-08-09 | 2019-11-19 | 北京智睿博信息技术有限公司 | A kind of method and system of quick positioning storage performance problem |
| CN111385667A (en) * | 2018-12-27 | 2020-07-07 | 中国电信股份有限公司 | Video data processing method, device and computer readable storage medium |
| CN112073331A (en) * | 2017-05-31 | 2020-12-11 | 华为技术有限公司 | Flow control method, equipment and system |
| CN112202681A (en) * | 2020-09-18 | 2021-01-08 | 京信通信***（中国）有限公司 | Data congestion processing method and device, computer equipment and storage medium |
| CN113891392A (en) * | 2021-09-24 | 2022-01-04 | 北京升哲科技有限公司 | Congestion control method, device, equipment and storage medium |
| CN114500127A (en) * | 2016-09-13 | 2022-05-13 | 高高商务航空有限责任公司 | Usage-based bandwidth optimization |
| CN114785744A (en) * | 2022-04-22 | 2022-07-22 | 中国工商银行股份有限公司 | Data processing method, data processing device, computer equipment and storage medium |
| WO2022213923A1 (en) * | 2021-04-06 | 2022-10-13 | 维沃移动通信有限公司 | Transmission processing method and apparatus, and communication device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6983153B2 (en) * | 2001-06-07 | 2006-01-03 | Qualcomm Incorporated | Method and apparatus for congestion control in a wireless communication system |
| CN100471140C (en) * | 2006-09-29 | 2009-03-18 | 华为技术有限公司 | Method for detecting QoS |
-
2008
- 2008-02-04 CN CN2008100577028A patent/CN101232455B/en not_active Expired - Fee Related
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010034226A1 (en) * | 2008-09-08 | 2010-04-01 | 华为技术有限公司 | Method and device for buffer overflow control |
| CN101442453B (en) * | 2008-12-22 | 2011-01-05 | 北京星网锐捷网络技术有限公司 | Method and system for testing random early detection function |
| CN101783747B (en) * | 2009-12-30 | 2012-06-27 | 福建星网锐捷网络有限公司 | Method and network for measuring length of buffer queue |
| CN102170663A (en) * | 2011-05-23 | 2011-08-31 | 迈普通信技术股份有限公司 | 3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service |
| CN102170663B (en) * | 2011-05-23 | 2014-03-05 | 迈普通信技术股份有限公司 | 3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service |
| CN102868577A (en) * | 2012-10-09 | 2013-01-09 | 盛科网络（苏州）有限公司 | Weighted random early detection (WRED) automated testing method and device |
| WO2015169048A1 (en) * | 2014-05-05 | 2015-11-12 | 中兴通讯股份有限公司 | Queue management method and device |
| CN104468382A (en) * | 2014-12-10 | 2015-03-25 | 中国科学院声学研究所 | Self-adaption selection method of congestion control algorithm module and system of congestion control algorithm module |
| CN106488505A (en) * | 2015-08-24 | 2017-03-08 | 中兴通讯股份有限公司 | A kind of data pack transmission method and device, communication system |
| WO2017088582A1 (en) * | 2015-11-23 | 2017-06-01 | 深圳市中兴微电子技术有限公司 | Network congestion control method and apparatus, and storage medium |
| CN105611309A (en) * | 2015-12-22 | 2016-05-25 | 北京奇虎科技有限公司 | Video transmission method and device |
| CN106101014A (en) * | 2016-06-03 | 2016-11-09 | 广东睿江云计算股份有限公司 | A kind of cloud main-machine communication queue support method based on QoS and system |
| CN106027411A (en) * | 2016-06-30 | 2016-10-12 | 广东睿江云计算股份有限公司 | Data processing method and device for cloud host system based on QOS |
| CN114500127A (en) * | 2016-09-13 | 2022-05-13 | 高高商务航空有限责任公司 | Usage-based bandwidth optimization |
| CN112073331A (en) * | 2017-05-31 | 2020-12-11 | 华为技术有限公司 | Flow control method, equipment and system |
| CN107333163A (en) * | 2017-06-29 | 2017-11-07 | 上海鋆创信息技术有限公司 | A kind of method for processing video frequency and device, a kind of terminal and storage medium |
| CN107979491B (en) * | 2017-11-20 | 2021-01-26 | 烽火通信科技股份有限公司 | Alarm data processing method and processing system |
| CN107979491A (en) * | 2017-11-20 | 2018-05-01 | 烽火通信科技股份有限公司 | The processing method and processing system of a kind of alarm data |
| CN109818874A (en) * | 2017-11-21 | 2019-05-28 | 华为技术有限公司 | Data transmission method, equipment and computer storage medium |
| CN108363633B (en) * | 2018-01-15 | 2021-11-23 | 北京五八信息技术有限公司 | Method, device, equipment and readable storage medium for controlling Activity quantity |
| CN108363633A (en) * | 2018-01-15 | 2018-08-03 | 北京五八信息技术有限公司 | Control method, apparatus, equipment and the readable storage medium storing program for executing of Activity quantity |
| CN108519909A (en) * | 2018-03-02 | 2018-09-11 | 阿里巴巴集团控股有限公司 | A kind of stream data processing method and device |
| CN108519909B (en) * | 2018-03-02 | 2022-01-18 | 创新先进技术有限公司 | Stream data processing method and device |
| CN108391289A (en) * | 2018-05-31 | 2018-08-10 | 京信通信***（中国）有限公司 | A kind of jamming control method and base station |
| CN109347702A (en) * | 2018-11-13 | 2019-02-15 | 天津津航计算技术研究所 | Utilize the method for Ethernet length of buffer queue prediction UDP Congestion Level SPCC |
| CN111385667A (en) * | 2018-12-27 | 2020-07-07 | 中国电信股份有限公司 | Video data processing method, device and computer readable storage medium |
| CN110471785A (en) * | 2019-08-09 | 2019-11-19 | 北京智睿博信息技术有限公司 | A kind of method and system of quick positioning storage performance problem |
| CN110471785B (en) * | 2019-08-09 | 2023-04-11 | 北京智睿博信息技术有限公司 | Method and system for quickly positioning storage performance problem |
| CN112202681A (en) * | 2020-09-18 | 2021-01-08 | 京信通信***（中国）有限公司 | Data congestion processing method and device, computer equipment and storage medium |
| CN112202681B (en) * | 2020-09-18 | 2022-07-29 | 京信网络***股份有限公司 | Data congestion processing method and device, computer equipment and storage medium |
| WO2022213923A1 (en) * | 2021-04-06 | 2022-10-13 | 维沃移动通信有限公司 | Transmission processing method and apparatus, and communication device |
| CN113891392A (en) * | 2021-09-24 | 2022-01-04 | 北京升哲科技有限公司 | Congestion control method, device, equipment and storage medium |
| CN113891392B (en) * | 2021-09-24 | 2023-05-23 | 北京升哲科技有限公司 | Congestion control method, device, equipment and storage medium |
| CN114785744A (en) * | 2022-04-22 | 2022-07-22 | 中国工商银行股份有限公司 | Data processing method, data processing device, computer equipment and storage medium |
| CN114785744B (en) * | 2022-04-22 | 2024-02-02 | 中国工商银行股份有限公司 | Data processing method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101232455B (en) | 2011-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101232455B (en) | Congestion control method and apparatus | |
| EP1796332A1 (en) | Token bucket dynamic bandwidth allocation | |
| US8767553B2 (en) | Dynamic resource partitioning for long-term fairness to non-elastic traffic on a cellular basestation | |
| CN104272680B (en) | Signalling congestion | |
| CN1126391C (en) | Method and apparatus or dynamically adapting connection state in mobile communications system | |
| Yigitel et al. | Design and implementation of a QoS-aware MAC protocol for wireless multimedia sensor networks | |
| US8130709B2 (en) | Apparatus and method for transmitting and receiving control information for uplink data in a mobile communication system and system thereof | |
| EP1604498A2 (en) | Admission control and resource allocation in a communication system supporting application flows supporting quality of service | |
| CN1820517A (en) | Grouped dispatching method of wireless communication system | |
| EP2862387A2 (en) | Systems and methods for resource booking for admission control and scheduling using drx | |
| Balogh et al. | Performance evaluation of WFQ, WF 2 Q+ and WRR queue scheduling algorithms | |
| WO2004054181A1 (en) | A method of and apparatus for adaptive control of data buffering in a data transmitter | |
| KR20150097599A (en) | Method and system for scheduling radio resources in cellular networks | |
| US20050052997A1 (en) | Packet scheduling of real time packet data | |
| EP2663037A1 (en) | Multi-level Bearer Profiling in Transport Networks | |
| US20040218545A1 (en) | Fair scheduling with guaranteed minimum parameter | |
| EP2737746A2 (en) | Systems and methods for resource booking for admission control and scheduling using drx | |
| Zhao et al. | QoS guaranteed resource block allocation algorithm in LTE downlink | |
| WO2007051380A1 (en) | A METHOD OF SERVICE STREAM ACCEPTING CONTROL APPLIED IN WIRELESS COMMUNICATION SYSTEM and the system thereof | |
| Zaki et al. | Intelligent traffic enforcement for LTE backhaul | |
| CN102469510A (en) | Content-aware active queue management (AQM) method for 3rd generation (3G) network video transmission | |
| EP2547053B1 (en) | Distribution of data units among interfaces of a node of a packet-switched communication network | |
| KR100726809B1 (en) | Dynamic bandwidth allocation apparatus and method | |
| Puttonen et al. | Mixed traffic packet scheduling in UTRAN long term evolution downlink | |
| EP1473886B1 (en) | Fair scheduling with guaranteed minimum parameter |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110511 Termination date: 20190204 |