CN101686196A - Service scheduling method and service scheduling device - Google Patents
Service scheduling method and service scheduling device Download PDFInfo
- Publication number
- CN101686196A CN101686196A CN200810223355A CN200810223355A CN101686196A CN 101686196 A CN101686196 A CN 101686196A CN 200810223355 A CN200810223355 A CN 200810223355A CN 200810223355 A CN200810223355 A CN 200810223355A CN 101686196 A CN101686196 A CN 101686196A
- Authority
- CN
- China
- Prior art keywords
- priority
- max
- service queue
- service
- weight coefficient
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000005540 biological transmission Effects 0.000 claims abstract description 19
- 230000015572 biosynthetic process Effects 0.000 claims description 29
- 238000004364 calculation method Methods 0.000 abstract description 3
- 238000004891 communication Methods 0.000 abstract description 2
- 238000005755 formation reaction Methods 0.000 description 21
- 230000003044 adaptive effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000013468 resource allocation Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 239000012467 final product Substances 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
Images
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 unitused 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
Technical field
The present invention relates to the service dispatching technology in the wireless communication system, relate to business scheduling method and device in high speed downlink packet access (HSDPA, High Speed Downlink Packet Access) system or rather.
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.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 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, Round-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, because above-mentioned dispatching algorithm all is based on 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 determine to treat the priority of dispatching services formation, be followed successively by the described dispatching services queue assignment physical resource for the treatment of by described priority order from high to low, carry out queue scheduling.
Wherein, described C
TdDetermine that mode is: determine 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; Described C
SPIValue is the grade point of service queue priority; Described C
UEDetermine by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.
Wherein, described 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, determine 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
UEDetermine by following mode:
Wherein, determine that the described related parameter of priority for the treatment of the dispatching services formation is two when above, for described parameter is provided with weight coefficient.
Wherein, described weight coefficient is set to fixed value.
Wherein, described weight coefficient dynamically arranges according to the priority of described parameter.
Wherein, described weight coefficient dynamically arranges according to the priority of described 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 determine to treat the priority of dispatching services formation; And
Physical source distributing and scheduling unit are used for being followed successively by the described dispatching services queue assignment physical resource for the treatment of by described priority order from high to low, carry out queue scheduling.
Wherein, described priority parameters computing unit comprises C
TdComputing module, C
SPIComputing module and C
UEIn the computing module at least one, wherein, described C
TdComputing module is determined 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; Described C
SPIComputing module is determined according to the grade point of service queue priority; Described C
UEComputing module is determined by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.
Wherein, described 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, described C
TdComputing module is determined 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, described C
UEComputing module calculates C
UEMode be:
Wherein, determine that the described related parameter calculating module of priority for the treatment of the dispatching services formation is two and comprises that also weight coefficient is provided with the unit when above, be used to described parameter that weight coefficient is set.
Wherein, described weight coefficient is provided with the unit weight coefficient and is set to fixed value.
Wherein, the unit is set is that described parameter dynamically arranges weight coefficient according to the priority of described parameter to described weight coefficient.
Wherein, described weight coefficient dynamically arranges according to the priority of described 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 determine 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 as shown in Figure 1, 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 determine 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 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 provides high as far as possible transfer of data according to channel condition for the user.Below introducing the present invention is how to determine service queue priority.
Represent to determine 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 determines:
Wherein, C
TdDelay requirement according to service queue is determined, 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 determine propagation delay time Td according to UE under the service queue, be 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 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 determining C
Td, when Td＞0, illustrate that service queue is overtime, need scheduling as early as possible, this moment C
TdGet positively related value, and when Td＜=0, service queue is described as yet not to the time of being scheduled with Td, 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. determines:
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] be the basic weights of the service queue of j for priority, these basic weights are by default.γ
IkBe K user UE
kThe basic weights of middle formation i are adjusted the factor, γ
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 at γ
i MinAnd γ
Ik Max 
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, determine 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 determine CQ more accurately, at this moment,
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 described dispatching services queue assignment physical resource for the treatment of by described 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, finish the scheduling of service queue successively by the priority of service queue.
By 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.By adjusting the γ in the dispatching algorithm
IkMax threshold γ
Ik MaxCan 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
Can reduce the γ of certain customers so
Ik MaxThereby, reduce its scheduling ratio, satisfy other users' rate requirement.Reduce γ
Ik MaxThe user can be the relatively poor user of channel condition, can be that actual speed rate and expected rate differ bigger user.If after channel condition improves or number of users reduces, need to adopt the readjustment strategy, raise above-mentioned user's γ
Ik MaxThe condition that raises is the γ when all formations
IkAll less than γ
Max* s (s＜=1) and duration surpass the t2 time, and promptly all GBR users satisfy assurance bit rate and certain time.In order to prevent that table tennis from switching γ
Ik MaxThe downward modulation process as quickly as possible, and the rise process wants slow, i.e. γ
Ik MaxThe 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 determine to treat the priority of dispatching services formation.Represent to determine 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 determines:
Wherein, i represents 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 described dispatching services queue assignment physical resource for the treatment of by described 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 determined 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 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 determining C
Td, when Td＞0, illustrate that service queue is overtime, need scheduling as early as possible, this moment C
TdGet positively related value, and when Td＜=0, service queue is described as yet not to the time of being scheduled with Td, 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 determined according to the grade point of service queue priority; C
SPIComputing module 202 is determined 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 determined 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:
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 at γ
i MinAnd γ
Ik Max 
For example M gets 100,150 or 200.
As shown in Figure 2, determine that the described related parameter calculating module of priority for the treatment of 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 described parameter that weight coefficient is set.Weight coefficient is provided with unit 22 can be set to fixed value by weight coefficient.Also can be that described parameter dynamically arranges weight coefficient according to the priority of described parameter.Described weight coefficient dynamically arranges according to the priority of described 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 determined the priority of service queue to be followed successively by the described dispatching services queue assignment physical resource for the treatment of by described 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, finish 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.By adjusting the γ in the dispatching algorithm
IkMax threshold γ
Ik MaxCan 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
Can reduce the γ of certain customers so
Ik MaxThereby, reduce its scheduling ratio, satisfy other users' rate requirement.Reduce γ
Ik MaxThe user can be the relatively poor user of channel condition, can be that actual speed rate and expected rate differ bigger user.If after channel condition improves or number of users reduces, need to adopt the readjustment strategy, raise above-mentioned user's γ
Ik MaxThe condition that raises is the γ when all formations
IkAll less than γ
Max* s (s＜=1) and duration surpass the t2 time, and promptly all GBR users satisfy assurance bit rate and certain time.In order to prevent that table tennis from switching γ
Ik MaxThe downward modulation process as quickly as possible, and the rise process wants slow, i.e. γ
Ik MaxThe 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 by corresponding software or corresponding hardware circuit.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.
Claims (18)
1, a kind of 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 determine to treat the priority of dispatching services formation, be followed successively by the described dispatching services queue assignment physical resource for the treatment of by described priority order from high to low, carry out queue scheduling.
2, method according to claim 1 is characterized in that, described C
TdDetermine that mode is: determine 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; Described C
SPIValue is the grade point of service queue priority; Described C
UEDetermine by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.
3, method according to claim 2 is characterized in that, described 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.
4, method according to claim 2 is characterized in that, determines 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.
5, method according to claim 2 is characterized in that, C
UEDetermine by following mode:
Wherein, pf
Kj(t) be the weighted value of the described service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight[j] be the basic weights of the service queue of j for priority; γ
IkBe K user UE
kThe basic weights of middle formation i are adjusted the factor, γ
Ik=R
g/ R
r, R
gFor guaranteeing bit rate, R
rBe actual transfer rate.
6, method according to claim 1 is characterized in that, determines that the described related parameter of priority for the treatment of the dispatching services formation is two when above, for described parameter is provided with weight coefficient.
7, method according to claim 6 is characterized in that, described weight coefficient is set to fixed value.
8, method according to claim 6 is characterized in that, described weight coefficient dynamically arranges according to the priority of described parameter.
9, method according to claim 8 is characterized in that, described weight coefficient dynamically arranges according to the priority of described 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)).
10, a kind of 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 determine to treat the priority of dispatching services formation; And
Physical source distributing and scheduling unit are used for being followed successively by the described dispatching services queue assignment physical resource for the treatment of by described priority order from high to low, carry out queue scheduling.
11, device according to claim 10 is characterized in that, described priority parameters computing unit comprises C
TdComputing module, C
SPIComputing module and C
UEIn the computing module at least one, wherein, described C
TdComputing module is determined 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; Described C
SPIComputing module is determined according to the grade point of service queue priority; Described C
UEComputing module is determined by user's channel condition, the basic weighted value and the assurance bit rate of service queue priority.
12, device according to claim 11 is characterized in that, described 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.
13, device according to claim 11 is characterized in that, described C
TdComputing module is determined 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.
14, device according to claim 11 is characterized in that, described C
UEComputing module calculates C
UEMode be:
Wherein, pf
Kj(t) be the weighted value of the described service queue that obtains according to the direct ratio fair algorithm; PriorityQueueWeight[j] be the basic weights of the service queue of j for priority; γ
IkBe K user UE
kThe basic weights of middle formation i are adjusted the factor, γ
Ik=R
g/ R
r, R
gFor guaranteeing bit rate, R
rBe actual transfer rate.
15, device according to claim 11 is characterized in that, determines that the described related parameter calculating module of priority for the treatment of the dispatching services formation is two and comprises that also weight coefficient is provided with the unit when above, is used to described parameter that weight coefficient is set.
16, device according to claim 15 is characterized in that, described weight coefficient is provided with the unit weight coefficient and is set to fixed value.
17, device according to claim 15 is characterized in that, it is that described parameter dynamically arranges weight coefficient according to the priority of described parameter that described weight coefficient is provided with the unit.
18, device according to claim 17 is characterized in that, described weight coefficient dynamically arranges according to the priority of described 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)).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102233551A CN101686196B (en) | 2008-09-26 | 2008-09-26 | Service scheduling method and service scheduling device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102233551A CN101686196B (en) | 2008-09-26 | 2008-09-26 | Service scheduling method and service scheduling device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101686196A true CN101686196A (en) | 2010-03-31 |
| CN101686196B CN101686196B (en) | 2012-04-25 |
Family
ID=42049177
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102233551A Active CN101686196B (en) | 2008-09-26 | 2008-09-26 | Service scheduling method and service scheduling device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101686196B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827446A (en) * | 2010-04-09 | 2010-09-08 | 新邮通信设备有限公司 | Radio bearer scheduling method and device |
| CN102264145A (en) * | 2010-05-31 | 2011-11-30 | ***通信集团公司 | Service scheduling method, device and system |
| CN102333035A (en) * | 2011-09-28 | 2012-01-25 | 中兴通讯股份有限公司 | Router and resource reservation protocol (RSVP) pre-reserved resource scheduling method and device |
| CN102469602A (en) * | 2010-11-19 | 2012-05-23 | 普天信息技术研究院有限公司 | Method for user multi-service dispatching |
| CN102946362A (en) * | 2012-09-13 | 2013-02-27 | 杭州华三通信技术有限公司 | Method and device for allocating socket resources |
| WO2013075446A1 (en) * | 2011-11-22 | 2013-05-30 | 华为技术有限公司 | Service processing method and system |
| CN103973593A (en) * | 2014-05-09 | 2014-08-06 | 中国电子科技集团公司第三十研究所 | IP voice dispatching method |
| CN104168318A (en) * | 2014-08-18 | 2014-11-26 | 中国联合网络通信集团有限公司 | Resource service system and resource distribution method thereof |
| CN105554886A (en) * | 2015-12-04 | 2016-05-04 | 京信通信技术(广州)有限公司 | Method and device for resource scheduling |
| CN105721116A (en) * | 2014-12-04 | 2016-06-29 | 中兴通讯股份有限公司 | HARQ (hybrid automatic repeat request) process number distribution method and device |
| CN107196877A (en) * | 2016-03-14 | 2017-09-22 | 华为技术有限公司 | The method and its network equipment of control of network flow quantity |
| CN108365924A (en) * | 2017-01-26 | 2018-08-03 | 华为技术有限公司 | A kind of data repeating method, communication device |
| CN109360397A (en) * | 2018-10-30 | 2019-02-19 | 国网北京市电力公司 | The system that method, data dispatching method and the multilist collection that multilist collection is copied are copied |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN111314243A (en) * | 2020-01-21 | 2020-06-19 | 北京工业大学 | LoRa network QoS scheduling management method supporting complex service data transmission |
| CN111835654A (en) * | 2019-04-19 | 2020-10-27 | 海能达通信股份有限公司 | Method and device for improving sensing rate, storage medium and electronic equipment |
| CN111950832A (en) * | 2019-05-17 | 2020-11-17 | 拉扎斯网络科技（上海）有限公司 | Scheduling method, device, server cluster and storage medium |
| CN113490281A (en) * | 2021-07-20 | 2021-10-08 | 上海中兴易联通讯股份有限公司 | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100574178C (en) * | 2005-07-04 | 2009-12-23 | 上海原动力通信科技有限公司 | Realize equipment, the system and method for multi-carrier-wave high-speed down-converter grouped accessing business |
| CN100544245C (en) * | 2006-02-10 | 2009-09-23 | 中兴通讯股份有限公司 | A kind of retransfer scheduling method of the HARQ agreement based on number of retransmissions |
| CN100459582C (en) * | 2006-09-21 | 2009-02-04 | 电子科技大学 | Group dispatching and channel distributing method for HSDPA system |
-
2008
- 2008-09-26 CN CN2008102233551A patent/CN101686196B/en active Active
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827446B (en) * | 2010-04-09 | 2012-09-05 | 新邮通信设备有限公司 | Radio bearer scheduling method and device |
| CN101827446A (en) * | 2010-04-09 | 2010-09-08 | 新邮通信设备有限公司 | Radio bearer scheduling method and device |
| CN102264145A (en) * | 2010-05-31 | 2011-11-30 | ***通信集团公司 | Service scheduling method, device and system |
| CN102264145B (en) * | 2010-05-31 | 2014-12-31 | ***通信集团公司 | Service scheduling method, device and system |
| CN102469602B (en) * | 2010-11-19 | 2014-06-04 | 普天信息技术研究院有限公司 | Method for user multi-service dispatching |
| CN102469602A (en) * | 2010-11-19 | 2012-05-23 | 普天信息技术研究院有限公司 | Method for user multi-service dispatching |
| CN102333035B (en) * | 2011-09-28 | 2017-11-07 | 中兴通讯股份有限公司 | Router and its rsvp reservation resource regulating method and device |
| CN102333035A (en) * | 2011-09-28 | 2012-01-25 | 中兴通讯股份有限公司 | Router and resource reservation protocol (RSVP) pre-reserved resource scheduling method and device |
| WO2013075446A1 (en) * | 2011-11-22 | 2013-05-30 | 华为技术有限公司 | Service processing method and system |
| CN103139100A (en) * | 2011-11-22 | 2013-06-05 | 华为技术有限公司 | Business handling method and business handling system |
| CN102946362B (en) * | 2012-09-13 | 2016-08-31 | 杭州华三通信技术有限公司 | A kind of socket resource allocation methods and equipment |
| CN102946362A (en) * | 2012-09-13 | 2013-02-27 | 杭州华三通信技术有限公司 | Method and device for allocating socket resources |
| CN103973593B (en) * | 2014-05-09 | 2017-03-15 | 中国电子科技集团公司第三十研究所 | A kind of ip voice dispatching method |
| CN103973593A (en) * | 2014-05-09 | 2014-08-06 | 中国电子科技集团公司第三十研究所 | IP voice dispatching method |
| CN104168318A (en) * | 2014-08-18 | 2014-11-26 | 中国联合网络通信集团有限公司 | Resource service system and resource distribution method thereof |
| CN104168318B (en) * | 2014-08-18 | 2018-03-23 | 中国联合网络通信集团有限公司 | A kind of Resource service system and its resource allocation methods |
| CN105721116A (en) * | 2014-12-04 | 2016-06-29 | 中兴通讯股份有限公司 | HARQ (hybrid automatic repeat request) process number distribution method and device |
| CN105554886A (en) * | 2015-12-04 | 2016-05-04 | 京信通信技术(广州)有限公司 | Method and device for resource scheduling |
| CN107196877A (en) * | 2016-03-14 | 2017-09-22 | 华为技术有限公司 | The method and its network equipment of control of network flow quantity |
| US11316795B2 (en) | 2016-03-14 | 2022-04-26 | Huawei Technologies Co., Ltd. | Network flow control method and network device |
| CN108365924A (en) * | 2017-01-26 | 2018-08-03 | 华为技术有限公司 | A kind of data repeating method, communication device |
| CN108365924B (en) * | 2017-01-26 | 2021-02-12 | 华为技术有限公司 | Data retransmission method and communication device |
| US11082166B2 (en) | 2017-01-26 | 2021-08-03 | Huawei Technologies Co., Ltd. | Data retransmission method and communications apparatus |
| CN109360397A (en) * | 2018-10-30 | 2019-02-19 | 国网北京市电力公司 | The system that method, data dispatching method and the multilist collection that multilist collection is copied are copied |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN109962760B (en) * | 2019-04-09 | 2022-08-30 | 湖南智领通信科技有限公司 | Service scheduling method suitable for wireless TDMA ad hoc network |
| CN111835654A (en) * | 2019-04-19 | 2020-10-27 | 海能达通信股份有限公司 | Method and device for improving sensing rate, storage medium and electronic equipment |
| CN111835654B (en) * | 2019-04-19 | 2023-08-11 | 海能达通信股份有限公司 | Method and device for improving perceived rate, storage medium and electronic equipment |
| CN111950832A (en) * | 2019-05-17 | 2020-11-17 | 拉扎斯网络科技（上海）有限公司 | Scheduling method, device, server cluster and storage medium |
| CN111314243A (en) * | 2020-01-21 | 2020-06-19 | 北京工业大学 | LoRa network QoS scheduling management method supporting complex service data transmission |
| CN111314243B (en) * | 2020-01-21 | 2022-04-15 | 北京工业大学 | LoRa network QoS scheduling management method supporting complex service data transmission |
| CN113490281A (en) * | 2021-07-20 | 2021-10-08 | 上海中兴易联通讯股份有限公司 | Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101686196B (en) | 2012-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101686196B (en) | Service scheduling method and service scheduling device | |
| US7668150B2 (en) | Packet-priority control apparatus and method thereof | |
| JP4173508B2 (en) | Packet scheduling | |
| CN100566295C (en) | A kind of Packet Service scheduling method for wireless resource based on service quality guarantee | |
| JP4397928B2 (en) | A method for allocating resources of a wireless communication network to traffic to be transmitted to user equipment over a network channel | |
| JP4510826B2 (en) | Method for scheduling uplink transmission of user equipment and base station | |
| WO2007040698A2 (en) | Scheduling a priority value for a user data connection based on a quality of service requirement | |
| EP1938521A1 (en) | Scheduling depending on quality of service and channel properties | |
| Choi et al. | MAC scheduling scheme for VoIP traffic service in 3G LTE | |
| WO2003051007A1 (en) | Priority scheduler | |
| JP2007507951A (en) | Virtually centralized uplink scheduling | |
| CN101425964B (en) | Service scheduling method and apparatus based on QoS | |
| US7394768B2 (en) | Fair scheduling with guaranteed minimum parameter | |
| CN103442446A (en) | Dynamic and semi-static combined dispatching method in LTE system | |
| Song et al. | Packet-scheduling algorithm by the ratio of transmit power to the transmission bits in 3GPP LTE downlink | |
| EP1718002A1 (en) | User selection method and device for data packet services in wireless communication systems | |
| Rhee et al. | A wireless fair scheduling algorithm for 1/spl times/EV-DO system | |
| CN100536603C (en) | Mobile communication system scheduling method | |
| EP1473886B1 (en) | Fair scheduling with guaranteed minimum parameter | |
| CN100369502C (en) | Direct proportion fair dispatch method for base station selective service terminal | |
| Golaup et al. | A packet scheduling algorithm supporting multimedia traffic over the HSDPA link based on early delay notification | |
| Choi et al. | QoS scheduling for multimedia traffic in packet data cellular networks | |
| WO2007121674A1 (en) | A scheduling method and apparatus in communication systems | |
| Choi et al. | WAF: wireless-adaptive fair scheduling for multimedia stream in time division multiplexed packet cellular systems | |
| Öberg | Evaluation of scheduling algorithms for a web browsing service in WCDMA high speed downlink shared channel |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C57 | Notification of unclear or unknown address | ||
| DD01 | Delivery of document by public notice |
Addressee: Wu Guoxin Document name: Notification of Passing Preliminary Examination of the Application for Invention |
|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD. Effective date: 20110407 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 29, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100191 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20110407 Address after: 100191 Haidian District, Xueyuan Road, No. 40, Applicant after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 Haidian District, Xueyuan Road, No. 29, Applicant before: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210531 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |