CN101425964A - Service scheduling method and apparatus based on QoS - Google Patents

Abstract

The invention discloses a service dispatching method based on service quality, relating to service dispatching technology in radio communication system and is to solve problem of low service quality of service queue dispatching. The scheme comprises: computing priority parameter of queue to be dispatched in dispatching period, dispatching physical resource according to dispatching priority determined by priority parameter. The invention also discloses a device for implementing the method comprising priority parameter computation unit, for computing priority parameter of service queue to be dispatched in dispatching period; physical resource dispatching unit, for dispatching physical resource according to dispatching priority determined by priority parameter. The service queue priority fully guarantees QoS of service, promotes service dispatching performance.

Description

Quality-of-service based 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 quality-of-service based 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 a kind of good solution that is considered to 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 may transmit several 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 use (UE) of the different QoS grades of service and shared HSDPA down link.

Below the HSDPA technology is simply introduced.

HSDPA changes to adapt to subscriber channel by 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 situations 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, Roun-Robin) algorithm.This algorithm calls each user circularly, and 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 serviced 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 allow 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 mobile communication system, the residing position of user difference, the signal strength signal intensity that it received is different, maximum C/I algorithm must have been looked after user near from the base station, that channel is good, other users far away from the base station then can't obtain service, and the service coverage of base station is very little.This dispatching algorithm is least fair.

Direct ratio justice (PF, Proportional-Fair Scheduler) algorithm.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, based on channel condition, long process is taken into account all users' throughput in a short time.Also consider data volume to be sent such as user, sent situations 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 at business features, the user carries out because above-mentioned dispatching algorithm all is based on, and remain professional characteristic itself with QoS is the most closely-related, need fully to satisfy the service that professional characteristic itself just can provide higher QoS.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of quality-of-service based 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 quality-of-service based business scheduling method comprises:

Calculate in dispatching cycle and treat the dispatching services priority parameter of service queue, according to priority the determined dispatching priority of parameter is dispatched physical resource.

Wherein, the described dispatching services priority parameter of service queue for the treatment of is relevant with in the following parameter at least one:

The formation transmission time delay parameters C ^Td1, queue scheduling priority indication parameter C ^SPI, activate the formation transmission time delay parameters C ^Td2, data block delay parameter C to be sent ^TAnd scheduling of user terminals relevant parameter C ^UE

Wherein, described when treating dispatching services priority parameter of service queue and more than one parameter correlation, for each relative parameters setting has weight coefficient.

Wherein, described physical resource is dispatched, being comprised:

Sort with all service queue priority parameters corresponding priorities in dispatching cycle, carry out resource allocation for each service queue in regular turn.

Wherein, described physical resource is dispatched, being comprised:

All service queues in dispatching cycle are sorted out by affiliated user terminal, determined the priority of user terminal, and be that terminal is carried out resource allocation with the user terminal priority order with the priority parameters of service queue under each user terminal.

Wherein, the described dispatching services queue priority parameter for the treatment of was calculated before arriving dispatching cycle.

A kind of quality-of-service based service dispatching device comprises:

The priority parameters computing unit is used to calculate and treats the dispatching services priority parameter of service queue in dispatching cycle; And

The physical resource scheduling unit, being used for according to priority, the determined dispatching priority of parameter carries out the scheduling of physical resource.

Wherein, described priority parameters computing unit is determined the priority parameters of service queue by the result of calculation of following at least one computing module:

Be used to calculate the formation transmission time delay parameters C ^Td1C ^Td1Computing module, be used to calculate the parameters C of queue scheduling priority indication ^SPIC ^SPIComputing module, be used for computing activation formation transmission time delay parameters C ^Td2C ^Td2Computing module, be used to calculate data block delay parameter C to be sent ^TC ^TComputing module and be used to calculate scheduling of user terminals relevant parameter C ^UEC ^UEComputing module.

Wherein, when described priority parameters computing unit comprised more than one parameter calculating module, correspondence comprised and is used for calculating respectively C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEC ^Td1Weight coefficient computing module, C ^SPIWeight coefficient computing module, C ^Td2Weight coefficient computing module, C ^TWeight coefficient computing module and C ^UEThe weight coefficient computing module.

Wherein, described physical resource scheduling unit comprises:

The service queue order module, be used for to all service queues in dispatching cycle according to priority the parameter corresponding priorities sort; And

The scheduling service queue module is used for carrying out resource allocation with described service queue order module institute alignment ordered pair service queue.

Wherein, described physical resource scheduling unit comprises:

The service queue classifying module is used for all service queues in dispatching cycle are sorted out by affiliated user terminal;

User terminal priority determination module is used for determining with the priority parameters of service queue under each user terminal the priority of user terminal; And

The teleservice scheduler module, being used for the user terminal priority order is that terminal is carried out resource allocation.

Wherein, described priority parameters computing unit calculated before arriving dispatching cycle and treats the dispatching services priority parameter of service queue.

The present invention is directed to and treat dispatching services, take into full account the traffic performance relevant, utilize professional characteristic to determine its dispatching priority with QoS; The priority of service queue of the present invention and formation transmission time delay parameters C ^Td1, activate the determined priority parameters C of formation cost function ^SPI, activate the formation transmission time delay parameters C ^Td2, data block delay parameter C to be sent ^TAnd scheduling of user terminals relevant parameter C ^UEIn 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 composition structural representation that the present invention is based on the service dispatching device of service quality;

Fig. 2 is the structural representation of Fig. 1 medium priority parameter calculation unit;

Fig. 3 is the structural representation of physical resource scheduling unit among Fig. 1;

Fig. 4 is another structural representation of physical resource scheduling unit among Fig. 1;

Fig. 5 is the flow chart that the present invention is based on the business scheduling method of service quality.

Embodiment

Core concept of the present invention is: though determined the multiple business dispatching algorithm in the present HSDPA system, realized the service quality part demand of user at business, but mostly these service dispatching algorithms are to design at user terminal, and current operation is more and more abundanter, its characteristic is also more outstanding, dispatching algorithm should fully take into account these traffic performances, and the service of the user's request of more fitting just can be provided, further the QoS of elevator system.The present invention is directed to business characteristic in the present HSDPA system, take into full account professional various characteristics, and the service dispatching that satisfies each traffic performance algorithm is provided, fully guaranteed professional QoS, improved the performance of service dispatching.Below in conjunction with accompanying drawing technical scheme of the present invention is elaborated.

Fig. 1 is the composition structural representation that the present invention is based on the service dispatching device of service quality, as shown in Figure 1, the service dispatching device that the present invention is based on service quality comprises priority parameters computing unit 10 and physical resource scheduling unit 11, wherein, priority parameters computing unit 10 is used to calculate and treats the dispatching services priority parameter of service queue in dispatching cycle.At each service dispatching in the cycle, need to determine each professional scheduling strategy, could treat dispatching services when arrive dispatching cycle and dispatch one by one, the present invention determines the dispatching sequence of service queue by the priority parameters of determining service queue, thereby embodies the different QoS requirements of different business.Priority parameters computing unit 10 need be determined the priority parameters of service queue before the cycle for the treatment of dispatching services arrives.

Physical resource scheduling unit 11 is used for according to priority, and the determined dispatching priority of parameter carries out the scheduling of physical resource.Priority parameters computing unit 10 determined service queue priority parameters correspondences corresponding priority level, according to determined service priority these business are carried out resource allocation, thereby finish professional scheduling.

Below introduce priority parameters computing unit 10, physical resource scheduling unit 11 respectively.

Fig. 2 is the structural representation of Fig. 1 medium priority parameter calculation unit, and as shown in Figure 2, priority parameters computing unit 10 of the present invention comprises at least one of following computing module:

Be used to calculate the formation transmission time delay parameters C ^Td1C ^Td1Computing module 100, be used to calculate the parameters C of queue scheduling priority indication ^SPIC ^SPIComputing module 101, be used for computing activation formation transmission time delay parameters C ^Td2C ^Td2Computing module 102, be used to calculate data block delay parameter C to be sent ^TC ^TComputing module 103 and be used to calculate scheduling of user terminals relevant parameter C ^UEC ^UEComputing module 104.Below introduce C in detail ^Td1Computing module 100, C ^SPIComputing module 101, C ^Td2Computing module 102, C ^TComputing module 103 and C ^UEComputing module 104 is how to finish C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEEach calculation of parameter.

About C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEThe CALCULATION OF PARAMETERS mode the invention provides two kinds of account forms, the account form of promptly non-quantification account form and quantification.

Describe with non-quantification manner earlier:

C ^Td1Computing module 100 promptly is to calculate the parameter relevant with propagation delay time Td, and among the present invention, the propagation delay time Td value of service queue is more than or equal to 0 o'clock, $C_i^{\mathrm{Td}1}=1;$ Otherwise, $C_i^{\mathrm{Td}1}=0$ 。Wherein, i service queue number.

Require business data flow is divided three classes according to transmission rate and propagation delay time, below introduce the computational methods of the propagation delay time of all kinds of business respectively.

For the formation that time delay and bit rate requirement are arranged (in a formation, preferentially retransmitting).For formation i, set up timer T _iVirtual time F with transmission of data blocks _i, T _iInitial value $T_i^0=0,$ F _iInitial value $F_i^0=0$ 。When having data to send among the formation i first, initialization T _iAnd F _i, start timer T simultaneously _i

Each subframe is upgraded T _i, $T_i^r=r*T_p,$ R is T _iNumber dispatching cycle that is activated, T _pBe the dispatching cycle of system, T in the systems such as TD SDMA _p=5ms, the i.e. frame length of the used subframe of communication system.

When being sent by Node B first, upgrades data block k F _i

$F_i^j=F_i^{j-1}+L_i^k/{\mathrm{\Φ}}_i,$

Be the virtual time of formation i in subframe j, k data block of transmission.

When receiving the NACK message that data block k transmits first, upgrades Node B F _i

$F_i^j=F_i^{j-1}-L_i^k/{\mathrm{\Φ}}_i$

When receiving the ACK message of data block k re-transmission, upgrades Node B F _i

$F_i^j=F_i^{j-1}-L_i^k/{\mathrm{\Φ}}_i$

Be the bit length of k data block of i formation, Φ _iBe the bit rate of formation i assurance or the bit rate of distribution.

Calculate ${\mathrm{Td}}_i=T_i^r-F_i^j-{\mathrm{Tm}}_i,$ Td _iInvoked priority is big more among the big more formation i.

Tm _iRelevant with the admissible time delay of formation i.Tm _i=δ _i-Tad _i, δ _iPropagation delay time requirement for formation i has setting, Tad in advance _iBe the mean transit delay of formation i data block, its initial value is Tad _i=Trans _Max* T _Harq, Trans _MaxBe this formation maximum transmission times, T _HarqMinimum scheduling interval for this line user terminal UE.

Td _Im, i ∈ 1...I, I are the formation number of m online user's terminal, m ∈ 1...M, M are UE number online in the sub-district.

Td _m=Max (Td _Im), i ∈ 1...I, the Td value of m UE.

When the data among the formation i have been sent out, initialization T _iAnd F _i, while timeing closing device T _i

Has only the formation of delay requirement.Td _i=T _i-Tm _i, T _iBe to be scheduled and stand-by period of long data piece of stand-by period Tm in the formation _iBe the control delay parameter of formation i, Tm _i=Max (0, δ-Tad _i), δ is a delay requirement, Tad _iMean transit delay for formation i data block.

There is not the formation of time delay and bit rate requirement.The Td of formation _i=SPI _i-16, SPI _iIt is dispatching priority indication (SPI, the Scheduling Priority Indicator) value of formation i.

Existing delay requirement has the formation (preferentially retransmit, and reinforcement being to the control of time delay) of bit rate requirement again in a formation.Delay requirement is arranged and have the Td account form of bit rate requirement to calculate two Td value Td1 according to aforementioned respectively _i, Td2 _i, Td _iGet the maximum of T d in two result of calculations _i=Max (Td1 _i, Td2 _i).

C ^SPIThe scheduling service queue priority indication parameter C of computing module 101 computing service formations ^SPI, $C_i^{\mathrm{SPI}}=(\mathrm{Min}\left(\mathrm{Cost}\right)+a)/({\mathrm{Cost}}_i+a),$ Wherein a is a constant, makes

Be distributed in the acceptable scope Cost _iCost function for formation i place priority.

For the calculating of SPI cost function, the invention provides two kinds of computational methods.

Method 1:

Cost _i(t)=Cost _i(t-1)+N _Tramsmit(t, i)/Credit (t, i), Cost _i(0)=0, wherein, N _Tramsmit(t i) is the code channel number that SPI concentrates formation to take among the subframe t.

After the finishing scheduling of each subframe, Cost _i(t)=Cost _i(t)-Cost _Min(t)

Cost _Min(t)=Min[Cost _i(t)], i belongs to the SPI that is activated.

Method 2: utilize weighting scheme to calculate, be specially:

${\mathrm{Cost}}_i\left(t\right)=p\·\frac{\underset{j=t-w+1}{\overset{t}{\mathrm{\Σ}}}{N}_{\mathrm{ij}}}{w\·N_{\max }}+(1-p)\·\frac{{\mathrm{CW}}_i/Q_{\mathrm{ai}}}{\underset{j=0}{\overset{15}{\mathrm{\Σ}}}{\mathrm{CW}}_j/Q_{\mathrm{aj}}}$

Wherein, p: weighted factor, scope [0,1]; W: resource is calculated sliding window, and value tentatively is decided to be 40 Transmission Time Interval TTI.N _Ij: the code channel resource quantity that j TTI of i priority takies.N _Max: a TTI allows the maximum resource quantity of use.CW _i: the cost weights of i priority, computational methods are: CW _i=2 * (16-SPI).Q _Ai: the number of queues that activates in i priority, if Q _AiBe 0, then disregarding gets it right answers the cost of priority, does not also dispatch this priority.

C ^Td2Computing module 102 is the transmission time delay parameters of computing activation formation.(Td _i-Min (Td)+b)/(Max (Td)-Min (Td)+b), wherein b is a constant, makes

Be distributed in the acceptable scope.

C ^TComputing module 103 calculates C ^TMode be: if (T-T _a) 〉=(N _T* T1/N _Max), $C_i^T=1;$ Otherwise, $C_i^T=0$ 。T is the stand-by period that formation i will be sent out data block; T _aBe the definite Transmission Time Interval of system; N _TBe the transmission number of times of this data block, initial value is 1; T1 wants seeking time for the formation propagation delay time; N _MaxIt is maximum number of times of transmission.

C ^UEComputing module 104 is used for determining C ^UEMode as follows:

Repeating query: 1/N _x, N _xBe x UE _xThe number of times that is scheduled, initial value is 1, every scheduling UE _xOnce, N _xValue increase by 1, when a scheduling TTI finishes, upgrade N _x=N _x-Min (N)+1.

Maximum C/I:TBS _x/ 63, TBS _xBe x UE _xThe TBS call number of feedback.

Direct ratio justice: pf _x/ Max (pf); X UE _xThe direct ratio justice is taken as maximum wherein.

Below introduce the quantification account form of above-mentioned each parameter.

C ^Td1Computing module 100 promptly is to calculate the parameter relevant with propagation delay time Td, among the present invention, and C ^Td1Quantification calculate identical with non-quantification manner.

C ^SPI101 couples of C of computing module ^Td2Quantification calculate: the cost function that will activate formation sorts from small to large, and with service queue priority 16 grades being arranged is example, C ^SPIValue 1,15/16 successively, 14/16...2/16,1/16.

C ^Td2102 couples of C of computing module ^Td2Quantification calculate: press the Td value of the described mode computing activation of preamble formation, press the Td value and sort from small to large,

Value 1 successively, (N _Q-1)/N _Q, (N _Q-2)/N _Q..., N _QFor activating the formation number.

C ^T103 couples of C of computing module ^TQuantification calculate identical with non-quantification manner.

C ^UE104 couples of C of computing module ^UEQuantification calculate and to comprise:

Repeating query: time numerical value that is scheduled that will activate UE sorts from small to large, and value 1 successively, N _UE-1/N _UE, N _UE-2/N _UE..., N _UEIt is the UE number that activates.

Maximum C/I: will activate channel quality indication (CQI, Channel Quality Indicator) the value ordering from big to small of UE, value is N successively _UE-1/N _UE, N _UE-2/N _UE..., N _UEIt is the UE number that activates.

The direct ratio justice: the fair PF value of direct ratio that will activate UE sorts from big to small, and value is N successively _UE-1/N _UE, N _UE-2/N _UE..., N _UEIt is the UE number that activates.

When priority parameters computing unit 10 comprised more than one parameter calculating module, priority parameters computing unit 10 was used to calculate C and correspondence comprises ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEC ^Td1Weight coefficient computing module 105, C ^SPIWeight coefficient computing module 106, C ^Td2Weight coefficient computing module 107, C ^TWeight coefficient computing module 108 and C ^UEWeight coefficient computing module 109.C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEWeight coefficient be designated as respectively: A _Td1, A _SPI, A _Td2, A _T, A _UE, the A of non-quantification then _Td1, A _SPI, A _Td2, A _T, A _UEBe calculated as:

A _UE＝1；

A _T＝A _UE；

$A_{\mathrm{Td}2}=2/\mathrm{Min}\left(C_i^{\mathrm{Td}2}\right);$

Own in the expression current TTI

Minimum value;

$A_{\mathrm{SPI}}=A_{\mathrm{Td}2}/\mathrm{Min}\left(C_i^{\mathrm{SPI}}\right),$

Own in the expression current TTI

Minimum value;

A _Td1=A _SPI,

Value be 0 or 1.

If

Value all normalized to [0,1], and do not comprise the factor value of non-quantification, then A _Td1, A _SPI, A _Td2, A _T, A _UEBe calculated as:

A _UE＝1；

A _T=A _UE,

Value be 0 or 1;

A _Td2=2*N _Q, N _QFor activating the formation number;

A _SPI＝A _Td2*16；

A _Td1＝A _SPI。

Priority parameters computing unit 10 specifically is according to following formula computing service priority parameter of service queue:

$A_{\mathrm{Td}1}*C_i^{\mathrm{Td}1}+A_{\mathrm{Td}2}*C_i^{\mathrm{Td}2}+A_R*C_i^T+A_{\mathrm{SPI}}*C_i^{\mathrm{SPI}}+A_{\mathrm{UE}}*C_k^{\mathrm{UE}}$

Select for use at least one parameter in the following formula to come the computing service priority parameter of service queue according to the situation of computing service formation.When selected parameter is one when above, then need to utilize the corresponding weights computing module to calculate the respective weights of these parameters.

By the priority parameters of the determined service queue of above-mentioned each parameter, more can embody professional characteristic demand, based on the determined priority of above-mentioned parameter, the professional quality of service requirement of more fitting.

Fig. 3 is the structural representation of physical resource scheduling unit among Fig. 1, as shown in Figure 3, physical resource scheduling unit 11 of the present invention comprises service queue order module 110 and scheduling service queue module 111, wherein, service queue order module 110 be used for to all service queues in dispatching cycle according to priority the parameter corresponding priorities sort.Promptly determine the priority of each service queue for the priority parameters that each service queue calculated according to priority parameters computing unit 10.

Scheduling service queue module 111 is used for carrying out resource allocation with 110 alignment ordered pairs of service queue order module service queue.Promptly each service queue in dispatching cycle is carried out resource allocation, to finish the scheduling of service queue by service queue order module 110 determined priority.

Fig. 4 is another structural representation of physical resource scheduling unit among Fig. 1, as shown in Figure 4, another physical resource scheduling unit 11 of the present invention comprises service queue classifying module 112, user terminal priority determination module 113 and teleservice scheduler module 114, wherein, service queue classifying module 112 is used for all service queues in dispatching cycle are sorted out by affiliated user terminal.

User terminal priority determination module 113 is used for determining with the priority parameters of service queue under each user terminal the priority of user terminal.Among the present invention, adopt the priority of limit priority corresponding in the priority parameters of service queue under the user terminal, promptly with the priority of the service queue that the service queue medium priority is the highest under the user terminal priority as user terminal as this user terminal.

It is that terminal is carried out resource allocation that teleservice scheduler module 114 is used for the user terminal priority order.Promptly carry out resource allocation by UE, finishing the scheduling to this UE service queue, first dispatching priority is the service queue of the highest UE, and the service queue of the UE of scheduling time preferential rank successively again is until the service queue of having dispatched all UE in dispatching cycle.

Fig. 5 is the flow chart that the present invention is based on the business scheduling method of service quality, and as shown in Figure 5, the business scheduling method that the present invention is based on service quality may further comprise the steps:

Step 501: calculate in dispatching cycle and treat the dispatching services priority parameter of service queue.Promptly at first determining parameter relevant with service queue and corresponding coefficient weight thereof, specifically is to calculate C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEAnd corresponding weight coefficient A _Td1, A _SPI, A _Td2, A _T, A _UE, concrete account form can be referring to the associated description of the service dispatching device part that the present invention is based on service quality.According to following formula computing service priority parameter of service queue:

$A_{\mathrm{Td}1}*C_i^{\mathrm{Td}1}+A_{\mathrm{Td}2}*C_i^{\mathrm{Td}2}+A_R*C_i^T+A_{\mathrm{SPI}}*C_i^{\mathrm{SPI}}+A_{\mathrm{UE}}*C_k^{\mathrm{UE}}$

Select for use at least one parameter in the following formula to come the computing service priority parameter of service queue according to the situation of computing service formation.When selecting for use parameter to surpass one, then need to determine the weight of these parameter correspondences.

Step 502: according to priority the determined dispatching priority of parameter is dispatched physical resource.

The present invention has two kinds of scheduling modes, a kind of is mode by service queue priority: sort with all service queue priority parameters corresponding priorities in dispatching cycle, in regular turn for each service queue carries out resource allocation, thereby finish scheduling to service queue.

Another kind of mode is by the priority of user terminal service queue to be dispatched, be specially: all service queues in dispatching cycle are sorted out by affiliated user terminal, determine the priority of user terminal with the priority parameters of service queue under each user terminal, and be that terminal is carried out resource allocation, thereby service queue is finished scheduling by UE with the user terminal priority order.The present invention adopts the priority of limit priority corresponding in the priority parameters of the affiliated service queue of user terminal as this user terminal.

Wherein, treat that dispatching services queue priority parameter calculated before arriving dispatching cycle.

The determined service queue priority of the present invention has fully guaranteed professional QoS, has improved the performance of service dispatching.

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

Claims (12)

1, a kind of quality-of-service based business scheduling method is characterized in that, this method comprises:

Calculate in dispatching cycle and treat the dispatching services priority parameter of service queue, according to priority the determined dispatching priority of parameter is dispatched physical resource.

2, quality-of-service based business scheduling method according to claim 1 is characterized in that, the described dispatching services priority parameter of service queue for the treatment of is relevant with in the following parameter at least one:

The formation transmission time delay parameters C ^Td1, queue scheduling priority indication parameter C ^SPI, activate the formation transmission time delay parameters C ^Td2, data block delay parameter C to be sent ^TAnd scheduling of user terminals relevant parameter C ^UE

3, quality-of-service based business scheduling method according to claim 2 is characterized in that, and is described when treating dispatching services priority parameter of service queue and more than one parameter correlation, for each relative parameters setting has weight coefficient.

4, according to claim 2 or 3 described quality-of-service based business scheduling methods, it is characterized in that, described physical resource dispatched, comprising:

Sort with all service queue priority parameters corresponding priorities in dispatching cycle, carry out resource allocation for each service queue in regular turn.

5, according to claim 2 or 3 described quality-of-service based business scheduling methods, it is characterized in that, described physical resource dispatched, comprising:

All service queues in dispatching cycle are sorted out by affiliated user terminal, determined the priority of user terminal, and be that terminal is carried out resource allocation with the user terminal priority order with the priority parameters of service queue under each user terminal.

According to each described quality-of-service based business scheduling method in the claim 1 to 3, it is characterized in that 6, the described dispatching services queue priority parameter for the treatment of was calculated before arriving dispatching cycle.

7, a kind of quality-of-service based service dispatching device is characterized in that this device comprises:

The priority parameters computing unit is used to calculate and treats the dispatching services priority parameter of service queue in dispatching cycle; And

The physical resource scheduling unit, being used for according to priority, the determined dispatching priority of parameter carries out the scheduling of physical resource.

8, quality-of-service based service dispatching device according to claim 7 is characterized in that, described priority parameters computing unit is determined the priority parameters of service queue by the result of calculation of following at least one computing module:

Be used to calculate the formation transmission time delay parameters C ^Td1C ^Td1Computing module, be used to calculate the parameters C of queue scheduling priority indication ^SPIC ^SPIComputing module, be used for computing activation formation transmission time delay parameters C ^Td2C ^Td2Computing module, be used to calculate data block delay parameter C to be sent ^TC ^TComputing module and be used to calculate scheduling of user terminals relevant parameter C ^UEC ^UEComputing module.

9, quality-of-service based service dispatching device according to claim 8 is characterized in that, when described priority parameters computing unit comprised more than one parameter calculating module, correspondence comprised and is used to calculate C ^Td1, C ^SPI, C ^Td2, C ^T, C ^UEC ^Td1Weight coefficient computing module, C ^SPIWeight coefficient computing module, C ^Td2Weight coefficient computing module, C ^TWeight coefficient computing module and C ^UEThe weight coefficient computing module.

10, according to Claim 8 or 9 described quality-of-service based service dispatching devices, it is characterized in that described physical resource scheduling unit comprises:

The service queue order module, be used for to all service queues in dispatching cycle according to priority the parameter corresponding priorities sort; And

The scheduling service queue module is used for carrying out resource allocation with described service queue order module institute alignment ordered pair service queue.

11, according to Claim 8 or 9 described quality-of-service based service dispatching devices, it is characterized in that described service dispatching unit comprises:

The service queue classifying module is used for all service queues in dispatching cycle are sorted out by affiliated user terminal;

User terminal priority determination module is used for determining with the priority parameters of service queue under each user terminal the priority of user terminal; And

The teleservice scheduler module, being used for the user terminal priority order is that terminal is carried out resource allocation.

According to each described quality-of-service based service dispatching device in the claim 7 to 9, it is characterized in that 12, described priority parameters computing unit calculated and treats the dispatching services priority parameter of service queue before arriving dispatching cycle.

Images