CN102387540B - Flow control method of Iub port - Google Patents
Flow control method of Iub port Download PDFInfo
- Publication number
- CN102387540B CN102387540B CN201010267614.8A CN201010267614A CN102387540B CN 102387540 B CN102387540 B CN 102387540B CN 201010267614 A CN201010267614 A CN 201010267614A CN 102387540 B CN102387540 B CN 102387540B
- Authority
- CN
- China
- Prior art keywords
- flow control
- current
- buffer memory
- queue
- upper limit
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000000205 computational method Methods 0.000 claims description 6
- 238000001914 filtration Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 abstract description 15
- 230000000737 periodic effect Effects 0.000 abstract 1
- 241000209094 Oryza Species 0.000 description 22
- 235000007164 Oryza sativa Nutrition 0.000 description 22
- 235000021186 dishes Nutrition 0.000 description 22
- 235000009566 rice Nutrition 0.000 description 22
- 230000007246 mechanism Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 6
- 230000001276 controlling effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 239000012530 fluid Substances 0.000 description 2
- 230000036039 immunity Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
Abstract
The invention discloses a flow control method of an Iub port. The method comprises the following steps: judging whether a period timer is expired or not by each subframe; if the period timer is expired, carrying out the flow control of the Iub port by adopting a periodic timed triggering mode; and otherwise, carrying out the flow control of the Iub port by adopting a specific event triggering mode. By adopting the method disclosed by the invention, the transmission capability of an empty port can be adapted.
Description
Technical field
The present invention relates to field of mobile communication, particularly a kind of Iub port flow control method.
Background technology
Along with evolving to high-speed packet access from high speed downlink packet access (HSDPA) technology, mobile communication technology strengthens (HSPA+) technology, data dispatch (Node B) side execution still in base station in HSPA+ technology, the MAC-d PDU sending from radio network controller (RNC) (MAC-d protocol Data Unit) need to carry out buffer memory in Node B side, wait for the scheduling of MAC-ehs entity in Node B, wherein, it should be noted that, MAC-d entity is that (MAC) entity is controlled in the media interviews of processing dedicated transmission channel, MAC-d entity is arranged in RNC, MAC-ehs entity is the MAC entity of processing high speed descending sharing channel, MAC-ehs entity is arranged in Node B.Uncertainty due to the complexity of eating dishes without rice or wine and mobile channel, user data is subject to the impact of dispatching algorithm performance in the actual speed rate of eating dishes without rice or wine, also directly affect user data at the buffer memory of Node B side simultaneously, for fear of Node B side buffer area, occur congested, cause data cached queuing delay to exceed the abandoning time delay (discardtimer) of high level configuration of MAC layer and be dropped, need to introduce flow control mechanism at Iub mouth.Flow control mainly adopts a kind of dynamic mode to control the transmission of MAC-d PDU on Iub mouth according to 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 be also unlikely to empty, guarantee data volume in user cache be enough to support the to eat dishes without rice or wine transfer of data demand of upper dynamically changeable.Wherein, eat dishes without rice or wine to refer to the interface between Node B and subscriber equipment (UE), also claim Uu mouth, and Iub mouth refers to the interface between RNC and Node B.
Flow control needs Node B and RNC two ends to coordinate, by the requests for capacity control frame of Iub mouth and moving alternately of capacity distribution control frame.Particularly, RNC passes through to send requests for capacity control frame indicating user data at the storage condition of RNC to Node B, and requires Node B response capacity to distribute control frame to distribute this user's data transmission capacity; Node B distributes control frame to inform speed and effective time of this speed that the operable data flow of RNC sends by capacity.It should be noted that, be not only to receive that the requests for capacity control frame from RNC could distribute control frame by transmission capacity, in most cases do not have requests for capacity control frame, but initiatively according to buffer queue and subscriber channel situation, judged by Node B, oneself determine whether transmission capacity distributes control frame.
In HSPA+ system, define HS-DSCH CAPACITY ALLOCATION TYPE 2 capacity and distributed control frame, main field and the meaning thereof of to capacity, distributing control frame to comprise below describe:
CmCH-PI: be used to indicate the priority of priority query (PQ), wherein, priority query is often called as PQ queue;
Maximum MAC-d PDU length: be used to indicate the maximum MAC-d PDU length allowing, maximum 1504 bits in agreement;
HS-DSCH Interval: be used to indicate the time interval that HS-DSCH Credits authorizes, wherein, the implication of HS-DSCH is high speed descending sharing channel;
HS-DSCH Credits: be used to indicate the MAC-dPDU total amount of data that RNC sends in HS-DSCH Interval, 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 that HS-DSCH Credits authorizes, wherein, HS-DSCH Repetition Period did not limit 0 expression repetition period;
Congestion Status: be used to indicate downlink transfer network layer and whether detect congested.
To the flow control of Iub mouth, mainly adopt buffer memory balanced flow to control (BBFC) pattern at present, by the buffer data size that high threshold and/or low threshold are controlled PQ is set for the PQ queue of Node B side.High threshold is for controlling the appearance that causes loss of data phenomenon due to PQ queue cache overflow, and low threshold does not have the situation that data can be sent out to produce while dispatching for avoiding data cached deficiency to cause.Specifically, prior art has mainly proposed following several Iub port flow control methods:
The patent of invention of application number 200810101764.4 proposes to carry out adaptability flow control for the different flow demand for control of business, method is that high threshold and the low threshold of data buffer storage amount in service queue (being PQ queue) are set according to the business contract of RNC, when the data buffer storage amount of service queue exceeds its high threshold, Node B distributes control frame notice RNC to stop sending the data of this service queue by capacity, when the data buffer storage amount of service queue is during lower than its low threshold, Node B distributes control frame notice RNC with newly assigned speed, to send the data of this service queue by capacity.Wherein, the buffer data size of service queue exceeds high threshold or carries out the renewal of threshold value during lower than low threshold.
The patent of invention of application number 200610089213.1 proposes to adopt the cycle timed sending mechanism of 100ms, Node B measures the average transmission rate of eating dishes without rice or wine of each PQ queue every 100ms, Node B is according to the buffer memory occupied information of each PQ queue of RNC side, for size and the repetition period of the Iub port transmission data block of next 100ms are selected in each queue, and the capacity that sends distributes control frame to RNC.
The patent of invention of application number 200610084695.1 proposes to adopt event trigger mechanism, and trigger event comprises: priority query be scheduled transmission, receive RNC Frame or receive the requests for capacity control frame of RNC.Buffer threshold value is set, and Node B receives after trigger event the relation of judgement buffer data size and threshold value and current flag size determine whether to RNC transmission capacity, distribute control frame.Flag is upgraded principle: every capacity distribution control frame that allows to issue data to one of RNC transmission, home position 0, the every capacity distribution control frame of forbidding issuing data, home position 1 of sending to RNC.
But, the equal existent defect of above-mentioned several Iub port flow control methods:
The patent of invention of application number 200810101764.4 proposes to carry out adaptability flow control for the flow control demand of business, the shortcoming existing is: high threshold and low threshold that 1, data buffer storage in service queue is set according to business contract, but do not consider the actual transmittability of eating dishes without rice or wine, jitter immunity is poor; 2, the buffer data size of service queue all can send flow-control command (capacity distribution control frame) higher than high threshold or lower than low threshold, and flow-control command sends frequent, and system processing load is higher.
The simple solution of the Iub mouth flow control that the patent of invention of application number 200610089213.1 proposes, the shortcoming existing is: 1, the response speed of cycle timing mechanism is too slow, thereby that the channel circumstance of particularly eating dishes without rice or wine under mobile context changes is very fast, stream control response affects scheduling performance not in time; 2, the buffer data size of service queue does not have the upper limit, for the not protection of situation of cache overflow.
The shortcoming that the patent of invention of application number 200610084695.1 exists is: 1, buffer threshold value only consider to eat dishes without rice or wine maximum transmitted ability or be made as fixed value, and variation that cannot adaptive space mouth channel circumstance, jitter immunity is poor; 2, with buffer data size, coordinate the Flow Control trigger mechanism of flag bit too simple with the magnitude relationship of buffer threshold, flow-control command only issues data or does not send out data alternately, can not adjust flexibly Iub mouth speed size according to the transmittability of eating dishes without rice or wine.
To sum up, the data rate that Iub port flow control method of the prior art does not have to consider to make an Iub mouth and the data rate of eating dishes without rice or wine this criterion that matches, that is to say, Iub port flow control method of the prior art is difficult to adapt to the transmittability of eating dishes without rice or wine.
Summary of the invention
In view of this, the invention provides a kind of Iub port flow control method, can adapt to the transmittability of eating dishes without rice or wine.
For solving the problems of the technologies described above, technical scheme of the present invention is achieved in that
An Iub port flow control method, the length T of pre-configured cycle timer
fC_period, the length T of cycle timer
fC_periodbe a Flow Control cycle, be a cycle Flow Control point finish time in each Flow Control cycle, and calculate in advance buffer memory queuing time thresholding, and the method comprises:
Every subframe judges whether cycle timer expires, and if so, adopts cycle clocked flip mode to carry out the flow control of Iub mouth; Otherwise, adopt specific events trigger mode to carry out the flow control of Iub mouth.
The method that described employing cycle clocked flip mode is carried out the flow control of Iub mouth comprises:
A1, the gentle limit of leaving of the renewal buffer memory upper limit;
A2, judge that whether the buffer memory queuing delay of current PQ queue is greater than described buffer memory queuing time thresholding, if so, carries out urgent Flow Control; Otherwise, execution step A3;
A3, judge that whether the buffer data size of current PQ queue is more than or equal to the described buffer memory upper limit, if so, carries out upper limit Flow Control; Otherwise, execution step A4;
A4, judge that whether the buffer data size of current PQ queue is less than or equal to described buffer memory lower limit, if so, carries out lower limit Flow Control; Otherwise, carry out normal Flow Control.
After carrying out urgent Flow Control described in steps A 2, the method further comprises: the current PQ queue of scheduler priority scheduling.
The described method of calculating in advance buffer memory queuing time thresholding is: calculate T
max=f
urgent* T
discard, wherein, T
maxfor buffer memory queuing time thresholding, T
discardfor abandoning time delay, f
urgentfor urgent coefficient, f
urgentspan be greater than 0 and be less than 1.
The method of upgrading the buffer memory upper limit described in steps A 1 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 queue on average goes out group speed, T at current time
maxfor buffer memory queuing time thresholding, T
high_remainfor the buffer memory upper limit regulates parameter, T
high_remainfor making up the impact of speed shake on the buffer memory upper limit, and can be used for controlling intervention schedule and packet loss;
The method of upgrading buffer memory lower limit described in steps A 1 is: calculate PQ_low_Buffer_Size=a * Rate
pQ_out* T
feeaback, wherein, PQ_low_Buffer_Size is buffer memory lower limit, Rate
pQ_outfor current PQ queue current time on average go out group speed, a is the anti-shake factor of lower limit, a gets the positive integer that is greater than 0, T
feedbackfor capacity distributes the round-trip delay of control frame between base station node B and radio network controller (RNC).
Described Rate
pQ_outcomputational methods be: calculate
wherein, Rate
* pQ_outfor current PQ queue on average goes out group speed, R in the previous moment of current time
pQ_outfor current PQ queue goes out group speed, T current time instantaneous
fCfor filtering factor.
The method that described employing specific events trigger mode is carried out the flow control of Iub mouth comprises:
B1, judge that whether the buffer memory queuing delay of current PQ queue is greater than the buffer memory queuing time thresholding that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B2; Otherwise, execution step B3;
Whether B2, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out urgent Flow Control;
B3, judge that whether the buffer data size of current PQ queue is more than or equal to the buffer memory upper limit that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B4; Otherwise, execution step B5;
Whether B4, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out upper limit Flow Control;
B5, judge that whether the buffer data size of current PQ queue is less than or equal to the buffer memory lower limit that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B6; Otherwise current subframe is not carried out flow-control operation;
Whether B6, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be lower limit Flow Control, if lower limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out lower limit Flow Control.
After carrying out urgent Flow Control described in step B2, the method further comprises: the current PQ queue of scheduler priority scheduling.
Described normal Flow Control is: Node B distributes control frame to RNC request buffer data size B by capacity
need1, wherein, B
need1=Rate
pQ_out* T
fC_period, wherein, work as B
need1value be less than or equal at 0 o'clock and get 0;
Described lower limit Flow Control is: Node B distributes control frame to RNC request buffer data size B by capacity
need2, B
need2be greater than B
need1;
Described urgent Flow Control is: it is 0 to RNC request buffer data size that Node B distributes control frame by capacity;
Described upper limit Flow Control is: it is 0 to RNC request buffer data size that Node B distributes control frame by capacity.
Visible, according to technical scheme provided by the present invention, the mode that Flow Control trigger mechanism adopts cycle clocked flip and specific events trigger to combine, cycle clocked flip mode can avoid frequently sending flow-control command, reduction system operand, and specific events trigger can be adjusted Iub mouth speed according to the transmittability of eating dishes without rice or wine in time, therefore, Iub port flow control method provided by the present invention has adapted to the transmittability of eating dishes without rice or wine on the one hand, also takes into account simultaneously and has reduced system computing.
In addition, the calculating of buffer memory bound be take PQ queue and is gone out group speed as foundation, therefore can dynamic sensing the eat dishes without rice or wine variation of transmission quality and the impact of scheduling, and cycle timer is to after date renewal buffer memory bound numerical value, to adapt to the variation of the quality of eating dishes without rice or wine and the impact of scheduling.Also set customized parameter, in realization, can carry out easily parameter configuration according to the speed of the number of terminal in different system and channel circumstance variation, make up the impact that in the Flow Control cycle, speed shake is calculated buffer memory bound, strengthen buffer memory bound and calculate the adaptability of different application scene and flexibility.
Specific events trigger mode in the present invention not only has triggering thresholding, also defined in addition specific events trigger twice Flow Control the triggering constraint rule between the cycle, under the prerequisite that guarantees fluid control effect, effectively reduce the frequency that Flow Control triggers.
The present invention adopts scheduling and Flow Control to match, not merely that unidirectional Flow Control coordinates scheduling, when occurring that buffer memory queuing delay arrives default buffer memory crash time thresholding, not only Flow Control produces corresponding urgent flow-control operation, and scheduler can be to current PQ queue priority scheduling.
Accompanying drawing explanation
Fig. 1 is the flow chart of a kind of Iub port flow control method provided by the present invention.
Fig. 2 is the flow chart of the embodiment of a kind of Iub port flow control method provided by the present invention.
Embodiment
For making object of the present invention, technical scheme and advantage clearer, referring to the accompanying drawing embodiment that develops simultaneously, scheme of the present invention is described in further detail.
Fig. 1 is the flow chart of a kind of Iub port flow control method provided by the present invention.As shown in Figure 1, the method comprises the following steps:
Step 101, the length T of pre-configured cycle timer
fC_period, the length T of cycle timer
fC_periodbe a Flow Control cycle, be a cycle Flow Control point finish time in each Flow Control cycle, and calculate in advance buffer memory queuing time thresholding.
Step 102, every subframe judges whether cycle timer expires, and if so, adopts cycle clocked flip mode to carry out the flow control of Iub mouth; Otherwise, adopt specific events trigger mode to carry out the flow control of Iub mouth.
Below by an embodiment, a kind of Iub port flow control method provided by the present invention is described in detail.
Fig. 2 is the flow chart of the embodiment of a kind of Iub port flow control method provided by the present invention.As shown in Figure 2, the method comprises the following steps:
It should be noted that the flow control of the equal fingering row of Flow Control described in the present embodiment Iub mouth.
Step 200, the length T of pre-configured cycle timer
fC_period, the length T of cycle timer
fC_periodbe a Flow Control cycle, be a cycle Flow Control point finish time in each Flow Control cycle, and calculate buffer memory queuing time thresholding.
Buffer memory queuing time thresholding T
maxbefore cycle clocked flip or specific events trigger, calculate, and no longer upgrade in the Flow Control of cycle clocked flip mode or specific events trigger mode Flow Control running.
Buffer memory queuing time thresholding T
maxfor maximum queuing time threshold parameter, T
maxwith PQ queue attribute, to abandon time delay (discard timer) etc. relevant, also can claim T
maxfor buffer memory crash time thresholding, T
maxcomputational methods as follows:
T
max＝f
urgent×T
discard
Wherein, T
discardbe MAC layer high level configuration abandon time delay (discard timer), T
discardconcrete numerical value according to the agreement regulation of 3GPP, set, f
urgenta configurable urgent coefficient, for controlling buffer memory queuing urgency level, f
urgentless, urgency level is higher, and its span is greater than 0 and be less than 1, f
urgentconcrete numerical value according to actual conditions, determine.
Step 201, every subframe judges whether cycle timer expires, and if so, performs step 202; Otherwise, execution step 206.
The mode that Flow Control trigger mechanism in the present invention adopts cycle clocked flip and specific events trigger to combine.
Wherein, cycle clocked flip triggers when each cycle timer expires, and triggers liking user PQ queue, 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, (be the moment of cycle clocked flip finish time in each Flow Control cycle, also be that cycle timer expires constantly) be a cycle Flow Control point, following step 202 is to 205 being the concrete steps of employing cycle clocked flip mode Flow Control.
Specific events trigger is carried out the judgement of a Flow Control type in each subframe, triggering object is also user PQ queue, according to situation about judging, determine whether to trigger Flow Control and trigger which kind of Flow Control, following step 206 is to 211 concrete steps for employing specific events trigger mode Flow Control.
Step 202, upgrades the gentle limit of leaving of the buffer memory upper limit.
The object that the buffer memory upper limit is set is to avoid cache overflow, controls buffer data size and abandons to avoid queueing delay, once buffer data size reaches the buffer memory upper limit, and triggers upper limit Flow Control, controls the data volume that Node B asks for to RNC.In order to reduce operand, the concrete numerical value of the buffer memory upper limit constantly calculates and upgrades at cycle clocked flip, and wherein, the computational methods of buffer memory upper limit PQ_high_Buffer_Size are as follows:
PQ_high_Buffer_Size＝Rate
PQ_out×(T
max-T
high_Remain)
Wherein, Rate
pQ_outfor current PQ queue current time on average go out group speed, unit is kbps; T
maxfor 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, for making up the impact of speed shake on the buffer memory upper limit, and can be used for controlling intervention schedule and packet loss, its occurrence can be determined according to actual conditions.
A kind of Rate is provided below
pQ_outcomputational methods: for current PQ queue, if current PQ queue is dispatched in current transmission time interval (TTI), Rate
pQ_outvalue is zero, that is to say, current PQ queue is 0 in group speed that on average goes out of current time; If current PQ queue obtained scheduling in current TTI, adopt Filtering Formula
calculate, wherein, T
fCfor filtering factor, value can be according to simulation result configuration in advance, R
i(t) for PQ queue i goes out group speed moment t instantaneous,
for PQ queue i the previous moment of moment t on average go out group speed,
for PQ queue i on average goes out group speed at moment t.
When i gets the label of current PQ queue, when t gets current time, aforementioned formula can change into:
wherein, Rate
* pQ_outfor current PQ queue on average goes out group speed, R in the previous moment of current time
pQ_outfor current PQ queue goes out group speed current time instantaneous.
The object that buffer memory lower limit is set be while avoiding dispatching data cached quantity not sufficient even buffer data size be the empty scheduling performance that affects.Once buffer data size reaches lower limit, and trigger lower limit Flow Control, control Node B and ask more data volume to RNC.In order to reduce operand, buffer memory lower limit constantly calculates and upgrades at cycle clocked flip.Wherein, the computational methods of buffer memory lower limit PQ_low_Buffer_Size are as follows:
PQ_low_Buffer_Size＝a×Rate
PQ_out×T
feedback
Wherein, Rate
pQ_outfor current PQ queue current time on average go out group speed, unit is kbps, circular can be with reference to aforementioned description; T
feedbackfor capacity distributes the round-trip delay of control frame between Node B and RNC, unit is ms, is also that capacity distributes control frame from being issued to the actual time interval of coming into force and working; A is the anti-shake factor of lower limit, get the positive integer that is greater than 0, concrete numerical value can be determined according to simulation result in advance, a empties rapidly the situation of buffer memory while causing current PQ queue to be dispatched continuously for preventing that lower limit is too low, to avoid that lower limit is excessive queues up and to have impact buffer memory simultaneously, and can not make buffer memory lower limit be greater than buffer memory higher limit.
Step 203, judges whether the buffer memory queuing delay of current PQ queue is greater than buffer memory queuing time thresholding, if so, carries out urgent Flow Control; Otherwise, execution step 204.
Wherein, the method for obtaining the buffer memory queuing delay of current PQ queue can adopt the content of prior art.
In addition, for the current PQ queue of carrying out urgent Flow Control, also can notify scheduler priority scheduling, make the current PQ queue device scheduling that can preferentially be scheduled.
Step 204, judges whether the buffer data size of current PQ queue is more than or equal to the buffer memory upper limit, if so, carries out upper limit Flow Control; Otherwise, execution step 205.
Wherein, the method for obtaining the buffer data size of current PQ queue can adopt the content of prior art.
Step 205, judges whether the buffer data size of current PQ queue is less than or equal to buffer memory lower limit, if so, carries out lower limit Flow Control; Otherwise, carry out normal Flow Control.
In above-mentioned steps 203 to 205, relate to urgent Flow Control, upper limit Flow Control, lower limit Flow Control and normal these four operations of Flow Control, below the concrete meaning of these four operations is described.
Normally Flow Control refers to, Node B distributes control frame to RNC request buffer data size B by capacity
need1=Rate
pQ_out* T
fC_period, wherein, B
need1it is a Flow Control cycle T
fC_periodthe buffer data size of interior needs.
Lower limit Flow Control refers to, Node B distributes control frame to RNC request buffer data size B by capacity
need2, B
need2be greater than B
need1.
Promptly Flow Control and upper limit Flow Control refer to, it is 0 to RNC request buffer data size that Node B distributes control frame by capacity.
Wherein, in above-mentioned four operations, Node B distributes control frame identical with prior art to the concrete grammar of RNC request buffer data size by capacity.
Visible, when normal Flow Control, Node B is that standard is asked for data to RNC according to the Mean Speed of eating dishes without rice or wine of a period of time, and the upper limit and urgent Flow Control can significantly reduce and even stop asking for data, and lower limit Flow Control can relatively normal Flow Control more be asked for data.
Step 206, judges whether the buffer memory queuing delay of current PQ queue is greater than buffer memory queuing time thresholding, if so, performs step 207; Otherwise, execution step 208.
It should be noted that, when specific events trigger, do not carry out gentle renewal and the calculating of leaving limit of buffer memory queuing time thresholding, the buffer memory upper limit, step 206 and subsequent step 208 and 208 related buffer memory queuing time thresholding, the buffer memory upper limits are gentle to be left limit and is buffer memory queuing time thresholding, the buffer memory upper limit that the constantly nearest last cycle Flow Control point of the current specific events trigger of distance (i.e. the moment of the constantly nearest cycle clocked flip of the current specific events trigger of distance) upgrades and eases up and leave the value of limit.For example, if current specific events trigger constantly between second round Flow Control point and period 3 Flow Control point, step 206 and subsequent step 208 and 208 related buffer memory queuing time thresholding, the buffer memory upper limits gentle leave be limited to second round during Flow Control point buffer memory queuing time thresholding, the buffer memory upper limit of renewal and calculating ease up and leave the value of limit.
Step 207, whether judgement is put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out urgent Flow Control.
Illustrate, if current time is between second round Flow Control point and period 3 Flow Control point, judge from second round Flow Control point to current time in this time period, apart from the recent Flow Control of current time, whether be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation, that is to say, current subframe is not controlled flow, keeps the state of original flow; Otherwise, carry out urgent Flow Control, the concrete manner of execution of urgent Flow Control can be with reference to aforementioned description.
In addition, for the current PQ queue of carrying out urgent Flow Control, the device that also can preferentially be scheduled scheduling.
Step 208, judges whether the buffer data size of current PQ queue is more than or equal to the buffer memory upper limit, if so, performs step 209; Otherwise, execution step 210.
Step 209, whether judgement is put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out upper limit Flow Control.
The concrete manner of execution of upper limit Flow Control can be with reference to aforementioned description.
Step 210, judges whether the buffer data size of current PQ queue is less than or equal to buffer memory lower limit, if so, performs step 211; Otherwise current subframe is not carried out flow-control operation.
Step 211, whether judgement is put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be lower limit Flow Control, if lower limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out lower limit Flow Control.
The concrete manner of execution of lower limit Flow Control can be with reference to aforementioned description.
So far, this flow process finishes.
To sum up, in the present invention, the mode that Flow Control trigger mechanism adopts cycle clocked flip and specific events trigger to combine, cycle clocked flip mode can avoid frequently sending flow-control command, reduction system operand, and specific events trigger can be adjusted Iub mouth speed according to the transmittability of eating dishes without rice or wine in time, therefore, Iub port flow control method provided by the present invention has adapted to the transmittability of eating dishes without rice or wine on the one hand, also takes into account simultaneously and has reduced system computing.
In addition, the calculating of buffer memory bound be take PQ queue and is gone out group speed as foundation, therefore can dynamic sensing the eat dishes without rice or wine variation of transmission quality and the impact of scheduling, and cycle timer is to after date renewal buffer memory bound numerical value, to adapt to the variation of the quality of eating dishes without rice or wine and the impact of scheduling.Also set customized parameter, in realization, can carry out easily parameter configuration according to the speed of the number of terminal in different system and channel circumstance variation, make up the impact that in the Flow Control cycle, speed shake is calculated buffer memory bound, strengthen buffer memory bound and calculate the adaptability of different application scene and flexibility.
Specific events trigger mode in the present invention not only has triggering thresholding, also defined in addition specific events trigger twice Flow Control the triggering constraint rule between the cycle, under the prerequisite that guarantees fluid control effect, effectively reduce the frequency that Flow Control triggers.
The present invention adopts scheduling and Flow Control to match, not merely that unidirectional Flow Control coordinates scheduling, when occurring that buffer memory queuing delay arrives default buffer memory crash time thresholding, not only Flow Control produces corresponding urgent flow-control operation, and scheduler can be to current PQ queue priority scheduling.
The above, be only preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (9)
1. an Iub port flow control method, 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 a cycle Flow Control point finish time in each Flow Control cycle, and calculate in advance buffer memory queuing time thresholding, and the method comprises:
Every subframe judges whether cycle timer expires, and if so, adopts cycle clocked flip mode to carry out the flow control of Iub mouth; Otherwise, adopt specific events trigger mode to carry out the flow control of Iub mouth;
The method that described employing cycle clocked flip mode is carried out the flow control of Iub mouth comprises:
A1, the gentle limit of leaving of the renewal buffer memory upper limit;
A2, judge that whether the buffer memory queuing delay of current PQ queue is greater than described buffer memory queuing time thresholding, if so, carries out urgent Flow Control; Otherwise, execution step A3;
A3, judge that whether the buffer data size of current PQ queue is more than or equal to the described buffer memory upper limit, if so, carries out upper limit Flow Control; Otherwise, execution step A4;
A4, judge that whether the buffer data size of current PQ queue is less than or equal to described buffer memory lower limit, if so, carries out lower limit Flow Control; Otherwise, carry out normal Flow Control.
2. method according to claim 1, is characterized in that, after carrying out urgent Flow Control described in steps A 2, the method further comprises: the current PQ queue of scheduler priority scheduling.
3. method according to claim 1, is characterized in that, the described method of calculating in advance buffer memory queuing time thresholding is: calculate T
max=f
urgent* T
discard, wherein, T
maxfor buffer memory queuing time thresholding, T
discardfor abandoning time delay, f
urgentfor urgent coefficient, f
urgentspan be greater than 0 and be less than 1.
4. method according to claim 3, is characterized in that, the method for upgrading the buffer memory upper limit described in steps A 1 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 queue on average goes out group speed, T at current time
maxfor buffer memory queuing time thresholding, T
high_remainfor the buffer memory upper limit regulates parameter, T
high_remainfor making up the impact of speed shake on the buffer memory upper limit, and can be used for controlling intervention schedule and packet loss.
5. method according to claim 4, is characterized in that, the method for upgrading buffer memory lower limit described in steps A 1 is: calculate PQ_low_Buffer_Size=a * Rate
pQ_out* T
feedback, wherein, PQ_low_Buffer_Size is buffer memory lower limit, Rate
pQ_outfor current PQ queue current time on average go out group speed, a is the anti-shake factor of lower limit, a gets the positive integer that is greater than 0, T
feedbackfor capacity distributes the round-trip delay of control frame between base station node B and radio network controller (RNC).
6. method according to claim 5, is characterized in that, described Rate
pQ_outcomputational methods be: calculate
wherein, Rate
* pQ_outfor current PQ queue on average goes out group speed, R in the previous moment of current time
pQ_outfor current PQ queue goes out group speed, T current time instantaneous
fCfor filtering factor.
7. method according to claim 6, is characterized in that, the method that described employing specific events trigger mode is carried out the flow control of Iub mouth comprises:
B1, judge that whether the buffer memory queuing delay of current PQ queue is greater than the buffer memory queuing time thresholding that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B2; Otherwise, execution step B3;
Whether B2, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out urgent Flow Control;
B3, judge that whether the buffer data size of current PQ queue is more than or equal to the buffer memory upper limit that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B4; Otherwise, execution step B5;
Whether B4, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be urgent Flow Control or upper limit Flow Control, if urgent Flow Control or upper limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out upper limit Flow Control;
B5, judge that whether the buffer data size of current PQ queue is less than or equal to the buffer memory lower limit that the upper one-period Flow Control point nearest apart from current time upgrades, and if so, performs step B6; Otherwise current subframe is not carried out flow-control operation;
Whether B6, judgement are put to current time in this time period from upper one-period Flow Control, apart from the recent Flow Control of current time, be lower limit Flow Control, if lower limit Flow Control, current subframe is not carried out flow-control operation; Otherwise, carry out lower limit Flow Control.
8. method according to claim 7, is characterized in that, after carrying out urgent Flow Control described in step B2, the method further comprises: the current PQ queue of scheduler priority scheduling.
9. according to the method described in claim 1 or 7, it is characterized in that,
Described normal Flow Control is: Node B distributes control frame to RNC request buffer data size B by capacity
need1, wherein, B
need1=Rate
pQ_out* T
fC_period, wherein, work as B
need1value be less than or equal at 0 o'clock and get 0, Rate
pQ_outfor current PQ queue on average goes out group speed at current time;
Described lower limit Flow Control is: Node B distributes control frame to RNC request buffer data size B by capacity
need2, B
need2be greater than B
need1;
Described urgent Flow Control is: it is 0 to RNC request buffer data size that Node B distributes control frame by capacity;
Described upper limit Flow Control is: it is 0 to RNC request buffer data size that Node B distributes control frame by capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010267614.8A CN102387540B (en) | 2010-08-30 | 2010-08-30 | Flow control method of Iub port |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010267614.8A CN102387540B (en) | 2010-08-30 | 2010-08-30 | Flow control method of Iub port |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102387540A CN102387540A (en) | 2012-03-21 |
| CN102387540B true CN102387540B (en) | 2014-07-16 |
Family
ID=45826369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010267614.8A Active CN102387540B (en) | 2010-08-30 | 2010-08-30 | Flow control method of Iub port |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102387540B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104378305B (en) * | 2013-08-14 | 2018-05-29 | 华为终端有限公司 | A kind of method and device for controlling data flow |
| CN105744568A (en) * | 2014-12-08 | 2016-07-06 | 中兴通讯股份有限公司 | Method and device of flow control for reducing RLC (Radio Link Control) layer data retransmission |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787654A (en) * | 2004-12-09 | 2006-06-14 | 华为技术有限公司 | Method for controlling time regulating frame flow |
| CN101248609A (en) * | 2005-08-26 | 2008-08-20 | 艾利森电话股份有限公司 | Flow-control in UMTS |
-
2010
- 2010-08-30 CN CN201010267614.8A patent/CN102387540B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787654A (en) * | 2004-12-09 | 2006-06-14 | 华为技术有限公司 | Method for controlling time regulating frame flow |
| CN101248609A (en) * | 2005-08-26 | 2008-08-20 | 艾利森电话股份有限公司 | Flow-control in UMTS |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102387540A (en) | 2012-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10772081B2 (en) | Airtime-based packet scheduling for wireless networks | |
| KR101193769B1 (en) | Coordinated data flow control and buffer sharing in umts | |
| CN101340358B (en) | Flow control method, system and flow control entity | |
| CN102217365B (en) | Long term evolution base station and method for processing data service thereof | |
| KR101126802B1 (en) | Buffer status reporting | |
| RU2005131960A (en) | ACCESS PERMISSION MANAGEMENT AND RESOURCE ALLOCATION IN THE COMMUNICATION SYSTEM WITH SUPPORT OF APPLICATION STREAMS WITH AVAILABILITY OF SERVICE QUALITY REQUIREMENTS | |
| US9007901B2 (en) | Method and apparatus providing flow control using on-off signals in high delay networks | |
| CN100579107C (en) | Iub port flow control method | |
| EP2437445B1 (en) | Dynamic control of air interface throughput | |
| KR20050095307A (en) | Apparatus and method of scheduling for processing packet data in a wireless communication system | |
| CN111213403B (en) | Method and device for scheduling QoS (quality of service) flow in wireless communication system | |
| CN101521624A (en) | Method and device for distributing downlink bandwidth of lub port | |
| CN103797841A (en) | Admission control method and device | |
| CN113315720A (en) | Data flow control method, system and equipment | |
| CN103001748B (en) | A kind of method of data re-transmission and data retransmission process, equipment | |
| CN102387540B (en) | Flow control method of Iub port | |
| CN102457909B (en) | Iub port flow control method based on target buffer | |
| JP2009278532A (en) | Transmission apparatus and congestion control method | |
| US20150063106A1 (en) | Executing variable-priority jobs using multiple statistical thresholds in cellular networks | |
| JP4973452B2 (en) | Invalid data removal using WiMAX scheduler latency count | |
| CN102457908B (en) | Method for flow control of Iub port based on scheduling state | |
| CN102291779B (en) | User plane data dispatching method | |
| CN101854660B (en) | Congestion control method and device | |
| CN100459743C (en) | High-speed downlink packet access service scheduling method | |
| WO2016090607A1 (en) | Backhaul terminal, base station and flow control method for wireless network |
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: 20131211 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20131211 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 | ||
| CP03 | Change of name, title or address |
Address after: 100080 Putian Building, No. 6 North Second Street, Haidian District, Beijing Patentee after: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd. Address before: 100080 6, two North Street, Haidian District, Beijing, Haidian Patentee before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |