WO2007121674A1 - Procédé et appareil de programmation dans des systèmes de communication - Google Patents

Procédé et appareil de programmation dans des systèmes de communication Download PDF

Info

Publication number
WO2007121674A1
WO2007121674A1 PCT/CN2007/001326 CN2007001326W WO2007121674A1 WO 2007121674 A1 WO2007121674 A1 WO 2007121674A1 CN 2007001326 W CN2007001326 W CN 2007001326W WO 2007121674 A1 WO2007121674 A1 WO 2007121674A1
Authority
WO
WIPO (PCT)
Prior art keywords
scheduling
user terminal
period
algorithm
priority queue
Prior art date
Application number
PCT/CN2007/001326
Other languages
English (en)
Chinese (zh)
Inventor
Xiaoxia Wang
Fangfu Guo
Original Assignee
Huawei Technologies Co., Ltd.
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
Priority claimed from CNB2006100744873A external-priority patent/CN100536603C/zh
Priority claimed from CNB2006100846684A external-priority patent/CN100502361C/zh
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2007121674A1 publication Critical patent/WO2007121674A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a scheduling method and apparatus for a communication system. Background technique
  • WCDMA Wideband Code Divisio Multiple Access
  • HSDPA High Speed Downlink Packet Access
  • the technology mainly adopts Adaptive Modulation and Coding (AMC), Hybrid Automatic Repeat Request (HQQ) and fast scheduling to further improve the downlink packet data rate. In this way, the capacity and frequency efficiency of the system are greatly improved, and the quality of the user terminal service is also improved.
  • AMC Adaptive Modulation and Coding
  • HQQ Hybrid Automatic Repeat Request
  • HS-DSCH High Speed Downlink Shared Channel
  • GBR bit rate
  • the scheduling algorithm can determine the service priority for each user terminal, and therefore, for the user terminal It is very important to be able to get the GBR rate.
  • the basic idea of the R algorithm is to ensure that the user terminals in the cell circulate and occupy the radio resources of the same time in a certain order to perform communication.
  • Each user terminal corresponds to a queue for storing data to be transmitted.
  • the non-empty queue receives services in a round-robin manner to transmit data.
  • the scheduling algorithm schedules all user terminals that are simultaneously carried on the HS-DSCH channel in turn.
  • a timer is started, indicating the length of waiting time, and each time interval of each user terminal is queued according to the length of each user terminal waiting time. Priority scheduling of user terminals with long waiting times.
  • the algorithm has fairness in scheduling opportunities, since the specific conditions of the wireless channels of different user terminal devices are not considered, the scheduling time for each user terminal device is relatively fixed, and the differentiated service cannot be provided; It is also impossible to make full use of the time period in which the channel quality of the user terminal equipment is high, and more data is transmitted during the time period, so that system resource utilization efficiency and system throughput are low; thus, the algorithm does not consider the user terminal.
  • the demand for GBR is guaranteed, so that user terminal satisfaction is very low.
  • Max C/I Maximum Carrier to Interference Algorithm
  • CQI channel quality indicator
  • the CQIs reported by the user terminals that can transmit data are queued from large to small; then, the data of the user terminal devices are sequentially transmitted in descending order of CQI.
  • the algorithm can obtain the maximum system throughput, the service obtained by the user terminal is very unfair.
  • the user terminal equipment close to the base station will always receive the service because of its good channel condition, and the user terminal equipment at the cell edge is due to its letter.
  • the quality indicator is low, so there is no service opportunity, and the user terminal with low channel quality may even be "starved"; thus, the algorithm does not consider the user end.
  • the GBR requirement is such that the user terminal with high channel quality obtains a rate much larger than the GBR, and the user terminal with low channel shield cannot obtain the GBR rate service, and the user terminal satisfaction rate is low.
  • the PF algorithm assigns a corresponding priority to each user terminal device, and the user terminal device with the highest priority first accepts the service.
  • the user terminal that can send data calculates the priority according to the following formula (1), and then schedules the user terminal in order from highest to lowest according to the priority:
  • ?, _ max (0 is the maximum transmission rate supported by the location of the user terminal at time t, r,. (0 represents the actual transmission rate obtained by the user terminal in the previous period.
  • the algorithm makes the ratio of the rate that the user terminal in the same cell can obtain to the location that can be provided is basically unchanged, that is, the probability that the user terminal device obtains the service at any time is almost the same, but the user terminal GBR requirement is not considered. It may cause a large number of scheduling opportunities to be allocated to low-channel quality user terminals due to the existence of a large number of low channel quality user terminals, so that high channel quality user terminals do not have sufficient scheduling opportunities, thereby making the system The number of satisfied user terminals is low.
  • Embodiments of the present invention provide a scheduling method and apparatus for a communication system, so as to increase the number of user terminals that receive satisfactory services in the system, and improve user satisfaction.
  • an embodiment of the present invention provides a scheduling method for a communication system, where the method includes the steps of: determining, in a preset scheduling period, whether the user terminal is satisfied with a service;
  • the embodiment of the present invention further provides a scheduling apparatus of a communication system, where the apparatus includes: a determining unit, configured to determine, in a preset scheduling period, whether the user terminal is satisfied with a service; The judgment result of the judgment unit is that the user terminal is placed in a different priority queue. If the determination result is yes, the user terminal is placed in a low priority queue. If the determination result is no, the user terminal is placed. Enter the high priority queue;
  • a scheduling unit configured to schedule user terminal data in the priority queue.
  • the method and apparatus for scheduling a communication system can enable as many users as possible to obtain satisfactory services in a scheduling period, thereby increasing the number of user terminals that are satisfactory in the system, and improving user satisfaction. degree.
  • FIG. 1 is a flowchart of a communication system scheduling method according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a first embodiment of a communication system scheduling method according to the present invention
  • FIG. 3 is a flowchart of a second embodiment of a communication system scheduling method according to the present invention.
  • FIG. 4 is a flowchart of a third embodiment of a communication system scheduling method according to the present invention.
  • FIG. 5 is a schematic structural diagram of a scheduling apparatus of a communication system according to an embodiment of the present invention.
  • Figure 6 is an embodiment of the apparatus of Figure 5.
  • Embodiments of the present invention provide a wideband code division multiple access (WCDMA) communication system capable of supporting a third generation (3G) wireless mobile communication technology, in particular, an HSDPA system of a WCDMA communication system, and the scheduling of the communication system of the present invention.
  • WCDMA wideband code division multiple access
  • 3G third generation
  • HSDPA High Speed Downlink Packet Access
  • TD-SCDMA time division duplex-synchronous code division multiple access.
  • FIG. 1 is a flowchart of a scheduling method of a communication system according to an embodiment of the present invention, the method includes:
  • Step 11 In the preset scheduling period, determine whether the user terminal is satisfied with the service; Step 12: If yes, put the user terminal into a low priority queue; Step 13: If no, put the user terminal into a high priority queue;
  • Step 14 Scheduling user terminal data in the priority queue.
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • the demand for the transmission rate is relatively stable. If the rate fluctuation is too large, the data transmission may be temporarily interrupted, thereby affecting the quality of service. Therefore, when the service is carried on the HS-DSCH channel.
  • a scheduling algorithm based on the scheduling period is adopted, so that as many user terminals as possible obtain a rate greater than or equal to GBR in each scheduling period, and the scheduling period should meet the rate allowed at the service. Within the range of fluctuations.
  • each scheduling period includes multiple transmission time intervals TTI, and one or several TTIs are used as one adjustment period.
  • the length of the scheduling period may be tolerated according to services. Rate fluctuation to determine, for example, a scheduling period may contain 150 1000 ⁇ ; Then, whether the amount of data that the user terminal has been scheduled is greater than or equal to "GBRx scheduling period" is used as a basis for determining whether the user terminal is satisfied with the quality of service. Put the user terminal into two queues with different priority levels.
  • the transmission rate ratio algorithm obtained by the user terminal refers to the ratio of the actual transmission rate obtained by the user to the guaranteed bit rate.
  • FIG. 2 it is an implementation process diagram of a first embodiment of a method for scheduling a communication system according to the present invention.
  • a TTI is used as an adjustment period as an example.
  • the process of this method includes:
  • Step 21 Determine whether the current TTI is the first TTI of the current scheduling period. If yes, set the amount of data that each user terminal has scheduled in the current scheduling period to 0 (ie, step 22). Otherwise, keep the original Value, go directly to step 23;
  • Step 23 Put all user terminals into two queues according to whether the amount of data that the user terminal has been scheduled is greater than or equal to the product of the GBR and the scheduling period, and the user terminal is placed in two queues: a high priority queue and a low priority queue. ;
  • step 23 The amount of data that the user terminal is scheduled is also the amount of data that the user terminal has sent.
  • the specific implementation process of step 23 is as follows:
  • the amount of data that the user terminal has sent is greater than or equal to the "GBRx scheduling period, and the user terminal is placed in the low priority queue; the user terminal that has sent the data amount less than the "GBRx scheduling period" is placed in the high priority. Level queue.
  • Step Spiral 24 In each priority queue, according to algorithms such as MAX C/I, Round Robin or Proportional Fair, it is also possible to use a waiting time length algorithm, a transmission rate ratio algorithm obtained by a user terminal, or other sorting algorithm, for each The user terminal performs priority queuing in the order of high to low.
  • Step 25 In the next adjustment period, the results of the priority queuing according to the previous adjustment period are sequentially scheduled from the highest to the lowest order in the high priority queue.
  • User terminal data until the HSDPA resource is exhausted; if the user terminal data in the high priority queue has been scheduled, and the HSDPA resource remains, the user terminal data in the low priority queue is sequentially scheduled;
  • Step 26 Update the amount of data that the user terminal has scheduled in the current scheduling period;
  • Step 27 Return to the above steps, that is, repeat steps 21 to 26.
  • the user terminal data is scheduled according to the result of the priority scheduling of the previous scheduling period, and then the user terminal is determined to be satisfied with the service. According to this, different priority queues are put into the queue, and the queued result is used for the next adjustment period.
  • the scheduling time is divided into scheduling periods, and multiple transmission time intervals TTI are included in each scheduling period, and according to whether the data amount that the user terminal has been scheduled is greater than the “GBRx scheduling period, as a measurement user terminal. Whether to obtain a satisfactory basis for the quality of service, and based on the judgment
  • the user terminal After the satisfactory service, put it in the low priority queue. When the user terminal does not get satisfactory service, put it in the high priority queue. After that, according to the corresponding algorithm (for example, the maximum carrier-to-interference ratio algorithm, round robin The algorithm, the proportional fairness algorithm, the latency algorithm, the transmission rate ratio algorithm obtained by the user terminal or other sorting algorithm, etc.) allocate scheduling opportunities to the user terminal. In this way, the remaining resources can be allocated to other user terminals that need to be scheduled, thereby increasing the number of user terminals that are generally satisfactory in the system, and improving user satisfaction.
  • the corresponding algorithm for example, the maximum carrier-to-interference ratio algorithm, round robin The algorithm, the proportional fairness algorithm, the latency algorithm, the transmission rate ratio algorithm obtained by the user terminal or other sorting algorithm, etc.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • the scheduling period is set, and whether the amount of data that has been scheduled by the user terminal is greater than the “GBRx scheduling period” is used to measure whether the user terminal obtains a satisfactory service.
  • the scheduling algorithm of the communication system of the first embodiment of the present invention is different in that, in this embodiment, whether the actual transmission rate that the user terminal has obtained is greater than or equal to GBR is used to measure whether the user terminal is satisfied.
  • FIG. 3 it is an implementation diagram of a second embodiment of a method for scheduling a communication system according to the present invention.
  • a TTI is used as an adjustment period as an example.
  • the method process includes:
  • Step 31 Calculate the transmission rate that the user terminal has obtained
  • the transmission rate ⁇ ( t ) that the user terminal has obtained is a filtered value of the actual transmission rate of the user terminal within the smoothing time Tc.
  • i'i ( t ) is the transmission rate that the user terminal has obtained
  • Tc is the smoothing time constant
  • ⁇ indicating how many TTIs are used to smooth the rate
  • the smoothing time constant Tc should be chosen to be large enough to ensure that the negative effects of fast fading are filtered, but should also be short enough to allow the calculated rate to reflect the shadow fading environment.
  • the smoothing time constant Tc takes a value of 800. It can be understood that the transmission rate that the user terminal has obtained can also be calculated by other means.
  • Step 32 Put all user terminals into 2 queues according to whether the transmission rate that the user terminal has obtained is greater than or equal to whether the GBR is a satisfactory service for the user terminal: high priority queue and low Priority queue
  • Step 33 In each priority queue, according to the MAX C/l, Round Robin, Proportional Fair algorithm, or according to the waiting time length algorithm, the transmission rate ratio algorithm obtained by the user terminal or other sorting algorithm, each user terminal is performed. Priority queuing, in order from high to low;
  • Step 34 In the next adjustment period, according to the result of the prioritization of the previous adjustment period, the user terminal data in the high priority queue is sequentially scheduled from the highest to the lowest, until the HSDPA resource is exhausted;
  • step 34 if the user terminal data in the high priority queue has been scheduled, and the HSDPA resource remains, the user terminal data in the low priority queue is sequentially scheduled;
  • Step 35 Return to the above steps, repeat steps 31 through 34.
  • the transmission rate that the user terminal has obtained is calculated by using the formula (2), and then according to whether the transmission rate ri ( t ) that the user terminal has obtained is greater than or equal to the GBR, as a basis for determining whether the user terminal obtains a satisfactory quality of service, Put the user terminal into two different priority levels, that is, when the user terminal has received satisfactory service, put it into the low priority queue; when the user terminal does not get satisfactory service, put it into the queue High priority queue.
  • the user terminal is then assigned a scheduling opportunity according to a corresponding algorithm (e.g., maximum carrier-to-interference ratio algorithm, round-robin algorithm, proportional fairness algorithm, latency algorithm, resulting rate ratio, example algorithm, or other ranking algorithm).
  • a corresponding algorithm e.g., maximum carrier-to-interference ratio algorithm, round-robin algorithm, proportional fairness algorithm, latency algorithm, resulting rate ratio, example algorithm, or other ranking algorithm.
  • the user terminal is also considered to be satisfied with the service.
  • the user terminals are accordingly placed in different priority queues.
  • the user has no data in the buffer queue to be transmitted, which refers to the user at the NodeB. There is no data in the MAC-hs queue cache.
  • the first or second embodiment it is also possible to judge by using the criterion of determining whether the user terminal is satisfied with the service terminal at the end point of the scheduling period. In this way, not only is the judgment of whether the service is satisfactory in each adjustment period, but also the user terminal is placed in a different priority queue, and then scheduled; and such judgment is also made at the end of a scheduling period, and then the user terminal is further Put in different priority queues. In this way, the remaining resources can be allocated to other user terminals that need to be scheduled, thereby increasing the number of user terminals that are generally satisfactory in the system, and improving user satisfaction.
  • the above description is based on the air interface HSDPA data scheduling of the WCDMA system as an example.
  • the present invention is not limited thereto, and the embodiment of the present invention can also be applied to data scheduling of the Iub interface.
  • the implementation process is known to those skilled in the art and will not be described herein.
  • the technical solution provided by the embodiment of the present invention is applicable to a WCDMA communication system, a CDMA2000 communication system, or a communication system such as TD-SDCDMA.
  • Embodiment 3 is a diagrammatic representation of Embodiment 3
  • FIG. 4 is a flowchart of an implementation of a third embodiment of a method for scheduling a communication system according to the present invention, the process includes:
  • the user terminal is scheduled according to a more efficient scheduling method for a period of time; then, the user terminal that is not satisfied is preferentially scheduled; finally, the redundant time resource is redistributed.
  • step 41 each scheduling period is divided into different scheduling time periods
  • the different scheduling time segments include a service rate scheduling time segment and a mandatory scheduling time segment.
  • the scheduling period may further include a supplementary scheduling time segment.
  • Each scheduling period includes a number of transmission time intervals TTI, which are set by the system itself.
  • the determination of the length of the scheduling period needs to take into account the fluctuation range requirements of the user rate and the signal fading period factor of the channel environment. Taking into account the above factors, each scheduling period can be 0 to 5 seconds.
  • the scheduling period length is 0.5 seconds, and includes 250 transmission time intervals.
  • a ⁇ is taken as an adjustment cycle as an example, but it is not Limited to this.
  • each of the scheduling time periods is represented by X, Y, and z, respectively, indicating a service rate scheduling time period, a mandatory scheduling time period, and a supplementary scheduling time period:
  • the X phase is ended and the process proceeds directly to the ⁇ phase. Then, there are X and ⁇ phases in this scheduling period, and the length of the ⁇ phase is 0.
  • the ⁇ phase continues until the end of the scheduling period, and does not enter the ⁇ phase. Then there are X and ⁇ phases in this cycle.
  • X, Y, Ze [0, 100] respectively represent the proportion of the scheduling period occupied by each scheduling period.
  • the determination of the X, ⁇ , and ⁇ values can be obtained based on the simulation results of the system.
  • the simulation is performed separately by the network simulation software, and the simulation result is analyzed.
  • the corresponding X value is the maximum value of X.
  • (X—max % x scheduling period) is the duration of the X period
  • (Y—max % x scheduling period) is the duration of the Y period.
  • Step 42 Determine whether the user terminal is satisfied in each TTI (ie, the adjustment period of this embodiment), and put the user terminal that is satisfied with the service into the low priority queue, and put the user terminal that does not receive the satisfactory service into the high priority queue. ; In each case, whether the actual transmission rate that the user terminal has obtained is greater than or equal to GBR is used as a basis for determining that the user terminal is satisfied with the service.
  • determining whether the user terminal is satisfied with the service may also be based on other criteria, such as: whether the amount of data that has been sent by the user terminal is greater than or equal to the product of the GBR and the scheduling period; or whether the following conditions are met, and the scheduling period ends. Point, if the amount of data that the user terminal has been scheduled in the current scheduling period does not reach the product of the GBR and the scheduling period, but the user has no data in the buffer queue to be transmitted; or, at the end of the scheduling period, if the user terminal The actual transmission rate obtained does not reach GBR, but the user has no data in the buffer queue to be transmitted.
  • step 43 according to the scheduling time period in which the adjustment period is located, in each priority queue, selecting a suitable queuing basis, and prioritizing each user terminal;
  • the maximum carrier-to-interference ratio scheduling algorithm and/or the proportional fair scheduling algorithm are used to prioritize the user terminal; in the mandatory scheduling period, according to the scheduling priority indicator (SPI, Schedule Priority Indicator) Prioritize the user terminals.
  • SPI Schedule Priority Indicator
  • each user terminal is prioritized by a round robin algorithm or a proportional fair algorithm.
  • step 44 in the next adjustment period, according to the result of the prior adjustment period priority queuing, the user terminal data in the high priority queue is sequentially scheduled from high to low until the HSDPA resources are exhausted.
  • the judgment basis may be one of the foregoing judgment criteria.
  • whether the actual transmission rate obtained by the user terminal reaches the GBR is as follows. For an example, describe it. The user terminal that has reached the GBR in the actual transmission rate in the period is placed in the low priority queue; and the user terminal that does not reach the GBR in the actual transmission rate obtained in the period is placed in the high priority queue. Priority is given to scheduling.
  • the scheduling algorithm that can be used is: MA C/I scheduling algorithm and / Or PF scheduling algorithm.
  • the X time period When the last TTI of the X time period arrives, it is judged whether the actual transmission rate obtained by the user terminal in the scheduling period does not reach the GBR, that is, whether all the user terminals are satisfied with the service. If the last transmission time of the X time period arrives, the actual transmission rate obtained by the user terminal in the scheduling period does not reach the GBR, the X time period ends, and the Y scheduling time period is entered, and in the Y scheduling time period, these are The user terminal whose transmission rate does not reach the GBR is scheduled according to the SPI in the priority queue until the transmission rate obtained by all the user terminals in the period reaches the GBR, and the Y period ends. Correspondingly, if the actual transmission rate obtained by all users in the period reaches GBR before the last TTI of the X period arrives, the X period ends prematurely and does not enter the Y period.
  • the supplementary scheduling time period ie, the Z phase, which is the actual transmission rate obtained by all the user terminals, may be entered.
  • the remaining time resources of the scheduling period the round robin algorithm Round Robin or the proportional fair Porportional fair scheduling algorithm is used to allocate the remaining time resources to all user terminals.
  • the X scheduling time period of the above scheme has a maximum value X - max, which can be adjusted.
  • X - max the maximum value reserved for the high-priority user is insufficient.
  • the next scheduling period needs to reduce the length of the X-phase, that is, X-max is reduced by one step; if there is no unsatisfactory user , and the scheduling period includes the ⁇ phase, then the X phase is increased in the next scheduling cycle, that is, X-max is increased by one step. In other cases, the length of the X phase remains the same.
  • Table 2 shows the scheduling algorithm used for each scheduling period, the users it targets, and a description of the purpose. It is to be noted that determining whether the user terminal is satisfied with the service may be a plurality of standards. In the following table, whether the actual transmission rate obtained by the user terminal is obtained by using the GBR is described as an example, but is not limited thereto: Table 2 Scheduling of each scheduling time period Algorithm description table
  • the X traffic rate can be selected by the following algorithms: MAX C/I actual transmission speed) W GBR user scheduling time scheduling algorithm, PF scheduling algorithm rate does not reach the user plane of the multi-send GBR under the condition of the ring-breaking, time resource trace rate Y Forced scheduling for users who do not meet GBR according to the actual transmission speed.
  • the time period priority indication (SPI) is used to determine the user rate does not reach the household priority, and meet the user service requirements of the differentiated terminal to schedule GBR.
  • the supplementary scheduling will balance the remaining time resources.
  • the actual transmission time period is the allocation of the redundant time period to all users.
  • the adopted time rate has been reached. The user needs to consider the degree of the user channel environment and priority users.
  • the embodiment of the present invention is directed to a user whose transmission rate does not reach the GBR, and the user terminal is scheduled according to a higher efficiency algorithm in the X time period, that is, the service rate adjustment time period.
  • the selected algorithms are: MAX C/I scheduling algorithm, PF scheduling algorithm, so that all users with GBR first send more data when the channel environment becomes better, and improve the utilization of time resources;
  • the user terminal that still has not satisfied GBR at the end of the X time period is adjusted according to the scheduling priority indication (SPI).
  • SPI scheduling priority indication
  • the transmission rate of all user terminals has reached the GBR and the service is satisfactory, enter the Z time segment, that is, the supplementary scheduling time period, and allocate the remaining time resources to all required user terminals again.
  • the scheduling algorithm used can use Round Robin. Or the Porportional Fair, to achieve the purpose of allocating redundant time resources, avoiding wasted time resources.
  • the X time period can be further divided into two time segments, and the basis of the division is that the two system indicators of the number of users satisfying the service and the response time of the small data volume service achieve the optimal performance, the two times.
  • the segments are: (1) the maximum carrier-to-interference ratio scheduling period, and (2) the proportional fair scheduling period.
  • the MAX C/I scheduling algorithm and the PF scheduling algorithm are respectively used for time resource scheduling.
  • the user guarantees the bit rate requirement.
  • the user terminal When the user terminal has obtained a satisfactory service, the user terminal is put into the low priority queue. When the user terminal does not get the satisfactory service, the user is used. The terminal is placed in the high priority queue. After that, each scheduling period is divided into smaller scheduling time segments, and a targeted scheduling algorithm is adopted in the scheduling time period, so that a larger number of users obtain the guaranteed bit rate in the scheduling period, thereby improving the user. Satisfaction.
  • an embodiment of the present invention further provides a scheduling apparatus for a communication system, and a schematic structural diagram thereof is shown in FIG. 5.
  • the apparatus includes: a determining unit 52, an adjusting unit 53, and a scheduling unit 54.
  • the determining unit 52 is configured to determine, according to a determination result of the determining unit 52, the user terminal, Entering a different priority queue, if the determination result is yes, placing the user terminal into a low priority queue, and if the determination result is no, placing the user terminal into a high priority queue; the scheduling unit 54, Used to schedule user terminal data in the priority queue.
  • FIG. 6 is an embodiment of the apparatus of FIG.
  • the apparatus includes the unit defined in FIG. 5 (in FIG. 6, the judgment unit number is 62, the adjustment unit number is 53, and the scheduling unit number is 54), and may further include: a period dividing unit 61.
  • the period dividing unit 61 is configured to divide the scheduling time into a plurality of the scheduling periods, and divide the scheduling period into multiple adjustment periods, where the adjustment period is in units of ,, including one or more TTIs;
  • the function of the determining unit 62 may be specifically implemented in multiple manners. The following is one of the modes:
  • the determining unit 62 includes a data amount determining sub-unit 621, configured to perform the current scheduling period according to the user terminal in each of the adjustment periods. Whether the amount of data that has been scheduled is greater than or equal to the product of the GBR and the scheduling period to determine whether the user terminal is satisfied with the service, and sends the result of the determination to the adjusting unit 63.
  • the adjusting unit 63 adjusts the scheduling priority of the user terminal according to the determination result of the data amount determining sub-unit 621, and if the determination result is yes, lowers the The scheduling priority of the user terminal, the user terminal is placed in the low priority queue, and if the determination result is no, the scheduling priority of the user terminal is increased, and the user terminal is placed in the high priority queue;
  • the scheduling unit 64 is configured to schedule user terminal data in the priority queue.
  • the scheduling unit 64 may further include: a queuing subunit 641, scheduling Subunit 642 and algorithm selection subunit 643.
  • the queuing sub-unit 641 is configured to perform priority queuing for the user terminals in each priority queue.
  • the scheduling sub-unit 642 is configured to sequentially schedule the queuing results according to the queuing sub-unit 641.
  • the algorithm selection sub-unit 643 is configured to select a basis used for priority queuing of the user terminal.
  • the priority queuing for each user terminal is based on: maximum carrier-to-interference ratio algorithm, round-robin algorithm, proportional fairness algorithm, length of waiting time, or ratio of transmission rate obtained by the user terminal.
  • the scheduling unit 64 schedules the user terminal data in the priority queue, and uses the judgment result of the previous adjustment period. That is, in one adjustment period, the judgment and the different priority queues are performed, the queuing sub-unit 641 performs priority queuing on the user terminal, and then the scheduling sub-unit 642 performs scheduling according to the queuing result in the next scheduling period. Then repeat the above function actions.
  • the scheduling apparatus further includes a data volume updating unit 65, configured to update, after the scheduling unit 63, the data of the user terminal, that the user terminal has been scheduled in a current scheduling period. The amount of data.
  • the function of the judging unit 62 can take another form.
  • the judging unit 62 may include: a calculating subunit and a GBR judging subunit.
  • the calculating subunit is configured to calculate an actual transmission rate that has been obtained by the user terminal in the current scheduling period in each of the adjustment periods; and the GBR determining subunit is configured to calculate according to the calculating subunit As a result, it is judged whether the actual transmission rate is greater than or equal to GBR, and the result of the determination is sent to the adjustment unit.
  • the adjusting unit adjusts the scheduling priority of the user terminal according to the judgment result of the GBR determining subunit, and if the judgment result is yes, lowers the scheduling priority of the user terminal, and places the user terminal into If the result of the determination is no, the scheduling priority of the user terminal is increased, and the user terminal is placed in a high priority queue.
  • the scheduling unit is configured to schedule user terminal data in the priority queue. .
  • the function of the judging unit 62 can adopt the third mode.
  • the determining unit may further include a buffer determining subunit, configured to determine, in each of the adjustment periods, whether the user terminal has data in the buffer queue user terminal to be transmitted, and send the determination result to the adjusting unit.
  • the adjusting unit adjusts the scheduling priority of the user terminal according to the judgment result of the buffer judging subunit, and if the judgment result is yes, the scheduling priority of the user terminal is lowered, and if the judging result is No, the scheduling priority of the user terminal is increased; the scheduling unit is configured to adjust the priority of the adjusting unit.
  • the data of the user terminal of the level is scheduled.
  • the queuing subunits prioritize the user terminals, and then the subunits are scheduled in the next scheduling period. Scheduling based on the queuing results. Then repeat the above function actions.
  • the period dividing unit 61 may further include: a time segment dividing subunit 611, configured to divide the scheduling period into a service rate scheduling time period, a mandatory scheduling time period, and a supplementary scheduling time period, where each of the adjustment periods corresponds to Service rate adjustment time period, forced scheduling time period, or supplementary scheduling time period.
  • the algorithm selection sub-unit 643 selects an appropriate queuing basis according to different scheduling time periods corresponding to the adjustment period.
  • the maximum carrier-to-interference ratio scheduling algorithm and/or the proportional fair scheduling algorithm are selected.
  • the scheduling unit is instructed to schedule the user terminal according to the scheduling priority indication.
  • a round robin algorithm or a proportional fair algorithm is selected.
  • the service rate scheduling period of the above solution has a maximum value X_max, which can be adjusted.
  • the apparatus may include a time period adjustment unit to perform its adjustment function. At the end of the scheduling period, it is determined whether there is an unsatisfactory user. If it exists, it indicates that the mandatory scheduling period reserved for the high-priority user is insufficient. In the next scheduling period, the time length of the service rate scheduling period needs to be reduced, that is, X-max is reduced by one step; if not, Satisfied user, and this scheduling period includes the forced scheduling time period, then the X phase is increased in the next scheduling period, that is, X-max is increased by one step. In other cases, the length of the X phase remains the same.
  • the determining unit may further include: a data amount determining subunit, a GBR judging subunit, and a buffer judging subunit, and the specific functions and functions thereof are as described above, and are not described herein again.
  • the scheduling method and apparatus of the communication system reduces the scheduling priority of the user terminal when the user terminal has received a satisfactory service in a preset scheduling period.
  • the low priority queue when the user terminal does not get satisfactory service, increases the scheduling priority of the user terminal and puts it into the high priority queue.
  • the user terminal is then assigned a scheduling opportunity according to a corresponding algorithm (eg, maximum carrier-to-interference ratio algorithm, round-robin algorithm, proportional fairness algorithm, latency algorithm, resulting rate scaling algorithm, or other ranking algorithm).
  • a corresponding algorithm eg, maximum carrier-to-interference ratio algorithm, round-robin algorithm, proportional fairness algorithm, latency algorithm, resulting rate scaling algorithm, or other ranking algorithm.
  • the scheduling period can be divided into smaller scheduling time segments, and a targeted scheduling algorithm is adopted in different scheduling time periods, so that a larger number of users can get satisfactory services in the scheduling period, thereby improving users. Satisfaction.

Landscapes

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

Abstract

La présente invention concerne un procédé de programmation qui est mis en oeuvre dans des systèmes de communication et consiste : à déterminer si un terminal utilisateur a obtenu un service satisfaisant au cours d'une période de programmation prédéterminée; si c'est le cas, à placer ledit terminal utilisateur dans une file d'attente à faible niveau de priorité; sinon, à placer ledit terminal utilisateur dans un file d'attente à niveau de priorité élevé; à programmer les données du terminal utilisateur dans lesdites files d'attente à niveau de priorité. Un appareil de programmation utilisé dans des systèmes de communication comprend une unité de détermination, une unité de réglage et une unité de programmation. Le présent schéma permet d'augmenter le nombre de terminaux utilisateur qui ont obtenus des services satisfaisants et d'augmenter le niveau de satisfaction des utilisateurs.
PCT/CN2007/001326 2006-04-21 2007-04-23 Procédé et appareil de programmation dans des systèmes de communication WO2007121674A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CNB2006100744873A CN100536603C (zh) 2006-04-21 2006-04-21 一种移动通信系统的调度方法
CN200610074487.3 2006-04-21
CN200610084668.4 2006-05-29
CNB2006100846684A CN100502361C (zh) 2006-05-29 2006-05-29 一种通信系统的调度方法

Publications (1)

Publication Number Publication Date
WO2007121674A1 true WO2007121674A1 (fr) 2007-11-01

Family

ID=38624555

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/001326 WO2007121674A1 (fr) 2006-04-21 2007-04-23 Procédé et appareil de programmation dans des systèmes de communication

Country Status (1)

Country Link
WO (1) WO2007121674A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9940471B2 (en) 2013-07-31 2018-04-10 Zte Corporation Virtual output queue authorization management method and device, and computer storage medium
CN113411811A (zh) * 2021-05-27 2021-09-17 国网江苏省电力有限公司南京供电分公司 基于新用户发现机制和剩余带宽动态调度的带宽分配方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1291395A (zh) * 1998-02-18 2001-04-11 鲍尔·埃克斯有限公司 用于数据交换装置的调度装置
US20040210619A1 (en) * 2003-04-15 2004-10-21 Krishna Balachandran Method for scheduling transmissions in communication systems
US20050052997A1 (en) * 2002-04-09 2005-03-10 Hector Montes Linares Packet scheduling of real time packet data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1291395A (zh) * 1998-02-18 2001-04-11 鲍尔·埃克斯有限公司 用于数据交换装置的调度装置
US20050052997A1 (en) * 2002-04-09 2005-03-10 Hector Montes Linares Packet scheduling of real time packet data
US20040210619A1 (en) * 2003-04-15 2004-10-21 Krishna Balachandran Method for scheduling transmissions in communication systems

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9940471B2 (en) 2013-07-31 2018-04-10 Zte Corporation Virtual output queue authorization management method and device, and computer storage medium
CN113411811A (zh) * 2021-05-27 2021-09-17 国网江苏省电力有限公司南京供电分公司 基于新用户发现机制和剩余带宽动态调度的带宽分配方法
CN113411811B (zh) * 2021-05-27 2022-11-04 国网江苏省电力有限公司南京供电分公司 基于新用户发现机制和剩余带宽动态调度的带宽分配方法

Similar Documents

Publication Publication Date Title
CN101926133B (zh) 通信调度方法和系统
JP4397928B2 (ja) ワイヤレス通信ネットワークの資源を、ネットワークのチャネルを介してユーザ機器に送信すべきトラヒックに割り当てる方法
CN101686196B (zh) 业务调度方法与装置
JP4335619B2 (ja) パケット優先制御装置及びその方法
KR101177136B1 (ko) 기지국에서 전송 리소스를 할당하기 위한 방법
JP4302140B2 (ja) パケット送信制御装置及びパケット送信制御方法
JP4790805B2 (ja) サービス品質およびチャネル特性に応じたスケジューリング
CN100550691C (zh) 调度分组数据传输的方法
JP5395982B2 (ja) サービス品質に基づく保証ビットレートのトラフィックスケジューリング方法
CN100362834C (zh) 分组发送控制装置和分组发送控制方法
KR20050037494A (ko) 무선 통신 시스템에서 패킷 데이터 전송들을 스케줄링하기위한 방법 및 장치
JP2004320774A (ja) 通信システムにおける伝送をスケジューリングする方法
US6920120B2 (en) System and method of scheduling radio resources in a wireless communications network
CN1968195A (zh) 一种通信系统的调度方法
CN102104968A (zh) 一种资源调度方法和基站
US7394768B2 (en) Fair scheduling with guaranteed minimum parameter
JP4150622B2 (ja) パケット送信制御装置及びパケット送信制御方法
JP2005236918A (ja) パケット送信制御装置及びパケット送信制御方法
JP2007300642A (ja) 無線ネットワークおよび他のアプリケーション用の、公平さが保証された、高スループットのスケジューラ
CN101860916A (zh) 一种资源调度方法及装置
WO2007121674A1 (fr) Procédé et appareil de programmation dans des systèmes de communication
JP2004260261A (ja) パケットスケジューリング方法及び移動通信システム
EP1473886B1 (fr) Ordonnancement équitable avec paramètres minimum garantis
Gyasi-Agyei et al. Comparison of opportunistic scheduling policies in time-slotted AMC wireless networks
CN100369502C (zh) 基站选择服务终端的正比公平调度方法

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: 07720899

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: 07720899

Country of ref document: EP

Kind code of ref document: A1