CN1968195A - Communication system scheduling method - Google Patents
Communication system scheduling method Download PDFInfo
- Publication number
- CN1968195A CN1968195A CNA2006100846684A CN200610084668A CN1968195A CN 1968195 A CN1968195 A CN 1968195A CN A2006100846684 A CNA2006100846684 A CN A2006100846684A CN 200610084668 A CN200610084668 A CN 200610084668A CN 1968195 A CN1968195 A CN 1968195A
- Authority
- CN
- China
- Prior art keywords
- user terminal
- steps
- communication system
- priority
- dispatching
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a distributing method of communication system, wherein it comprises that: a, setting distributing period, in the period, judging if the user terminal obtains satisfied service; if there is, reducing the priority of user terminal, and distributing the resource to other user terminal without satisfied services; or else, increasing the priority, distributing resource to the user terminal first. The invention can confirm most users with speed higher than GBR, in each period.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of dispatching method of communication system.
Background technology
Insert (Wideband Code Division Multiple Access in Wideband Code Division Multiple Access (WCDMA), WCDMA) introduce a kind of new high speed data transfer technology in the R5 version---and the high speed downlink packet access (High Speed Downlink Packet Access, HSDPA).This technology has mainly adopted adaptive coding and modulation (Adaptive Modulation and Coding, AMC), rapid mixing retransmits (Hybrid Automatic Repeat request automatically, HARQ) and technology such as fast dispatch, with further raising downlink grouped data speed.Like this, improve the capacity and the spectrum efficiency of system greatly, also improved the quality of subscriber terminal service.
At present, in the communication system that high speed downlink packet inserts, (HighSpeed Downlink Shared Channel HS-DSCH) comes the transmission user terminal data by high speed descending sharing channel.Article one, the HS-DSCH channel can be born the data transmission task of a plurality of user terminals.All user terminals that are carried on this channel can divide the time and divide the different channels sign indicating number to share this channel, if the every 2ms of high speed descending sharing channel sends a secondary data (Transmission Time Interval TTI=2ms), so, different user terminals can send data in different Transmission Time Intervals, also can use different channel code to carry out data in identical Transmission Time Interval and send.The transmitting time that each user terminal data is concrete is determined by dispatching algorithm.
Usually, all guaranteed bit rate of conversation class and stream class service (Guaranteed Bit Rate, GBR) demand for services.Guarantee that bit rate is defined as: when the transmission rate of business during more than or equal to GBR, professional service quality is gratifying; When service transmission rate during less than GBR, QoS can not be accepted.
Dispatching algorithm can determine the service priority to each user terminal, and therefore, it is extremely important whether to access GBR speed for user terminal.
At present, mainly contain three kinds of dispatching algorithms commonly used:
(1) repeating query (Round Robin, RR) algorithm
The RR basic idea is: guarantee that the user terminal in the sub-district communicates according to the Radio Resource that certain sequential loop of determining takies equal time.The corresponding formation of each user terminal is to deposit data to be transferred, and the formation of non-NULL is accepted service to transmit data in the mode of repeating query when scheduling.This dispatching algorithm is that all user terminals that are carried on the HS-DSCH channel are simultaneously dispatched in turn.
Concrete, after each user terminal is set up or sent a secondary data, just start a timer, the time length that expression is waited for is in each Transmission Time Interval, according to the length of each user terminal stand-by period, rank the user terminal that the priority scheduling stand-by period is long from big to small.
Although this algorithm dispatcher can on have fairness,, owing to do not consider the concrete condition of the wireless channel of different user terminals equipment, therefore,, can not provide differentiated service to the scheduling of each subscriber terminal equipment relative fixed constantly; And this method can not make full use of the higher time period of subscriber terminal equipment channel quality, sends more data in this time period, thereby makes system resource utilization efficient and throughput of system very low; In addition, this method does not consider that user terminal guarantees the demand of GBR, so that the user terminal satisfaction is very low.
(2) max carrier to interference (Maximum Carrier to Interference, Max C/I) algorithm
Max C/I algorithm is the dispatching algorithm that a kind of typical utilization " multiple users diversity " realizes maximized system capacity.Its basic thought is: (channel quality indicator, CQI) predicted value sorts, and carries out the data transmission according to order from big to small according to the logical quality indication of its letter to all subscriber terminal equipments.
Concrete, in each Transmission Time Interval, at first, the CQI that can send the user terminal report of data lines up from big to small; Then, send the data of subscriber terminal equipment successively according to CQI order from big to small.
Although this algorithm can access maximum system throughput, but the service of user terminal gained is very unfair, can accept service apart from the subscriber terminal equipment that the base station is near well owing to its channel condition always, and be in the subscriber terminal equipment of cell edge because the logical quality indication of its letter is lower, thereby can not get service opportunity, hang down the user terminal even the meeting " being died of hunger " of channel quality; In addition, this scheme is not considered user terminal GBR demand, make the user terminal of high channel quality obtain speed much larger than GBR, and the user terminal of low channel quality can not get the GBR rate service, and the user terminal satisfaction rate is low.
(3) direct ratio justice (Proportional Fair) algorithm
The PF algorithm distributes a corresponding priority level for each subscriber terminal equipment, and the subscriber terminal equipment of priority maximum is at first accepted service.
Concrete, in each Transmission Time Interval, the user terminal that can send data is according to following formula calculating priority level, then according to priority dispatched users terminal successively from high to low:
Wherein, R
I_max(t) be constantly at t, the peak transfer rate that the user terminal present position is supported, r
i(t) scheduling rates that arrives in real income for the previous period of expression user terminal.
Although the ratio that this algorithm makes speed that the user terminal in the same sub-district can access and its present position that speed can be provided is constant substantially, be subscriber terminal equipment obtain service at any time probability much at one, but do not consider user terminal GBR demand yet, may give the user terminal of low channel quality owing to the existence that a large amount of low channel quality user terminals are arranged has distributed a large amount of chances, and the user terminal that makes the high channel quality can not get enough dispatcher meetings, makes that also satisfied user terminal number is low in the system.
If the business of setting up in communication system is stream type (for example: video request program, video telephone etc.), this business needs a GBR usually.
If the business of setting up is other business that do not have GBR demand type, if user terminal is not disposed GBR, when system resource is nervous, do not provide service so, this user terminal also can be satisfied with; If also dispose a suitable GBR, this user terminal also can obtain a basic service quality so.The more operation strategy of horn of plenty can be provided like this.
For this reason, need to design a kind of being used for, the service of GBR speed is provided for most user terminals as far as possible, make the maximum method of user terminal number that obtains satisfactory rate according to the required GBR of user terminal.
Summary of the invention
The invention reside in the dispatching method that a kind of communication system is provided.
The dispatching method of communication system of the present invention may further comprise the steps:
Steps A) is set dispatching cycle, in dispatching cycle, judges whether user terminal obtains satisfactory service; If user terminal has obtained satisfactory service, then the priority with user terminal reduces, and scheduling resource is preferentially given other do not satisfy the user terminal that guarantees speed; Otherwise the priority of user terminal is improved, make user terminal preferentially obtain scheduling resource.
Wherein, described steps A) can may further comprise the steps:
Steps A 11) at first TTI of the dispatching cycle that comprises a plurality of TTI, the data volume that each user terminal was scheduled in described dispatching cycle is set to 0;
Steps A 12) each user terminal is put into high-priority queue and Low Priority Queuing respectively;
Steps A 13) in each priority query, each user terminal is carried out priority queueing according to dispatching algorithm;
Steps A 14) according to steps A 13) middle order of lining up, the user terminal data in the schedules high priority formation is used up up to scheduling resource successively;
Steps A 15) upgrades the data volume that user terminal has been scheduled in current dispatching cycle;
Steps A 16) when entering next TTI, repeating step A11) to steps A 15).
The dispatching method of communication system of the present invention in the time of can also comprising the following steps: the data volume that sent when user terminal more than or equal to the product of GBR and dispatching cycle, thinks that user terminal obtains satisfactory service.
Wherein, described steps A 12) can comprise the following steps:
Steps A 121) in current dispatching cycle, the user terminal that obtains satisfactory service is put into Low Priority Queuing;
Steps A 122) user terminal that will not obtain satisfactory service is put into high-priority queue.
Wherein, described steps A 14) can also comprise the following steps:
Steps A 141) if the user terminal data in the described high-priority queue dispatched finish after, scheduling resource still has residue, then the user terminal data in the schedules low priority formation successively.
Wherein, described steps A) can comprise the following steps:
Steps A 21) calculates the scheduling rates that user terminal has obtained;
Steps A 22) according to steps A 21) in the scheduling rates that obtained of user terminal each user terminal is put into high-priority queue and Low Priority Queuing respectively;
Steps A 23) in each priority query, each user terminal is carried out priority queueing according to dispatching algorithm;
Steps A 24) according to steps A 23) middle order of lining up, the user terminal data in the schedules high priority formation is used up up to scheduling resource successively;
Steps A 25) when entering next TTI, repeating step A21) to steps A 24).
The dispatching method of communication system of the present invention wherein, can also comprise the following steps:
The scheduling rates that has obtained when user terminal thinks that user terminal obtains satisfactory service during more than or equal to GBR.
Wherein, described steps A 22) can comprise the following steps:
Steps A 221) in current dispatching cycle, the user terminal that obtains satisfactory service is put into Low Priority Queuing;
Steps A 222) user terminal that will not obtain satisfactory service is put into high-priority queue.
Wherein, the scheduling rates that obtained of described user terminal is that the actual schedule speed of user terminal in smoothingtime obtains by the low pass smothing filtering;
Described smoothingtime constant is 800.
Wherein, described steps A 23) can comprise the following steps:
Steps A 231) if the user terminal data in the described high-priority queue dispatched finish after, scheduling resource still has residue, then the user terminal data in the schedules low priority formation successively.
The dispatching method of communication system of the present invention, wherein, described dispatching algorithm can be MAX C/I algorithm or Round Robin algorithm or Proportional Fair algorithm.
The dispatching method of communication system of the present invention, wherein, described scheduling can be air interface HSDPA data dispatch or Iub interface data dispatch.
The dispatching method of communication system of the present invention, wherein, described communication system can be WCDMA communication system, CDMA2000 communication system or TD-SDCDMA communication system.
Beneficial effect of the present invention: according to communication system dispatching method of the present invention, can make as much as possible user in each dispatching cycle, all obtain speed more than or equal to GBR, thus whole satisfied user terminal number in the raising system.
Description of drawings
Fig. 1 is the flow chart of the communication system dispatching method of one embodiment of the invention;
Fig. 2 is the flow chart of the communication system dispatching method of another embodiment of the present invention.
Embodiment
Describe the dispatching method of communication system of the present invention in detail below in conjunction with accompanying drawing 1～2.
The embodiment of the invention can be supported the third generation (3G) wireless mobile telecommunication technology Wideband Code Division Multiple Access (WCDMA) (WCDMA) communication system with a kind of, be example and the dispatching method of communication system of the present invention is described particularly with the HSDPA system of WCDMA communication system, but the present invention is suitable for other mobile communication system except above-mentioned mobile communications network equally, as the situation of CDMA 2000 (CDMA2000) communication system or time division duplex-S-CDMA (TD-SCDMA) communication system.
Embodiment one:
For the business that majority needs GBR speed, demand to transmission rate is more stable, if rate fluctuation is excessive, may cause the temporary transient interruption of transfer of data, thereby influence service quality, therefore, when service bearer during in the HS-DSCH channel, for service speed more stably is provided, employing is based on the dispatching algorithm of dispatching cycle, make as much as possible user terminal in each dispatching cycle, all obtain the speed more than or equal to GBR, the size of dispatching cycle should satisfy in the rate fluctuation scope that business allows.
Concrete, at first, whole scheduling time is divided into a plurality of dispatching cycles, comprise a plurality of TTI each dispatching cycle, here, the length of dispatching cycle can be determined according to the rate fluctuation that business is tolerated, for example, can comprise 150～1000 TTI a dispatching cycle; Then, the data volume that has sent with user terminal whether more than or equal to " GBR * dispatching cycle " as weighing the basis for estimation whether user terminal obtains satisfied service quality, user terminal is put into 2 priority-level different queues; Then, in each priority query, according to existing algorithm (for example, MAX C/I algorithm or RoundRobin algorithm or Proportional Fair algorithm or other sort algorithms etc.) each user terminal is carried out priority queueing, user terminal data in the schedules high priority formation successively is up to the HSDPA runs out of resource sets.
Below, the implementation procedure (with reference to figure 1) of the dispatching method of the communication system of specific descriptions present embodiment:
Step 11) judges that whether current TTI is first TTI of current dispatching cycle, if then each user terminal is set to 0 in the data volume that current dispatching cycle has been scheduled, otherwise keeps original value;
Whether the data volume that step 12) has sent with user terminal is the standard whether user terminal obtains satisfactory service more than or equal to the product of GBR and dispatching cycle, all user terminals is put into 2 formations: high-priority queue and Low Priority Queuing;
Wherein, step 12) further comprises the following steps:
Step 121) in current dispatching cycle, the data volume that user terminal has sent is put into Low Priority Queuing more than or equal to the user terminal of " GBR * dispatching cycle ";
Step 122) user terminal has sent data volume and has put into high-priority queue less than the user terminal of " GBR * dispatching cycle ";
Step 13) according to MAX C/I or Round Robin or Proportional Fair scheduling algorithm, is carried out priority queueing to each user terminal in each priority query, order is for from high to low;
Step 14) is according to from high to low order in the step 13), and the user terminal data in the schedules high priority formation successively is up to the HSDPA runs out of resource sets;
Wherein, step 14) also comprises the following steps:
Step 141) if the HSDPA resource still has residue, the user terminal data in the schedules low priority formation successively then;
Step 15) is upgraded the data volume that user terminal has been scheduled in current dispatching cycle;
Step 16) enter next TTI, repeating step 11) to step 15).
According to present embodiment, constantly be divided into dispatching cycle by dispatching, in each dispatching cycle, comprise a plurality of Transmission Time Interval TTI, and the data volume that has sent according to user terminal whether greater than " GBR * dispatching cycle " as weighing the basis for estimation whether user terminal obtains satisfied service quality, user terminal is put into 2 priority-level different queues, according to existing algorithm (for example, the max carrier to interference algorithm, perhaps stand-by period length, the speed ratio that perhaps obtains or other sort algorithms etc.) be user terminal allocation schedule chance, after user terminal has reached satisfied service, then reduce the dispatching priority of this user terminal, so just residual resource can be distributed to other more needs the user terminal dispatched, thus whole satisfied user terminal number in the raising system.
Embodiment two:
The embodiment of the invention one is by be set dispatching cycle, adopts data volume that user terminal sent whether to weigh user terminal greater than " GBR * dispatching cycle " and whether obtains the satisfactory service quality.And be in the dispatching algorithm difference of the communication system of the dispatching algorithm of the communication system of present embodiment and the embodiment of the invention one, whether whether the scheduling rates that present embodiment adopts the calculating user terminal to obtain weighs user terminal more than or equal to GBR is satisfied with
Below, as shown in Figure 2, the implementation procedure of the dispatching method of the communication system of specific descriptions present embodiment:
Step 21) calculates the scheduling rates that user terminal has obtained; The scheduling rates that user terminal has obtained calculates by following formula:
That is the scheduling rates r that obtained of user terminal,
i(t) obtain by the low pass smothing filtering for the actual schedule speed of user terminal in smoothingtime Tc.
Wherein, r
i(t) scheduling rates that has obtained for user terminal, Tc are the smoothingtime constant, and unit is TTI, and it is that expression is carried out level and smooth time span to speed for what TTI; R
i(t) be that user terminal is in t actual schedule speed constantly.If user terminal is not scheduled at t constantly, so R
i(t)=0.
The value of smoothingtime constant Tc should be chosen enough big, to guarantee smoothly to fall the influence of rapid fading, still also should enough lack, and makes rate calculated can reflect the shadow fading environment.
Preferably, smoothingtime constant Tc value 800.
Step 22) whether the scheduling rates that has obtained with user terminal is the standard whether user terminal obtains satisfactory service more than or equal to GBR, all user terminals is put into 2 formations: high-priority queue and Low Priority Queuing;
Wherein, step 22) further comprise the following steps:
Step 221) works as r
i(t)＞=and during GBR, think that user terminal is satisfied, user terminal is put into Low Priority Queuing;
Step 222) works as r
i(t)＜and during GBR, think that user terminal is dissatisfied, user terminal is put into high-priority queue;
Step 23) in each priority query, according to MAX C/I or Round Robin or Proportional Fair algorithm or other sort algorithms, each user terminal is carried out priority queueing, order is for from high to low;
Step 24) according to step 23) in from high to low order, the user terminal data in the schedules high priority formation successively is up to the HSDPA runs out of resource sets;
Wherein, step 24) also comprise the following steps:
Step 241) if the HSDPA resource still has residue, the user terminal data in the schedules low priority formation successively then;
Step 25) enter next TTI, repeating step 21) to step 24).
According to present embodiment, calculate the scheduling rates that user terminal has obtained, the scheduling rates r that has obtained according to user terminal then by formula (2)
i(t) whether more than or equal to GBR as weighing the basis for estimation whether user terminal obtains satisfied service quality, user terminal is put into 2 priority-level different queues, according to existing algorithm (for example, the max carrier to interference algorithm, perhaps stand-by period length, the speed ratio that perhaps obtains or other sort algorithms) be user terminal allocation schedule chance, when user terminal has reached satisfied service, then reduce the dispatching priority of this user terminal, so just residual resource can be distributed to other more needs the user terminal dispatched, thus whole satisfied user terminal number in the raising system.
Be understandable that, more than only be air interface HSDPA data dispatch with the WCDMA system be example present invention is described, still, the present invention is not limited thereto, method of the present invention can also be applicable to the data dispatch of Iub interface.
In sum, according to the dispatching algorithm of communication system of the present invention,, make the user terminal speed that in dispatching cycle, as far as possible is guaranteed by be set dispatching cycle; In dispatching cycle, after user terminal obtains satisfactory service, just reduce the dispatching priority of this user terminal, scheduling resource is distributed to other user terminals that do not obtain satisfactory service preferentially to be used, and (for example according to existing algorithm, the max carrier to interference algorithm, perhaps stand-by period length, the speed ratio that perhaps obtains or other sort algorithms) in each priority query user terminal allocation schedule chance, when user terminal has obtained satisfied service, then reduce the dispatching priority of this user terminal, so just remaining scheduling resource can be distributed to other more needs the user terminal dispatched, thus whole satisfied user terminal number in the raising system.
More than describing is to make things convenient for those of ordinary skills to understand the present invention; to the detailed description that the present invention carried out; but can expect; in the scope that does not break away from claim of the present invention and contained, can also make other variation and modification, these variations and revising all in protection scope of the present invention.
Claims (14)
1. the dispatching method of a communication system is characterized in that, may further comprise the steps:
Steps A) is set dispatching cycle, in dispatching cycle, judges whether user terminal obtains satisfactory service; If user terminal has obtained satisfactory service, then the priority with user terminal reduces, and scheduling resource is preferentially given other do not satisfy the user terminal that guarantees speed; Otherwise the priority of user terminal is improved, make user terminal preferentially obtain scheduling resource.
2. the dispatching method of communication system as claimed in claim 1 is characterized in that, described steps A) may further comprise the steps:
Steps A 11) at first TTI of the dispatching cycle that comprises a plurality of TTI, the data volume that each user terminal was scheduled in described dispatching cycle is set to 0;
Steps A 12) each user terminal is put into high-priority queue and Low Priority Queuing respectively;
Steps A 13) in each priority query, each user terminal is carried out priority queueing according to dispatching algorithm;
Steps A 14) according to steps A 13) middle order of lining up, the user terminal data in the schedules high priority formation is used up up to scheduling resource successively;
Steps A 15) upgrades the data volume that user terminal has been scheduled in current dispatching cycle;
Steps A 16) when entering next TTI, repeating step A11) to steps A 15).
3. the dispatching method of communication system as claimed in claim 2 is characterized in that, also comprises the following steps:
The data volume that has sent when user terminal thinks that user terminal obtains satisfactory service during more than or equal to the product of GBR and dispatching cycle.
4. the dispatching method of communication system as claimed in claim 3 is characterized in that, described steps A 12) comprise the following steps:
Steps A 121) in current dispatching cycle, the user terminal that obtains satisfactory service is put into Low Priority Queuing;
Steps A 122) user terminal that will not obtain satisfactory service is put into high-priority queue.
5. the dispatching method of communication system as claimed in claim 2 is characterized in that, described steps A 14) also comprise the following steps:
Steps A 141) if the user terminal data in the described high-priority queue dispatched finish after, scheduling resource still has residue, then the user terminal data in the schedules low priority formation successively.
6. the dispatching method of communication system as claimed in claim 1 is characterized in that, described steps A) comprise the following steps:
Steps A 21) calculates the scheduling rates that user terminal has obtained;
Steps A 22) according to steps A 21) in the scheduling rates that obtained of user terminal each user terminal is put into high-priority queue and Low Priority Queuing respectively;
Steps A 23) in each priority query, each user terminal is carried out priority queueing according to dispatching algorithm;
Steps A 24) according to steps A 23) middle order of lining up, the user terminal data in the schedules high priority formation is used up up to scheduling resource successively;
Steps A 25) when entering next TTI, repeating step A21) to steps A 24).
7. the dispatching method of communication system as claimed in claim 6 is characterized in that, also comprises the following steps:
The scheduling rates that has obtained when user terminal thinks that user terminal obtains satisfactory service during more than or equal to GBR.
8. the dispatching method of communication system as claimed in claim 7 is characterized in that, described steps A 22) comprise the following steps:
Steps A 221) in current dispatching cycle, the user terminal that obtains satisfactory service is put into Low Priority Queuing;
Steps A 222) user terminal that will not obtain satisfactory service is put into high-priority queue.
9. the dispatching method of communication system as claimed in claim 7 is characterized in that, the scheduling rates that described user terminal has obtained is that the actual schedule speed of user terminal in smoothingtime obtains by the low pass smothing filtering.
10. the dispatching method of communication system as claimed in claim 9 is characterized in that, described smoothingtime constant is 800.
11. the dispatching method of communication system as claimed in claim 6 is characterized in that, described steps A 23) comprise the following steps:
Steps A 231) if the user terminal data in the described high-priority queue dispatched finish after, scheduling resource still has residue, then the user terminal data in the schedules low priority formation successively.
12. the dispatching method as claim 2 or 6 described communication systems is characterized in that, described dispatching algorithm is MAX C/I algorithm or Round Robin algorithm or Proportional Fair algorithm.
13. the dispatching method as claim 1 or 2 or 6 described communication systems is characterized in that, described air interface HSDPA data dispatch or the Iub interface data dispatch of being scheduling to.
14. the dispatching method as claim 1 or 2 or 6 described communication systems is characterized in that, described communication system is WCDMA communication system or CDMA2000 communication system or TD-SDCDMA communication system.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100846684A CN100502361C (en) | 2006-05-29 | 2006-05-29 | Communication system scheduling method |
| PCT/CN2007/001326 WO2007121674A1 (en) | 2006-04-21 | 2007-04-23 | A scheduling method and apparatus in communication systems |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100846684A CN100502361C (en) | 2006-05-29 | 2006-05-29 | Communication system scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1968195A true CN1968195A (en) | 2007-05-23 |
| CN100502361C CN100502361C (en) | 2009-06-17 |
Family
ID=38076752
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100846684A Active CN100502361C (en) | 2006-04-21 | 2006-05-29 | Communication system scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100502361C (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010075724A1 (en) * | 2008-12-31 | 2010-07-08 | 华为技术有限公司 | A method and apparatus for scheduling the service data of a communication system |
| CN101459965B (en) * | 2007-12-12 | 2010-07-14 | ***通信集团公司 | Method, device and communication system for resource scheduling |
| CN101848500A (en) * | 2010-05-26 | 2010-09-29 | 新邮通信设备有限公司 | Sorting method of Qos scheduling |
| CN102104969A (en) * | 2009-12-21 | 2011-06-22 | 中兴通讯股份有限公司 | Resource scheduling method and base station |
| CN102264143A (en) * | 2010-05-28 | 2011-11-30 | 鼎桥通信技术有限公司 | User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system |
| CN102387597A (en) * | 2010-08-30 | 2012-03-21 | 普天信息技术研究院有限公司 | Method for scheduling downlink data transmission |
| CN102457973A (en) * | 2010-10-27 | 2012-05-16 | 普天信息技术研究院有限公司 | GBR (Guaranteed BitRate) service scheduling method |
| CN102487515A (en) * | 2010-12-03 | 2012-06-06 | ***通信集团设计院有限公司 | LTE (Long Term Evolution) network plan simulation method and device |
| CN101459581B (en) * | 2007-12-12 | 2014-12-10 | ***通信集团公司 | Resource scheduling method, device and a communication system |
| CN106302065A (en) * | 2016-10-17 | 2017-01-04 | 上海顺久电子科技有限公司 | A kind of data transmission method and device |
| CN108572957A (en) * | 2017-03-07 | 2018-09-25 | 中兴通讯股份有限公司 | A kind of dispatching method and device of operation NE database |
-
2006
- 2006-05-29 CN CNB2006100846684A patent/CN100502361C/en active Active
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459965B (en) * | 2007-12-12 | 2010-07-14 | ***通信集团公司 | Method, device and communication system for resource scheduling |
| CN101459581B (en) * | 2007-12-12 | 2014-12-10 | ***通信集团公司 | Resource scheduling method, device and a communication system |
| WO2010075724A1 (en) * | 2008-12-31 | 2010-07-08 | 华为技术有限公司 | A method and apparatus for scheduling the service data of a communication system |
| CN102104969A (en) * | 2009-12-21 | 2011-06-22 | 中兴通讯股份有限公司 | Resource scheduling method and base station |
| CN101848500B (en) * | 2010-05-26 | 2012-12-05 | 新邮通信设备有限公司 | Sorting method of Qos scheduling |
| CN101848500A (en) * | 2010-05-26 | 2010-09-29 | 新邮通信设备有限公司 | Sorting method of Qos scheduling |
| CN102264143A (en) * | 2010-05-28 | 2011-11-30 | 鼎桥通信技术有限公司 | User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system |
| CN102264143B (en) * | 2010-05-28 | 2014-08-13 | 鼎桥通信技术有限公司 | User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system |
| CN102387597A (en) * | 2010-08-30 | 2012-03-21 | 普天信息技术研究院有限公司 | Method for scheduling downlink data transmission |
| CN102387597B (en) * | 2010-08-30 | 2014-04-09 | 普天信息技术研究院有限公司 | Method for scheduling downlink data transmission |
| CN102457973A (en) * | 2010-10-27 | 2012-05-16 | 普天信息技术研究院有限公司 | GBR (Guaranteed BitRate) service scheduling method |
| CN102457973B (en) * | 2010-10-27 | 2014-05-07 | 普天信息技术研究院有限公司 | GBR (Guaranteed BitRate) service scheduling method |
| CN102487515A (en) * | 2010-12-03 | 2012-06-06 | ***通信集团设计院有限公司 | LTE (Long Term Evolution) network plan simulation method and device |
| CN106302065A (en) * | 2016-10-17 | 2017-01-04 | 上海顺久电子科技有限公司 | A kind of data transmission method and device |
| CN106302065B (en) * | 2016-10-17 | 2019-09-20 | 上海顺久电子科技有限公司 | A kind of data transmission method and device |
| CN108572957A (en) * | 2017-03-07 | 2018-09-25 | 中兴通讯股份有限公司 | A kind of dispatching method and device of operation NE database |
| CN108572957B (en) * | 2017-03-07 | 2022-04-01 | 中兴通讯股份有限公司 | Scheduling method and device for metadata base of operation network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100502361C (en) | 2009-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1968195A (en) | Communication system scheduling method | |
| CN100566295C (en) | A kind of Packet Service scheduling method for wireless resource based on service quality guarantee | |
| CN1218591C (en) | Dynamic allocation of packet data channels | |
| CN101610551B (en) | Resource scheduling method for HSUPA | |
| CN1853386A (en) | Virtually centralized uplink scheduling | |
| CN100550691C (en) | The method of dispatching group data transmission | |
| CN101043638A (en) | Base station dispatcher, resource distribution module and dispatch control method for HSUPA | |
| CN101686196A (en) | Service scheduling method and service scheduling device | |
| CN1758781A (en) | Scheduling mode switching for uplink transmissions | |
| CN1620782A (en) | Priority control method in wireless pocket data channel | |
| CN1620177A (en) | Apparatus and method for allocating channel in a wireless communication system | |
| CN1921444A (en) | Method for classified package dispatching and resource distributing based on service quality | |
| CN1812374A (en) | Method and apparatus for managing packet data resources | |
| CN1596527A (en) | Packet transmission scheduling method and base station device | |
| CN1870468A (en) | Method for implementing group broadcasting service of multi-media broadcast | |
| CN102083221A (en) | Resource scheduling method and device based on HSDPA (high speed downlink packet access) | |
| CN1484398A (en) | Wireless communication system | |
| CN1878142A (en) | Method for confirming scheduling priority and scheduling method | |
| CN1788436A (en) | Base station, mobile station, communication system, and communication method | |
| CN1868233A (en) | Capacity scheduling method and system | |
| CN102104968A (en) | Resource scheduling method and base station | |
| CN101436921B (en) | Scheduling method and network side equipment | |
| CN1943180A (en) | Method for performing scheduling algorithm with minimum resource parameter and calculation thereof | |
| CN100461965C (en) | High-speed down block business attachment managing method, base station and system | |
| CN1735270A (en) | CDMA system up-bag dispatching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |