[go: up one dir, main page]

WO2012048542A1 - Procédé et dispositif de planification de groupe - Google Patents

Procédé et dispositif de planification de groupe Download PDF

Info

Publication number
WO2012048542A1
WO2012048542A1 PCT/CN2011/070446 CN2011070446W WO2012048542A1 WO 2012048542 A1 WO2012048542 A1 WO 2012048542A1 CN 2011070446 W CN2011070446 W CN 2011070446W WO 2012048542 A1 WO2012048542 A1 WO 2012048542A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
factor
group
scheduling
fairness
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.)
Ceased
Application number
PCT/CN2011/070446
Other languages
English (en)
Chinese (zh)
Inventor
杨国良
林立
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of WO2012048542A1 publication Critical patent/WO2012048542A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users

Definitions

  • the present invention relates to the field of communications, and in particular, to a packet scheduling method and apparatus. Background technique
  • a good scheduling scheme can provide a variety of real-time and non-real-time data services by reasonably allocating radio resources to different data services of wireless users, which can effectively improve channel utilization and service QoS.
  • packet scheduling methods exist in the current communication system.
  • Representative packet scheduling methods include: a polling scheduling algorithm, a maximum C/I (Carrier/Interference) scheduling algorithm, and a proportional fair scheduling algorithm.
  • a polling scheduling algorithm a maximum C/I (Carrier/Interference) scheduling algorithm
  • a proportional fair scheduling algorithm a proportional fair scheduling algorithm.
  • Each method has different characteristics in terms of fairness and QoS, which are described in detail below.
  • each user consumes the service resources with the same probability.
  • the maximum C/I scheduling algorithm performs user scheduling according to the time-varying channel conditions, and selects users with good channel conditions to occupy resource transmission data.
  • users with other good channel conditions can select the spectrum to maximize the spectrum. Utilization, but fairness is poor.
  • the user considers the channel quality and past historical throughput of the user, taking into account the differences in user channel conditions and the requirements for fairness, and compromises throughput and fairness, but cannot satisfy the user's QoS. Claim.
  • the present invention has been made in view of the above drawbacks of the prior art, and a main object of the present invention is to provide a packet scheduling method and apparatus.
  • the technical solution of the present invention is implemented as follows:
  • a packet scheduling method includes: calculating a maximum proportion fairness factor of the terminal according to a proportional fairness factor, a quality of service QoS factor, and a power boosting report PHR factor of the terminal that is waiting to be scheduled; and calculating a maximum proportion of the terminal according to the calculation
  • the order of the size of the factors, the terminal is divided into a plurality of groups, wherein the priority of the group to which the terminal having the largest proportion of the fairness factor belongs is a high priority; and the terminal is performed according to the order of the priorities of the group Scheduling, and scheduling the terminal in each group according to the waiting time of the terminal waiting for scheduling or the maximum proportion of the fairness factor of the terminal.
  • the proportional fairness factor of the terminal is obtained according to the following information: the size and historical throughput of the currently scheduled transport block TB.
  • the QoS factor of the terminal is obtained based on the following information: guaranteed bit rate GBR factor, aggregated maximum bit rate AMBR factor, allocation and retention priority ARP factor.
  • Obtaining a PHR factor of the terminal according to the following information: a PHR value reported by the terminal. And dividing the terminal into a plurality of groups according to a sequence of a maximum proportion of fairness factors of the terminal, including: setting a terminal with a maximum proportional fairness factor greater than or equal to an overflow threshold to belong to the first group; setting a maximum proportional fairness factor is less than The terminal with the overflow threshold and greater than zero belongs to the second group; the terminal with the maximum proportion fairness factor equal to zero belongs to the third group; wherein the order of the priority of the group is: the first group, the second group, the first The group is configured to schedule the terminal according to the waiting time length of the terminal waiting for scheduling or the maximum proportion of the fairness factor of the terminal in each group, including: The first group and the third group of terminals are adjusted according to the waiting time of waiting for scheduling from large to small. Degrees; the terminals belonging to the second group are scheduled in descending order of their maximum proportion fairness factors.
  • a packet scheduling device comprising:
  • An obtaining module configured to calculate a maximum proportion fairness factor of the terminal according to a proportional fairness factor, a QoS factor, and a PHR factor of the terminal that is waiting to be scheduled;
  • a grouping module configured to divide the terminal into a plurality of groups according to a sequence order of a maximum proportion of fairness factors of the terminal calculated by the acquiring module, where a priority of a group to which a terminal with a largest proportion of fairness factors belongs High priority;
  • a scheduling module configured to schedule the terminal according to a priority order of the group, and, in each group, according to a waiting time of the terminal waiting for scheduling or a maximum proportion of a fairness factor of the terminal The terminal is scheduled.
  • the obtaining module includes: a first obtaining module, configured to obtain a proportional fairness factor of the terminal according to the following information: a size of the currently scheduled TB, and a historical throughput.
  • the obtaining module includes: a second acquiring module, configured to obtain a quality of service factor of the terminal according to the following information: a GBR factor, an AMBR factor, and an ARP factor.
  • the obtaining module includes: a third acquiring module, configured to obtain the PHR factor according to the PHR value reported by the terminal.
  • the grouping module includes:
  • a first grouping module configured to set a terminal with a maximum proportional fairness factor greater than an overflow threshold to belong to the first group
  • a second grouping module configured to set a terminal whose maximum proportional fairness factor is less than the overflow threshold and greater than zero belongs to the second group
  • the scheduling module includes:
  • a first scheduling module configured to schedule the terminals belonging to the first group and the third group according to a waiting time of waiting for scheduling from large to small;
  • a second scheduling module configured to schedule the terminals belonging to the second group to be in descending order of a maximum proportionality factor thereof.
  • the terminal is sorted according to the maximum proportion fairness factor of the terminal, and the terminal is ordered according to the maximum proportion of the fairness factor of the terminal, so that the terminal acquires different scheduling priorities.
  • the solution of the present invention comprehensively considers throughput and fairness, enables users to share wireless resources fairly according to requirements, and can reasonably allocate resources for various bandwidth requirements, different delay guarantees, and different QoS levels, and improve communication.
  • the throughput of the system to ensure QoS for different services.
  • FIG. 1 is a schematic flow chart of a packet scheduling method according to an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of a packet scheduling apparatus according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a preferred structure of a packet scheduling apparatus according to an embodiment of the present invention. detailed description
  • the main idea of the present invention is mainly to calculate the maximum proportion fairness factor of the terminal, and sort the terminals according to the maximum proportion of the fairness factor of the terminal, so that the terminal acquires different scheduling priorities.
  • a packet scheduling method is provided.
  • FIG. 1 is a schematic flowchart of a packet scheduling method according to an embodiment of the present invention. As shown in FIG. 1, the method includes:
  • Step 102 Calculate a maximum proportion fairness factor of the terminal according to a proportional fairness factor, a QoS factor, and a PHR (Power Headroom Report) factor of the terminal that is waiting to be scheduled;
  • Step 104 according to the calculated maximum proportion of the terminal fairness factor In the order of the size, the terminal is divided into a plurality of groups, wherein the priority of the group to which the terminal having the largest proportion of the fairness factor belongs is a high priority;
  • Step 106 The terminal is scheduled according to the order of the priority of the group, and the terminal is scheduled in each group according to the waiting time of the terminal waiting for scheduling or the maximum proportion of the terminal fairness factor of the terminal. A large proportion of fairness algorithms. The details of the processing of the above steps are described in detail below.
  • the maximum proportional fairness factor of the terminal needs to be calculated, and the calculation expression of the maximum proportional fairness factor (FF) according to the embodiment of the present invention is:
  • calculating the maximum proportional fairness factor ( FF ) includes the following three aspects:
  • TBSize proportional fairness factor
  • the weighting factor usually takes the value [0,1].
  • the weighting factor usually takes the value [0,1].
  • the weighting factor usually takes the value [0,1].
  • the terminal in each sub The historical traffic of the terminal is maintained in the frame. It is usually divided into two cases: In one case, the terminal has service scheduling in the current subframe, and the historical traffic of the terminal is calculated in consideration of the historical traffic of the terminal update in the previous subframe. The service traffic scheduled with the current subframe; in another case, the terminal has no service scheduling in the current subframe, and only considers the historical traffic of the previous subframe update.
  • the maintenance of the historical traffic of the terminal introduces a weighting factor. When a user's service is not scheduled for a long time, the accumulated historical traffic is 4 ⁇ , which can improve the scheduling priority. At a certain TTI (Transmission Time) Interval, transmission time interval) is scheduled at all times.
  • TTI Transmission Time
  • TBSize is the TB (Transport Block, which is mapped by the System RB (Resource Block) and the Broadband MCS (Modulation and Coding Scheme) of the terminal in this TTI (the length is 1 ms, that is, the length of one subframe).
  • the size of the transport block is 1 ms, that is, the length of one subframe.
  • the GBR factor (FF GBR ) is related to the Gbr Value.
  • the calculation expression for GbrValue is:
  • the GBR Guaranteed Bit Rate
  • FF r GBR factor
  • the AMBR (Aggregate Maximum Bit Rate) is the maximum bit rate of all Non-GBR (non-GBR) services of a certain terminal configured by the upper layer, and Histh is the historical traffic of the previous subframe update by AmbrValue. Corresponding to AMBR by looking up Table 2
  • the ARP (Allocation and Retention Priority) factor is the probability that the terminal specifies that it is allocated or blocked. The value ranges from 0 to 15.
  • the core network allocates an ARP value according to its service type, and an ARP value is obtained from the ARP value lookup table 3 (FF)
  • the PHR factor includes: the power factor (FF P and the factor of the RB used for reporting (?5 p/ffi ).
  • FF P is the remaining power factor of the terminal.
  • EPS Evolved Packet System
  • the EPS bearer QoS description parameter set includes QCI (QoS Class Identifier), ARP, GBR, and MBR (Maximum Bit Rate).
  • the packet scheduling algorithm introduces a QoS differentiation and guarantee mechanism, which is suitable for multi-service hybrid transmission.
  • GBR, AMBR, and ARP weighting factors are introduced, and the specific expressions are as follows: According to the service type required by the terminal, the core network allocates different GBR and AMBR values to the terminal, ensuring that the services provided for the terminal can be satisfied as much as possible. If the historical traffic fails to meet the traffic demanded by the terminal, the maximum proportional fairness algorithm will increase the priority of the terminal, so that it can obtain more scheduling opportunities to meet the service requirements of the terminal;
  • the ARP is an allocation and retention priority. When the resource is limited, it is used to decide whether to accept or reject the bearer setup request or modification request to ensure that the resource request of the bearer with higher priority is preferentially satisfied.
  • ARP is applied to both GBR and Non-GBR service bearers.
  • the maximum proportional fairness algorithm uses ARP to determine whether the new bearer established can preempt the resources of the existing bearer. In the maximum proportional fairness algorithm, different ARP values are assigned different priority values. The smaller the ARP value, the greater the priority of the service. For example, in a resource-constrained condition, the service ARP value of the terminal 1 is N1, the service ARP value of the terminal 2 is N2, and N N2.
  • the terminal 1 requests the service, because of its service.
  • the ARP value is smaller than the ARP value of the service of the terminal 2, and the maximum proportion fairness algorithm allocates bandwidth to the service of the terminal 2 when the service of the terminal 1 is preferentially satisfied;
  • the number of central user scheduling is maximized, and the PHR factor is introduced to improve the throughput of the entire system.
  • three scheduling queues (groups) with different priorities need to be maintained, and are placed in queues of different priorities according to the maximum proportion of fairness factors of the terminal, where the terminal with the largest proportion of fairness factors belongs to Groups have a higher priority.
  • the three queues maintained are: a numeric overflow queue (first group), a queue with a value greater than zero (second group), and a queue with a value equal to zero (third group).
  • the order of priority of the above three queues is: An overflow queue, a queue with a value greater than zero, and a queue with a value equal to zero.
  • the value exceeds the platform support digits, and the overflow condition occurs. If the maximum proportional fairness factor overflows (greater than or equal to the overflow threshold) ), the terminal should be placed in the value overflow queue; the other case is: The platform does not support floating-point operations.
  • the TBSize of the terminal is smaller than the updated historical traffic, resulting in a calculation of the fairness factor of zero, and thus the maximum of the terminal.
  • the proportional fairness factor is zero, and the terminal puts a value equal to the zero queue.
  • terminals with a maximum proportional fairness factor greater than zero and less than the overflow threshold are placed in a queue with a value greater than zero.
  • the terminals are scheduled according to the order of priority of the groups, and the terminals are scheduled in the order of the waiting time of the terminal waiting for scheduling or the value of the maximum proportion fairness factor of the terminal in each group.
  • the terminal in the above-mentioned numerical overflow queue and the queue in which the value is equal to zero is prioritized according to the waiting time of the terminal, and the longer the terminal waits for scheduling, the terminal The higher the scheduling priority, the more chance there is to be scheduled. Therefore, it is necessary to maintain a terminal waiting for the scheduling time variable. At each TTI time, if the terminal is not scheduled, the variable will be incremented by 1.
  • the terminal is scheduled according to the order of the maximum proportion of the terminal in the queue. That is, in the queue with the value greater than zero, the terminal with the largest proportional fairness factor has the better chance of scheduling.
  • Step 202 First, obtain a proportional fairness factor, and obtain according to a broadband MCS of a terminal and an RB number of a system.
  • the TB block size of the current scheduling, and then the historical traffic of the current scheduling is calculated according to the TB block size and the historical traffic updated in the previous subframe, and finally the proportional fairness factor is obtained. If the proportion is fair If the sub is greater than zero, the value is greater than the zero queue, and step 204 is performed. If the proportional fairness factor is equal to zero, put the value equal to the zero queue and proceed to step 210.
  • the QoS factor is obtained according to the formula (3).
  • the base station side configures the corresponding GBR value, AMBR value, and ARP value according to the service type applied by the terminal.
  • GBR the GBR value is increased by (+ threshold) times, where m ⁇ oW is 0.1.
  • Step 206 Acquire a PHR factor as part of calculating a scheduling priority.
  • the power factor (FF she ) is obtained from the PHR value table 4 reported by the terminal, and the RB PHR is obtained according to the number of RBs allocated when the terminal reports the PHR value, thereby obtaining the PHR factor.
  • Step 208 Calculate a maximum proportional fairness factor according to a proportional fairness factor, a QoS factor, and a PHR factor. If the terminal maximum proportional fairness factor exceeds or equals an overflow threshold, the terminal is placed in a numerical overflow queue, and if the terminal has a maximum proportional fairness factor Less than the overflow threshold and greater than zero, the value is still greater than the zero queue.
  • Step 210 The logarithmic overflow queue is sorted according to the waiting scheduling time from large to small; the logarithmic value greater than zero queue is sorted according to the maximum proportional fairness factor from large to small; the logarithmic value is equal to zero queue according to the waiting scheduling time from large to d, and the sorting is performed. .
  • Step 212 Scheduling the terminal in the value overflow queue. After the terminal in the value overflow queue is scheduled, the scheduling value is greater than the terminal in the zero queue. After the terminal whose value is greater than the zero queue is scheduled, the scheduling value is equal to the terminal in the zero queue. . Update the historical traffic of all terminals, and the process ends.
  • the packet scheduling method according to an embodiment of the present invention will be further described below in conjunction with a scheduling procedure in an actual system.
  • the test of the uplink Non-GBR service is performed by using four terminals, and the terminal performs the same type of data service, and the data service size is X.
  • the ratio fairness factors of the four terminals are first calculated separately.
  • the broadband MCS of the terminal is mapped, and the TBSize of the terminal is obtained by combining the number of RBs of the system.
  • the proportional fairness factors are calculated as pl, p2, p3, and p4, respectively, and then it is judged that the four proportional fair factors are not equal to zero, and the four terminals are placed in a value greater than the zero queue.
  • the calculation of the QoS factor is performed on the terminal whose value is greater than the zero queue. Since the service bearers established by the four terminals are Non-GBR services and there is no GBR service, the QoS factors of the four terminals are equal to one. In the current TTI, only the terminal 1 reports the PHR value to the base station, and the corresponding power factor is Power. When the PHR value is reported, the number of RBs allocated by the terminal is N. Since the terminal 2, the terminal 3, and the terminal 4 do not report the PHR value in this TTI, the default PHR factor value is 1.
  • the maximum proportion fairness factors of the four terminals are calculated respectively, and the maximum proportions of the final terminal 1, terminal 2, terminal 3, and terminal 4 are Pl, P2, P3, and P4, respectively.
  • the maximum proportion of the fairness factors of the four terminals did not overflow.
  • the terminal with the logarithmic value greater than the zero queue is arranged according to the maximum proportion of the fairness factor.
  • the terminal priority is: terminal 1, terminal 3, terminal 2, terminal 4.
  • the scheduling of this TTI is performed in the order of the priority.
  • the ABR values corresponding to the GBR services of the terminal 1, the terminal 2, the terminal 3, and the terminal 4 are respectively set to N1, N2, N3, and N4.
  • the proportional fairness factor of the four terminals is calculated.
  • the broadband MCS of the terminal is mapped, and the total number of RBs of the system is obtained.
  • TBSize Due to the last TTI, terminal 4 does not have a scheduling opportunity, and the historical traffic maintained by the previous one is calculated according to the first formula of equation (2).
  • the proportional fairness factors are calculated as ql, q2, q3, and q4, respectively, and then it is judged that the four proportional fair factors are not equal to zero, and the four terminals are placed in a value greater than the zero queue.
  • the calculation of the QoS factor is performed on the terminal whose value is greater than the zero queue. Since the service bearers established by the four terminals are both GBR services and the service types are the same, the GBR factor and the AMBR factor are the same, but the ARP values are inconsistent, and the calculated QoS factors are not equal, which are respectively recorded as: fl, , ⁇ , f4. In the current TTI, all four terminals are reported to the base station PHR value, and the corresponding power factors are respectively recorded as: Power 1, Power 2, Power 3, Power 4, and the number of RBs used by the terminal when the PHR value is RBNuml, RBNum2, respectively. RBNum3, RBNum4. Then calculate the total maximum proportion fairness factor of each terminal separately.
  • Terminal 1's maximum proportional fairness factor exceeds the threshold, it is placed in the value overflow queue.
  • the maximum proportion fairness factors of terminal 2, terminal 3, and terminal 4 are Q2, Q3, and Q4, respectively, and the value is still greater than the zero queue.
  • the value overflow queues are sorted, and then the terminal with the value greater than the zero queue is arranged according to the maximum proportion fairness factor size: the terminal 2, the terminal 3, and the terminal 4.
  • the terminal 1 of the numerical overflow queue is scheduled, and then the terminal 2, the terminal 3, and the terminal 4 are respectively scheduled in order of priority. After the scheduling is completed, the historical traffic of each terminal is updated.
  • a packet scheduling apparatus is also provided.
  • Figure 3 is a packet scheduling apparatus according to an embodiment of the present invention
  • Figure 4 is a schematic diagram showing a preferred structure of a packet scheduling apparatus according to an embodiment of the present invention.
  • the packet scheduling apparatus includes an acquisition module 10, a grouping module 20, and a scheduling module 30.
  • the obtaining module 10 is configured to calculate a maximum proportion fairness factor of the terminal according to a proportional fairness factor, a QoS factor, and a PHR factor of the terminal that is waiting to be scheduled.
  • the obtaining module 10 may further include:
  • the first obtaining module 110 is configured to obtain a proportional fairness factor of the terminal according to the following information: a size of the currently scheduled TB, and a historical throughput;
  • the second obtaining module 120 is configured to obtain the QoS factor of the terminal according to the following information: GBR factor, AMBR
  • the third acquisition module 130 is configured to obtain a PHR factor according to the PHR value reported by the terminal.
  • the grouping module 20 is connected to the obtaining module 10, and is configured to divide the terminal into a plurality of groups according to the order of the maximum proportion of fairness factors of the terminals calculated by the obtaining module 10, wherein the group with the largest proportion of fairness factors belongs to the group
  • the priority is high priority.
  • the grouping module 20 may further include: a first grouping module 210, configured to set a terminal with a maximum proportional fairness factor greater than or equal to an overflow threshold to belong to the first group; and a second grouping module 220, configured to set a maximum proportional fairness factor less than an overflow threshold And the terminal that is greater than zero belongs to the second group; the third grouping module 230 is configured to set the terminal with the maximum proportional fairness factor equal to zero to belong to the third group; wherein, the order of the priority of the group is: the first group, the second group, The third group; and, the overflow threshold is greater than zero.
  • the scheduling module 30 is connected to the grouping module 20, and is configured to schedule the terminal according to the order of priority of the group, and in each group, according to the waiting time of the terminal waiting for scheduling or the maximum proportion of the terminal's fairness factor Schedule the terminal.
  • the scheduling module 30 may further include: a first scheduling module 310, configured to schedule terminals belonging to the first group and the third group according to a waiting time of waiting for scheduling, and a second scheduling module 320, configured to: The terminals belonging to the second group are scheduled in descending order of their maximum proportional fairness factors.
  • the packet scheduling apparatus may refer to the processes shown in FIG. 1 to FIG. 2, and details are not described herein.
  • the terminal is sorted according to the maximum proportion fairness factor of the terminal, and the terminal is ordered according to the maximum proportion of the fairness factor of the terminal, so that the terminal acquires different scheduling priorities.
  • the solution of the invention comprehensively considers throughput and fairness, can reasonably allocate resources for various services with different bandwidth requirements, different delay guarantees, and different QoS levels, improves the overall throughput of the communication system, and ensures different services. QoS.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur un procédé et un dispositif de planification de groupe. Le procédé comprend les opérations suivantes : conformément aux facteurs d'équité proportionnels, aux facteurs de qualité de service (QoS) et aux facteurs de rapport de marge de puissance (PHR) des terminaux qui doivent être planifiés, calculer les facteurs d'équité proportionnels maximaux des terminaux (102); conformément à l'ordre décroissant des facteurs d'équité proportionnels maximaux calculés des terminaux, diviser les terminaux en de multiples groupes, la priorité du groupe auquel appartiennent les terminaux ayant les plus grands facteurs d'équité proportionnels maximaux étant supérieure (104); planifier les terminaux conformément à l'ordre décroissant de la priorité des groupes, et planifier les terminaux conformément au temps d'attente de terminal pour une planification ou à l'ordre décroissant des facteurs d'équité proportionnels maximaux de terminal dans chaque groupe (106). La solution de la présente invention considère à la fois le débit et l'équité, et peut attribuer des ressources à des types de services ayant des exigences de bande passante différentes, des garanties de retard différentes, des niveaux QoS différents, de sorte que le débit total du système de communication soit augmenté et que la QoS de différents services est garantie.
PCT/CN2011/070446 2010-10-14 2011-01-20 Procédé et dispositif de planification de groupe Ceased WO2012048542A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010509922.7A CN102448119B (zh) 2010-10-14 2010-10-14 分组调度方法及装置
CN201010509922.7 2010-10-14

Publications (1)

Publication Number Publication Date
WO2012048542A1 true WO2012048542A1 (fr) 2012-04-19

Family

ID=45937851

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/070446 Ceased WO2012048542A1 (fr) 2010-10-14 2011-01-20 Procédé et dispositif de planification de groupe

Country Status (2)

Country Link
CN (1) CN102448119B (fr)
WO (1) WO2012048542A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102752870B (zh) * 2012-07-09 2015-03-25 北京北方烽火科技有限公司 一种lte系统中实用型最大载干比调度度量值计算方法及装置
CN103260258A (zh) * 2013-05-10 2013-08-21 南京邮电大学 一种蜂窝终端直通系统中资源分配和资源复用联合方法
CN109992391B (zh) * 2017-12-29 2021-09-28 浙江宇视科技有限公司 连接管理方法和系统
CN110351863B (zh) * 2018-04-04 2022-03-25 中兴通讯股份有限公司 比例公平调度的实现方法、装置及设备、存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101600231A (zh) * 2009-06-30 2009-12-09 中兴通讯股份有限公司 在分组调度中确定用户设备的优先级的方法和系统
CN101790239A (zh) * 2010-02-23 2010-07-28 中国电信股份有限公司 分组调度方法和前向业务调度器

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100423589C (zh) * 2003-11-12 2008-10-01 Ut斯达康(中国)有限公司 移动通信系统中下行链路多信道分组联合调度的方法和装置
CN100581074C (zh) * 2006-06-17 2010-01-13 中国科学技术大学 一种正交频分复用系统的实时业务资源分配方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101600231A (zh) * 2009-06-30 2009-12-09 中兴通讯股份有限公司 在分组调度中确定用户设备的优先级的方法和系统
CN101790239A (zh) * 2010-02-23 2010-07-28 中国电信股份有限公司 分组调度方法和前向业务调度器

Also Published As

Publication number Publication date
CN102448119A (zh) 2012-05-09
CN102448119B (zh) 2014-12-10

Similar Documents

Publication Publication Date Title
CN1906900B (zh) 用于无线网络的服务质量调度器
CN101621457B (zh) 一种多业务调度方法和系统
JP5395982B2 (ja) サービス品質に基づく保証ビットレートのトラフィックスケジューリング方法
CN103596285A (zh) 无线资源调度方法及无线资源调度器及系统
CN1706158A (zh) 调度系统及其方法
WO2014117347A1 (fr) Procédé et appareil de planification de données
CN112637911A (zh) 一种5G系统中eMMB和urllc并存时资源分配方法及系统
WO2013190364A2 (fr) Systèmes et procédés de réservation de ressources pour contrôle d'admission et planification utilisant drx
CN101808324B (zh) 无线Mesh网络MAC层架构设计
CN101436921B (zh) 调度方法及网络侧设备
WO2016082115A1 (fr) Procédé et dispositif d'ordonnancement de service
CN100431362C (zh) 移动通信系统中分组业务调度的方法
CN105120482B (zh) 一种基于资源利用率的时延优先调度方法
CN104602355B (zh) Lte系统中混合业务调度方法
CN101827446B (zh) 一种无线承载调度方法和装置
WO2012048542A1 (fr) Procédé et dispositif de planification de groupe
CN101841915A (zh) 一种通信系统中的资源调度和分配方法及调度器
CN101860916A (zh) 一种资源调度方法及装置
WO2016197673A1 (fr) Procédé et appareil de planification de porteuse composante dans un scénario d'agrégation de porteuses
CN112543510A (zh) 资源分配方法和装置
CN108347315A (zh) 一种电力无线专网中多子带业务调度方法
CN104540235B (zh) Td‑lte公网集群多媒体业务上行资源调度方法
CN101765209A (zh) 一种上行资源分配方法
CN101527939B (zh) 用于hsupa系统的ue带宽需求预测方法和装置
Kadatskaja et al. Different services resource scheduling in LTE

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11831939

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11831939

Country of ref document: EP

Kind code of ref document: A1