CN1710980A - Downstream grouped data scheduling method suitable to mobile communication system - Google Patents
Downstream grouped data scheduling method suitable to mobile communication system Download PDFInfo
- Publication number
- CN1710980A CN1710980A CN 200410048327 CN200410048327A CN1710980A CN 1710980 A CN1710980 A CN 1710980A CN 200410048327 CN200410048327 CN 200410048327 CN 200410048327 A CN200410048327 A CN 200410048327A CN 1710980 A CN1710980 A CN 1710980A
- Authority
- CN
- China
- Prior art keywords
- class
- packet data
- priority
- service
- queue
- 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 26
- 238000010295 mobile communication Methods 0.000 title claims description 10
- 238000012544 monitoring process Methods 0.000 claims abstract description 7
- 230000015572 biosynthetic process Effects 0.000 claims description 36
- 239000000872 buffer Substances 0.000 claims description 11
- 238000005259 measurement Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 description 18
- 230000006870 function Effects 0.000 description 10
- 238000012546 transfer Methods 0.000 description 5
- 230000009897 systematic effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000002452 interceptive effect Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Abstract
Under condition of ensuring QoS of access user effectively, the invention takes full advantage of wireless resources. Queue management module provides information of each service queue, including time delay of waiting queue, and length of queue for scheduling and decision-making module. Link quality monitoring module reports information of link quality for the scheduling module. Using strategy of combining fixed priority with relative priority, the scheduling module carries out down going dispatch. In fixed priority, the method puts access services into different classes based on QoS needed. In scheduling time is arrived, services in class of high priority is selected first. Only if there is no packet data to be transmitted, then services in class of next high priority is selected. In relative priority, the method transmits packet data queue with largest priority parameter selected from same class. Parameter is calculated from formula from QoS of link, length of queue etc.
Description
Technical field
The present invention relates to mobile communication technology, relate to a kind of downlink grouped data dispatching method that is applicable to 3-G (Generation Three mobile communication system) (IMT-2000) or rather, can effectively guarantee under the situation of access QoS of customer (QoS), make full use of finite wireless resources, improve systematic function.
Background technology
The packet scheduling technology of CDMA2000 1X is a kind of comparatively novel, the otherwise effective technique in the existing Packet Service solution.
In data communication, for up link, downlink grouping traffic need take more wireless bandwidth resource.Based on this asymmetric property of Packet Service, the EV-DO system of CDMA2000 1X has adopted high speed shared channels on down link, transmits each grouping user data in the mode of time-division.When carrying out the downlink grouped data scheduling, the grouping user data that the prioritised transmission priority is the highest, the transmission priority of grouping user k is determined by following function (1):
Wherein, R
k(t) be the average transmission rate of grouping user k at moment t; DRC
k(t) be grouping user k estimates and report application according to downlink quality at moment t data rate.
When scheduling arrives constantly, select δ
kMaximum grouping user data are transmitted.Like this, (the transmission rate DRC of request when user's channel quality is better
k(t) bigger) can obtain more transmission opportunity, thus improve the throughput of system; When user's channel quality relatively poor, thereby cause average transmission rate R
kWhen (t) hanging down, can make δ equally
kValue increases, and obtains transmission opportunity, thereby utilizes above-mentioned function (1) to decide the transmission priority of grouping user, has embodied certain fairness.
In 3-G (Generation Three mobile communication system) (IMT-2000), wireless access network not only needs to carry traditional speech business, also introduced multiple new business with different QoS requirements, as real-time multimedia service and various high-speed packet data services etc., therefore how effectively to guarantee to insert under the situation of QoS of customer (QoS), make full use of finite wireless resources, improve systematic function, become an important topic of RRM.
Aforesaid downlink grouped data scheduling scheme has been traded off preferably and has been improved the requirement of throughput of system and realization user fairness two aspects, but does not consider the different needs of problems of different service types to QoS.For example, the part Packet Service has strict delay requirement, and the part Packet Service is looser to the requirement of time delay, if can when dispatching group data, make full use of this characteristic, just can be under the situation that effectively guarantees different service types user QoS the further capacity and the resource utilization of raising system.
Summary of the invention
The purpose of this invention is to provide a kind of downlink grouped data dispatching method that is applicable to mobile communication system (as IMT-2000), in the downlink grouped data scheduling, take into full account the different needs of problems of different service types, thereby further improve the capacity and the resource utilization of system QoS.
The technical scheme that realizes the object of the invention is: a kind of downlink grouped data dispatching method that is applicable to mobile communication system, dispatch at the non real-time Packet data service, and it is characterized in that comprising following treatment step:
A. by queue management module according to the demand of accessing group data business to service quality, to put into for the traffic queue that the Packet data service of this access is created " class " of respective service quality, and a packet data queues corresponding with it in " class " is somebody's turn to do in the arrival of the speed of this accessing group data business of pressing, a service quality " class " height corresponding with a kind of QoS requirement and that press QoS requirement is determined the priority of " class ", queue management module is calculated the wait time delay and the queue length thereof of each packet data queues in each service quality " class ", and reports to the scheduling decision module;
B. when scheduling arrives constantly, the scheduling decision module is at first selected the high service quality of priority " class ", when the packet data queues that will not send in the service quality " class " of high priority, select the service quality " class " of time high priority, in the service quality of selecting " class ", the packet data queues that the selecting priority parameter is maximum relatively again, priority is the highest is transmitted, and the wait time delay of this priority argument and this formation and the length of this formation are relevant.
The present invention is provided with queue management, link-quality monitoring and three functional modules of scheduling decision, and wherein, queue management module provides each service queue information to the scheduling decision module periodically, comprises waiting for time delay w
i(t) and queue length l
i(t), the link-quality monitoring modular reports the link quality information φ of each service queue that has inserted periodically to the scheduling decision module
i(t), by above-mentioned information each Packet Service that has inserted is carried out descending scheduling by the scheduling decision module.The strategy that when making a strategic decision, has adopted fixed priority and relative priority level to combine, its fixed priority is the basis QoS demand of access service, access service is divided into different " class ", between different " classes ", adopt the scheduling strategy of fixed priority, promptly when scheduling arrives constantly, select high " class " of priority at first to transmit, when only in " class " of high priority, not having grouped data to be sent, just select " class " of time high priority to transmit.Its relative priority level is meant in same " class ", adopts the scheduling strategy of relative priority level, promptly the selecting priority parameter relatively the packet data queues of maximum (priority is the highest) transmit.The size of each packet data queues priority argument is determined by a formula, has comprised the downlink quality φ of t packet data queues constantly in this formula
i(t) (as the performance parameters such as signal interference ratio SIR, block error rate BLER or bit error rate BER that report by the mobile terminal UE measurement), the queue length l of t packet data queues constantly
i(t), the t packet data queues is waited for time delay w constantly
i(t) and the desired time delay thresholding of packet data queues W
THiAnd the early warning thresholding L that overflows of buffer memory
THiDeng.
Compared with prior art, the present invention is when carrying out grouped data scheduling, the different demands of various novel Packet Services have been taken into full account to QoS, the grouped data correspondence of various different QoS requirements is put into " class " of representing different QoS, adopt the fixed priority scheduling between " class ", thereby can under the situation that satisfies user QoS characteristic demand, admit more users, improve the capacity of system; To with adopting the scheduling of relative priority level between " class " Packet Service individual queue, considered of the influence of packet data queues size to system resource, avoided buffer memory to overflow effectively to resource waste; Simultaneously, also consider user's radio link quality, the wait time delay of each packet data queues, under the situation that guarantees certain algorithm fairness, further improved the throughput of system.
Description of drawings
Fig. 1 is a downlink grouped data scheduling schematic diagram;
Fig. 2 is a downlink grouped data scheduling flow block diagram.
Embodiment
The principle of the downlink grouped data scheduling scheme of the present invention's design as shown in fig. 1.
Downlink grouped data dispatching algorithm of the present invention can be divided for from the function logic by queue management (Queue Management) module 11, link-quality monitoring (Link Surveillance) module 12 and scheduling decision (Scheduler) module 13 totally three modules finish.Introduced following major parameter in the algorithm:
w
i(t): the wait time delay of packet data queues i during moment t;
l
i(t): the queue length of packet data queues i during moment t;
φ
i(t): the downlink quality of packet data queues i during moment t, as measure signal interference ratio (SIR:Signal to Interference Ratio), Block Error Rate (BLER:Block Error Ratio) or the bit error rate (BER:Bit Error Ratio) etc. that report by portable terminal (UE).
In the implementation of each modular algorithm, queue management module 11 at first can be created a data flow queue for the Packet Service of each access, and according to the QoS characteristic demand of this Packet Service this traffic queue is put into different " class " (QoS Class).Having as shown in FIG. 1 to m " class ".
According to different QoS characteristic demand, mainly, Packet Service is divided into different " class (QoS Class) " based on the delay character of business.As: the non real-time Packet data service higher (the present invention is only at the non real-time Packet data service), be placed in the priority the highest " class 1 " as web page browsing (Web Browsing) to delay requirement; Non real-time Packet data service loose relatively to delay requirement, that do one's best, download as the background of E-mail and to be placed in the priority time high " class 2 ".During realization, can be according to the concrete QoS characteristic requirements set a plurality of " classes " (as m class) of above-mentioned rule, as when introducing new business according to business.
Also can pass through at third generation partner program (3GPP, International Standards Organization's definition) setting up certain mapping relations between " type of service " and " class " (the QoS Class) in realizes, as: " interactive class " (Interactive Class) the non real-time Packet Service comparatively strict to delay requirement can be mapped to priority the highest " class 1 ", then can be mapped to priority time high " class 2 " to delay requirement loose relatively " background classes " (Background Class) non real-time Packet data service.When carrying out grouped data scheduling, at first can select the packet data queues in the priority high " class " (being each QoS of survice characteristic demand higher " class ") to carry out transfer of data.
The traffic queue of each grouped data can be with different service rate λ (t)
M, iArrive the formation in determined " class ", as 1 to N service rate formation.Queue management module 11 by be provided with for each formation counter add up its etc. time delay w to be transmitted
i(t): under the situation of former formation, have grouping to arrive for sky, or enabling counting device to the finishing scheduling of this formation but during the formation non-NULL, begin counting with the T of regular hour unit (as 10ms), counting finishes when the scheduled transmission to this formation begins, then Ci Shi wait time delay w
i(t) be: N (counter values) * T (chronomere).Simultaneously, queue management module 11 also can be monitored byte (Bytes) length l of individual queue
i(t), with the wait time delay w of individual queue
i(t) periodic report is given scheduling decision unit 13 together.
Link monitoring module 12 in the algorithm can be controlled the grouping user that has inserted and monitor its downlink quality φ
i(t), and periodic report gives scheduling decision module 13, dispatches judgement for it.
When each Packet Service is dispatched, scheduling decision module 13 will read up-to-date queue management information: w
i(t), l
i(t), and in conjunction with each insert user's downlink quality φ
i(t), dispatch judgement, select packet data queues to carry out transfer of data according to following algorithm.
At first, scheduling decision module 13 adopts the scheduling strategy of fixed priority between each " class ", that is: at first select the formation in the priority the highest " class 1 " to transmit, only when the packet that do not need in this " class " to transmit, just consider priority time high " class 2 " dispatched.And the like.
Then, for each packet data queues in same " class " chosen, scheduling decision module 13 has adopted the relative priority level scheduling strategy based on priority, the user data in the high formation of promptly first transmission priority parameter.The priority argument of individual queue is pressed the following formula decision:
W in the formula
THi, L
THiBe respectively the wait time delay thresholding of i formation and the length threshold of i formation (also being the early warning thresholding that buffer memory overflows).By (2) formula as seen, at the dispatching priority of determining formation temporary, introduced and inserted the downlink quality φ that grouping user is measured
i(t), the average waiting time delay of formation
Length l with formation
i(t), N is the packet data queues sum in " class ".Like this, under the situation that satisfies each QoS of survice characteristic requirement, algorithm can be selected the good user's transmission of link-quality as far as possible, thereby can reach the higher data transmission rate, reduces the probability of packet retransmissions present, further improves the throughput of system.
Utilize formula (3), (4) further to explain obtaining of formula (2) parameter below.In 3-G (Generation Three mobile communication system), time delay is a very important index in the various Packet Service QoS characteristic demands.Therefore, for satisfying quality of services for users, when scheduling, must consider the delay requirement that each is professional.Because all kinds of business to the requirement difference of time delay, are carrying out need at first carrying out normalized when priority is calculated, that is: hypothesis is W to the time delay threshold requirement of a certain customer service i
THi, be w in its normalization time delay of moment t so
i(T)/W
THiLike this, pass through computing formula (3) at moment t:
Obtained the time delay of formation i and be somebody's turn to do the deviation between all formation average delays in " class ", with this power exponent exp as exponential function.When deviation is big (link-quality is relatively poor relatively, causes and waits for that time delay is longer), functional value can rise with bigger slope, thereby can increase the priority of its scheduling more timely; And deviation hour (be that link-quality is more or less the same, wait for that time delay is basic identical), it is less that functional value changes, and this moment, the priority function was mainly with φ
i(t) be with reference to determining transmit queue, to improve the throughput of system.Therefore, by the delay requirement parameter after this normalized, not only can effectively satisfy of the requirement of each business, even guaranteed that also user (as user of cell edge) under relatively poor chain environment also can access service, has embodied the fairness of algorithm simultaneously to time delay.
The link of considering the certain user again may be in relatively poor state for a long time, with the wait time delay w in the such scheme
i(t) utilize formula (4) further to be optimized for the average waiting time delay:
W wherein
i(t) be the current wait time delay of this formation of queue management module report,
It is the average latency before last this formation of scheduling, a is forgetting factor (0＜a≤1), t is the moment of this formation of current scheduling, t-Δ t is the moment of last this formation of scheduling, like this, when the user owing to continuing to be in service opportunity that the relatively poor wireless environment of link-quality obtains more after a little while, the average latency can progressively increase, thereby makes the user obtain the more service chance.
It should be noted that a value can not be too big, otherwise will be obvious inadequately the improvement of QoS of customer; The value of a also can not be too little, otherwise can not react the variation of current wireless environment faster.Can obtain by above-mentioned analysis, can change the service opportunity that is in user under the relatively poor wireless environment by the value that changes a, thereby improve the fairness of algorithm.Therefore, the visual actual conditions of the value of a are adjusted.
In the realization, can be by coming the buffer memory downlink grouped data for a buffer of each queue assignment (Buffer), but because the variation of wireless environment and grouped data is sudden, can be under some situation because the overflowing and cause the part dropping packet data of " Buffer ", but the grouped data that this part is dropped, taken the resource of core net, public network and opposite end, the result who finally is dropped has caused the very big wasting of resources undoubtedly; Simultaneously, under the identical situation of other conditions, select the long formation transmission of the big formation in other words of grouping also can improve the resource utilization of current wireless interface.Therefore, in priority formula (2), introduced queue length parameter l again
i(t) and queue length threshold L
THi, to its processing of carrying out with
Similar.Queue length threshold L
THi(byte) also is the early warning thresholding that buffer memory overflows, and can rationally be provided with according to each professional characteristic (as service rate) and cache size.Because its effect is the sudden influence to transfer of data of the environmental change of monitoring current wireless, grouped data, improves systematic function, does not therefore need again to l here
i(t) average processing.
In 3-G (Generation Three mobile communication system) (IMT-2000), each main flow system standard (TD-SCDMA, WCDMA, CDMA2000 etc.) all wave point be Packet Service transmission configuration shared channel.By said method, on shared channel, realize the scheduled transmission of grouping user, can under the prerequisite that effectively guarantees QoS of customer, further improve the throughput and the resource utilization of system.For example, in the TD-SCDMA system, the rlc layer of radio network controller (RNC) can carry out caching process to each downlink grouped data that inserts the user, respectively measures message by configuration, reception, and the w in the above-mentioned algorithm can further be known in the radio resource management function unit
i(t), l
i(t), φ
i(t) etc. important parameter information is carried out scheduled transmission according to flow process to the grouped data that each inserts the user at interval according to certain scheduling time then.
Referring to Fig. 2, shown in the figure each access user's grouped data is carried out the flow process of scheduled transmission.
Step 21: after grouping user inserted, the measurement report that queue management module sends by mobile terminal receive (UE) and radio network controller (RNC) obtained or upgrades the w of each Packet Service formation
i(t), l
i(t), φ
iImportant parameter such as (t);
Step 22: when scheduling arrives constantly,, promptly own the l in " classes " if all grouping user of current access all do not have data to need transmission
i(t)=0, return step 21 after then wait for a period of time (as several TTI), otherwise carry out step 23;
Step 23: queue management module begins to search the highest " classes " of priority to be transmitted such as grouped data is arranged, i.e. l
i(t) ≠ 0 " class " that priority is the highest;
Step 24: the parameter that integrating step 21 obtains, calculating should " class " middle individual queue priority valve p
i(t) size;
Step 25: the scheduling decision module selects the formation of priority valve maximum in the step 24 to carry out transfer of data, returns step 21 then.
Method of the present invention can effectively guarantee under the situation of access QoS of customer in the downlink grouped data business, making full use of finite wireless resources, improves systematic function.
The strategy that the inventive method has adopted fixed priority and relative priority level to combine when making a strategic decision.Its fixed priority is the basis QoS demand of access service, access service is divided into different " class ", the priority of " class " that the QoS demand is high is also high, between different " classes ", adopt the scheduling strategy of fixed priority, when promptly scheduling arrives constantly, at first select priority high " class " to transmit, when only in " class " of high priority, not having packet to send, just select " class " of time high priority to carry out transfer of data.Its relative priority level is meant in " class " chosen, adopts the scheduling strategy of relative priority level, and the promptly preferential selecting priority parameter formation of maximum (priority is the highest) is relatively transmitted.This priority argument is to take all factors into consideration the result of the link-quality of the wait time delay of formation, queue length, this formation CU and the wait time delay thresholding of formation, the length threshold of formation etc., and utilizes formula to calculate and realize.
For tdd systems, as TD---the SCDMA system, downlink grouped data dispatching method of the present invention is finished in radio network controller (RNC).
Claims (11)
1. a downlink grouped data dispatching method that is applicable to mobile communication system is dispatched at the non real-time Packet data service, it is characterized in that comprising following treatment step:
A. by queue management module according to the demand of accessing group data business to service quality, to put into for the traffic queue that the Packet data service of this access is created " class " of respective service quality, and a packet data queues corresponding with it in " class " is somebody's turn to do in the arrival of the speed of this accessing group data business of pressing, a service quality " class " height corresponding with a kind of QoS requirement and that press QoS requirement is determined the priority of " class ", queue management module is calculated the wait time delay and the queue length thereof of each packet data queues in each service quality " class ", and reports to the scheduling decision module;
B. when scheduling arrives constantly, the scheduling decision module is at first selected the high service quality of priority " class ", when the packet data queues that will not send in the service quality " class " of high priority, select the service quality " class " of time high priority, in the service quality of selecting " class ", the packet data queues that the selecting priority parameter is maximum relatively again, priority is the highest is transmitted, and the wait time delay of this priority argument and this formation and the length of this formation are relevant.
2. method according to claim 1, it is characterized in that: the service quality in the described steps A " class " is based on the delay character of Packet data service the characteristic demand of service quality to be divided " class " by queue management module, to be placed in the priority high " class " the high non real-time Packet data service of delay requirement, non real-time Packet data service loose relatively to delay requirement, that do one's best will be placed in the priority low " class ".
3. method according to claim 1, it is characterized in that: the service quality in the described steps A " class " is to set up mapping relations by queue management module between " Packet data service type " and service quality " class ", to be mapped in the priority high " class " the high non real-time Packet data service of delay requirement, non real-time Packet data service loose relatively to delay requirement, that do one's best will be mapped in the priority low " class ".
4. method according to claim 1 is characterized in that: wait time delay in the described steps A and queue length thereof are reported to the scheduling decision module periodically by queue management module.
5. method according to claim 1 is characterized in that: in the described steps A, the acquisition of the wait time delay of each packet data queues in each service quality " class " may further comprise the steps:
A1. be that each packet data queues is provided with a counter in described " class " by queue management module;
A2. in packet data queues for empty and when having grouped data to send into, perhaps to the packet data queues finishing scheduling but formation enabling counting device when be sky, counter is pressed the gate time unit count;
A3. counting finishes when packet data queues is begun to dispatch;
A4. the current wait time delay of statistical packet data queue is the product of Counter Value and gate time unit.
6. method according to claim 1 is characterized in that: among the described step B, described priority argument is calculated according to the link quality information of wait time delay, this queue length and this formation of this formation and to be obtained; This link quality information is by the link-quality monitoring modular, the link-quality of the Packet data service that inserted is monitored, and link quality information is reported to the scheduling decision module periodically.
7. method according to claim 6 is characterized in that: described link quality information is the performance parameter that comprises signal interference ratio SIR, block error rate BLER or bit error rate BER that is reported by the portable terminal measurement.
8. method according to claim 6 is characterized in that: described priority argument is by formula
Calculating obtains, the φ in the formula
i(t) downlink quality of i packet data queues among the expression moment t described " class ",
The average waiting time delay of i packet data queues among the expression moment t described " class ", l
i(t) queue length of i packet data queues among the expression moment t described " class ", W
THiExpression is to the desired wait time delay of i packet data queues thresholding in described " class ", L
THiRepresent that the early warning thresholding that in described " class " i packet data queues buffer memory overflowed, N are the sums of packet data queues in described " class ".
9. method according to claim 8 is characterized in that: the average waiting time delay of packet data queues by formula among the described moment t described " class "
Calculate, a is a forgetting factor, and t-Δ t is the moment of last this packet data queues of scheduling,
Average waiting time delay before this packet data queues of the last scheduling of expression, w
i(t) expression moment t dispatches the wait time delay of i packet data queues.
10. method according to claim 9 is characterized in that: described forgetting factor is adjusted in the scope of 0＜a≤1, changes the service opportunity that is under the relatively poor wireless environment the Packet Service user by the value that changes a.
11. method according to claim 8, it is characterized in that: the early warning thresholding that described packet data queues buffer memory overflows is to be each packet data queues assigned buffers size thresholding in described " class ", and this thresholding is to be provided with according to the speed characteristic of Packet Service and cache size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100483272A CN100411474C (en) | 2004-06-17 | 2004-06-17 | Downstream grouped data scheduling method suitable to mobile communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100483272A CN100411474C (en) | 2004-06-17 | 2004-06-17 | Downstream grouped data scheduling method suitable to mobile communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1710980A true CN1710980A (en) | 2005-12-21 |
| CN100411474C CN100411474C (en) | 2008-08-13 |
Family
ID=35707138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100483272A Active CN100411474C (en) | 2004-06-17 | 2004-06-17 | Downstream grouped data scheduling method suitable to mobile communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100411474C (en) |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100466628C (en) * | 2006-11-13 | 2009-03-04 | 华为技术有限公司 | Method and device for allocating cache quene threshold, and its flow control method and device |
| CN101198093B (en) * | 2007-12-25 | 2010-07-14 | 中兴通讯股份有限公司 | Control method for dynamic regulating forward service flux |
| CN101179486B (en) * | 2006-11-10 | 2010-07-14 | 中兴通讯股份有限公司 | Computer network data packet forwarded CAR queue management method |
| CN101415242B (en) * | 2007-10-16 | 2010-07-14 | 中兴通讯股份有限公司 | System and method for scheduling wideband wireless access non-real time business |
| CN101212410B (en) * | 2006-12-30 | 2010-08-25 | 大唐移动通信设备有限公司 | Downlink resource scheduling method, system, and device |
| CN101986749A (en) * | 2010-11-02 | 2011-03-16 | 中兴通讯股份有限公司 | Downstream scheduling method and device in worldwide interoperability for microwave access (WiMAX) based on media package |
| CN101296109B (en) * | 2007-04-27 | 2011-04-06 | 华为技术有限公司 | Method, device and system for policy decision entity interaction under multi-policy execution point |
| CN1921444B (en) * | 2005-08-24 | 2011-11-30 | 上海原动力通信科技有限公司 | Method for classified package dispatching and resource distributing based on service quality, and communication device |
| CN101610198B (en) * | 2008-06-17 | 2012-03-28 | 大唐移动通信设备有限公司 | Method and device for scheduling packet services |
| CN102446144A (en) * | 2010-09-30 | 2012-05-09 | 北大方正集团有限公司 | Method, device and system for scheduling serial port resources |
| CN102469602A (en) * | 2010-11-19 | 2012-05-23 | 普天信息技术研究院有限公司 | Method for user multi-service dispatching |
| CN101115012B (en) * | 2006-06-27 | 2012-07-18 | 三星电子株式会社 | Apparatus and method of scheduling data packet in a communication system |
| CN103107955A (en) * | 2011-11-15 | 2013-05-15 | 中国移动通信集团公司 | Method and device of scheduling packet transport network queues |
| CN101589580B (en) * | 2007-01-22 | 2013-09-18 | 高通股份有限公司 | Assured packet data services associated with communication networks |
| CN101848494B (en) * | 2009-03-25 | 2014-03-19 | 中兴通讯股份有限公司 | Dispatching method of real-time business and device thereof |
| CN104066193A (en) * | 2014-06-06 | 2014-09-24 | 电信科学技术研究院 | Scheduling method and device |
| CN105517172A (en) * | 2014-10-15 | 2016-04-20 | 中国移动通信集团公司 | Business scheduling method and device |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN110518958A (en) * | 2019-08-05 | 2019-11-29 | 中国人民解放军陆军工程大学 | A kind of exchange and grouping scheduling method suitable for satellite communication system beam-hopping |
| CN112988354A (en) * | 2021-03-17 | 2021-06-18 | 中国人民解放军国防科技大学 | Satellite communication system outbound resource optimization management method |
| CN115955443A (en) * | 2022-09-29 | 2023-04-11 | 中国联合网络通信集团有限公司 | Resource scheduling method, device and storage medium |
| CN117692519A (en) * | 2024-01-30 | 2024-03-12 | 深圳华云信息系统科技股份有限公司 | Futures request sending method, device, equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001519121A (en) * | 1997-04-04 | 2001-10-16 | アセンド コミュニケーションズ インコーポレイテッド | High-speed packet scheduling method and apparatus |
| JP4168633B2 (en) * | 2002-01-17 | 2008-10-22 | 日本電気株式会社 | Packet scheduling method, packet transfer apparatus and packet scheduling program in radio base station |
| AU2002237171A1 (en) * | 2002-02-22 | 2003-09-09 | Linkair Communications, Inc. | A method of priority control in wireless packet data communications |
-
2004
- 2004-06-17 CN CNB2004100483272A patent/CN100411474C/en active Active
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921444B (en) * | 2005-08-24 | 2011-11-30 | 上海原动力通信科技有限公司 | Method for classified package dispatching and resource distributing based on service quality, and communication device |
| CN101115012B (en) * | 2006-06-27 | 2012-07-18 | 三星电子株式会社 | Apparatus and method of scheduling data packet in a communication system |
| CN101179486B (en) * | 2006-11-10 | 2010-07-14 | 中兴通讯股份有限公司 | Computer network data packet forwarded CAR queue management method |
| CN100466628C (en) * | 2006-11-13 | 2009-03-04 | 华为技术有限公司 | Method and device for allocating cache quene threshold, and its flow control method and device |
| CN101212410B (en) * | 2006-12-30 | 2010-08-25 | 大唐移动通信设备有限公司 | Downlink resource scheduling method, system, and device |
| CN101589580B (en) * | 2007-01-22 | 2013-09-18 | 高通股份有限公司 | Assured packet data services associated with communication networks |
| CN101296109B (en) * | 2007-04-27 | 2011-04-06 | 华为技术有限公司 | Method, device and system for policy decision entity interaction under multi-policy execution point |
| CN101415242B (en) * | 2007-10-16 | 2010-07-14 | 中兴通讯股份有限公司 | System and method for scheduling wideband wireless access non-real time business |
| CN101198093B (en) * | 2007-12-25 | 2010-07-14 | 中兴通讯股份有限公司 | Control method for dynamic regulating forward service flux |
| CN101610198B (en) * | 2008-06-17 | 2012-03-28 | 大唐移动通信设备有限公司 | Method and device for scheduling packet services |
| CN101848494B (en) * | 2009-03-25 | 2014-03-19 | 中兴通讯股份有限公司 | Dispatching method of real-time business and device thereof |
| CN102446144A (en) * | 2010-09-30 | 2012-05-09 | 北大方正集团有限公司 | Method, device and system for scheduling serial port resources |
| CN101986749A (en) * | 2010-11-02 | 2011-03-16 | 中兴通讯股份有限公司 | Downstream scheduling method and device in worldwide interoperability for microwave access (WiMAX) based on media package |
| CN101986749B (en) * | 2010-11-02 | 2014-04-30 | 中兴通讯股份有限公司 | Downstream scheduling method and device in worldwide interoperability for microwave access (WiMAX) based on media package |
| 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 |
| CN103107955A (en) * | 2011-11-15 | 2013-05-15 | 中国移动通信集团公司 | Method and device of scheduling packet transport network queues |
| CN103107955B (en) * | 2011-11-15 | 2016-04-27 | 中国移动通信集团公司 | Packet Transport Network array dispatching method and device |
| CN104066193A (en) * | 2014-06-06 | 2014-09-24 | 电信科学技术研究院 | Scheduling method and device |
| CN105517172A (en) * | 2014-10-15 | 2016-04-20 | 中国移动通信集团公司 | Business scheduling method and device |
| CN105517172B (en) * | 2014-10-15 | 2019-05-31 | 中国移动通信集团公司 | A kind of business scheduling method and device |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN110518958A (en) * | 2019-08-05 | 2019-11-29 | 中国人民解放军陆军工程大学 | A kind of exchange and grouping scheduling method suitable for satellite communication system beam-hopping |
| CN112988354A (en) * | 2021-03-17 | 2021-06-18 | 中国人民解放军国防科技大学 | Satellite communication system outbound resource optimization management method |
| CN115955443A (en) * | 2022-09-29 | 2023-04-11 | 中国联合网络通信集团有限公司 | Resource scheduling method, device and storage medium |
| CN117692519A (en) * | 2024-01-30 | 2024-03-12 | 深圳华云信息系统科技股份有限公司 | Futures request sending method, device, equipment and storage medium |
| CN117692519B (en) * | 2024-01-30 | 2024-04-19 | 深圳华云信息系统科技股份有限公司 | Futures request sending method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100411474C (en) | 2008-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100411474C (en) | Downstream grouped data scheduling method suitable to mobile communication system | |
| CN1135799C (en) | Link-efficiency based scheduling in radio data communications systems | |
| CN100586220C (en) | Method of packet scheduling in high speed downlink packet access network | |
| CN1921444B (en) | Method for classified package dispatching and resource distributing based on service quality, and communication device | |
| CN100459581C (en) | A method for packet dispatching of variable parameter for real-time mixed service environment | |
| CN101310483B (en) | Method and base station for scheduling HSDPA | |
| CN102083221A (en) | Resource scheduling method and device based on HSDPA (high speed downlink packet access) | |
| CN112637911A (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| CN101965061B (en) | Data traffic radio channel distribution method and system thereof | |
| CN1968195A (en) | Communication system scheduling method | |
| CN100369524C (en) | CDMA system up-bag dispatching method | |
| CN100440871C (en) | Packet scheduling method and device for wireless communication system | |
| CN1777147A (en) | Sharing cache dynamic threshold early drop device for supporting multi queue | |
| CN109862567A (en) | A kind of method of cell mobile communication systems access unlicensed spectrum | |
| CN101494908B (en) | Method for scheduling customer equipment data and packet scheduling device | |
| CN102469602B (en) | Method for user multi-service dispatching | |
| CN101047578A (en) | Control method and device for sleep mode in communication system | |
| EP1653683A2 (en) | Dynamic setting of transmission scheduler algorithms | |
| CN1518296A (en) | Method of implementing integrated queue scheduling for supporting multi service | |
| CN101827446A (en) | Radio bearer scheduling method and device | |
| CN1960318A (en) | Admission and control method and system for traffic flow applied to wireless communication system | |
| Li et al. | Adaptive packet scheduling algorithm for cognitive radio system | |
| CN1852147A (en) | Method for realizing statistics of business throughput rate and system therefor | |
| CN1551581A (en) | Method for detecting voice-over-ip networks | |
| WO2012048542A1 (en) | Group schedule method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: INST OF TELECOMMUNICATION SCIENCE AND TECHNOLGOY Free format text: FORMER OWNER: DATANG MOBILE COMMUNICATION EQUIPMENT CO., LTD. Effective date: 20110706 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100083 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING TO: 100191 NO. 40, XUEYUAN ROAD, HAIDIAN DISTRICT, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20110706 Address after: 100191 Haidian District, Xueyuan Road, No. 40, Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100083 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. |
|
| 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 |
|
| CP01 | Change in the name or title of a patent holder | ||
| 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 |