CN101610551B - Resource scheduling method for HSUPA - Google Patents

Resource scheduling method for HSUPA Download PDF

Info

Publication number
CN101610551B
CN101610551B CN2008101153244A CN200810115324A CN101610551B CN 101610551 B CN101610551 B CN 101610551B CN 2008101153244 A CN2008101153244 A CN 2008101153244A CN 200810115324 A CN200810115324 A CN 200810115324A CN 101610551 B CN101610551 B CN 101610551B
Authority
CN
China
Prior art keywords
dispatch
scheduling
dispatching
wait
resource
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN2008101153244A
Other languages
Chinese (zh)
Other versions
CN101610551A (en
Inventor
韦玮
李汉涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Potevio Information Technology Co Ltd
Original Assignee
Potevio Institute of Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Potevio Institute of Technology Co Ltd filed Critical Potevio Institute of Technology Co Ltd
Priority to CN2008101153244A priority Critical patent/CN101610551B/en
Publication of CN101610551A publication Critical patent/CN101610551A/en
Application granted granted Critical
Publication of CN101610551B publication Critical patent/CN101610551B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a resource scheduling method for HSUPA, which comprises the following steps: presetting user categories comprising UE for retransmission, UE not scheduled for a long time, UE of which the GBR is not ensured, and UE normally scheduled, which orderly correspond to four scheduling priorities sorted from high to low; in the resource scheduling, determining the user category of each UE to be scheduled and the corresponding scheduling priority; and according to the maximum user scheduling number, available resources and the order of the scheduling priorities from high to low, orderly performing resource scheduling on the UE to be scheduled. The method can avoid phenomena of untimely power control, loss of synchronism of the UE and low beamforming performance of an antenna caused by not scheduling the UE for a long time, and can ensure to meet the QoS requirement of service and improve scheduling performance.

Description

The resource regulating method of a kind of HSUPA
Technical field
The present invention relates to the scheduling of resource technology, particularly the resource regulating method of a kind of HSUPA.
Background technology
In order to improve up access capability, 3GPP introduces the HSUPA technology, and its main target is to improve the service efficiency of uplink air interface capacity, strengthens cell throughout.HSDPA combines with HSUPA realization high speed symmetric data is communicated by letter, and supports business such as multimedia, video conference and VoIP.Similar to HSDPA, the HSUPA key technology comprises NodeB fast dispatch, Adaptive Modulation and Coding AMC and mixes re-transmission HARQ automatically.
The purpose of NodeB fast dispatch is to be the up shared resource of UE reasonable distribution according to certain principle among the HSUPA, and good dispatching algorithm can the optimization system resource allocation, makes system obtain maximum throughput.And in scheduler, the dispatching priority that how to determine UE is again the core of scheduler, seeks rational HSUPA dispatching priority strategy, and then to obtain more optimal scheduling strategy be very important.
Existing HSUPA scheduling scheme mainly comprises following a few class:
1. polling algorithm (RR): each UE of sequential scheduling, for each UE distributes identical service time.
Though this algorithm has been considered service fairness, do not consider the channel condition difference of different UEs, thereby cause systematic function relatively poor.
2. max carrier to interference algorithm (MAX C/I): select chip energy/interferences (C/I) maximum, promptly the best UE of channel quality serves.
Though this algorithm can obtain best systematic function, service fairness is the poorest.
3. direct ratio fair algorithm (PF): consider channel conditions and the Mean Speed of UE in the scheduling process, its priority account form is obeyed formula (1):
Priority ( n ) = Rate Req ( n , t ) Rate Avg ( n , t ) - - - ( 1 )
Wherein, Rate Req(n is that user n is at the real time rate of moment t request NodeB for its distribution t); Rate Avg(n is the ascending idle port Mean Speed of user n t), Rate when it is subjected to dispatching continuously Avg(n t) increases gradually, thereby the priority of this UE is reduced, so single UE can always not accept service.
4. the improvement algorithm on direct ratio fair algorithm basis.Its priority account form such as formula (2):
Priority ( n ) = w 1 × Rate Req ( n , t ) Rate Avg ( n , t ) + w 2 × UCQ ( n , t ) - - - ( 2 )
W1 in the following formula, w2 are different weights, UCQ (n t) embodies the channel quality of UEn at moment t, and by the data rate and the signal to noise ratio decision of unit transmitted power, computational methods are seen following formula:
UCQ ( n , t ) = Rate ( n , t ) TxPw ( n , t ) × SIR ( n , t ) - - - ( 2 - 3 )
For the power control instruction of E-PUCH channel, and the synchronic command when configurating downlink is not followed the DPCH channel all needs by the schedule information transmission; In addition, when configurating downlink was not followed the DPCH channel, the upstream data that sends by UE carried out the estimation of electric wave arrival direction DOA.Therefore for guarantee UE synchronously, the beam shaping performance of power control performance and antenna, should avoid certain UE to can not get the situation of dispatching for a long time.But in above-mentioned four kinds of existing HSUPA dispatching methods, only consider factors such as the channel quality of UE and UE fairness, do not consider UE synchronously, power control and beam shaping requirement, this may cause UE can't be dispatched for a long time and phenomenons such as the power control that causes is untimely, UE step-out and beam shaping decreased performance.
In addition, all do not consider professional qos requirement in above-mentioned four kinds of existing HSUPA dispatching methods, this may cause some professional QoS to be difficult to satisfy.
In addition, except that polling algorithm, the signal to noise ratio that existing dispatching algorithm all directly transmit according to UE last time is assessed current channel quality.Because UE sends the adjustment that data are subjected to uplink power control in the HSUPA system, twice transmitted power in front and back may not be identical, therefore according to the channel quality of the signal to noise ratio assessment current UE of transmission last time, will cause assessing inaccurate, thereby influence scheduling performance.
Summary of the invention
In view of this, the invention provides the resource regulating method of a kind of HSUPA, can avoid that UE can not get for a long time dispatching that the power control that causes is untimely, the phenomenon of UE step-out and antenna beam excipient decreased performance, the qos requirement of guaranteed service is met simultaneously, thereby improves scheduling performance.
For achieving the above object, the present invention adopts following technical scheme:
The resource regulating method of a kind of HSUPA comprises:
Presetting user categories comprises and retransmits UE, do not dispatch UE, GBR be not guaranteed UE and normal consistency UE and corresponding successively four class dispatching priorities of ordering from high to low for a long time;
When carrying out scheduling of resource, determine class of subscriber and corresponding dispatching priority that each waits to dispatch UE;
According to maximum dispatched users number and available resources,, be followed successively by UE to be dispatched and carry out scheduling of resource according to dispatching priority order from high to low.
Preferably, describedly determine that each waits that the class of subscriber of dispatching UE is:
Describedly wait to dispatch UE loading error occurring last time when NodeB detects, and the re-transmission of this misdata bag is not when reaching maximum retransmission, determines describedly to wait to dispatch UE for retransmitting UE.
Preferably, describedly determine to wait that the class of subscriber of dispatching UE is:
When the described class of subscriber of dispatching UE of waiting does not belong to re-transmission UE and the described time t that waits to dispatch UE wait scheduling WaitT satisfies condition Wait〉=f Int er* T Max_int erThe time, determine the described class of subscriber of waiting to dispatch UE for not dispatching UE for a long time, wherein, f Int erBe default interval factor, T Max_int erThe longest wait at interval and UE described to be dispatched carries out maximum duration that electric wave arrival direction DOA the estimates minimum value at interval of carrying out the control of uplink synchronous and power for UE described to be dispatched.
Preferably, for the UE that does not carry out uplink as yet, t WaitSend the time interval of dispatch request first by E-RUCCH apart from this UE for current time;
For the UE that carries out transmitting uplink data, t WaitBe a nearest uplink, the time span that UE does not obtain dispatching.
Preferably, this method further comprises: at class of subscriber when not dispatching UE for a long time, according to T Max_int erWith t WaitThe difference size carry out dispatching priority ordering, difference is more little, dispatching priority is high more, T Max_int erFor UE described to be dispatched carry out the control of uplink synchronous and power the longest wait at interval and UE described to be dispatched carry out maximum duration that electric wave arrival direction DOA estimates at interval in minimum value, t WaitFor waiting for the time of scheduling.
Preferably, describedly determine to wait that the class of subscriber of dispatching UE is:
Wait to dispatch UE and do not belong to and retransmit UE and do not dispatch UE and described Mean Speed of waiting to dispatch UE highest priority logical channel business for a long time when described During less than its GBR speed, determine that UE described to be dispatched is the GBR UE that is not guaranteed.
Preferably, obtain described Mean Speed of waiting to dispatch UE highest priority logical channel business
Figure DEST_PATH_GSB00000472056200022
Mode be:
Figure DEST_PATH_GSB00000472056200023
Wherein, t is a current time, R i(t) be the momentary rate of described highest priority logical channel business, 1/T cBe filter factor.
Preferably, be GBR when not being guaranteed UE at class of subscriber, carry out the dispatching priority ordering according to the QoS grade of highest priority logical channel business.
Preferably, the mode of obtaining the QoS grade of described highest priority logical channel business is: according to SPI, ARP and the GBR parameter and the corresponding weights of highest priority logical channel in the NBAP message, determine the QoS grade of described highest priority logical channel business.
Preferably, when sorting according to described QoS grade, if described QoS grade is identical, then the buffer data size according to highest priority logical channel carries out described ordering, and buffer data size is big more, and dispatching priority is high more.
Preferably, describedly determine to wait that the class of subscriber of dispatching UE is:
Wait to dispatch UE and do not belong to and retransmit UE, when not dispatching UE and GBR and be not guaranteed UE for a long time, determine that UE described to be dispatched is normal consistency UE when described.
Preferably, when class of subscriber was normal consistency UE, according to by the described channel quality of waiting to dispatch UE, the priority that average ascending idle port speed and professional QoS grade are determined was carried out the dispatching priority ordering.
Preferably, utilize the channel quality of waiting to dispatch UE, average ascending idle port speed and professional QoS grade are determined the described priority P rio that waits to dispatch UE k(t) be:
Prio k ( t ) = Bits _ Per _ Slot × f 1 ( QoS ) R ‾ i ′ ( t ) ,
Wherein, Bits_Per_Slot is the channel quality estimation result who waits to dispatch UE under the current channel circumstance, f 1(QoS) be the pairing priority weighting of QoS of survice grade of waiting to dispatch UE,
Figure DEST_PATH_GSB00000472056200025
Be described average ascending idle port speed of waiting to dispatch UE.
Preferably, when the buffer data size of the described highest priority logical channel of waiting to dispatch UE greater than 0, f 1(Qos) equal high-rise and wait to dispatch the qos parameter of business configuration of the highest priority logical channel of UE for this;
When the described buffer data size of waiting to dispatch the highest priority logical channel of UE equals 0, f 1(Qos) equal this and wait to dispatch the UE buffer data size greater than in each logic channel of 0, the qos parameter of the business of the logic channel that priority is the highest and the product of default α, the value of α should make f 1(Qos) the qos parameter value than other UE highest priority logical channel is little.
Preferably, obtain and wait that the mode of dispatching the UE channel quality comprises:
Determine that by described first maximum power that power capability the limited gain of waiting to dispatch UE and for suppressing second maximum power gain that presence of intercell interference limited the minimum value during described first maximum power gain and described second maximum power are gained is as target power gain;
Type of service according to target power gain and current scheduling UE, determine all optional spreading factor SF and modulation coding mode MCS combination, corresponding every kind of SF and MCS combination, estimate the SIR of current MCS mode correspondence, and utilize estimated SIR to determine the bit number of single slot transmission of current SF and MCS combination correspondence;
Make up in the bit number of corresponding single slot transmission at all optional SF and MCS, select maximum as the channel quality estimation result.
Preferably, described according to maximum dispatched users number and available resources, according to dispatching priority order from high to low, be followed successively by UE to be dispatched and carry out scheduling of resource and be:
Dispatch successively retransmitting UE, and after each scheduling, the resource of distributing is deducted from available resources;
The long-term not UE of scheduling is carried out scheduling of resource successively, and satisfy power control, synchronously and the minimum available resource units estimated of DOA for its distribution, after each scheduling, the resource of distribution is deducted from available resources;
Wait to dispatch among the UE at except that the UE that retransmits UE and long-term not scheduling other, according to priority order from high to low, be followed successively by UE to be dispatched and carry out scheduling of resource, and after whenever determining a dispatched users and carrying out scheduling of resource, to from available resources, deduct for the resource that this user distributes, judge whether current dispatched users number reaches maximum dispatched users number, judge the current surplus resources that whether exists, if current dispatched users number reaches maximum dispatched users number, and/or the current surplus resources that do not exist, then finish scheduling, otherwise continue to carry out scheduling of resource according to priority order from high to low.
As seen from the above technical solution, among the present invention, presetting user categories comprises and retransmits UE, do not dispatch UE, GBR be not guaranteed UE and normal consistency UE and corresponding successively four class dispatching priorities of ordering from high to low for a long time; When carrying out scheduling of resource, determine class of subscriber and corresponding dispatching priority that each waits to dispatch UE; According to dispatching priority order from high to low, be followed successively by each UE to be dispatched and carry out scheduling of resource.By as seen above-mentioned, the ordering of dispatching priority is set according to class of subscriber among the present invention, for synchronous, power control and beam shaping performance can't guaranteed UE, and QoS of survice requires the UE that is not met to dispose high dispatching priority, thereby avoid that UE can not get for a long time dispatching that the power control that causes is untimely, the phenomenon of UE step-out and beam shaping decreased performance, and QoS of survice requires the phenomenon that can't satisfy, improves scheduling performance.
Description of drawings
Fig. 1 is the overview flow chart of resource regulating method among the present invention.
Fig. 2 is the particular flow sheet of resource regulating method in the embodiment of the invention.
Embodiment
For making purpose of the present invention, technological means and advantage clearer,, the present invention is described in further details below in conjunction with accompanying drawing.
Basic thought of the present invention is: preferentially can't guaranteed UE to synchronous, power control and beam shaping performance, and the UE that professional qos requirement is not met carries out scheduling of resource, thus the phenomenon that UE step-out, beam shaping decreased performance and the professional qos requirement of avoiding existing dispatching method to bring can't satisfy.
Fig. 1 is the overview flow chart of the resource regulating method of HSUPA among the present invention.As shown in Figure 1, this method flow comprises:
Step 101, presetting user categories comprise and retransmit UE, do not dispatch UE, GBR be not guaranteed UE and normal consistency UE and corresponding successively four class dispatching priorities of ordering from high to low for a long time.
Four kinds of class of subscribers are set, are respectively and retransmit UE, do not dispatch UE, GBR be not guaranteed UE and normal consistency UE for a long time, the dispatching priority of the UE correspondence of these four kinds of class of subscribers reduces successively.Thereby guarantee to retransmit UE, do not dispatch UE and GBR this three class of UE UE that is not guaranteed for a long time and preferentially obtain service, require the phenomenon that can't satisfy with the step-out phenomenon of avoiding the user and QoS of survice.
Step 102 when carrying out scheduling of resource, is determined class of subscriber and corresponding dispatching priority that each waits to dispatch UE.
When in Transmission Time Interval (TTI), carrying out scheduling of resource, determine that each waits to dispatch the class of subscriber of UE in this TTI, thereby determine corresponding dispatching priority.
Step 103 according to maximum dispatched users number and available resources, according to dispatching priority order from high to low, is followed successively by UE to be dispatched and carries out scheduling of resource.
In this step,, treat scheduling UE and carry out scheduling of resource according to determining dispatching priority order from high to low in the step 102, just at first scheduling retransmits UE, UE is not dispatched in scheduling for a long time then, next dispatches the not guaranteed UE of GBR, dispatches normal consistency UE at last; Simultaneously, maximum dispatched users number and available resources also have certain limitation in the current TTI, also need to satisfy this restriction when therefore carrying out scheduling of resource.
So far, the resource regulating method flow process among the present invention finishes.
Next, four class of subscribers and each the self-corresponding dispatching priority to setting of the present invention describes.
1, retransmits UE
Retransmit UE and refer to that promptly last time, data packets for transmission was detected as mistake, and the number of retransmissions of this misdata bag does not reach the UE of maximum retransmission.The UE dispatching priority of this classification is the highest, and this is because present NodeB is generally the wrong UE of biography distribution and retransmits with transmitting identical resource first, therefore answers priority scheduling re-transmission UE, is taken by other UE to avoid retransmitting resource; Consider the time delay demand of data retransmission, answer priority scheduling to retransmit UE; Therefore HARQ process number is limited, should retransmit misdata as early as possible, until receiving that ACK feedback back discharges its HARQ process that takies, avoids the HARQ process to be retransmitted data occupancy and influences the situation of new data transmission efficient; In addition, consider the buffer memory ability of terminal, answer priority scheduling to retransmit UE so that misdata obtains retransmitting as early as possible.
2, do not dispatch UE for a long time
The long-term UE that do not dispatch promptly refers to the UE that dispatches in certain Preset Time section, the dispatching priority of this type of UE comes second, reason is as follows: the power control instruction of E-PUCH channel, and system not the instruction of the uplink synchronous during configurating downlink DCH channel all need carry by the E-AGCH channel, in addition, not during configurating downlink DCH channel, is to guarantee antenna beam excipient performance in system, and the upstream data that needs regularly to send by UE carry out the estimation of ripple arrival direction DOA.If UE can not get scheduling for a long time, power control and synchronic command can't transmit on time, also can't regularly carry out DOA and estimate, thereby cause the beam shaping decreased performance, this not only can exert an influence to the qos requirement and the systematic function of business, more can cause the UE step-out and make its can't obtain the service.
3, guarantee bit rate (GBR) UE that is not guaranteed
The GBR UE that is not guaranteed refers to that promptly the actual transfer rate of customer service does not reach the UE of GBR, for guaranteeing professional basic qos requirement, the dispatching priority of this type of UE is come the 3rd.
4, normal consistency UE
Class of subscriber in aforementioned 1~3 refers to the classification under the unusual scheduling UE, and other except that these unusual scheduling UE are waited to dispatch UE and all belonged to normal consistency UE, and the dispatching priority of normal consistency UE is come the 4th.
In above-mentioned arbitrary class of subscriber, can also continue difference is waited that the dispatching priority of dispatching the UE correspondence carries out further careful division, to determine the dispatching sequence between such UE.
Below just the resource regulating method that carries out according to the setting of above-mentioned class of subscriber and dispatching priority among the present invention is described in further details by specific embodiment.
Fig. 2 is the particular flow sheet of the resource regulating method of HSUPA in the embodiment of the invention.As shown in Figure 2, this method comprises:
Step 201, presetting user categories comprise and retransmit UE, do not dispatch UE, GBR be not guaranteed UE and normal consistency UE and corresponding successively four dispatching priorities of ordering from high to low for a long time.
The operation of this step just repeats no more as previously mentioned here.
Step 202 when carrying out scheduling of resource in current TTI, is upgraded the ascending idle port Mean Speed of each the logic channel business wait to dispatch UE and the average ascending idle port speed of each UE.
Next, treat ordering and the scheduling of resource that scheduling UE carries out dispatching priority.
Step 203 is upgraded retransmission queue.
If certain UE Data Detection mistake, and do not reach maximum retransmission, then this UE being placed the retransmission queue tail end, the class of subscriber of UE is for retransmitting UE, corresponding the highest dispatching priority in this formation.
Step 204 is adjudicated successively to each UE in the retransmission queue.If all retransmit UE and all obtain scheduling in current TTI, change step 206 over to, other UE to be dispatched are carried out prioritization; Otherwise change step 205 over to, current re-transmission UE is carried out scheduling of resource.
Step 205 according to the current re-transmission of the scheduling of resource UE that distributed of transmission first, and is deleted this UE from retransmission queue, will deduct from system's available resources for the resource that it distributed.
By above-mentioned steps 203~205, determine at first to wait to dispatch in the current TTI that class of subscriber because the dispatching priority of this class UE is the highest, therefore directly carries out scheduling of resource to these UE that determine for retransmitting all UE of UE among the UE.
Because the number of UE is necessarily smaller or equal to maximum dispatched users number in the retransmission queue, and the required resource of UE is also necessarily smaller or equal to available resources in the retransmission queue, therefore during the UE in the scheduling retransmission queue, can judge one by one whether dispatched users number and surplus resources satisfy restriction, but directly dispatch.
Step 206, other UE except that retransmitting UE calculate dispatching priority for current TTI, and according to priority sequence arrangement from high to low.
In this step, at first determine to wait to dispatch the class of subscriber of UE, thereby determine the dispatching priority of correspondence according to class of subscriber except that retransmitting other of UE.
At first, judge that described other wait to dispatch UE and whether belong to and do not dispatch UE for a long time,, sort by the high more principle of short more priority remaining time if this type of UE priority comes present first place.
Specifically judging whether to belong to the mode of not dispatching UE for a long time is: determine that this UE waits for the time t of scheduling Wait, t if this time satisfies condition Wait〉=f Inter* T Max_inter, then determine to belong to and do not dispatch UE for a long time, otherwise do not belong to.Wherein, T Max_interFor the minimum value among following two value A, the B: A is the longest wait interval that UE described to be dispatched carries out uplink synchronous and power control, B is that UE described to be dispatched carries out the maximum duration interval that electric wave arrival direction DOA estimates; f InterBe default interval factor, span is 0~1, and the value of this interval factor is big more, and the wait scheduling time that illustrates that the user can tolerate is long more.Wait scheduling time t as UE WaitSurpass f Inter* T Max_interThe time, synchronously, power control or beam shaping performance can't guarantee, therefore, with it as being only second to the dispatched users classification that retransmits priority.
Wherein, for the UE that does not carry out uplink as yet, t WaitSend the time interval of dispatch request first by E-RUCCH apart from this UE for current time; For the UE that carries out transmitting uplink data, t WaitBe a nearest uplink, the time span that UE does not obtain dispatching.
Class of subscriber for do not dispatch for a long time UE wait to dispatch among the UE, according to T Max_interWith t WaitThe difference size carry out dispatching priority ordering, difference is more little, dispatching priority is high more.
Next, for except that retransmitting UE and not dispatching other UE to be dispatched the UE for a long time, judge whether to belong to the GBR UE that is not guaranteed, if its priority is only second to the above-mentioned UE that do not dispatch for a long time.This type of UE is by highest priority logical channel QoS ranking compositor.
Concrete judge whether UE belongs to the be not guaranteed mode of UE of GBR and be: the average ascending idle port speed Ri (t) that obtains UE highest priority logical channel business; If this average ascending idle port speed R i(t) less than the GBR of described highest priority logical channel business, determine that then this UE belongs to the GBR UE that is not guaranteed, otherwise, do not belong to.Wherein, the average ascending idle port speed R of highest priority logical channel business i(t) obtain manner can for: R ‾ i ( t ) = ( 1 - 1 T c ) × R ‾ i ( t - 1 ) + 1 T c × R i ( t ) , Wherein, t is a current time, R i(t) be the momentary rate of described highest priority logical channel business, 1/T cBe filter factor.
Class of subscriber be GBR be not guaranteed UE wait to dispatch among the UE, carry out dispatching priority ordering according to the QoS grade of highest priority logical channel business.If the QoS grade is identical, then the buffer data size according to highest priority logical channel carries out the dispatching priority ordering, and buffer data size is big more, and dispatching priority is high more.Wherein, the QoS grade of each logic channel business is by the SPI of respective logical channels in the NBAP message, ARP, and parameters such as GBR determine, are obtained the QoS grade of respective logical channels business by these parameters and its concrete weight mapping.
At last, remainingly wait to dispatch UE and all belong to normal consistency UE, carry out the dispatching priority ordering of this class of subscriber inside.
In normal consistency UE, when carrying out the dispatching priority ordering, can utilize the direct ratio fair algorithm of describing in the background technology and improve algorithm.Perhaps preferably, can further consider user's qos parameter, determine the priority of normal consistency UE according to following mode:
Prio k ( t ) = Bits _ Per _ Slot × f 1 ( QoS ) R ‾ i ′ ( t )
Wherein, R i' (t) be the average ascending idle port speed of UE, when UE carry out simultaneously a plurality of when professional, this R i' (t) be the average ascending idle port speed sum of each business.
f 1(Qos) priority weighting that the QoS of survice grade of waiting to dispatch UE determined of serving as reasons.Particularly, if the buffer data size of UE highest priority logical channel is greater than 0, f 1(Qos) value equals the qos parameter of high level for the business configuration of highest priority logical channel; If the buffer data size of UE highest priority logical channel equals 0, f 1(Qos) value equals this UE buffer data size greater than in each logic channel of 0, the qos parameter of the business of the logic channel that priority is the highest (this information reports NodeB by UE by dispatch request) and the product of default α, and this moment, the value of α should make f 1(Qos) the qos parameter value than other UE highest priority logical channel is little, thereby guarantees when this UE highest priority logical channel business is met, and preferentially guarantees the business transmission of other UE highest priority logical channel.
Bits_Per_Slot is the maximum number bits that each time slot can pass under the current channel circumstance, the channel quality of this parameter reflection UE.Obtaining of concrete Bits_Per_Slot parameter can be determined according to the signal to noise ratio of last time transmission according to existing mode, perhaps preferably, can determine in the following manner:
Determine first maximum power that power capability limited gain P by UE UPH, and for suppressing second maximum power gain P that presence of intercell interference limited Infer, the minimum value during the gain of described first maximum power and described second maximum power gained is as target power gain; Type of service according to target power gain and current scheduling UE, determine all optional spreading factor SF and modulation coding mode MCS combination, corresponding every kind of SF and MCS combination, estimate the SIR of current MCS mode correspondence, and utilize estimated SIR to determine the bit number of single slot transmission of current SF and MCS combination correspondence; Make up in the bit number of corresponding single slot transmission at all optional SF and MCS, select maximum as the channel quality estimation result.
Below, above-mentioned channel quality estimation mode is specifically introduced.Wherein, determine first maximum power gain P UPHMode can be P UPH=UPH+ α E_fore+ β Fore+ Δ Harq_fore-TPC * step, wherein, TPC * step is current time NodeB carries out closed-loop power control to UE result; α E_foreAnd β ForeThe power gain that SF that UE adopts when being respectively last transmission the and MCS bring respectively; Δ Harq_foreUE is passed the pairing power gain of type of service when transmitting by the last time, and the power gain α that SF and its brought of UE employing eBetween the power gain β that corresponding relation and MCS and its brought between corresponding relation all be pre-configured.
Determine second maximum power gain P InferMode can for: determine the current α that waits to dispatch UE e+ β maximum P Δ max, wherein, α eThe power gain that SF and MCS brought that adopts when being respectively current this transmission of waiting to dispatch UE with β; With the pre-configured current pairing power gain Δ of type of service current to be passed of waiting to dispatch UE HarqWith P Δ maxSum is as described second maximum power gain P Infer, current type of service to be passed is exactly that the highest and buffer data size of priority of logical channels is greater than zero professional type of service.Wherein according to P Δ max=ReferenceRTWP * φ-(P Rev_foreE_foreForeHarq_fore)-TPC * step-Δ HarqCalculate P Δ maxIn this formula, Reference RTWP is the maximum up reception gross power in pre-configured adjacent sub-district among the NodeB, and φ is the arest neighbors sub-district of this UE of reporting of described current UE to be dispatched and the path loss ratio of this sub-district, P Rev_foreSend data to the received power that reaches described NodeB, Δ during for the current last time transmission of waiting to dispatch UE HarqBe the pairing power gain of the current type of service to be passed of this UE.
Corresponding every kind of SF and MCS combination, estimate that the concrete operations of the SIR of current MCS mode correspondence are: when UE when dispatching first, with the pairing SIR lower limit of benchmark MCS as estimated SIR; When UE is non-when dispatching first, by formula S IR=SIR Fore+ TPC * step+ β-β Fore+ Δ HarqHarq_foreDetermine the SIR of current MCS mode correspondence.Wherein, SIR ForeBe the sir value of the last transmission of UE, β is the pairing power gain of current MCS mode.The SIR of the current MCS mode correspondence that concrete estimation obtains is the sir value corresponding to the code channel of SF=16.
Next determine the bit number of single slot transmission of every kind of SF and MCS combination correspondence according to the SIR that estimates, specifically according to existing mode time slot.At last, in the bit number of all single slot transmission, select maximum as the channel quality estimation result.
When determining channel quality in the manner described above, be to determine, therefore can solve the inaccurate problem of the channel quality estimation of describing in the background technology according to the signal to noise ratio of this transmission of estimating.
So far, determine that the class of subscriber of UE and the step of carrying out dispatching priority ordering finish.Next, proceed concrete scheduling of resource.
Step 207 judges whether the current residual resource is 0, and whether the number of users of scheduling reach maximum dispatched users number, if the current residual resource is 0 or reached maximum dispatched users number, then finishes this TTI scheduling; Otherwise execution in step 208 is dispatched other UE.
Step 208 judges whether do not dispatch UE for a long time all obtains scheduling in current TTI, if, execution in step 210, UE dispatches to other classifications; Otherwise execution in step 209 is not dispatched dispatching IE for a long time.
Step 209 is not dispatched UE for a long time and is dispatched successively by its dispatching priority, and UE of every scheduling will deduct from resource pool by its branch resource, and these resources can not be given other UE again in current TTI, and return step 207.
Specifically do not dispatch UE for a long time and dispatch successively, promptly according to T by its dispatching priority Max_interWith t WaitThe ascending order of difference dispatch.When each is not dispatched UE for a long time and carries out resource allocation, preferably,, UE satisfies power control, synchronously and the minimum available resource units estimated of DOA for distributing.
Step 210 judges whether the current residual resource is 0, and whether the number of users of scheduling reach maximum dispatched users number, if the current residual resource is 0 or reached maximum dispatched users number, then finishes this TTI scheduling; Otherwise execution in step 211 is dispatched other UE.
Step 211 judges that whether the GBR UE that is not guaranteed all obtains scheduling in current TTI, if, execution in step 213, UE dispatches to other classifications; Otherwise execution in step 212 is dispatched the GBR UE that is not guaranteed.
Step 212 is dispatched by its dispatching priority and is dispatched successively the GBR UE that is not guaranteed, and UE of every scheduling will deduct from resource pool by its branch resource, and these resources can not be given other UE again in current TTI, and return step 210.
Wherein, the GBR UE that is not guaranteed dispatches successively by its dispatching priority, promptly dispatch,, then dispatch according to the descending order of the buffer data size of highest priority logical channel if the QoS grade is identical according to the QoS grade of the highest logic channel business.
Step 213 judges whether the current residual resource is 0, and whether the number of users of scheduling reach maximum dispatched users number, if the current residual resource is 0 or reached maximum dispatched users number, then finishes this TTI scheduling; Otherwise execution in step 214 is dispatched other UE.
Step 214 judges whether the UE of normal consistency all obtains scheduling in current TTI, if, finish this TTI scheduling, otherwise execution in step 215, UE dispatches to normal consistency.
Step 215 is dispatched by dispatching priority order from high to low successively to normal consistency UE, and UE of every scheduling will deduct from resource pool by its branch resource, and these resources can not be given other UE again in current TTI, and return step 213.
Wherein, normal consistency UE dispatches successively by dispatching priority order from high to low, promptly dispatches according to the priority that calculates.
So far, HSUPA scheduling of resource flow process of the present invention finishes.By as seen above-mentioned, in the HSUPA resource regulating method of the present invention, classification by dispatching priority, for the beam shaping performance of synchronous, power control and antenna can't guaranteed user, and QoS of survice requires unsatisfied user to dispose higher priority level, thereby the power control of avoiding existing dispatching algorithm to bring is untimely, user's step-out, and antenna beam excipient decreased performance and QoS of survice require to guarantee phenomenon.Further, when in said method, carrying out channel quality estimation, according to maximum power gain the signal to noise ratio of transmission last time is revised, adopted the signal to noise ratio of revising to assess current channel quality, transmitted signal to noise ratio last time and assess the inaccurate problem of channel quality thereby solved direct employings.
Being preferred embodiment of the present invention only below, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (16)

1. the resource regulating method of a HSUPA is characterized in that, this method comprises:
Presetting user categories comprise retransmit UE, for a long time do not dispatch UE, guarantee bit rate GBR be not guaranteed UE and normal consistency UE and corresponding successively four class dispatching priorities of ordering from high to low;
When carrying out scheduling of resource, determine class of subscriber and corresponding dispatching priority that each waits to dispatch UE;
According to maximum dispatched users number and available resources,, be followed successively by UE to be dispatched and carry out scheduling of resource according to dispatching priority order from high to low.
2. method according to claim 1 is characterized in that, describedly determines that each waits that the class of subscriber of dispatching UE is:
Describedly wait to dispatch UE loading error occurring last time when NodeB detects, and the re-transmission of this misdata bag is not when reaching maximum retransmission, determines describedly to wait to dispatch UE for retransmitting UE.
3. method according to claim 1 is characterized in that, describedly determines to wait that the class of subscriber of dispatching UE is:
When the described class of subscriber of dispatching UE of waiting does not belong to re-transmission UE and the described time t that waits to dispatch UE wait scheduling WaitT satisfies condition Wait〉=f Int er* T Max_int erThe time, determine the described class of subscriber of waiting to dispatch UE for not dispatching UE for a long time, wherein, f Int erBe default interval factor, T Max_int erThe longest wait at interval and UE described to be dispatched carries out maximum duration that electric wave arrival direction DOA the estimates minimum value at interval of carrying out the control of uplink synchronous and power for UE described to be dispatched.
4. method according to claim 3 is characterized in that, for the UE that does not carry out uplink as yet, t WaitSend the time interval of dispatch request first by enhanced uplink random access channel E-RUCCH apart from this UE for current time;
For the UE that carries out transmitting uplink data, t WaitBe a nearest uplink, the time span that UE does not obtain dispatching.
5. method according to claim 2 is characterized in that, this method further comprises: at class of subscriber when not dispatching UE for a long time, according to T Max_int erWith t WaitThe difference size carry out dispatching priority ordering, difference is more little, dispatching priority is high more, T Max_int erFor UE described to be dispatched carry out the control of uplink synchronous and power the longest wait at interval and UE described to be dispatched carry out maximum duration that electric wave arrival direction DOA estimates at interval in minimum value, t WaitFor waiting for the time of scheduling.
6. method according to claim 1 is characterized in that, describedly determines to wait that the class of subscriber of dispatching UE is:
Wait to dispatch UE and do not belong to and retransmit UE and do not dispatch UE and described Mean Speed of waiting to dispatch UE highest priority logical channel business for a long time when described
Figure RE-FSB00000498821300011
During less than its GBR speed, determine that UE described to be dispatched is the GBR UE that is not guaranteed.
7. method according to claim 6 is characterized in that, obtains described Mean Speed of waiting to dispatch UE highest priority logical channel business
Figure RE-FSB00000498821300012
Mode be:
Figure RE-FSB00000498821300013
Wherein, t is a current time, R i(t) be the momentary rate of described highest priority logical channel business, 1/T cBe filter factor.
8. method according to claim 6 is characterized in that, is GBR when not being guaranteed UE at class of subscriber, carries out the dispatching priority ordering according to the QoS grade of highest priority logical channel business.
9. method according to claim 8, it is characterized in that, the mode of obtaining the QoS grade of described highest priority logical channel business is: according to dispatching priority indication SPI, distribution/maintenance priority ARP and the GBR parameter and the corresponding weights of highest priority logical channel in the base station application part agreement NBAP message, determine the QoS grade of described highest priority logical channel business.
10. method according to claim 8 is characterized in that, when sorting according to described QoS grade, if described QoS grade is identical, then the buffer data size according to highest priority logical channel carries out described ordering, and buffer data size is big more, and dispatching priority is high more.
11. method according to claim 1 is characterized in that, describedly determines to wait that the class of subscriber of dispatching UE is:
Wait to dispatch UE and do not belong to and retransmit UE, when not dispatching UE and GBR and be not guaranteed UE for a long time, determine that UE described to be dispatched is normal consistency UE when described.
12. method according to claim 11 is characterized in that, when class of subscriber was normal consistency UE, according to by the described channel quality of waiting to dispatch UE, the priority that average ascending idle port speed and professional QoS grade are determined was carried out the dispatching priority ordering.
13. method according to claim 12 is characterized in that, utilizes the channel quality of waiting to dispatch UE, average ascending idle port speed and professional QoS grade are determined the described priority P rio that waits to dispatch UE k(t) be:
Figure FSB00000472056100031
Wherein, Bits_Per_Slot is the channel quality estimation result who waits to dispatch UE under the current channel circumstance, f 1(QoS) be the pairing priority weighting of QoS of survice grade of waiting to dispatch UE, Be described average ascending idle port speed of waiting to dispatch UE.
14. method according to claim 13 is characterized in that, when the buffer data size of the described highest priority logical channel of waiting to dispatch UE greater than 0, f 1(Qos) equal high-rise and wait to dispatch the qos parameter of business configuration of the highest priority logical channel of UE for this;
When the described buffer data size of waiting to dispatch the highest priority logical channel of UE equals 0, f 1(Qos) equal this and wait to dispatch the UE buffer data size greater than in each logic channel of 0, the qos parameter of the business of the logic channel that priority is the highest and the product of default α, the value of α should make f 1(Qos) the qos parameter value than other UE highest priority logical channel is little.
15. method according to claim 13 is characterized in that, obtains and waits that the mode of dispatching the UE channel quality comprises:
Determine that by described first maximum power that power capability the limited gain of waiting to dispatch UE and for suppressing second maximum power gain that presence of intercell interference limited the minimum value during described first maximum power gain and described second maximum power are gained is as target power gain;
Type of service according to target power gain and current scheduling UE, determine all optional spreading factor SF and modulation coding mode MCS combination, corresponding every kind of SF and MCS combination, estimate the SIR of current MCS mode correspondence, and utilize estimated SIR to determine the bit number of single slot transmission of current SF and MCS combination correspondence;
Make up in the bit number of corresponding single slot transmission at all optional SF and MCS, select maximum as the channel quality estimation result.
16. method according to claim 1 is characterized in that, and is described according to maximum dispatched users number and available resources, according to dispatching priority order from high to low, is followed successively by UE to be dispatched and carries out scheduling of resource and be:
Dispatch successively retransmitting UE, and after each scheduling, the resource of distributing is deducted from available resources;
The long-term not UE of scheduling is carried out scheduling of resource successively, and satisfy power control, synchronously and the minimum available resource units estimated of DOA for its distribution, after each scheduling, the resource of distribution is deducted from available resources;
Except that retransmit and the UE of long-term not scheduling other wait to dispatch among the UE, according to priority order from high to low, be followed successively by UE to be dispatched and carry out scheduling of resource, and after whenever determining a dispatched users and carrying out scheduling of resource, to from available resources, deduct for the resource that this user distributes, judge whether current dispatched users number reaches maximum dispatched users number, judge the current surplus resources that whether exists, if current dispatched users number reaches maximum dispatched users number, and/or the current surplus resources that do not exist, then finish scheduling, otherwise continue to carry out scheduling of resource according to priority order from high to low.
CN2008101153244A 2008-06-20 2008-06-20 Resource scheduling method for HSUPA Expired - Fee Related CN101610551B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008101153244A CN101610551B (en) 2008-06-20 2008-06-20 Resource scheduling method for HSUPA

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008101153244A CN101610551B (en) 2008-06-20 2008-06-20 Resource scheduling method for HSUPA

Publications (2)

Publication Number Publication Date
CN101610551A CN101610551A (en) 2009-12-23
CN101610551B true CN101610551B (en) 2011-12-07

Family

ID=41484076

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008101153244A Expired - Fee Related CN101610551B (en) 2008-06-20 2008-06-20 Resource scheduling method for HSUPA

Country Status (1)

Country Link
CN (1) CN101610551B (en)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101778477A (en) * 2010-03-08 2010-07-14 上海华为技术有限公司 Scheduling resource distributing method and base station
CN102340824B (en) * 2010-07-22 2015-04-01 中兴通讯股份有限公司 Multi-carrier high-speed data business scheduling method and device
CN102387597B (en) * 2010-08-30 2014-04-09 普天信息技术研究院有限公司 Method for scheduling downlink data transmission
CN102404805B (en) * 2010-09-15 2014-03-19 普天信息技术研究院有限公司 Method and device for obtaining radio interface rate of user
CN102404745B (en) * 2010-09-17 2014-08-27 普天信息技术研究院有限公司 Method for carrying out dynamic traffic scheduling on users
CN102457973B (en) * 2010-10-27 2014-05-07 普天信息技术研究院有限公司 GBR (Guaranteed BitRate) service scheduling method
CN102685918B (en) * 2011-03-08 2015-06-24 鼎桥通信技术有限公司 Network accessing method
CN102300322B (en) * 2011-07-28 2015-02-04 大唐移动通信设备有限公司 Method for reducing high speed uplink packet access (HSUPA) user interference and device
CN102983955B (en) * 2012-11-13 2015-08-19 电信科学技术研究院 A kind of dispatching method of small bandwidth service and device
CN103229580B (en) * 2012-12-21 2016-09-28 华为技术有限公司 The method and apparatus of scheduling of resource
WO2015077990A1 (en) * 2013-11-29 2015-06-04 Telefonaktiebolaget L M Ericsson (Publ) A method in a network and network node for co-scheduling in a network
CN104918333B (en) * 2014-03-13 2019-02-05 普天信息技术有限公司 A kind of dispatching method for Non-GBR business
CN104066193A (en) * 2014-06-06 2014-09-24 电信科学技术研究院 Scheduling method and device
CN105101372B (en) * 2015-07-13 2019-03-01 北京大学 A kind of subscriber resource distribution method based on inner-loop power control performance
CN106413108B (en) * 2015-07-30 2019-10-25 华为技术有限公司 Resource regulating method and device
CN106162738B (en) * 2016-09-27 2019-09-17 京信通信系统(中国)有限公司 Control plane resource regulating method and device
AU2016424838B2 (en) * 2016-09-28 2020-09-10 Huawei Technologies Co., Ltd. Method for feeding back ack/nack information for downlink data and related device
CN108260160B (en) * 2016-12-29 2021-10-22 普天信息技术有限公司 Method and system for scheduling users
CN108418652A (en) * 2017-02-09 2018-08-17 工业和信息化部电信研究院 A kind of modulation coding method of data service
CN109286989A (en) * 2017-07-21 2019-01-29 中兴通讯股份有限公司 HSDPA pre-computation dispatching method, device, equipment and storage medium
CN111918328A (en) * 2019-05-09 2020-11-10 大唐移动通信设备有限公司 User equipment resource scheduling method and device
CN112383964B (en) * 2020-10-21 2022-07-19 武汉虹信科技发展有限责任公司 Single-core multi-task scheduling method and system of wireless network physical layer

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043638A (en) * 2006-03-20 2007-09-26 上海贝尔阿尔卡特股份有限公司 Base station dispatcher, resource distribution module and dispatch control method for HSUPA
CN101087160A (en) * 2006-06-08 2007-12-12 大唐移动通信设备有限公司 A dispatching method and device for uplink enhanced priority
CN101132631A (en) * 2006-06-21 2008-02-27 华为技术有限公司 Method and base station for allocating system resource according to user service quality

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043638A (en) * 2006-03-20 2007-09-26 上海贝尔阿尔卡特股份有限公司 Base station dispatcher, resource distribution module and dispatch control method for HSUPA
CN101087160A (en) * 2006-06-08 2007-12-12 大唐移动通信设备有限公司 A dispatching method and device for uplink enhanced priority
CN101132631A (en) * 2006-06-21 2008-02-27 华为技术有限公司 Method and base station for allocating system resource according to user service quality

Also Published As

Publication number Publication date
CN101610551A (en) 2009-12-23

Similar Documents

Publication Publication Date Title
CN101610551B (en) Resource scheduling method for HSUPA
CN100586220C (en) Method of packet scheduling in high speed downlink packet access network
CN101132631B (en) Method and base station for allocating system resource according to user service quality
JP4510826B2 (en) Method for scheduling uplink transmission of user equipment and base station
CN101686196B (en) Service scheduling method and service scheduling device
CN1853386B (en) Virtually centralized uplink scheduling
CN101114851B (en) Power control method and device for HSDPA
CN1953350B (en) A method to perform the uplink dispatching and united dispatching uplink and downlink aiming at the user
CN101345647B (en) Channel establishing method for high speed ascending packet data transmission, and network controller
CN101521942B (en) Method for dispatching high-speed uplink package access system
EP1635522A1 (en) Obtaining a relative indicator for use in scheduling uplink transmissions
CN101926133A (en) Client/server adaptation scheme for communications traffic
CN100442915C (en) Dispatching method for high speed data transmission in mobile communication system
WO2006104347A1 (en) Method of managing radio resources and node b apparatus implementing the same
EP1864405A1 (en) Method and apparatus for signaling maximum ue transmitter power information to base station for scheduling of uplink packet transmission in a mobile communication system
CN112637911B (en) Resource allocation method and system for eMB and urllc in coexistence in 5G system
EP2088816A2 (en) Radio communication system, radio communication method, and base station
WO2008080264A1 (en) Scheduling method and system for hsupa
EP2490477B1 (en) Method and device for assigning authentication of a high speed uplink packet access (hsupa) network
CN101257371B (en) Method and device for processing wireless communication uplink grouping scheduling
CN101527965B (en) Method and system for improving uplink service quality
CN102404832B (en) Method for allocating uplink power resources and device for allocating uplink power resources
CN102104969A (en) Resource scheduling method and base station
CN102149145A (en) Method for controlling non-scheduled resource in high-speed uplink packet access (HSUPA) service
CN101146318B (en) Uplink load control fault correction 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
C14 Grant of patent or utility model
GR01 Patent grant
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: 20130304

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20130304

Address after: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District

Patentee after: CHINA POTEVIO CO.,LTD.

Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No.

Patentee 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: 20130313

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20130313

Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No.

Patentee after: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd.

Address before: 100080, No. two, 2 street, Zhongguancun science and Technology Park, Beijing, Haidian District

Patentee before: CHINA POTEVIO CO.,LTD.

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource dispatching method of HSUPA

Effective date of registration: 20131210

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd.

Registration number: 2013990000954

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
C56 Change in the name or address of the patentee

Owner name: POTEVIO INFORMATION TECHNOLOGY CO., LTD.

Free format text: FORMER NAME: PUTIAN IT TECH INST CO., LTD.

CP01 Change in the name or title of a patent holder

Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No.

Patentee after: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No.

Patentee before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd.

PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20151102

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2013990000954

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PM01 Change of the registration of the contract for pledge of patent right

Change date: 20151102

Registration number: 2013990000954

Pledgor after: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Pledgor before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd.

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource dispatching method of HSUPA

Effective date of registration: 20151105

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2015990000948

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20161008

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2015990000948

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource dispatching method of HSUPA

Effective date of registration: 20161011

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2016990000859

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20170802

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2016990000859

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource dispatching method of HSUPA

Effective date of registration: 20171012

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2017990000948

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20180112

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2017990000948

PC01 Cancellation of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Resource dispatching method of HSUPA

Effective date of registration: 20180117

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2018990000033

PE01 Entry into force of the registration of the contract for pledge of patent right
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20181017

Granted publication date: 20111207

Pledgee: Bank of Beijing Limited by Share Ltd. Century City Branch

Pledgor: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd.

Registration number: 2018990000033

PC01 Cancellation of the registration of the contract for pledge of patent right
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20111207