CN101686196B - Service scheduling method and service scheduling device - Google Patents

Abstract

The invention discloses a service scheduling method, which relates to service scheduling in a wireless communication system, and is proposed for solving the problem that services in prior service queue scheduling are irrational. The service scheduling method adopts a scheme comprising: according to at least one of transmission time delay parameters C<Td> of service queues, scheduling priority indication parameters C<SPI> of the service queues and user terminal scheduling related parameters C<UE>, determining the priorities of the service queues to be scheduled; and allocating physical resources to the service queues to be scheduled according to an order from the high priority to the low priority, and performing queue scheduling. The invention simultaneously discloses a device for implementing the method, which comprises a priority parameter calculation unit used for determining the priorities of the service queues to be scheduled, and a physical resource allocating and scheduling unit used for allocating the physical resources to the service queues to be scheduled according to the order from the high priority to the low priority, and performing the queue scheduling. In the invention, the determined priorities of the service queues fully guarantee the QoS of the services and improve the performance of the service scheduling.

Description

Business scheduling method and device

Technical field

The present invention relates to the service dispatching technology in the wireless communication system, relate to high speed downlink packet or rather and insert business scheduling method and device in (HSDPA, High Speed Downlink Packet Access) system.

Background technology

Following wireless cellular network will support the integrated multimedia of different service quality (QoS, Quality of Service) demand to use.Provide QoS to distinguish and be considered to a kind of good solution for the growing multimedia demand of wireless terminal user.In the HSDPA system, a high speed descending sharing channel is shared by a plurality of users of same sub-district, has the difference of traffic performance between a plurality of users, and unique user also possibly transmit several kinds of business datums that have different QoS to require simultaneously.Such as, user can carry out FTP (File Transfer Protocol) download in browsing video Streaming Media etc.Therefore, the scheduler among the Node B will be simultaneously dispatched the different terminal user (UE) of the different QoS grades of service and shared HSDPA down link.Do not have to improve resource utilization as wide as possible under the congested prerequisite, under the heavier congested prerequisite of load, to satisfy user's as much as possible QoS demand.

Below the HSDPA technology is carried out brief account.

HSDPA changes to adapt to subscriber channel through the data volume that adaptive scheduling sent apace, thereby improves user's average downlink transmission data rate.Dispatching algorithm is being controlled shared resource allocation, and each sending time slots has determined to have determined the performance of whole system to a great extent for the user provides the service quality of business and the quantity of service-user.Should be during scheduling mainly based on channel condition; Data volume and professional situation such as priority level to be sent such as consideration simultaneously; And give full play to adaptive coding and modulating (AMC; Adaptive Modulation and Coding) and mix the ability of automatic repeat requests (HARQ, Hybrid AutomaticRepeat Request).In the HSDPA system, in order to make system's short term variations of adaptive channel better, dispatching algorithm is positioned among the MAC-hs rather than radio network controller (RNC, Radio Network Controller) of Node B.Below present main dispatching algorithm is introduced.

Repeating query (RR, Round-Robin) algorithm.This algorithm calls each user circularly, says that from the scheduling probability all same probability of each user takies Service Source (time slot, power etc.).During each the scheduling, do not consider the situation that the user was served in the past, be memoryless property mode.The repeating query algorithm is the most fair algorithm, and promptly each user probability of obtaining serving equates.But the resource utilization of algorithm is not high, can obtain service because work as the situation of certain user's channel condition very severe yet, and therefore, the throughput ratio of system is lower.

Max carrier to interference (C/I, Carrier-To-Interference Ratio) algorithm.Maximum C/I algorithm is only selected the user of max carrier to interference C/I when selecting transmission user, promptly let the best CU resource transmission data of channel condition, after this subscriber channel variation, selects the best user of other channels again.The base station is always the best user's service of this transmission time channel condition.The throughput that maximum C/I algorithm obtains is the limiting value of throughput; But in GSM; The residing position of user is different, and the signal strength signal intensity that it received is different, and maximum C/I algorithm must have been looked after the user from the base station is near, channel is good; Other then can't obtain service from base station user far away, and the service coverage of base station is very little.This dispatching algorithm is least fair.

Fair (PF, the Proportional-Fair Scheduler) algorithm of direct ratio.This algorithm is to transmit for a long time on the roughly fair basis of data throughout keeping the user, considers simultaneously to utilize the short-term channel situation of change to increase efficiency of transmission.Be that system obtains a kind of compromise of maximum throughput rate and fairness.With respect to the round-robin scheduling algorithm, the max carrier to interference algorithm can obtain bigger cell throughout.But adopt the system of max carrier to interference algorithm, the user of service concentrates on the zone very near apart from Node B, and cell coverage area dwindles.And the direct ratio fair algorithm sends data in moment to the user with best channel condition; Can reach the highest user data rate and maximum data throughout in each moment like this; But also consider fairness simultaneously to each user; Be main with channel condition in a short time, long process is taken into account all users' throughput.Also consider data volume to be sent such as user, sent situation such as professional type, priority.

In these dispatching algorithms, repeating query algorithm fairness is best, but throughput of system is lower; Maximum C/I algorithm has best throughput of system performance, but fairness is relatively poor.Therefore people seek some compromise algorithms between these two kinds of algorithms, on the basis that guarantees fairness, seek the maximization of throughput, so occurred such as direct ratio fair algorithm, the maximum C/I algorithm of rate-constrained, feedback controlled dispatching algorithm etc.

Though the fairness that above-mentioned miscellaneous service dispatching method has adopted corresponding scheduling rule and considered resource allocation to business features; Because above-mentioned dispatching algorithm all is based on the scheduling of resource to different UEs, do not consider professional such as guaranteeing QoS characteristic demands such as bit rate, time delay.Rich based on data service, the data service of UE can have different QoS characteristic demands, therefore in order to guarantee the QoS demand of different business, must carry out resource control to the class of service of multiple QoS demand.In addition, in case system loading is heavier, the user can occurs in the system and can not get scheduling, the situation that QoS is not being met.Under this situation, dispatching algorithm also should be experienced angle from the user except considering fairness and QoS demand, considers that sacrificial section user's speed satisfies user's as much as possible QoS demand.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of business scheduling method and device, with the QoS of further raising service dispatching.

For achieving the above object, technical scheme of the present invention is achieved in that

A kind of business scheduling method comprises:

Transmission time delay parameters C according to service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation, be followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling.

Wherein, said C ^TdConfirm that mode is: confirm propagation delay time Td according to the UE under the service queue, Td>0 o'clock, C ^TdGet positively related value, Td with Td≤0 o'clock, C ^TdValue is 0; Said C ^SPIValue is the grade point of service queue priority; Said C ^UEConfirm by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.

Wherein, said C ^TdGet positively related value, be specially with Td:

Get a Td and a constant sum as C ^TdValue or get Td and a constant long-pending as C ^TdValue.

Wherein, confirm propagation delay time Td, be specially according to UE under the service queue:

Td _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that the automatic repeat requests HARQ process of mixed once retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting.

Wherein, C ^UEConfirm by following mode:

$C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _KjX (t) is the weighted value of the said service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight [j] is the basic weights of the service queue of j for priority; γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

Wherein, confirm that the said related parameter of priority of treating the dispatching services formation is two when above, for said parameter is provided with weight coefficient.

Wherein, said weight coefficient is set to fixed value.

Wherein, said weight coefficient dynamically arranges according to the priority of said parameter.

Wherein, said weight coefficient dynamically arranges according to the priority of said parameter, is specially:

The weight coefficient of the parameters C 1 that priority is minimum is made as constant m, and the weight coefficient A2 of the parameters C 2 that priority is time high is made as max, and (C1 * m), the weight coefficient A3 of the parameters C 3 that priority is the highest are made as MAX (max (C1 * m), max (A2 * C2)).

A kind of service dispatching device comprises:

The priority parameters computing unit is used for the transmission time delay parameters C according to service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation; And

Physical source distributing and scheduling unit are used for being followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling.

Wherein, said priority parameters computing unit comprises C ^TdComputing module, C ^SPIComputing module and C ^UEIn the computing module at least one, wherein, said C ^TdComputing module is confirmed propagation delay time Td according to the UE under the service queue, Td>0 o'clock, C ^TdGet positively related value, Td with Td≤0 o'clock, C ^TdValue is 0; Said C ^SPIComputing module is confirmed according to the grade point of service queue priority; Said C ^UEComputing module is confirmed by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.

Wherein, said C ^TdGet positively related value, be specially with Td:

Get a Td and a constant sum as C ^TdValue or get Td and a constant long-pending as C ^TdValue.

Wherein, said C ^TdComputing module is confirmed propagation delay time Td according to UE under the service queue, is specially:

Td _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that the automatic repeat requests HARQ process of mixed once retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting.

Wherein, said C ^UEComputing module calculates C ^UEMode be:

$C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _Kj(t) be the weighted value of the said service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight [j] is the basic weights of the service queue of j for priority; γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

Wherein, confirm that the said related parameter calculating module of priority of treating the dispatching services formation is two and comprises that also weight coefficient is provided with the unit when above, be used to said parameter weight coefficient is set.

Wherein, said weight coefficient is provided with the unit weight coefficient and is set to fixed value.

Wherein, the unit is set is that said parameter dynamically arranges weight coefficient according to the priority of said parameter to said weight coefficient.

Wherein, said weight coefficient dynamically arranges according to the priority of said parameter, is specially:

The weight coefficient of the parameters C 1 that priority is minimum is made as constant m, and the weight coefficient A2 of the parameters C 2 that priority is time high is made as max, and (C1 * m), the weight coefficient A3 of the parameters C 3 that priority is the highest are made as MAX (max (C1 * m), max (A2 * C2)).

The present invention is directed to and treat dispatching services, take into full account the traffic performance relevant, utilize professional characteristic to confirm its dispatching priority with QoS; The priority of service queue of the present invention and the transmission time delay parameters C of service queue ^Td, service queue dispatching priority indication parameter C ^SPIIn at least one is relevant, the determined service queue priority of the present invention has fully guaranteed professional QoS, has improved the performance of service dispatching.

Description of drawings

Fig. 1 is the flow chart of the business scheduling method of the embodiment of the invention;

Fig. 2 is the composition structural representation of the service dispatching device of the embodiment of the invention.

Embodiment

Below in conjunction with accompanying drawing technical scheme of the present invention is elaborated.

Fig. 1 is the flow chart of the business scheduling method of the embodiment of the invention, and is as shown in Figure 1, and the business scheduling method of the embodiment of the invention may further comprise the steps:

Step 101: according to the transmission time delay parameters C of service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation.

The dispatching method of the embodiment of the invention promptly is channel condition, the delay character of service queue, the assurance bit rate (GBR that takes all factors into consideration the terminal; Guaranteed Bit Rate), priority level of service queue etc.; Under the prerequisite that satisfies user QoS demand, improve the data throughout of sub-district as far as possible.Based on the dual consideration of user terminal and service queue, dispatching method of the present invention can embody user's demand for services better, and user experience is better, and for the user high as far as possible transfer of data is provided according to channel condition.Below introducing the present invention is how to confirm service queue priority.

Represent to confirm the parameter of service queue priority, to calculate the relevant parameter C of this service queue with CQ for arbitrary service queue ^Td, C ^SPIAnd C ^UE, then the CQ of service queue presses following formula and confirms:

${\mathrm{CQ}}_i=C_i^{\mathrm{Td}}+C_i^{\mathrm{SPI}}+C_{\mathrm{Ki}}^{\mathrm{UE}},$ Wherein, i representes the numbering of service queue.

Wherein, C ^TdDelay requirement according to service queue is confirmed; Described delay requirement is relevant with the grade of service of user's selection, the priority of service etc.; Each business user-selected or customization is corresponding with a priority level; And the service queue of each priority level all has corresponding delay requirement, can confirm propagation delay time Td according to UE under the service queue, is specially:

Td _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that a HARQ process retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting, the α value is big more, and the priority of corresponding service formation is high more, and the α value can rule of thumb be provided with, and for the service queue of each priority, all correspondence is provided with the α value.For the service queue that does not have delay requirement; Can its Td value be set to constant; For example-1, be set to cause this service queue always can not be scheduled after the negative value, can unconfinedly do not wait in order to guarantee this service queue; Can be set to a bigger value by δ, to reduce the stand-by period of service queue.In a word, for the service queue that does not have delay requirement, can be set its stand-by period according to service feature.The present invention just is being based on the Td value of service queue and is confirming C ^Td, as Td>0 o'clock, explain that service queue is overtime, need scheduling as early as possible, at this moment C ^TdGet positively related value, and work as Td with Td≤0 o'clock, service queue is described as yet not to the time of being scheduled, at this moment, C ^TdValue is 0.Here, C ^TdValue and Td positive correlation, for example: C ^Td=Td+b, wherein, b is a positive constant, for example value is 1,2 or 5; Perhaps, C ^Td=Td * b.Certainly, if C ^TdThe evolution value or the square root of getting Td also can.

C ^SPIValue is the grade point of service queue priority.For example for general service, its C ^SPIBe set to 0, set gradually according to priority order from low to high for the business that special priority is arranged be 1,2 ..., 15.Above-mentioned C ^SPIValue just the priority level value with business is identical, also can get and react corresponding other values, high more its corresponding value of priority is big more.

C ^UEBy the basic weighted value of user's channel condition, service queue priority and guarantee that bit rate etc. confirms: $C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _Kj(t) for the weighted value of the service queue that obtains according to the direct ratio fair algorithm, it will be appreciated by those skilled in the art that the direct ratio fair algorithm is a known technology, repeat no more here.PriorityQueueWeight [j] is the basic weights of the service queue of j for priority, and these basic weights are by default.γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

When there is the phenomenon of being transferred sky in buffer memory service queue in dispatching cycle, just with γ _IkValue is set to initial value.γ _IkAdjusting range exist

With

${\mathrm{\&gamma;}}_i^{\mathrm{Min}}=R_i^{\mathrm{GBR}},{\mathrm{\&gamma;}}_{\mathrm{Ik}}^{\mathrm{Max}}=M*R_i^{\mathrm{GBR}},$ For example M gets 100,150 or 200.

The CQ value that calculates is big more, and the priority of corresponding service queue is high more.

Need to prove, confirm that parameter that the CQ of service queue relates to reaches two when above, promptly at C ^Td, C ^SPIAnd C ^UEIn relate to two or all the time, be preferably each parameter setting weight coefficient, to confirm CQ more accurately, at this moment, ${\mathrm{CQ}}_i=A_{\mathrm{Td}}\&times;C_i^{\mathrm{Td}}+A_{\mathrm{SPI}}\&times;C_i^{\mathrm{SPI}}+A_{\mathrm{UE}}\&times;C_{\mathrm{Ki}}^{\mathrm{UE}}$

Weight coefficient A _Td, A _SPI, A _UECan be set to fixed value, promptly according to C ^Td, C ^SPIAnd C ^UEPriority orders, for each parameter is provided with fixing weight coefficient, relate to which parameter when calculating CQ, promptly select its corresponding weight coefficient for use.

Weight coefficient A _Td, A _SPI, A _UEAlso can be according to each parameters C ^Td, C ^SPIAnd C ^UEPriority dynamically arrange, promptly according to its significance level to CQ.The weight coefficient of the parameters C 1 that priority is minimum is made as constant m, and the weight coefficient A2 of the parameters C 2 that priority is time high is made as max, and (C1 * m), the weight coefficient A3 of the parameters C 3 that priority is the highest are made as MAX (max (C1 * m), max (A2 * C2)).

Generally speaking, C ^UE, C ^Td, C ^SPIThe proportion shared to the CQ value increases successively.As establish A _UE=1,

A _Td=max (A _UE* C ^UE)=max (C ^UE), maximum is got in max () expression, promptly gets A _UE* C ^UEIn maximum.A _SPI＝MAX(max(C ^UE)，max(A _Td×C ^Td))。

Step 102: be followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling.Be about to current system resource and distribute, carry out resource allocation for the high formation of priority earlier, accomplish the scheduling of service queue successively by the priority of service queue.

Through the determined priority of CQ cost function of step 101, and when dispatching, when traffic load is not heavy, under the prerequisite that guarantees all kinds of QoS of survice, utilized the efficient of resource substantially by this priority.And under the heavier prerequisite of load, system can not satisfy all users' QoS, and the present invention adopts sacrificial section user's speed to satisfy other users' QoS demand.Through the γ in the adjustment dispatching algorithm _IkMax threshold

Can realize this purpose.

If have at least more than one the assurance bit rate of service queue in time t1 not reach requirement, and have ${\mathrm{\&gamma;}}_{\mathrm{Ik}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}^{\mathrm{Max}},$ Can reduce certain customers so

Thereby reduce its scheduling ratio, satisfy other users' rate requirement.The user who reduces

can be the relatively poor user of channel condition, can be that actual speed rate and expected rate differ bigger user.After perhaps number of users reduces if channel condition improves, need to adopt readjustment tactful, raise above-mentioned user's

The condition that raises is the γ when all formations _IkAll less than γ ^Max* s (s≤1) and the duration surpass the t2 time, promptly all GBR users satisfy assurance bit rate and certain time.In order to prevent that table tennis from switching; The downward modulation process of

as quickly as possible; And the rise process wants slow; Promptly

downward modulation grade is less, and the rise grade is more.Above-mentioned t1 and t2 are set point, set according to the system requirements of reality to get final product.

Fig. 2 is the composition structural representation of the service dispatching device of the embodiment of the invention; As shown in Figure 2; The service dispatching device of the embodiment of the invention comprises priority parameters computing unit 20 and physical source distributing and scheduling unit 21; Wherein, priority parameters computing unit 20 is used for the transmission time delay parameters C according to service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation.Represent to confirm the parameter of service queue priority, all to calculate the relevant parameter C of this service queue with CQ for arbitrary service queue ^Td, C ^SPIAnd C ^UE, then the CQ of service queue presses following formula and confirms: ${\mathrm{CQ}}_i=C_i^{\mathrm{Td}}+C_i^{\mathrm{SPI}}+C_{\mathrm{Ki}}^{\mathrm{UE}},$ Wherein, i representes the numbering of service queue.Priority parameters computing unit 20 promptly is the CQ value that calculates service queue.Physical source distributing and scheduling unit 21 are used for being followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling.

Wherein, priority parameters computing unit 20 comprises C ^TdComputing module 201, C ^SPIComputing module 202 and C ^UEIn the computing module 203 at least one, wherein, C ^TdComputing module 201 is confirmed propagation delay time Td, Td according to the UE under the service queue _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that a HARQ process retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting, the α value is big more, and the priority of corresponding service formation is high more, and the α value can rule of thumb be provided with, and for the service queue of each priority, all correspondence is provided with the α value.For the service queue that does not have delay requirement; Can its Td value be set to constant; For example-1, be set to cause this service queue always can not be scheduled after the negative value, can unconfinedly do not wait in order to guarantee this service queue; Can be set to a bigger value by δ, to reduce the stand-by period of service queue.In a word, for the service queue that does not have delay requirement, can be set its stand-by period according to service feature.The present invention just is being based on the Td value of service queue and is confirming C ^Td, as Td>0 o'clock, explain that service queue is overtime, need scheduling as early as possible, at this moment C ^TdGet positively related value, and work as Td with Td≤0 o'clock, service queue is described as yet not to the time of being scheduled, at this moment, C ^TdValue is 0.Here, C ^TdValue and Td positive correlation, for example: C ^Td=Td+b, wherein, b is a positive constant, for example value is 1,2 or 5; Perhaps, C ^Td=Td * b.Certainly, if C ^TdThe evolution value or the square root of getting Td also can.C ^SPIComputing module 202 is confirmed according to the grade point of service queue priority; C ^SPIComputing module 202 is confirmed C ^SPIMode be: C ^SPIValue be the grade point of service queue priority.For example for general service, its C ^SPIBe set to 0, set gradually according to priority order from low to high for the business that special priority is arranged be 1,2 ..., 15.Above-mentioned C ^SPIValue just the priority level value with business is identical, also can get and react corresponding other values, high more its corresponding value of priority is big more.C ^UEComputing module 203 is confirmed by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.C ^UEComputing module 203 calculates C ^UEMode be:

$C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _Kj(t) be the weighted value of the said service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight [j] is the basic weights of the service queue of j for priority; γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

When there is the phenomenon of being transferred sky in buffer memory service queue in dispatching cycle, just with γ _IkValue is set to initial value.γ _IkAdjusting range exist

With

${\mathrm{\&gamma;}}_i^{\mathrm{Min}}=R_i^{\mathrm{GBR}},{\mathrm{\&gamma;}}_{\mathrm{Ik}}^{\mathrm{Max}}=M*R_i^{\mathrm{GBR}},$ For example M gets 100,150 or 200.

As shown in Figure 2, confirm that the said related parameter calculating module of priority of treating the dispatching services formation is two when above, the service dispatching device of the embodiment of the invention also weight coefficient is provided with unit 22, is used to said parameter weight coefficient is set.Weight coefficient is provided with unit 22 can be set to fixed value by weight coefficient.Also can be that said parameter dynamically arranges weight coefficient according to the priority of said parameter.Said weight coefficient dynamically arranges according to the priority of said parameter; Be specially: the weight coefficient of the parameters C 1 that priority is minimum is made as constant m; The weight coefficient A2 of the parameters C 2 that priority is time high is made as max (C1 * m); The weight coefficient A3 of the parameters C 3 that priority is the highest is made as MAX (max (C1 * m), max (A2 * C2)).Generally speaking, C ^UE, C ^Td, C ^SPIThe proportion shared to the CQ value increases successively.As establish A _UE=1, A then _Td=max (A _UE* C ^UE)=max (C ^UE), maximum is got in max () expression, promptly gets A _UE* C ^UEIn maximum.A _SPI＝MAX(max(C ^UE)，max(A _Td×C ^Td))。

Physical source distributing and the scheduling unit 21 according to priority result of calculation of parameter calculation unit 20 are confirmed the priority of service queue to be followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling.Be about to current system resource and distribute, carry out resource allocation for the high formation of priority earlier, accomplish the scheduling of service queue successively by the priority of service queue.When traffic load is not heavy, under the prerequisite that guarantees all kinds of QoS of survice, utilized the efficient of resource substantially.And under the heavier prerequisite of load, system can not satisfy all users' QoS, and the present invention adopts sacrificial section user's speed to satisfy other users' QoS demand.Through the γ in the adjustment dispatching algorithm _IkMax threshold

Can realize this purpose.

If have at least more than one the assurance bit rate of service queue in time t1 not reach requirement, and have ${\mathrm{\&gamma;}}_{\mathrm{Ik}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}^{\mathrm{Max}},$ Can reduce certain customers so

Thereby reduce its scheduling ratio, satisfy other users' rate requirement.The user who reduces

can be the relatively poor user of channel condition, can be that actual speed rate and expected rate differ bigger user.After perhaps number of users reduces if channel condition improves, need to adopt readjustment tactful, raise above-mentioned user's

The condition that raises is the γ when all formations _IkAll less than γ ^Max* s (s≤1) and the duration surpass the t2 time, promptly all GBR users satisfy assurance bit rate and certain time.In order to prevent that table tennis from switching; The downward modulation process of

as quickly as possible; And the rise process wants slow; Promptly

downward modulation grade is less, and the rise grade is more.Above-mentioned t1 and t2 are set point, set according to the system requirements of reality to get final product.

It will be appreciated by those skilled in the art that device shown in Figure 2 is a corresponding intrument of realizing method shown in Figure 1, the function of each unit and module can be understood with reference to the associated description among Fig. 1.Each unit and module shown in Figure 2 can realize function corresponding through corresponding software or corresponding hardware circuit.

The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.

Claims (16)

1. a business scheduling method is characterized in that, this method comprises:

Transmission time delay parameters C according to service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation, be followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling,

Wherein, said C ^TdConfirm that mode is: confirm propagation delay time Td according to the UE under the service queue, Td＞0 o'clock, C ^TdGet positively related value, Td＜=0 o'clock, C with Td ^TdValue is 0; Said C ^SPIValue is the grade point of service queue priority; Said C ^UEConfirm by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.

2. method according to claim 1 is characterized in that, said C ^TdGet positively related value, be specially with Td:

Get a Td and a constant sum as C ^TdValue or get Td and a constant long-pending as C ^TdValue.

3. method according to claim 1 is characterized in that, confirms propagation delay time Td according to UE under the service queue, is specially:

Td _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that the automatic repeat requests HARQ process of mixed once retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting.

4. method according to claim 1 is characterized in that C ^UEConfirm by following mode: $C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _Kj(t) be the weighted value of the said service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight [j] is the basic weights of the service queue of j for priority; γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

5. method according to claim 1 is characterized in that, confirms that the said related parameter of priority of treating the dispatching services formation is two when above, for said parameter is provided with weight coefficient.

6. method according to claim 5 is characterized in that said weight coefficient is set to fixed value.

7. method according to claim 5 is characterized in that said weight coefficient dynamically arranges according to the priority of said parameter.

8. method according to claim 7 is characterized in that, said weight coefficient dynamically arranges according to the priority of said parameter, is specially:

The weight coefficient of the parameters C 1 that priority is minimum is made as constant m, and the weight coefficient A2 of the parameters C 2 that priority is time high is made as max, and (C1 * m), the weight coefficient A3 of the parameters C 3 that priority is the highest are made as MAX (max (C1 * m), max (A2 * C2)).

9. a service dispatching device is characterized in that, this device comprises:

The priority parameters computing unit is used for the transmission time delay parameters C according to service queue ^Td, service queue dispatching priority indication parameter C ^SPIAnd scheduling of user terminals relevant parameter C ^UEIn at least one confirm to treat the priority of dispatching services formation; And

Physical source distributing and scheduling unit are used for being followed successively by the said dispatching services queue assignment physical resource of treating by said priority order from high to low, carry out queue scheduling,

Wherein, said priority parameters computing unit comprises C ^TdComputing module, C ^SPIComputing module and C ^UEIn the computing module at least one, wherein, said C ^TdComputing module is confirmed propagation delay time Td according to the UE under the service queue, Td＞0 o'clock, C ^TdGet positively related value, Td＜=0 o'clock, C with Td ^TdValue is 0; Said C ^SPIComputing module is confirmed C according to the grade point of service queue priority ^SPISaid C ^UEComputing module is by the basic weighted value of user's channel condition, service queue priority and guarantee that bit rate confirms C ^UE

10. device according to claim 9 is characterized in that, said C ^TdGet positively related value, be specially with Td:

Get a Td and a constant sum as C ^TdValue or get Td and a constant long-pending as C ^TdValue.

11. device according to claim 9 is characterized in that, said C ^TdComputing module is confirmed propagation delay time Td according to UE under the service queue, is specially:

Td _i=T _i-Tm _i, wherein, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm among the service queue i _iBe the control delay parameter of service queue i, Tm _i=Max (0, δ-Tad _Max), δ is the mac-hs delay requirement of service queue i, Tad _Max=α * T _Harq* N _Max, T _HarqBe that the automatic repeat requests HARQ process of mixed once retransmits required shortest time, N _MaxBe the maximum transmission times of this formation, the corrected parameter of α for setting.

12. device according to claim 9 is characterized in that, said C ^UEComputing module calculates C ^UEMode be:

$C_k^{\mathrm{UE}}={\mathrm{\&gamma;}}_{\mathrm{Ik}}\&times;\mathrm{PriorityQueueWeight}\left[j\right]\&times;{\mathrm{Pf}}_{\mathrm{Kj}}\left(t\right),$ Wherein, pf _Kj(t) be the weighted value of the said service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight [j] is the basic weights of the service queue of j for priority; γ _IkBe K user UE _kThe basic weights adjustment factor of middle formation i, γ _Ik=R _g/ R _r, R _gFor guaranteeing bit rate, R _rBe actual transfer rate.

13. device according to claim 8 is characterized in that, confirms that the said related parameter calculating module of priority of treating the dispatching services formation is two and comprises that also weight coefficient is provided with the unit when above, is used to said parameter weight coefficient is set.

14. device according to claim 13 is characterized in that, said weight coefficient is provided with the unit weight coefficient and is set to fixed value.

15. device according to claim 13 is characterized in that, it is that said parameter dynamically arranges weight coefficient according to the priority of said parameter that said weight coefficient is provided with the unit.

16. device according to claim 15 is characterized in that, said weight coefficient dynamically arranges according to the priority of said parameter, is specially:

The weight coefficient of the parameters C 1 that priority is minimum is made as constant m, and the weight coefficient A2 of the parameters C 2 that priority is time high is made as max, and (C1 * m), the weight coefficient A3 of the parameters C 3 that priority is the highest are made as MAX (max (C1 * m), max (A2 * C2)).

Images