CN102457909A - Iub port flow control method based on target buffer - Google Patents
Iub port flow control method based on target buffer Download PDFInfo
- Publication number
- CN102457909A CN102457909A CN2010105276772A CN201010527677A CN102457909A CN 102457909 A CN102457909 A CN 102457909A CN 2010105276772 A CN2010105276772 A CN 2010105276772A CN 201010527677 A CN201010527677 A CN 201010527677A CN 102457909 A CN102457909 A CN 102457909A
- Authority
- CN
- China
- Prior art keywords
- buffer
- flow control
- size
- target cache
- buffer memory
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000015572 biosynthetic process Effects 0.000 claims description 94
- 238000000205 computational method Methods 0.000 claims description 7
- 230000001276 controlling effect Effects 0.000 claims description 4
- 238000001914 filtration Methods 0.000 claims description 4
- 230000001105 regulatory effect Effects 0.000 claims description 3
- 230000002349 favourable effect Effects 0.000 abstract 1
- 241000209094 Oryza Species 0.000 description 21
- 235000007164 Oryza sativa Nutrition 0.000 description 21
- 235000021186 dishes Nutrition 0.000 description 21
- 235000009566 rice Nutrition 0.000 description 21
- 230000005540 biological transmission Effects 0.000 description 20
- 238000005516 engineering process Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 6
- 230000002159 abnormal effect Effects 0.000 description 4
- 230000003139 buffering effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 244000188472 Ilex paraguariensis Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Images
Abstract
The invention discloses an Iub port flow control method based on a target buffer. The method comprises the following steps of: judging a cycle timer whether expires by each subframe, if so, adopting a cycle timing triggering manner, and carrying out the Iub port flow control according to a buffer upper limit PQ_high_Buffer_Size, a buffer lower limit PQ_low_Buffer_Size and the target buffer PQ_low_Buffer_Size; otherwise, adopting a specific event triggering manner, and carrying out the Iub port flow control according to the buffer upper limit PQ_high_Buffer_Size, the buffer lower limit PQ_low_Buffer_Size and the target buffer PQ_low_Buffer_Size. By adopting the method disclosed by the invention, and stability for maintaining buffer data quantity can be favorable.
Description
Technical field
The present invention relates to field of mobile communication, particularly a kind of Iub port flow control method of based target buffer memory.
Background technology
Along with inserting (HSDPA) technology from high speed downlink packet, mobile communication technology evolves to high-speed packet access enhancing (HSPA+) technology; Data dispatch (Node B) side execution in the HSPA+ technology still in the base station, the MAC-d PDU (MAC-d protocol Data Unit) that sends from radio network controller (RNC) need carry out buffer memory in Node B side, waits for the scheduling of MAC-ehs entity among the Node B; Wherein, Need to prove that the MAC-d entity is media interviews control (MAC) entity of handling dedicated transmission channel, the MAC-d entity is arranged in RNC; The MAC-ehs entity is a MAC entity of handling high speed descending sharing channel, and the MAC-ehs entity is arranged in Node B.Because the complexity of eating dishes without rice or wine and the uncertainty of mobile channel; User data receives the dispatching algorithm Effect on Performance in the actual speed rate of eating dishes without rice or wine; Also directly influence simultaneously the buffer memory of user data in Node B side; Take place congestedly for fear of Node B side buffer area, cause data cached queuing delay to exceed the abandoning time delay (discard timer) and be dropped of high level configuration of MAC layer, need introduce flow control mechanism at the Iub mouth.Flow control mainly adopts a kind of dynamic mode to control the transmission of MAC-d PDU on the Iub mouth according to the user in the actual transmissions ability of eating dishes without rice or wine; Make the user cache data volume of Node B side be unlikely to overfill and also be unlikely to empty, guarantee that the data volume in the user cache is enough to support to eat dishes without rice or wine to go up the transfer of data demand of dynamically changeable.Wherein, eat dishes without rice or wine to be meant the interface between Node B and the subscriber equipment (UE), also claim the Uu mouth, and the Iub mouth is meant the interface between RNC and the Node B.
Flow control needs Node B and RNC two ends to cooperate, through the requests for capacity control frame of Iub mouth and moving alternately of capacity allocation control frame.Particularly, RNC indicates the storage condition of user data at RNC through send the requests for capacity control frame to Node B, and requires Node B to respond the capacity allocation control frame to distribute this user's data transmission capacity; Node B informs speed and the effective time of this speed that the operable data flow of RNC is sent through the capacity allocation control frame.Need to prove; Be not only to receive that the requests for capacity control frame from RNC could send the capacity allocation control frame; In most cases do not have the requests for capacity control frame; But initiatively judge according to buffer queue and subscriber channel situation whether own decision sends the capacity allocation control frame by Node B.
In the HSPA+ system, defined HS-DSCH CAPACITY ALLOCATION TYPE 2 capacity allocation control frames, the main field and the meaning thereof that comprise in the face of the capacity allocation control frame down describe:
CmCH-PI: be used to indicate the priority of priority query, wherein, priority query often is called as the PQ formation;
Maximum MAC-d PDU length: be used to indicate the maximum MAC-d PDU length that allows, maximum 1504 bits in the agreement;
HS-DSCH Interval: be used to indicate the time interval of HS-DSCH Credits mandate, wherein, the implication of HS-DSCH is a high speed descending sharing channel;
HS-DSCH Credits: be used to the MAC-d PDU total amount of data of indicating RNC in HS-DSCH Interval, to send, with byte representation, it equals the product of MAC-d PDU length and MAC-d PDU number.
HS-DSCH Repetition Period: be used to indicate the repetition period of HS-DSCH Credits mandate, wherein, HS-DSCH Repetition Period did not limit 0 expression repetition period;
Whether Congestion Status: it is congested to be used to indicate the downlink transfer network layer to detect.
At present buffer memory balanced flow control (BBFC) pattern is mainly adopted in the flow control of Iub mouth, through the buffer data size that high threshold and/or low threshold are controlled PQ is set for the PQ formation of Node B side.High threshold is used to control owing to PQ formation buffer memory overflows the appearance that causes the loss of data phenomenon, and the situation that low threshold does not have data to send out when being used to avoid data cached deficiency to cause scheduling produces.Specifically, several kinds of Iub port flow control methods (" Flow Control " described herein and " flow control " be the flow control of fingering row Iub mouth all) below prior art has mainly proposed:
Application number is the method that 200810101764.4 patent of invention proposes to carry out to professional different Flow Control demands the adaptability Flow Control: the first, buffer threshold is provided with high threshold and low threshold; Be guaranteed bit rate, peak rate and the professional maximum data delay time that allows by business contract; Wealthy family is limited to the product of the maximum data delay time that guarantees that bit rate and business allow; Low threshold is 2 times of product of the defeated time delay of peak rate and Iub oral instructions; When in case buffer data size exceeds high threshold or is lower than low threshold; High threshold be updated to PQ formation RNC side current data growth rate and Node B side the current data growth rate ratio with upgrade before the product of high threshold; Low threshold is updated to 2 times of product that peak rate and Node B stress difference and the defeated time delay of Iub oral instructions of newly assigned RNC data rate, according to high threshold and low threshold after upgrading the flow of PQ formation is controlled.The second, when the buffer memory of PQ formation exceeds its high threshold, notice RNC stops the data of this PQ formation and sends, when the buffer memory of PQ formation is lower than its low threshold, for this PQ formation is redistributed the data transmission rate of RNC and notified RNC to send data.
Application number is that 200610084695.1 patents of invention propose a kind of Iub port flow control method: the first, buffer threshold is provided with first threshold value and second threshold value, and second threshold value is greater than first threshold value.First threshold value does
TB
MaxBe the maximum transmitted piece that the Uu mouth allows transmission, T
S1Expression is sent a capacity allocation control frame that allows to issue data from Node B to RNC and is assembled into the time delay of first Frame to RNC, and Ti is the HS-DSCH Interval value that is provided with in the capacity allocation control frame, and TTI is a Transmission Time Interval; Second threshold value is that the cache size of PQ formation deducts
L
MaxBe the maximum MAC-d PDU length that allows in the capacity allocation control frame to issue, N
C_maxBe the maximum of the Credits that possibly distribute in the capacity allocation control frame, T
S2Expression is sent the time delay that a capacity allocation control frame of forbidding issuing data comes into force to this frame from Node B to RNC.The second, Node B receive trigger event (comprise the PQ formation be scheduled transmission, receive the RNC Frame, receive the RNC capacity request frame) after; Detect the buffer memory of PQ formation; Judge the relation and the flag bit size of this buffer memory and threshold value, send respective volume to RNC and distribute control frame.
Application number is that 200510105661.1 patent of invention proposes a kind of Iub port flow control method: the first, buffer threshold is provided with that largest buffered, expectation buffer memory, Flow Control are initiated the upper limit, Flow Control is initiated lower limit.The buffer memory that largest buffered is defined as the PQ formation abandons 1.5 times of product of buffer memory average latency and PQ formation Uu mouth data rate of product or the PQ formation of time and PQ formation Uu mouth data rate; The expectation buffer memory is the product of largest buffered and expecting factor; Be limited to largest buffered and Flow Control on Flow Control is initiated and initiate the product of the upper limit factor; Flow Control initiates to be limited to down the product that largest buffered and Flow Control are initiated the lower limit factor; Wherein Flow Control is initiated the lower limit factor less than expecting factor, and expecting factor is initiated the upper limit factor less than Flow Control, and is the positive number less than 1.The second, the Flow Control triggering mode is that current cache is in preset initiation Flow Control scope (initiate the upper limit or initiate lower limit less than Flow Control greater than Flow Control), or receives the requests for capacity control frame of RNC.The expectation buffer memory is deducted the difference of current cache; The ratio of calculated difference and expectation buffer memory, PQ formation Uu mouth data rate are as parameter again; Calculate the expectation input speed that RNC sends to the PQ formation through the Iub mouth; And then form the capacity allocation control frame and be sent to RNC, RNC is according to capacity allocation control frame adjustment Iub mouth speed.
Yet; Above-mentioned application number is that 200810101764.4,200610084695.1 and 200510105661.1 patent of invention all is provided with the gentle limit of leaving of the buffer memory upper limit; All be that the abnormal conditions that exceed the buffer memory upper limit or be lower than the buffer memory lower limit to buffer data size are carried out the control of Iub mouth flow; Do not consider buffer data size is in how to carry out the control of Iub mouth flow when the buffer memory upper limit is gentle leaves the normal condition between the limit; Therefore cause Iub mouth speed to fluctuate widely, be unfavorable for keeping the stable problem of buffer data size.
Summary of the invention
In view of this, the present invention provides a kind of Iub port flow control method of based target buffer memory, helps keeping the stable of buffer data size.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
A kind of Iub port flow control method of based target buffer memory, the length T of pre-configured cycle timer
FC_period, the length T of cycle timer
FC_periodBe a Flow Control cycle, be one-period Flow Control point the finish time in each Flow Control cycle, and this method comprises:
Every subframe judges whether cycle timer expires; If then adopt cycle timing triggering mode and carry out the flow control of Iub mouth according to buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size and target cache PQ_low_Buffer_Size; Otherwise, adopt the specific events trigger mode and carry out the flow control of Iub mouth according to buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size and target cache PQ_low_Buffer_Size.
Said employing cycle is triggering mode and comprise according to the method that the buffer memory upper limit, buffer memory lower limit and target cache are carried out the flow control of Iub mouth regularly:
A1, judge that whether current priority formation (PQ formation) buffer memory gets into normal condition by the state of emergency or packet loss; And in the current subframe normal consistency has been carried out in current PQ formation; If then target cache factor alfa is updated to target cache factor initial value alfa
Init, direct then execution in step A3, wherein, target cache factor alfa and target cache factor initial value alfa
InitBe positive number less than 1; Otherwise; Upgrade the gentle limit PQ_low_Buffer_Size that leaves of buffer memory upper limit PQ_high_Buffer_Size; And according to gentle limit PQ_low_Buffer_Size renewal target cache PQ_expect_Buffer_Size, the execution in step A2 then of leaving of the buffer memory upper limit PQ_high_Buffer_Size that upgrades;
A2, judge current PQ formation the buffer memory queuing delay whether more than or equal to preset crash time thresholding T
Max, if then carry out urgent Flow Control, and calculate alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading; Otherwise, execution in step A4;
A3, renewal buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size, and according to the gentle limit PQ_low_Buffer_Size renewal target cache PQ_expect_Buffer_Size that leaves of target cache factor alfa, buffer memory upper limit PQ_high_Buffer_Size apart from the current time last update;
A4, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to buffer memory upper limit PQ_high_Buffer_Size, if then carry out upper limit Flow Control apart from the current time last update; Otherwise, execution in step A5;
A5, judge current PQ formation buffer data size PQ_Buffer_Size whether smaller or equal to buffer memory lower limit PQ_low_Buffer_Size, if then carry out the lower limit Flow Control apart from the current time last update; Otherwise, execution in step A6;
A6, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to target cache PQ_expect_Buffer_Size, if then carry out Flow Control on the target cache apart from the current time last update; Otherwise, carry out Flow Control under the target cache.
Said employing specific events trigger mode also comprises according to the method that the buffer memory upper limit, buffer memory lower limit and target cache are carried out the flow control of Iub mouth:
B1, judge that whether current PQ formation buffer memory gets into normal condition by the state of emergency or packet loss, and in the current subframe normal consistency has been carried out in current PQ formation, if then target cache factor alfa is updated to target cache factor initial value alfa
Init, direct then execution in step B4, wherein, target cache factor alfa and target cache factor initial value alfa
InitBe positive number less than 1; Otherwise, execution in step B2;
B2, judge current PQ formation the buffer memory queuing delay whether more than or equal to preset crash time thresholding T
Max, if, execution in step B3 then; Otherwise, execution in step B5;
B3, judge from last one-period Flow Control and put to current time in this time period; Whether apart from the type of the recent Flow Control of current time is Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache; If; Then carry out urgent Flow Control, and calculate alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading; Otherwise, do not carry out Flow Control;
B4, according to upgrading target cache PQ_expect_Buffer_Size apart from the target cache factor alfa of current time last update, the gentle limit PQ_low_Buffer_Size that leaves of buffer memory upper limit PQ_high_Buffer_Size;
B5, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to buffer memory upper limit PQ_high_Buffer_Size apart from the current time last update, if, execution in step B6 then; Otherwise, execution in step B7;
Whether B6, judge from last one-period Flow Control and put to current time in this time period, be Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache apart from the type of the recent Flow Control of current time, if then carry out upper limit Flow Control; Otherwise, do not carry out Flow Control;
B7, judge current PQ formation buffer data size PQ_Buffer_Size whether smaller or equal to buffer memory lower limit PQ_low_Buffer_Size apart from the current time last update, if, execution in step B8 then; Otherwise, execution in step B9;
Whether B8, judge from last one-period Flow Control and put to current time in this time period, be the lower limit Flow Control apart from the type of the recent Flow Control of current time, if then do not carry out Flow Control; Otherwise, carry out the lower limit Flow Control;
B9, judge current PQ formation data cached data volume PQ_Buffer_Size whether more than or equal to target cache PQ_expect_Buffer_Size apart from the current time last update, if, execution in step B10 then; Otherwise, execution in step B11;
B10, condition one; Put to current time in this time period from last one-period Flow Control; Type apart from the recent Flow Control of current time is the lower limit Flow Control, and condition two has been carried out normal consistency to current PQ formation in the current subframe and from last one-period Flow Control point to current time in this time period; Apart from the recent Flow Control of current time is Flow Control on the target cache, and the target cache factor alfa of reference is less than alfa
Init, judge whether to satisfy condition one or condition two, if then carry out Flow Control on the target cache; Otherwise, do not carry out Flow Control;
B11, condition three: put to current time in this time period from last one-period Flow Control; Type apart from the recent Flow Control of current time is upper limit Flow Control or urgent Flow Control; Condition four; Put to current time in this time period from last one-period Flow Control, apart from the target cache factor alfa of the Flow Control institute reference of the recent reference target buffer memory of the current time factor less than alfa
Init, judge whether to satisfy condition three or condition four, if, execution in step B12 then; Otherwise, do not carry out Flow Control;
B12, judge whether current PQ formation has been carried out normal consistency in the current subframe, if then carry out Flow Control under the target cache; Otherwise, do not carry out Flow Control.
The method of upgrading the buffer memory upper limit described in steps A 1, A3 and the B4 is: calculate PQ_high_Buffer_Size=Rate
PQ_out* (T
Max-T
High Remain), wherein, PQ_high_Buffer_Size is the buffer memory upper limit, Rate
PQ_outFor current PQ formation on average goes out group speed, T at current time
MaxBe buffer memory queuing time thresholding, T
High_remainFor the buffer memory upper limit is regulated parameter, T
High_remainBe used to remedy the influence of speed shake, and can be used for controlling intervention schedule and packet loss the buffer memory upper limit.
The method of upgrading the buffer memory lower limit described in steps A 1, A3 and the B4 is: calculate PQ_low_Buffer_Size=a * Rate
PQ_out* T
Feedback, wherein, PQ_low_Buffer_Size is the buffer memory lower limit, Rate
PQ_outFor current PQ formation current time on average go out group speed, a is the anti-shake factor of lower limit, a gets the positive integer greater than 0, T
FeedbackBe the round-trip delay of capacity allocation control frame between base station node B and radio network controller (RNC).
Said Rate
PQ_outComputational methods be: calculate
Wherein, Rate
* PQ_outFor current PQ formation on average goes out group speed, R in the previous moment of current time
PQ_outFor current PQ formation goes out group speed, T current time instantaneous
FCBe filtering factor.
The method of upgrading target cache described in steps A 1, A2, A3, B3 and the B4 is:
Calculate
PQ_expect_Buffer_Size＝PQ_low_Buffer_Size+
alfa×(PQ_high_Buffer_Size-PQ_low_Buffer_Size)。
Said urgent Flow Control is: Node B is 0 through the capacity allocation control frame to RNC request buffer data size;
Said lower limit Flow Control is:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2, B
Need2Greater than B
Need1, B wherein
Need1=Rate
PQ_out* T
FC_period
Or Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2For:
B
need2＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
Said upper limit Flow Control is: Node B is 0 through the capacity allocation control frame to RNC request buffer data size;
Flow Control is on the said target cache:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need3For:
B
need3＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
If B
Need3Calculating is less than 0, then with 0 as B
Need3Value;
Flow Control is under the said target cache:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need3For:
B
need3＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
If B
Need3Calculating is less than 0, then with 0 as B
Need3Value.
It is thus clear that; According to technical scheme provided by the present invention; The abnormal conditions that not only exceed the buffer memory upper limit or be lower than the buffer memory lower limit to buffer data size are carried out the control of Iub mouth flow; And considered buffer data size is in when the buffer memory upper limit is gentle leaves the normal condition between the limit how to carry out the control of Iub mouth flow, has avoided Iub mouth speed to fluctuate widely, and helps keeping the stable problem of buffer data size.
Description of drawings
Fig. 1 is the flow chart of the Iub port flow control method of a kind of based target buffer memory provided by the present invention.
Fig. 2 is the flow chart of embodiment of the Iub port flow control method of a kind of based target buffer memory provided by the present invention.
Embodiment
For making the object of the invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, scheme according to the invention is done to specify further.
Fig. 1 is the flow chart of the Iub port flow control method of a kind of based target buffer memory provided by the present invention.As shown in Figure 1, this method may further comprise the steps:
Through an embodiment Iub port flow control method of a kind of based target buffer memory provided by the present invention is described in detail below.
Fig. 2 is the flow chart of embodiment of the Iub port flow control method of a kind of based target buffer memory provided by the present invention.(adopting " Y " expression judged result among Fig. 2 is " being ", and adopting " N " expression judged result is " denying ") as shown in Figure 2, this method may further comprise the steps:
Flow Control trigger mechanism among the present invention adopts the cycle regularly to trigger the mode that combines with specific events trigger.
Wherein, the cycle regularly triggers when each cycle timer expires and triggers, and triggers liking user PQ formation, the length T of cycle timer
FC_periodCan be pre-configured, the length of cycle timer is empirical value, and is determined on a case-by-case basis.The length T of cycle timer
FC_periodDefined a Flow Control cycle, the finish time in each Flow Control cycle, (being the moment of regularly triggering in the cycle, also is that cycle timer expires constantly) was one-period Flow Control point, and following step 202 is to 212 concrete steps for employing cycle timing triggering mode Flow Control.
The triggering object of particular event also is user PQ formation, whether triggers Flow Control and triggers which kind of Flow Control according to the situation decision of judging, following step 213 is to 230 for adopting the concrete steps of specific events trigger mode Flow Control.
The said state of emergency is meant that the buffer memory queuing delay of PQ formation is more than or equal to preset crash time thresholding T
Max, and abandon time delay (discard timer) less than the configuration of the high level of MAC layer.Preset T
MaxConcrete numerical value can decide according to actual conditions, a kind of T can be provided for example at present
MaxMethod to set up: T
Max=f
Urgent* T
DiscardWherein, T
DiscardBe the MAC layer high level configuration abandon time delay (discard timer), T
DiscardConcrete numerical value set f according to the agreement of 3GPP regulation
UrgentBe a configurable urgent coefficient, be used to control buffer memory queuing urgency level, f
UrgentMore little, urgency level is high more, and its span is greater than 0 and less than 1, f
UrgentConcrete root of number border situation and deciding factually.
Said packet loss is meant the situation that abandon time delay (discard timer) of the buffer memory queuing delay of PQ formation greater than the high level configuration of MAC layer.
Said normal condition is meant non-emergent state, and non-packet loss.
In addition, scheduling type is divided into three types:
The first, intervention schedule: if having packet to be about to be dropped in the PQ formation, then dispatching algorithm may these packets that are about to be dropped of priority scheduling, and at this moment, dispatching algorithm is called as intervention schedule to the scheduling type of PQ formation.
Second; Retransfer scheduling: after referring to a preceding error of transmission; The MAC layer scheduling algorithm then carries out the transmission again of an error of transmission bag; Retransfer scheduling is actual to be to fetch data in the transmission buffer memory from mixed automatic repeat request (HARQ) entity, is not to dispatch to the buffer memory of certain PQ formation, promptly can not change PQ formation buffer memory size.
The 3rd, normal consistency: the scheduling that Node B makes certain PQ formation except that intervention schedule and retransfer scheduling, all is a normal consistency.In addition; Be dispatched to (being that prioritization is considered to and can dispatches) by dispatching algorithm; But because its data cached very few and formation of be not scheduled (be reality do not send authorize and distribute interface-free resources), the dispatch state that also can be considered to this formation during Flow Control is a normal consistency.
It should be noted that here above-mentioned three types are meant scheduling type, and the aforementioned state of emergency, packet loss and normal condition are meant the PQ queue scheduling state of buffer memory before.
Wherein, the method for obtaining the buffer memory queuing delay of current PQ formation can adopt the content of prior art.
Wherein, the gentle calculating of limit and the content that update method adopts prior art left of the buffer memory upper limit, existing only giving one example describes the gentle computational methods of leaving limit of the buffer memory upper limit.
The computational methods of buffer memory upper limit PQ_high_Buffer_Size are following:
PQ_high_Buffer_Size＝Rate
PQ_out×(T
max-T
high_Remain)
Wherein, Rate
PQ_outFor current PQ formation current time on average go out group speed, unit is kbps; T
MaxBe buffer memory queuing time thresholding; T
High_remainFor regulating a configurable time span of the buffer memory upper limit; Can be referred to as the buffer memory upper limit and regulate parameter, unit is ms, is used to remedy the influence of speed shake to the buffer memory upper limit; And can be used for controlling intervention schedule and packet loss, its occurrence can be decided according to actual conditions or emulation.
A kind of Rate is provided below
PQ_outComputational methods: then adopt the filtering formula
Calculate, wherein, T
FCBe filtering factor, value can be according to simulation result configuration in advance, R
i(t) for PQ formation i goes out group speed moment t instantaneous,
For PQ formation i the previous moment of moment t on average go out group speed,
For PQ formation i on average goes out group speed at moment t.
When i gets the label of current PQ formation, when t got current time, then aforementioned formula can change into:
Wherein, Rate
* PQ_outFor current PQ formation on average goes out group speed, R in the previous moment of current time
PQ_outFor current PQ formation goes out group speed current time instantaneous.
The computational methods of buffer memory lower limit PQ_low_Buffer_Size are following:
PQ_low_Buffer_Size＝a×Rate
PQ_out×T
feedback
Wherein, Rate
PQ_outFor current PQ formation current time on average go out group speed, unit is kbps, concrete computational methods can be with reference to aforementioned description; T
FeedbackBe the round-trip delay of capacity allocation control frame between Node B and RNC, unit is ms, also is that the capacity allocation control frame is from being issued to actual coming into force the acting time interval; A is the anti-shake factor of lower limit; Get positive integer greater than 0; Concrete numerical value can be decided according to simulation result in advance; A is used to prevent that lower limit from crossing low and cause current PQ formation to empty the situation of buffer memory when dispatching continuously rapidly, will avoid lower limit excessive influential to the buffer memory queuing simultaneously, and can not make the buffer memory lower limit greater than the buffer memory higher limit.
The buffer memory lower limit and the buffer memory upper limit all belong to abnormal protection mechanism; We hope that the data volume of controlling in the buffer area is positioned at certain limit; Defined target cache for this reason; Node B is reference with the target cache when the RNC request data quantity, makes the buffer data size of PQ formation fluctuate up and down round target cache, avoids frequently triggering the buffer memory bound.
The definition of target cache is following:
PQ_expect_Buffer_Size＝PQ_low_Buffer_Size+
alfa×(PQ_high_Buffer_Size-PQ_low_Buffer_Size)
Wherein, PQ_low_Buffer_Size is the buffer memory lower limit, and PQ_high_Buffer_Size is the buffer memory upper limit, and PQ_expect_Buffer_Size is a target cache.
It is thus clear that target cache calculates according to the buffer memory bound, and the buffer memory bound can draw with the quality of eating dishes without rice or wine with reference to user's the speed of eating dishes without rice or wine, so target cache has in fact also adapted to the eat dishes without rice or wine variation of status transmission of user.
In addition; Contain target cache factor alfa in the formula of calculating target cache, the alfa value is the positive number less than 1, is used for dynamically adjusting target cache; Prevent that the target cache setting is too high and cause the buffer memory queuing delay oversize, avoid the too low reference significance that loses of target cache simultaneously.So, through different alfa values is set, different target cache sizes can be set, promptly target cache is more near the buffer memory upper limit or buffer memory lower limit, alfa or alfa
InitConcrete numerical value unqualified, can confirm or confirm according to emulation according to actual conditions.
Move under the scene, the status transmission of eating dishes without rice or wine changes at any time, when the channel circumstance of eating dishes without rice or wine is bad, can cause data cached overstocking, and the buffer memory queuing delay increases until overtime packet loss, should reduce alfa this moment to reduce target cache; Eat dishes without rice or wine suitably to promote alfa to improve target cache after the channel circumstance improvement.In addition; Owing to the reason of dispatching algorithm itself also can cause the user in a period of time, can not dispatch normally; To such an extent as to the data delay that overstocks in the user cache reaches the maximum of system tolerant; Should control littler buffer memory recoverable amount through forcing down target cache more in this case, make Flow Control can cooperate the operating state of dispatching algorithm.Improve and work as the subscriber channel environment; Or dispatching algorithm is not when temporarily dispatching this user to this user of the frequent scheduling of beginning; Should raise and recover normal target cache early; Control user PQ queue for storing more data amount, the requirement of satisfying scheduling and eating dishes without rice or wine to transmit makes Flow Control can cooperate the operating state of dispatching algorithm.
Step 205 is carried out urgent Flow Control, and calculates alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading.
Wherein, alfa after the renewal keeps the positive number greater than 0, if the difference after promptly calculating smaller or equal to 0 then this step is only carried out urgent Flow Control, is omitted the step of calculated difference.
Wherein, target cache factor step-length step
AlfaConcrete numerical value be the parameter that is provided with in advance, its value is the positive number less than 1, its concrete numerical value is confirmed according to emulation or actual conditions.
Said urgent Flow Control is meant that Node B is 0 through the capacity allocation control frame to RNC request buffer data size.
Step 207 is carried out upper limit Flow Control.
Upper limit Flow Control is meant that Node B is 0 through the capacity allocation control frame to RNC request buffer data size.
Step 209 is carried out the lower limit Flow Control.
The implication of lower limit Flow Control is: Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2, B
Need2Greater than B
Need1, B wherein
Need1=Rate
PQ_out* T
FC_period
The implication of lower limit Flow Control also can be: Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2For:
B
need2＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size?。
Step 211 is carried out Flow Control on the target cache.
Step 212 is carried out Flow Control under the target cache.
Wherein, on the target cache under Flow Control or the target cache during Flow Control, Node B through the capacity allocation control frame to RNC request buffer data size B
Need3For:
B
need3＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
If B
Need3Calculating is less than 0, then with 0 as B
Need3Value.
So far, above-mentioned steps 202 to 212 is the concrete steps of cycle timing triggering mode Flow Control, introduces in the face of the concrete steps of specific events trigger mode Flow Control down.
Whether step 215 is judged from last one-period Flow Control and is put to current time in this time period, be Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache apart from the type of the recent Flow Control of current time, if then execution in step 217; Otherwise, execution in step 230.
Illustrate; If current time is between second round Flow Control point and period 3 Flow Control point; Then judge from second round the Flow Control point to current time in this time period; Whether apart from the recent Flow Control of current time is Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache, if then execution in step 217; Otherwise execution in step 230.
Step 216 is updated to target cache factor initial value alfa with target cache factor alfa
Init, upgrade target cache PQ_expect_Buffer_Size according to the gentle limit PQ_low_Buffer_Size that leaves of target cache factor alfa, buffer memory upper limit PQ_high_Buffer_Size apart from the current time last update, execution in step 218 then.
Above-mentioned steps 213,214 and step 202,203 content are identical, will not give unnecessary details here, can be with reference to step 202 and 203 associated description.
Step 217 is carried out urgent Flow Control, and calculates alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading.
Above-mentioned steps is identical with 205, but the relevant introduction of refer step 205 will not be given unnecessary details here.
Whether step 219 is judged from last one-period Flow Control and is put to current time in this time period, be Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache apart from the type of the recent Flow Control of current time, if then execution in step 220; Otherwise, execution in step 230.
Step 220 is carried out upper limit Flow Control.
But the relevant introduction of the concrete implication refer step 207 of upper limit Flow Control.
Whether step 222 is judged from last one-period Flow Control and is put to current time in this time period, be the lower limit Flow Control apart from the type of the recent Flow Control of current time, if then execution in step 230; Otherwise, execution in step 223.
Step 223 is carried out the lower limit Flow Control.
The concrete implication of lower limit Flow Control can be with reference to the relevant introduction of step 209.
In this step; If satisfy condition one: put to current time in this time period from last one-period Flow Control; Type apart from the recent Flow Control of current time is the lower limit Flow Control; Perhaps satisfy condition two: current PQ formation carried out normal consistency in the current subframe and in this time period, be Flow Control on the target cache, and calculated buffer data size B apart from the recent Flow Control of current time from last one-period Flow Control point to current time
Need3The target cache factor alfa of reference (calculates buffer data size B
Need3Relate to target cache PQ_expect_Buffer_Size, and calculate target cache PQ_expect_Buffer_Size reference target buffer memory factor alfa) less than alfa
Init, then execution in step 226.
Step 226 is carried out Flow Control on the target cache.
But the associated description of the implication refer step 211 of Flow Control on the target cache.
The Flow Control of the said reference target buffer memory factor can be on the target cache Flow Control under Flow Control or the target cache.
Node B asks buffer data size B through the capacity allocation control frame to RNC during in addition, as if the lower limit Flow Control
Need2Be B
Need2=Rate
PQ_out* T
FC_period+ PQ_Expect_Buffer_Size-PQ_Buffer_Size, then the Flow Control of the reference target buffer memory factor can be on lower limit Flow Control, the target cache Flow Control under Flow Control or the target cache.
Step 228 judges in the current subframe whether current PQ formation has been carried out normal consistency, if then execution in step 229; Otherwise, execution in step 230.
Step 229 is carried out Flow Control under the target cache.
But the associated description of the implication refer step 212 of Flow Control under the target cache.
Step 230 is not carried out Flow Control.
The implication of this step promptly keeps original flow of Iub mouth for not carrying out flow control.
So far, this flow process finishes.
To sum up; In the present invention; The abnormal conditions that not only exceed the buffer memory upper limit or be lower than the buffer memory lower limit to buffer data size are carried out the control of Iub mouth flow; And considered buffer data size is in when the buffer memory upper limit is gentle leaves the normal condition between the limit how to carry out the control of Iub mouth flow, has avoided Iub mouth speed to fluctuate widely, and helps keeping the stable problem of buffer data size.
The present invention has set up the notion of target cache, and target cache is not a fixing value, and its transmission quality of eating dishes without rice or wine according to the user upgrades, and the eat dishes without rice or wine variation of status transmission of user is had adaptability preferably.And with flow-control mechanism to the control degree of buffer data size as the weighing criteria of system's state and the Iub mouth flow rate coupling rate criterion of eating dishes without rice or wine; And binding cache bound triggering criterion, can strengthen the stability of transmitting data performance between two network elements of RNC and Node B greatly.
Because the present invention has introduced target cache; The operation of comparing with target cache with current cache; The data volume that Node B asks for to RNC no longer only is that simple Iub mouth flow rate matees the speed of eating dishes without rice or wine; But want data volume to do correction to a certain degree to current cable according to the difference of current cache and target cache, it is certain for the eat dishes without rice or wine anticipation function of channel circumstance and transmission rate of user to make that Flow Control has, and to the eat dishes without rice or wine self-debugging functions of estimation error of transmittability of active user; This can improve, and flow-control mechanism is followed the tracks of and the accuracy of the estimation subscriber channel environment and the speed of eating dishes without rice or wine, and improves the eat dishes without rice or wine adaptive capacity of status transmission shake to the user.
The present invention introduces the Flow Control of based target buffer memory; The buffer memory of PQ formation is maintained on the reasonable levels; Avoid fluctuating widely of buffer memory; This Flow Control belongs to normal Flow Control, can reduce the triggering frequency of upper limit Flow Control and the so unusual Flow Control of lower limit Flow Control significantly, reduces promptly also that the buffer memory packet loss is gentle to save as the frequency that sky causes that throughput descends.
The present invention has also defined the target cache factor; Mechanism with dynamic adjustments target cache; Can respond the variation of the transmission quality of eating dishes without rice or wine and the variation of active user's scheduled transmission state of living in, the accuracy and the reasonability of dependable flow control can better Matching Scheduling.
The present invention is owing to introduced the Event triggered Flow Control of target cache; For a buffering course is set in the quick variation of Iub mouth speed; Carrying out a buffering for situation about increasing fast because of the too high or too low buffer memory that causes of Iub mouth speed or descend fast regulates; Avoid frequently triggering the buffer memory upper limit or buffer memory lower limit, avoid Iub mouth rate fluctuation too big; In addition, carry out Iub mouth rate adaptation, can respond the variation of the buffer memory demand that the variation of user's dispatch state causes more timely, the accuracy of dependable flow control for upgrade the buffer data size cause interval situation about changing of living in because of target cache.
The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. the Iub port flow control method of a based target buffer memory is characterized in that, the length T of pre-configured cycle timer
FC_period, the length T of cycle timer
FC_periodBe a Flow Control cycle, be one-period Flow Control point the finish time in each Flow Control cycle, and this method comprises:
Every subframe judges whether cycle timer expires; If then adopt cycle timing triggering mode and carry out the flow control of Iub mouth according to buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size and target cache PQ_low_Buffer_Size; Otherwise, adopt the specific events trigger mode and carry out the flow control of Iub mouth according to buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size and target cache PQ_low_Buffer_Size.
2. method according to claim 1 is characterized in that, said employing cycle is triggering mode and comprise according to the method that the buffer memory upper limit, buffer memory lower limit and target cache are carried out the flow control of Iub mouth regularly:
A1, judge that whether current priority formation (PQ formation) buffer memory gets into normal condition by the state of emergency or packet loss; And in the current subframe normal consistency has been carried out in current PQ formation; If then target cache factor alfa is updated to target cache factor initial value alfa
Init, direct then execution in step A3, wherein, target cache factor alfa and target cache factor initial value alfa
InitBe positive number less than 1; Otherwise; Upgrade the gentle limit PQ_low_Buffer_Size that leaves of buffer memory upper limit PQ_high_Buffer_Size; And according to gentle limit PQ_low_Buffer_Size renewal target cache PQ_expect_Buffer_Size, the execution in step A2 then of leaving of the buffer memory upper limit PQ_high_Buffer_Size that upgrades;
A2, judge current PQ formation the buffer memory queuing delay whether more than or equal to preset crash time thresholding T
Max, if then carry out urgent Flow Control, and calculate alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading; Otherwise, execution in step A4;
A3, renewal buffer memory upper limit PQ_high_Buffer_Size, buffer memory lower limit PQ_low_Buffer_Size, and according to the gentle limit PQ_low_Buffer_Size renewal target cache PQ_expect_Buffer_Size that leaves of target cache factor alfa, buffer memory upper limit PQ_high_Buffer_Size apart from the current time last update;
A4, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to buffer memory upper limit PQ_high_Buffer_Size, if then carry out upper limit Flow Control apart from the current time last update; Otherwise, execution in step A5;
A5, judge current PQ formation buffer data size PQ_Buffer_Size whether smaller or equal to buffer memory lower limit PQ_low_Buffer_Size, if then carry out the lower limit Flow Control apart from the current time last update; Otherwise, execution in step A6;
A6, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to target cache PQ_expect_Buffer_Size, if then carry out Flow Control on the target cache apart from the current time last update; Otherwise, carry out Flow Control under the target cache.
3. method according to claim 2 is characterized in that, said employing specific events trigger mode also comprises according to the method that the buffer memory upper limit, buffer memory lower limit and target cache are carried out the flow control of Iub mouth:
B1, judge that whether current PQ formation buffer memory gets into normal condition by the state of emergency or packet loss, and in the current subframe normal consistency has been carried out in current PQ formation, if then target cache factor alfa is updated to target cache factor initial value alfa
Init, direct then execution in step B4, wherein, target cache factor alfa and target cache factor initial value alfa
InitBe positive number less than 1; Otherwise, execution in step B2;
B2, judge current PQ formation the buffer memory queuing delay whether more than or equal to preset crash time thresholding T
Max, if, execution in step B3 then; Otherwise, execution in step B5;
B3, judge from last one-period Flow Control and put to current time in this time period; Whether apart from the type of the recent Flow Control of current time is Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache; If; Then carry out urgent Flow Control, and calculate alfa and preset target cache factor step-length step
AlfaDifference, difference as the alfa after upgrading, is upgraded target cache PQ_expect_Buffer_Size according to the alfa after upgrading; Otherwise, do not carry out Flow Control;
B4, according to upgrading target cache PQ_expect_Buffer_Size apart from the target cache factor alfa of current time last update, the gentle limit pQ_low_Buffer_Size that leaves of buffer memory upper limit PQ_high_Buffer_Size;
B5, judge current PQ formation buffer data size PQ_Buffer_Size whether more than or equal to buffer memory upper limit PQ_high_Buffer_Size apart from the current time last update, if, execution in step B6 then; Otherwise, execution in step B7;
Whether B6, judge from last one-period Flow Control and put to current time in this time period, be Flow Control under Flow Control or the target cache on lower limit Flow Control, the target cache apart from the type of the recent Flow Control of current time, if then carry out upper limit Flow Control; Otherwise, do not carry out Flow Control;
B7, judge current PQ formation buffer data size PQ_Buffer_Size whether smaller or equal to buffer memory lower limit PQ_low_Buffer_Size apart from the current time last update, if, execution in step B8 then; Otherwise, execution in step B9;
Whether B8, judge from last one-period Flow Control and put to current time in this time period, be the lower limit Flow Control apart from the type of the recent Flow Control of current time, if then do not carry out Flow Control; Otherwise, carry out the lower limit Flow Control;
B9, judge current PQ formation data cached data volume PQ_Buffer_Size whether more than or equal to target cache PQ_expect_Buffer_Size apart from the current time last update, if, execution in step B10 then; Otherwise, execution in step B11;
B10, condition one; Put to current time in this time period from last one-period Flow Control; Type apart from the recent Flow Control of current time is the lower limit Flow Control, and condition two has been carried out normal consistency to current PQ formation in the current subframe and from last one-period Flow Control point to current time in this time period; Apart from the recent Flow Control of current time is Flow Control on the target cache, and the target cache factor alfa of reference is less than alfa
Init, judge whether to satisfy condition one or condition two, if then carry out Flow Control on the target cache; Otherwise, do not carry out Flow Control;
B11, condition three: put to current time in this time period from last one-period Flow Control; Type apart from the recent Flow Control of current time is upper limit Flow Control or urgent Flow Control; Condition four; Put to current time in this time period from last one-period Flow Control, apart from the target cache factor alfa of the Flow Control institute reference of the recent reference target buffer memory of the current time factor less than alfa
Init, judge whether to satisfy condition three or condition four, if, execution in step B12 then; Otherwise, do not carry out Flow Control;
B12, judge whether current PQ formation has been carried out normal consistency in the current subframe, if then carry out Flow Control under the target cache; Otherwise, do not carry out Flow Control.
4. method according to claim 3 is characterized in that, the method for upgrading the buffer memory upper limit described in steps A 1, A3 and the B4 is: calculate PQ_high_Buffer_Size=Rate
PQ_out* (T
Max-T
High Remain), wherein, PQ_high_Buffer_Size is the buffer memory upper limit, Rate
PQ_outFor current PQ formation on average goes out group speed, T at current time
MaxBe buffer memory queuing time thresholding, T
High_remainFor the buffer memory upper limit is regulated parameter, T
High_remainBe used to remedy the influence of speed shake, and can be used for controlling intervention schedule and packet loss the buffer memory upper limit.
5. method according to claim 4 is characterized in that, the method for upgrading the buffer memory lower limit described in steps A 1, A3 and the B4 is: calculate PQ_low_Buffer_Size=a * Rate
PQ_out* T
Feedback, wherein, PQ_low_Buffer_Size is the buffer memory lower limit, Rate
PQ_outFor current PQ formation current time on average go out group speed, a is the anti-shake factor of lower limit, a gets the positive integer greater than 0, T
FeedbackBe the round-trip delay of capacity allocation control frame between base station node B and radio network controller (RNC).
6. method according to claim 5 is characterized in that, said Rate
PQ_outComputational methods be: calculate
Wherein, Rate
* PQ_outFor current PQ formation on average goes out group speed, R in the previous moment of current time
PQ_outFor current PQ formation goes out group speed, T current time instantaneous
FCBe filtering factor.
7. method according to claim 6 is characterized in that, the method for upgrading target cache described in steps A 1, A2, A3, B3 and the B4 is:
Calculate
PQ_expect_Buffer_Size＝PQ_low_Buffer_Size+
alfa×(PQ_high_Buffer_Size-PQ_low_Buffer_Size)。
8. method according to claim 7 is characterized in that,
Said urgent Flow Control is: Node B is 0 through the capacity allocation control frame to RNC request buffer data size;
Said lower limit Flow Control is:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2, B
Need2Greater than B
Need1, B wherein
Need1=Rate
PQ_out* T
FC_period
Or Node B asks buffer data size B through the capacity allocation control frame to RNC
Need2For:
B
need2＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
Said upper limit Flow Control is: Node B is 0 through the capacity allocation control frame to RNC request buffer data size;
Flow Control is on the said target cache:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need3For:
B
need3＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
If B
Need3Calculating is less than 0, then with 0 as B
Need3Value;
Flow Control is under the said target cache:
Node B asks buffer data size B through the capacity allocation control frame to RNC
Need3For:
B
need3＝Rate
PQ_out×T
FC_period+PQ_Expect_Buffer_Size-PQ_Buffer_Size，
If B
Need3Calculating is less than 0, then with 0 as B
Need3Value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010527677.2A CN102457909B (en) | 2010-10-27 | 2010-10-27 | Iub port flow control method based on target buffer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010527677.2A CN102457909B (en) | 2010-10-27 | 2010-10-27 | Iub port flow control method based on target buffer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102457909A true CN102457909A (en) | 2012-05-16 |
| CN102457909B CN102457909B (en) | 2014-05-14 |
Family
ID=46040431
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010527677.2A Expired - Fee Related CN102457909B (en) | 2010-10-27 | 2010-10-27 | Iub port flow control method based on target buffer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102457909B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017107526A1 (en) * | 2015-12-24 | 2017-06-29 | 中兴通讯股份有限公司 | Base station and flow control processing method and device |
| CN109630901A (en) * | 2018-11-29 | 2019-04-16 | 北京市燃气集团有限责任公司 | A kind of mesolow garden pipeline abnormal flow recognition methods and device |
| WO2019129198A1 (en) * | 2017-12-29 | 2019-07-04 | 华为技术有限公司 | Communication method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859152A (en) * | 2005-07-22 | 2006-11-08 | 上海华为技术有限公司 | Iub interface flow control plan |
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
| CN1984067A (en) * | 2006-06-13 | 2007-06-20 | 华为技术有限公司 | Method for controlling up-link flow |
| US20090147680A1 (en) * | 2006-08-17 | 2009-06-11 | Huawei Technologies Co., Ltd. | Method of flow control for iub-interface, apparatus and base station |
-
2010
- 2010-10-27 CN CN201010527677.2A patent/CN102457909B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859152A (en) * | 2005-07-22 | 2006-11-08 | 上海华为技术有限公司 | Iub interface flow control plan |
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
| CN1984067A (en) * | 2006-06-13 | 2007-06-20 | 华为技术有限公司 | Method for controlling up-link flow |
| US20090147680A1 (en) * | 2006-08-17 | 2009-06-11 | Huawei Technologies Co., Ltd. | Method of flow control for iub-interface, apparatus and base station |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017107526A1 (en) * | 2015-12-24 | 2017-06-29 | 中兴通讯股份有限公司 | Base station and flow control processing method and device |
| WO2019129198A1 (en) * | 2017-12-29 | 2019-07-04 | 华为技术有限公司 | Communication method and device |
| CN109630901A (en) * | 2018-11-29 | 2019-04-16 | 北京市燃气集团有限责任公司 | A kind of mesolow garden pipeline abnormal flow recognition methods and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102457909B (en) | 2014-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1523134B1 (en) | Coordinated data flow control and buffer sharing in UMTS | |
| CN101340358B (en) | Flow control method, system and flow control entity | |
| EP2204018B1 (en) | Limiting the rlc window size in a hsdpa flow control | |
| US9667545B2 (en) | Method and system for aggregate bandwidth control | |
| US20040057378A1 (en) | Flow control in a packet-switched communication network using a leaky bucket algorithm | |
| WO2011037518A1 (en) | Rate shaping for wireless communication using token bucket that allows token debt | |
| US20140281034A1 (en) | System and Method for Compressing Data Associated with a Buffer | |
| CN109873773B (en) | Congestion control method for data center | |
| CN101123573B (en) | Flow control method for packet data units in high-speed downlink link packet access network | |
| CN102457909B (en) | Iub port flow control method based on target buffer | |
| CN100493040C (en) | Method for controlling up-link flow | |
| CN102387540B (en) | Flow control method of Iub port | |
| CN102487531B (en) | Flow control method for flow self-adaption modification of Iub port | |
| CN102457908B (en) | Method for flow control of Iub port based on scheduling state | |
| KR101835387B1 (en) | Terminal and method for scheduling resources thereof | |
| CN101932018B (en) | RLC data transmission method of HSDPA system | |
| CN100583720C (en) | A method and apparatus for control of high speed downlink packet data flow | |
| JP7327642B2 (en) | Signal transfer system, signal transfer device, signal transfer method and signal transfer program | |
| WO2016090986A1 (en) | Traffic control method and apparatus for reducing radio link control (rlc) layer data retransmission | |
| CN102595507A (en) | Lower limit stream control method | |
| KR20070081500A (en) | Apparatus and method for controlling of data transmission in mobile communication system | |
| CN102387541A (en) | Iub interface flow control protection method and base station | |
| CN102413511A (en) | CELL_FACH flow control method in HSPA+ system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHINA POTEVIO CO., LTD. Free format text: FORMER OWNER: PUTIAN IT TECH INST CO., LTD. Effective date: 20130916 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20130916 Address after: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant after: CHINA POTEVIO CO.,LTD. Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. |
|
| ASS | Succession or assignment of patent right |
Owner name: PUTIAN IT TECH INST CO., LTD. Free format text: FORMER OWNER: CHINA POTEVIO CO., LTD. Effective date: 20131202 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20131202 Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant after: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. Address before: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District Applicant before: CHINA POTEVIO CO.,LTD. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140514 Termination date: 20211027 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |