CN104105153B - A kind of terminal state transition method and apparatus - Google Patents
A kind of terminal state transition method and apparatus Download PDFInfo
- Publication number
- CN104105153B CN104105153B CN201310125979.0A CN201310125979A CN104105153B CN 104105153 B CN104105153 B CN 104105153B CN 201310125979 A CN201310125979 A CN 201310125979A CN 104105153 B CN104105153 B CN 104105153B
- Authority
- CN
- China
- Prior art keywords
- terminal
- msub
- mrow
- fach
- time period
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses terminal state transition method and apparatus, for any terminal, often by a period of time T, RNC then carries out following processing：The upstream data bag arrival rate λ of terminal is determined according to uplink traffic of the terminal in nearest N number of period of time T and downlink traffic respectively1With downlink data packet arrival rate λ2；The up buffered traffic Q of terminal is obtained respectively1And down buffer storage portfolio Q2；It is determined that according to λ1And Q1, and λ2And Q2Whether it is able to determine that Mean Speed R of the terminal in subsequent time period T is 0, if it is, by terminal from CELL_DCH state transition to _ FACH state；Otherwise, it determines according to λ1And Q1, and λ2And Q2Whether it is able to determine that Mean Speed R of the terminal in subsequent time period T meets R ∈ (0, ThresholdFACH], if it is, by terminal from CELL_DCH state transitions to CELL_FACH states.Using scheme of the present invention, channel resource can be made to be used appropriately.
Description
Technical field
The present invention relates to wireless domain, more particularly to a kind of terminal state transition method and apparatus.
Background technology
In third generation partner program（3GPP, 3rd Generation Partnership Project）UMTS land
Wireless access network（UTRAN, UMTS Terrestrial Radio Access Network）In system, terminal（UE, User
Equipment）Two basic manipulation modes be idle mode and connected mode, wherein, UMTS be Universal Mobile
Telecommunications System abbreviation, means UMTS.
The connection mode of terminal can be further divided into 4 kinds of different service conditions, i.e.,：CELL_DCH states, CELL_FACH
State, _ FACH state and utran registration area_paging indicator channel state.Fig. 1 is showing for the corresponding each operator scheme of existing terminal and each service condition
It is intended to.Corresponding to different service conditions, terminal will use different types of physical channel.
Wherein, in celldch state, terminal will pass through dedicated channel（DCH, Dedicated Channel）Led to
Letter；In the cell -- fach state, terminal is not take up dedicated channel, but uses RACH（RACH, Random
Access Channel）And forward access channel（FACH, Forward Access Channel）To transmit signaling message and lack
The user face data of amount；Under _ FACH state and utran registration area_paging indicator channel state, wireless access network passes through PCH（PCH,
Paging Channel）Contacted with terminal.
For the non real-time class business of packet domain, the reason such as change and cell-overload due to portfolio can all need terminal
From CELL_DCH state transitions to CELL_FACH states or _ FACH state, so as to be effectively saved DCH resources, and then
Different channel resources are used appropriately.
But, in the prior art also without a kind of preferable state transition mode of effect, so as to cause channel resource can not
It is used appropriately.
The content of the invention
In view of this, the invention provides a kind of terminal state transition method and apparatus, channel resource can be made reasonable
Utilize.
In order to achieve the above object, the technical proposal of the invention is realized in this way：
A kind of terminal state transition method,
For any terminal, often by a period of time T, radio network controller (RNC) then carries out following processing：
The upstream data bag of the terminal is determined according to uplink traffic of the terminal in nearest N number of period of time T
Arrival rate λ1, the downlink data packet of the terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T
Arrival rate λ2；
The up buffered traffic Q of the terminal is obtained respectively1And down buffer storage portfolio Q2；
It is determined that according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine that the terminal exists
Mean Speed R in subsequent time period T is 0, if it is, by the terminal from CELL_DCH state transition to CELL_PCH
State；
Otherwise, it determines according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine the end
The Mean Speed R in subsequent time period T is held to meet R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor CELL_
The access rate threshold of FACH state, if it is, by the terminal from CELL_DCH state transitions to CELL_FACH states.
A kind of RNC, including：
First processing module, for for any terminal, often by a period of time T, then notifying Second processing module
Perform itself function；
The Second processing module, for being determined according to uplink traffic of the terminal in nearest N number of period of time T
The upstream data bag arrival rate λ of the terminal1, determined according to downlink traffic of the terminal in nearest N number of period of time T
The downlink data packet arrival rate λ of the terminal2；
The up buffered traffic Q of the terminal is obtained respectively1And down buffer storage portfolio Q2；
It is determined that according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine that the terminal exists
Mean Speed R in subsequent time period T is 0, if it is, by the terminal from CELL_DCH state transition to CELL_PCH
State；
Otherwise, it determines according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine the end
The Mean Speed R in subsequent time period T is held to meet R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor CELL_
The access rate threshold of FACH state, if it is, by the terminal from CELL_DCH state transitions to CELL_FACH states.
It can be seen that, using scheme of the present invention, the flow for considering the portfolio of caching and truly occurring, so that really
Mean Speed of the terminal in subsequent time period is made, and determines whether terminal needs carry out state according to the Mean Speed
Migration, so as to may be such that channel resource more can be utilized reasonably.
Brief description of the drawings
Fig. 1 is the schematic diagram of the corresponding each operator scheme of existing terminal and each service condition.
Fig. 2 is the flow chart of terminal state transition embodiment of the method for the present invention.
Fig. 3 is the composition structural representation of RNC embodiments of the present invention.
Embodiment
For problems of the prior art, a kind of terminal state transition scheme is proposed in the present invention.
In order that technical scheme is clearer, clear, develop simultaneously embodiment referring to the drawings, to institute of the present invention
The scheme of stating is described in further detail.
Fig. 2 is the flow chart of terminal state transition embodiment of the method for the present invention.For any terminal, often by a time
Cycle T, RNC can carry out single treatment according to mode shown in Fig. 2, as shown in Fig. 2 including step 21~step 24.
Step 21：Determine that the upstream data bag of terminal is arrived according to uplink traffic of the terminal in nearest N number of period of time T
Up to rate λ1, the downlink data packet arrival rate λ of terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T2。
In actual applications, RNC can count uplink traffic of the terminal in nearest N number of period of time T respectively, and calculate N
The average of individual statistical result, regard the average calculated as λ1；In addition, RNC can count terminal respectively in nearest N number of time cycle
Downlink traffic in T, and the average of N number of statistical result is calculated, it regard the average calculated as λ2。
The specific value of the period of time T can be decided according to the actual requirements.
Wherein, i represents a nearest period of time T, P1jRepresent the uplink traffic in i-th of period of time T, P2jRepresent
Downlink traffic in i-th of period of time T,Uplink traffic average is represented,Downlink traffic average is represented, due to packet
Arrival rate approximately obey Poisson distribution, so having
It should be noted that above-mentioned determination λ1And λ2Mode by way of example only, the technology being not intended to limit the invention
Scheme, it is also possible as long as same purpose can be reached if using other manner.
Step 22：The up buffered traffic Q of terminal is obtained respectively1And down buffer storage portfolio Q2。
Wherein, up direction, RNC can control instruction to terminal sending measuring, and instruction terminal carries out measuring business volume, and connects
The measurement report that terminal is reported is received, wherein carrying the up buffered traffic Q of terminal1.Due to the caching of terminal be it is limited,
Therefore need to ensure the portfolio cached after each period of time T with certain Probability p1No more than L1, wherein, L1Represent terminal
The up buffered traffic upper limit.
Down direction, RNC can count the down buffer storage portfolio Q that itself is directed to the terminal2, similarly, since RNC caching
It is limited, it is therefore desirable to ensure the portfolio cached after each period of time T with certain Probability p2No more than L2, wherein, L2
Represent that RNC is directed to the down buffer storage portfolio upper limit of the terminal.
Step 23：It is determined that according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal in subsequent time period T
Interior Mean Speed R is 0, if it is, by terminal from CELL_DCH state transition to _ FACH state, otherwise, performing step
Rapid 24.
Mean Speed is to refer to the Mean Speed that terminal sends packet.
Wherein, if RNC is according to λ1And Q1Determine that reaching the packet of itself from terminal in subsequent time period T accumulates not
L can be exceeded1-Q1, then can determine that Mean Speed R of the terminal in subsequent time period T is 0.
Specifically, if following formula is set up：
Wherein, p1For predetermined probability value, Γ () is incomplete Gamma function, then can determine that terminal in future time
Mean Speed R in cycle T is 0.
Similarly, if RNC is according to λ2And Q2Determining the packet accumulation of incoming terminal in subsequent time period T will not surpass
Cross L2-Q2, then can determine that Mean Speed R of the terminal in subsequent time period T is 0.
Specifically, if following formula is set up：
Wherein, p2For predetermined probability value, Γ () is incomplete Gamma function, then can determine that terminal in future time
Mean Speed R in cycle T is 0.
With formula（3）Exemplified by, its physical meaning is as follows：
If Mean Speed of the terminal in subsequent time period T is 0, then, the data that will only be reached in terminal buffers
Bag, which is added, to be come, and the subsequent time period T buffered traffic upper limit is L1, current buffered traffic is Q1, accordingly, it would be desirable to ensure
The packet accumulation reached in subsequent time period T is no more than L1-Q1, the event occur probability beIt is required that this probability is less than p1, then haveOrder
The formula equal sign, which is set up, solves boundary condition, because the cumulative distribution function of Poisson distribution isEnter
Formula is can obtain after the appropriate equation processing of row（3）.
Step 24：It is determined that according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal in subsequent time period T
Interior Mean Speed R meets R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor the access speed of CELL_FACH states
Rate thresholding, if it is, by terminal from CELL_DCH state transitions to CELL_FACH states.
Wherein, if RNC is according to λ1And Q1Q can at least be handled in subsequent time period T certainly by determining1+n1-L1Number
According to bag, and handle each packet Annual distribution obey parameter beExponential distribution, then can determine that end
The Mean Speed R in subsequent time period T is held to meet R ∈ (0, ThresholdFACH]；Wherein, n1For the random of Poisson distribution
Number.
Specifically, if following formula is set up：
It then can determine that Mean Speed R of the terminal in subsequent time period T meets R ∈ (0, ThresholdFACH]。
If RNC is according to λ2And Q2Determine that terminal can at least handle Q in subsequent time period T2+n2-L2Individual packet,
And handle each packet Annual distribution obey parameter beExponential distribution, then can determine that terminal exists
Mean Speed R in subsequent time period T meets R ∈ (0, ThresholdFACH]。
Specifically, if following formula is set up：
It then can determine that Mean Speed R of the terminal in subsequent time period T meets R ∈ (0, ThresholdFACH]。
With formula（5）Exemplified by, its physical meaning is as follows：
It is Threshold in Mean SpeedFACHCritical condition under calculate border, if subsequent time period T average speed
Rate is ThresholdFACH, handle each packet Annual distribution obey parameter beExponential distribution；
Assuming that in subsequent time period T, terminal have sent n1Individual packet, and Q has been cached with present for the terminal in RNC1Number
According to bag, so problem is translated into：Calculate all Q of service1+n1-L1The time of individual packet is less than T probability, according to probability reason
Formula is can obtain by calculating（5）Form.
To sum up, using scheme of the present invention, the access rate threshold 0 and one of a _ FACH state can be pre-set
The access rate threshold Threshold of individual CELL_FACH statesFACH；If it is determined that terminal being averaged in subsequent time period T
Speed R is 0, then RNC can trigger RRC reconfiguration courses, by terminal from CELL_DCH state transition to _ FACH state；If really
Make Mean Speed R of the terminal in subsequent time period T and meet R ∈ (0, ThresholdFACH], then RNC can trigger RRC weights
Configuration process, by terminal from CELL_DCH state transitions to CELL_FACH states；If it is determined that terminal is in subsequent time period T
Interior Mean Speed R is neither 0, is also unsatisfactory for R ∈ (0, ThresholdFACH], then it can maintain the CELL_DCH states of terminal not
Become.
Based on above-mentioned introduction, Fig. 3 is the composition structural representation of RNC embodiments of the present invention.As shown in figure 3, including：
First processing module, for for any terminal, often by a period of time T, then notifying Second processing module
Perform itself function；
Second processing module, for determining terminal according to uplink traffic of the terminal in nearest N number of period of time T
Row packet arrival rate λ1, the downlink data packet of terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T
Arrival rate λ2；
The up buffered traffic Q of terminal is obtained respectively1And down buffer storage portfolio Q2；
It is determined that according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal being averaged in subsequent time period T
Speed R is 0, if it is, by terminal from CELL_DCH state transition to _ FACH state；
Otherwise, it determines according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal in subsequent time period T
Mean Speed R meet R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor the access speed of CELL_FACH states
Thresholding, if it is, by terminal from CELL_DCH state transitions to CELL_FACH states.
Wherein, it may particularly include in Second processing module：
First processing units, for determining terminal according to uplink traffic of the terminal in nearest N number of period of time T
Row packet arrival rate λ1, the downlink data packet of terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T
Arrival rate λ2, and by λ1And λ2It is sent to second processing unit；The up buffered traffic Q of terminal is obtained respectively1And it is descending slow
Deposit portfolio Q2, and by Q1And Q2It is sent to second processing unit；
Second processing unit, for determining according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal next
Mean Speed R in period of time T is 0, if it is, by terminal from CELL_DCH state transition to _ FACH state；
Otherwise, it determines according to λ1And Q1, and λ2And Q2Whether it is able to determine terminal in subsequent time period T
Mean Speed R meet R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor the access speed of CELL_FACH states
Thresholding, if it is, by terminal from CELL_DCH state transitions to CELL_FACH states.
It can further comprise again in first processing units（It is not shown to simplify accompanying drawing）：
First processing subelement, for counting uplink traffic of the terminal in nearest N number of period of time T respectively, and calculates N
The average of individual statistical result, regard the average calculated as λ1；Statistics terminal is descending in nearest N number of period of time T respectively
Flow, and the average of N number of statistical result is calculated, it regard the average calculated as λ2；And by λ1And λ2It is sent to second processing list
Member；
Second processing subelement, for controlling to indicate to terminal sending measuring, the up cache business that receiving terminal is reported
Measure Q1, and count the down buffer storage portfolio Q for itself being directed to terminal2；By Q1And Q2It is sent to second processing unit.
It can further comprise again in second processing unit（It is not shown to simplify accompanying drawing）：
3rd processing subelement, for when according to λ1And Q1Determine in subsequent time period T and the number of itself is reached from terminal
According to bag accumulation not over L1-Q1, and according to λ2And Q2Determine the packet accumulation of incoming terminal in subsequent time period T not
L can be exceeded2-Q2When, it is 0 to determine Mean Speed R of the terminal in subsequent time period T, and terminal is moved from CELL_DCH states
Move on to _ FACH state；Wherein, L1Represent the up buffered traffic upper limit of terminal, L2Represent RNC for the descending of the terminal
The buffered traffic upper limit；
Fourth process subelement, for when according to λ1And Q1Determining can at least be handled in subsequent time period T certainly
Q1+n1-L1Individual packet, and handle each packet Annual distribution obey parameter beIndex point
Cloth, and according to λ2And Q2Determine that terminal can at least handle Q in subsequent time period T2+n2-L2Individual packet, and processing is every
The Annual distribution of one packet obeys parameterExponential distribution when, determine terminal future time week
Mean Speed R in phase T meets R ∈ (0, ThresholdFACH], and by terminal from CELL_DCH state transition to CELL_FACH
State；Wherein, n1And n2It is the random number of Poisson distribution.
The specific workflow of Fig. 3 shown device embodiments refer to the respective description in preceding method embodiment, herein
Repeat no more.
In summary, presently preferred embodiments of the present invention is these are only, is not intended to limit the scope of the present invention.
Within the spirit and principles of the invention, any modification, equivalent substitution and improvements made etc., should be included in the present invention's
Within protection domain.
Claims (11)
1. a kind of terminal state transition method, it is characterised in that
For any terminal, often by a period of time T, radio network controller (RNC) then carries out following processing：
Determine that the upstream data bag of the terminal is reached according to uplink traffic of the terminal in nearest N number of period of time T
Rate λ1, determine that the downlink data packet of the terminal is reached according to downlink traffic of the terminal in nearest N number of period of time T
Rate λ2；
The up buffered traffic Q of the terminal is obtained respectively1And down buffer storage portfolio Q2；
It is determined that according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine the terminal in lower a period of time
Between Mean Speed R in cycle T be 0, if it is, by the terminal from CELL_DCH state transition to _ FACH state；
Otherwise, it determines according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine that the terminal exists
Mean Speed R in subsequent time period T meets R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor CELL_FACH
The access rate threshold of state, if it is, by the terminal from CELL_DCH state transitions to CELL_FACH states.
2. according to the method described in claim 1, it is characterised in that
The upstream data bag that the terminal is determined according to uplink traffic of the terminal in nearest N number of period of time T
Arrival rate λ1Including：
The RNC counts uplink traffic of the terminal in nearest N number of period of time T respectively, and calculates N number of statistical result
Average, regard the average calculated as the λ1；
The downlink data packet that the terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T
Arrival rate λ2Including：
The RNC counts downlink traffic of the terminal in nearest N number of period of time T respectively, and calculates N number of statistical result
Average, regard the average calculated as the λ2。
3. according to the method described in claim 1, it is characterised in that
The up buffered traffic Q for obtaining the terminal1Including：
The RNC controls to indicate to the terminal sending measuring, and receives the up buffered traffic Q that the terminal is reported1；
The down buffer storage portfolio Q for obtaining the terminal2Including：
The RNC counts the down buffer storage portfolio Q that itself is directed to the terminal2。
4. the method according to claim 1,2 or 3, it is characterised in that
It is described according to the λ1With the Q1Determine that Mean Speed R of the terminal in subsequent time period T includes for 0：
If the RNC is according to the λ1With the Q1Determine in subsequent time period T and the packet of itself is reached from the terminal
Accumulation is not over L1-Q1, it is determined that Mean Speed R of the terminal in subsequent time period T is 0；Wherein, the L1Table
Show the up buffered traffic upper limit of the terminal；
It is described according to the λ2With the Q2Determine that Mean Speed R of the terminal in subsequent time period T includes for 0：
If the RNC is according to the λ2With the Q2Determine that the packet that the terminal is reached in subsequent time period T is accumulated not
L can be exceeded2-Q2, it is determined that Mean Speed R of the terminal in subsequent time period T is 0；Wherein, the L2Represent described
RNC is directed to the down buffer storage portfolio upper limit of the terminal.
5. method according to claim 4, it is characterised in that
It is described according to the λ1With the Q1Determine and reach the packet accumulation of itself in subsequent time period T from the terminal
Not over L1-Q1Including：
The λ1With the Q1Meet：Wherein, the p1For predetermined probability value,
The Γ () is incomplete Gamma function；
It is described according to the λ2With the Q2Determine that the packet accumulation that the terminal is reached in subsequent time period T will not surpass
Cross L2-Q2Including：
The λ2With the Q2Meet：Wherein, the p2For predetermined probability
Value.
6. the method according to claim 1,2 or 3, it is characterised in that
It is described according to the λ1With the Q1Determine Mean Speed R of the terminal in subsequent time period T meet R ∈ (0,
ThresholdFACH] include：
If the RNC is according to the λ1With the Q1Q can at least be handled in subsequent time period T certainly by determining1+n1-L1
Individual packet, and handle each packet Annual distribution obey parameter beExponential distribution, it is determined that
Mean Speed R of the terminal in subsequent time period T meets R ∈ (0, ThresholdFACH]；
Wherein, the L1Represent the up buffered traffic upper limit of the terminal, the n1For the random number of Poisson distribution；
It is described according to the λ2With the Q2Determine Mean Speed R of the terminal in subsequent time period T meet R ∈ (0,
ThresholdFACH] include：
If the RNC is according to the λ2With the Q2Determine that the terminal can at least handle Q in subsequent time period T2+
n2-L2Individual packet, and handle each packet Annual distribution obey parameter beExponential distribution, then
Determine that Mean Speed R of the terminal in subsequent time period T meets R ∈ (0, ThresholdFACH]；
Wherein, the L2Represent that the RNC is directed to the down buffer storage portfolio upper limit of the terminal, the n2For Poisson distribution
Random number.
7. method according to claim 6, it is characterised in that
It is described according to the λ1With the Q1Q can at least be handled in subsequent time period T certainly by determining1+n1-L1Individual data
Wrap, and handle the Annual distribution obedience parameter of each packet and beExponential distribution include：
The λ 1 and the Q1 are met：
<mrow>
<mi>g</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>&lambda;</mi>
<mn>1</mn>
</msub>
<mo>,</mo>
<msub>
<mi>Q</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mo>&infin;</mo>
</munderover>
<mfrac>
<mrow>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>&lambda;</mi>
<mn>1</mn>
</msub>
<mi>T</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msup>
<msup>
<mi>e</mi>
<mrow>
<msub>
<mi>&lambda;</mi>
<mn>1</mn>
</msub>
<mi>T</mi>
</mrow>
</msup>
</mrow>
<mrow>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>!</mo>
</mrow>
</mfrac>
<mo>[</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mrow>
<mi>&Gamma;</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>Q</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<msub>
<mi>L</mi>
<mn>1</mn>
</msub>
<mo>,</mo>
<mfrac>
<mi>T</mi>
<msub>
<mi>Threshold</mi>
<mi>FACH</mi>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mrow>
<mo>(</mo>
<msub>
<mi>Q</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>n</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<msub>
<mi>L</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>!</mo>
</mrow>
</mfrac>
<mo>]</mo>
<mo>&le;</mo>
<msub>
<mi>p</mi>
<mn>1</mn>
</msub>
<mo>;</mo>
</mrow>
Wherein, the p1 is predetermined probability value, and the Γ () is incomplete Gamma function；
It is described according to the λ2With the Q2Determine that the terminal can at least handle Q in subsequent time period T2+n2-L2It is individual
Packet, and handle each packet Annual distribution obey parameter beExponential distribution include：
The λ2With the Q2Meet：
<mrow>
<mi>g</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>&lambda;</mi>
<mn>2</mn>
</msub>
<mo>,</mo>
<msub>
<mi>Q</mi>
<mn>2</mn>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mi>&Sigma;</mi>
<mrow>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mo>&infin;</mo>
</munderover>
<mfrac>
<mrow>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>&lambda;</mi>
<mn>2</mn>
</msub>
<mi>T</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msup>
<msup>
<mi>e</mi>
<mrow>
<msub>
<mi>&lambda;</mi>
<mn>2</mn>
</msub>
<mi>T</mi>
</mrow>
</msup>
</mrow>
<mrow>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>!</mo>
</mrow>
</mfrac>
<mo>[</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mrow>
<mi>&Gamma;</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>Q</mi>
<mn>2</mn>
</msub>
<mo>+</mo>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>L</mi>
<mn>2</mn>
</msub>
<mo>,</mo>
<mfrac>
<mi>T</mi>
<msub>
<mi>Threshold</mi>
<mi>FACH</mi>
</msub>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mrow>
<mo>(</mo>
<msub>
<mi>Q</mi>
<mn>2</mn>
</msub>
<mo>+</mo>
<msub>
<mi>n</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<msub>
<mi>L</mi>
<mn>2</mn>
</msub>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>!</mo>
</mrow>
</mfrac>
<mo>]</mo>
<mo>&le;</mo>
<msub>
<mi>p</mi>
<mn>2</mn>
</msub>
<mo>;</mo>
</mrow>
Wherein, the p2 is predetermined
Probable value.
8. a kind of radio network controller (RNC), it is characterised in that including：
First processing module, for for any terminal, often by a period of time T, then notifies Second processing module to perform
Itself function；
The Second processing module, determine for the uplink traffic according to the terminal in nearest N number of period of time T described in
The upstream data bag arrival rate λ of terminal1, according to being determined downlink traffic of the terminal in nearest N number of period of time T
The downlink data packet arrival rate λ of terminal2；
The up buffered traffic Q of the terminal is obtained respectively1And down buffer storage portfolio Q2；
It is determined that according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine the terminal in lower a period of time
Between Mean Speed R in cycle T be 0, if it is, by the terminal from CELL_DCH state transition to _ FACH state；
Otherwise, it determines according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine that the terminal exists
Mean Speed R in subsequent time period T meets R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor CELL_FACH
The access rate threshold of state, if it is, by the terminal from CELL_DCH state transitions to CELL_FACH states.
9. RNC according to claim 8, it is characterised in that the Second processing module includes：
First processing units, for determining the terminal according to uplink traffic of the terminal in nearest N number of period of time T
Upstream data bag arrival rate λ1, the terminal is determined according to downlink traffic of the terminal in nearest N number of period of time T
Downlink data packet arrival rate λ2, and by the λ1With the λ2It is sent to second processing unit；The upper of the terminal is obtained respectively
Row buffered traffic Q1And down buffer storage portfolio Q2, and by the Q1With the Q2It is sent to the second processing unit；
The second processing unit, for determining according to the λ1With the Q1, and the λ2With the Q2Whether it is able to
It is 0 to determine Mean Speed R of the terminal in subsequent time period T, if it is, by the terminal from CELL_DCH shapes
State moves to _ FACH state；
Otherwise, it determines according to the λ1With the Q1, and the λ2With the Q2Whether it is able to determine that the terminal exists
Mean Speed R in subsequent time period T meets R ∈ (0, ThresholdFACH], wherein, ThresholdFACHFor CELL_FACH
The access rate threshold of state, if it is, by the terminal from CELL_DCH state transitions to CELL_FACH states.
10. RNC according to claim 9, it is characterised in that the first processing units include：
First processing subelement, for counting uplink traffic of the terminal in nearest N number of period of time T respectively, and calculates N
The average of individual statistical result, regard the average calculated as the λ1；The terminal is counted respectively in nearest N number of period of time T
Interior downlink traffic, and the average of N number of statistical result is calculated, it regard the average calculated as the λ2；And by the λ1With it is described
λ2It is sent to the second processing unit；
Second processing subelement, for controlling to indicate to the terminal sending measuring, receives the up caching that the terminal is reported
Portfolio Q1, and count the down buffer storage portfolio Q for itself being directed to the terminal2；By the Q1With the Q2It is sent to described
Two processing units.
11. the RNC according to claim 9 or 10, it is characterised in that the second processing unit includes：
3rd processing subelement, for when according to the λ1With the Q1Determine in subsequent time period T from terminal arrival
The packet of itself is accumulated not over L1-Q1, and according to the λ2With the Q2Determine and institute is reached in subsequent time period T
The packet for stating terminal is accumulated not over L2-Q2When, it is 0 to determine Mean Speed R of the terminal in subsequent time period T,
And by the terminal from CELL_DCH state transition to _ FACH state；Wherein, the L1Represent the up slow of the terminal
Deposit the portfolio upper limit, the L2Represent that the RNC is directed to the down buffer storage portfolio upper limit of the terminal；
Fourth process subelement, for when according to the λ1With the Q1Determine and at least can certainly in subsequent time period T
Handle Q1+n1-L1Individual packet, and handle each packet Annual distribution obey parameter beIndex
Distribution, and according to the λ2With the Q2Determine that the terminal can at least handle Q in subsequent time period T2+n2-L2It is individual
Packet, and handle each packet Annual distribution obey parameter beExponential distribution when, determine institute
State Mean Speed R of the terminal in subsequent time period T and meet R ∈ (0, ThresholdFACH], and by the terminal from CELL_
DCH state transitions are to CELL_FACH states；Wherein, the n1And n2It is the random number of Poisson distribution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310125979.0A CN104105153B (en) | 2013-04-12 | 2013-04-12 | A kind of terminal state transition method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310125979.0A CN104105153B (en) | 2013-04-12 | 2013-04-12 | A kind of terminal state transition method and apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104105153A CN104105153A (en) | 2014-10-15 |
| CN104105153B true CN104105153B (en) | 2017-09-12 |
Family
ID=51672875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310125979.0A Active CN104105153B (en) | 2013-04-12 | 2013-04-12 | A kind of terminal state transition method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104105153B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301915B (en) * | 2014-10-27 | 2017-09-19 | 大唐移动通信设备有限公司 | Resource distribution method of adjustment and radio network controller |
| WO2016070437A1 (en) * | 2014-11-07 | 2016-05-12 | 华为技术有限公司 | State transition method, user equipment, and radio network controller |
| CN105187236B (en) * | 2015-08-12 | 2019-01-15 | 广东睿江云计算股份有限公司 | A kind of method of network flow migration |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101076138A (en) * | 2006-05-17 | 2007-11-21 | 中兴通讯股份有限公司 | Wireless bearing transferring method for WCDMA system |
| CN101442771A (en) * | 2007-11-23 | 2009-05-27 | 大唐移动通信设备有限公司 | Method and apparatus for implementing PS business status transfer |
| CN101662419A (en) * | 2008-08-27 | 2010-03-03 | 华为技术有限公司 | Method, device and system for realizing resource reservation |
| WO2011098163A1 (en) * | 2010-02-10 | 2011-08-18 | Research In Motion Limited | Method and apparatus for state/mode transitioning |
| CN102724689A (en) * | 2012-06-05 | 2012-10-10 | 中国联合网络通信集团有限公司 | Method and system for optimizing wireless state transition |
-
2013
- 2013-04-12 CN CN201310125979.0A patent/CN104105153B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101076138A (en) * | 2006-05-17 | 2007-11-21 | 中兴通讯股份有限公司 | Wireless bearing transferring method for WCDMA system |
| CN101442771A (en) * | 2007-11-23 | 2009-05-27 | 大唐移动通信设备有限公司 | Method and apparatus for implementing PS business status transfer |
| CN101662419A (en) * | 2008-08-27 | 2010-03-03 | 华为技术有限公司 | Method, device and system for realizing resource reservation |
| WO2011098163A1 (en) * | 2010-02-10 | 2011-08-18 | Research In Motion Limited | Method and apparatus for state/mode transitioning |
| CN102724689A (en) * | 2012-06-05 | 2012-10-10 | 中国联合网络通信集团有限公司 | Method and system for optimizing wireless state transition |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104105153A (en) | 2014-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102027794B (en) | Base station device and communication control method | |
| EP2887726A1 (en) | Layer 2 measurement and result processing method and device under heterogeneous network | |
| EP2800445B1 (en) | Method, device, and communication system for controlling dormancy timer | |
| CN104811961B (en) | A kind of method and system LTE Wireless network congestion perception and alleviated | |
| CN103974436B (en) | The method of adjustment and device of a kind of dispatching priority | |
| CN104092522A (en) | Base station device and communication control method | |
| CN102611989B (en) | Minimum road test method and apparatus | |
| US20170006437A1 (en) | Group communication apparatus and method | |
| EP3163817A1 (en) | Wireless congestion control method and device | |
| CN101277176B (en) | Method, equipment and system for adjusting mixed automatic retransmission time | |
| US20150245269A1 (en) | Method for Uplink Softer Handover, User Equipment, and Base Station | |
| CN104105153B (en) | A kind of terminal state transition method and apparatus | |
| EP2943013B1 (en) | Admission control method and device for wireless communication network | |
| CN103906098A (en) | Paging parameter self-optimizing method in long term evolution network and system thereof | |
| EP2268075A1 (en) | Method and apparatus for adjustment of transmission time interval | |
| CN103945462A (en) | Assistance service cell configuration method and device | |
| EP2458910B1 (en) | Method and apparatus for detecting performance of random access channel | |
| CN101212771A (en) | Load control method, device and system | |
| CN102013963B (en) | Data transmission method and device | |
| CN101127725A (en) | Method, device and system for channel unit scheduling | |
| CN101494888B (en) | Channel migration method based on traffic | |
| CN101111039A (en) | Business measuring control method used for high speed descending grouping access system | |
| CN103906097B (en) | A kind of synchronous/asynchronous processing method and processing device | |
| CN106454954A (en) | Method and device of transmitting SIB7 by RIM message | |
| CN104159301B (en) | A kind of bearing mode selection method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |