US7974198B2 - Apparatus and method for guaranteeing QoS traffic rate in mobile communication system - Google Patents

Apparatus and method for guaranteeing QoS traffic rate in mobile communication system Download PDF

Info

Publication number
US7974198B2
US7974198B2 US12/012,430 US1243008A US7974198B2 US 7974198 B2 US7974198 B2 US 7974198B2 US 1243008 A US1243008 A US 1243008A US 7974198 B2 US7974198 B2 US 7974198B2
Authority
US
United States
Prior art keywords
traffic rate
mobile station
traffic
mean
rate
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.)
Expired - Fee Related, expires
Application number
US12/012,430
Other versions
US20080186884A1 (en
Inventor
Byung-Chan Ahn
Jang-Won Park
Young-Soon Lee
Eun-Jin Lee
Soo-yeul Oh
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.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics 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
Application filed by Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Assigned to SAMSUNG ELECTRONICS CO., LTD. reassignment SAMSUNG ELECTRONICS CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: AHN, BYUNG-CHAN, LEE, EUN-JIN, LEE, YOUNG-SOON, OH, SOO-YEUL, PARK, JANG-WON
Publication of US20080186884A1 publication Critical patent/US20080186884A1/en
Application granted granted Critical
Publication of US7974198B2 publication Critical patent/US7974198B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/78Architectures of resource allocation
    • H04L47/781Centralised allocation of resources
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/822Collecting or measuring resource availability data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/824Applicable to portable or mobile terminals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints

Definitions

  • the present invention relates generally to an apparatus and a method for Quality of Service (QoS) in a mobile communication system. More particularly, the present invention relates to an apparatus and a method for guaranteeing a minimum reserved traffic rate and a maximum sustained traffic rate in the mobile communication system.
  • QoS Quality of Service
  • QoS Quality of Service
  • CAC Connection Admission Control
  • flow control e.g., leaky bucket
  • packet scheduling controlling usage of radio channels between a base station and a terminal, by referring to QoS parameters from a user and the network condition.
  • the Institute of Electrical and Electronics Engineers (IEEE) 802.16 standard provides quite detailed and sub-divided features in the QoS definition and differentiation.
  • the IEEE 802.16 standard defines QoS parameters of a minimum reserved traffic rate and a maximum sustained traffic rate.
  • the IEEE 802.16 standard supports Unsolicited Grant Service (UGS), real-time Polling Services (rtPS), and non-real-time Polling Services (nrtPS).
  • UMS Unsolicited Grant Service
  • rtPS real-time Polling Services
  • nrtPS non-real-time Polling Services
  • the minimum reserved traffic rate is used to meet a minimum traffic rate required in the application of real time service, or to keep a packet transmission interval of non-real-time service below a certain interval.
  • the UGS connection of the IEEE 802.16 standard periodically allocates slots for the minimum reserved traffic rate in an unsolicited pattern. Accordingly, there are no more subjects to be considered to meet the minimum reserved traffic rate in the UGS connection.
  • the rtPS connection of the IEEE 802.16 standard statistically, it is highly likely to satisfy the minimum traffic rate through the CAC.
  • the application frequently using the rtPS connection is a video streaming service. The video streaming generates burst traffic at a video codec at intervals.
  • the nrtPS connection of the IEEE 802.16 standard which has no required latency, exhibits the traffic rate in proportion to the channel condition. This is scheduled by a packet scheduler (e.g., a proportional fair scheduler). To raise the possibility of the traffic rate satisfaction, the packet scheduler multiplies by a weighting factor greater than 1 when calculating the priority. When the multiplied weighting factor is too great, the wireless bandwidth is monopolized. Thus, the traffic rate becomes too high and it may be problematic in view of the fairness. By contrast, when the multiplied weighting factor is too small, there would be not enough chances to select meet the minimum reserved traffic rate. Therefore, to effectively meet the minimum reserved traffic rate in the nrtPS connection, a method for determining an adequate weighting factor is required.
  • the maximum sustained traffic rate is used to provide the QoS based on a level of a subscriber.
  • the subscriber of the better channel condition acquires the higher traffic rate.
  • the traffic rate allocated to the subscriber is restricted, it is possible to allocate the small bandwidth to the subscriber who pays smaller fee in the good channel condition and then to allocate the remaining bandwidth to the subscriber who requires the high traffic rate and pays the considerable fee. That is, the subscriber requiring the high QoS acquires the high maximum sustained traffic rate while paying the considerable fee.
  • the maximum sustained traffic rate is used to limit the traffic rate in accordance with the paid fee, rather than to guarantee the traffic rate.
  • an aspect of the present invention is to provide an apparatus and a method for QoS in a mobile communication system.
  • Another aspect of the present invention is to provide an apparatus and a method for calculating a weight which meets a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system.
  • Yet another aspect of the present invention is to provide an apparatus and a method for scheduling using a weight which meets a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system.
  • the above aspects are achieved by providing a scheduling method for guaranteeing a Quality of Service (QoS) traffic rate in a mobile communication system.
  • the scheduling method includes calculating a total sum of traffic rates based on a channel change and a total sum of sustained traffic rates; calculating a weighted traffic rate using the traffic rate based on the channel change and the sustained traffic rate when the sustained traffic rate does not meet the QoS traffic rate; and determining a service priority using the weighted traffic rate.
  • QoS Quality of Service
  • a scheduling apparatus for guaranteeing a QoS traffic rate in a mobile communication system includes a traffic information calculator for calculating a total sum of traffic rates based on a channel change; a sustained traffic calculator for calculating a total sum of sustained traffic rates on a channel basis by accumulating the traffic rates; a weight calculator for calculating a weighted traffic rate using the traffic rate based on the channel change and the sustained traffic rate when the sustained traffic rate does not meet the QoS traffic rate; and a priority determiner for determining a service priority using the weighted traffic rate.
  • a method for guaranteeing a QoS traffic rate in a mobile communication system includes increasing a certain allocated token when a data size transmitted in a previous period is greater than a data size transmitted in a period at the QoS traffic rate; allocating the token to a corresponding to the channel connection; and scheduling using the allocated token and decreasing a token of a corresponding token.
  • FIG. 1 is a flowchart of a base station to guarantee QoS traffic rates using a weight in a mobile communication system according to an embodiment of the present invention
  • FIG. 2 is a flowchart of the base station to guarantee the QoS traffic rates using token allocation in the mobile communication system according to an embodiment of the present invention
  • FIG. 3 a block diagram of an apparatus for guaranteeing the QoS traffic rates in the mobile communication system according to an embodiment of the present invention
  • FIG. 4 is a graph of a minimum reserved traffic rate using the token allocation according to an embodiment of the present invention.
  • FIG. 5 is a graph of the minimum reserved traffic rate using the weight according to an embodiment of the present invention.
  • FIG. 6 is a graph of a maximum sustained traffic rate using the weight according to an embodiment of the present invention.
  • FIGS. 1 through 6 discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged wireless communication system.
  • the present invention provides an apparatus and a method for satisfying a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system.
  • the minimum reserved traffic rate and the maximum sustained traffic rate are referred to as QoS traffic rates.
  • FIG. 1 A method for satisfying the QoS traffic rate by multiplying by an adequate weight is explained in FIG. 1 , a method for determining priority to meet the QoS traffic rates by periodically allocating tokens is explained in FIG. 2 , and an apparatus for scheduling based on the priority which meets the QoS traffic rates is explained in FIG. 3 .
  • FIG. 1 is a flowchart of a base station to guarantee QoS traffic rates using a weight in a mobile communication system according to an embodiment of the present invention.
  • step 100 the base station calculates the total sum
  • the traffic rates R c,k are determined based on the channel change, c is a channel status index, and k is a connection index.
  • step 102 the base station calculates a total sum
  • the sustained traffic rate R t,k is on the time basis and can be acquired using the result of the scheduling.
  • the calculation method of the sustained traffic rate varies depending on its definition.
  • the IEEE 802.16 standard has a definition similar to a moving average. To guarantee the QoS, it is required that a packet scheduler perform a greater amount of calculation. For the accurate moving average calculation, a Digital Signal Processor (DSP), which requires a high processing load, is not suitable. Accordingly, the sustained traffic rate is calculated simply using an exponential average (1-tap IIR filtering).
  • step 104 the base station determines whether the QoS traffic rates are 0 kbps.
  • the base station determines priority using the acquired traffic rate based on the channel change and the mean traffic rate in step 110 .
  • the QoS traffic rates of 0 kbps signify no definition of the QoS traffic rates. Thus, in the scheduling, there is no need to meet the QoS traffic rates.
  • the base station determines whether the mean traffic rate meets the QoS traffic rates in step 106 .
  • the base station calculates the traffic rate of a weight using the total sum
  • R aux,c,k is a weighted traffic rate by multiplying R c,k by the weight f k
  • R c,k is the traffic rate based on the channel change
  • R aux,t,k is a weighted sustained traffic rate
  • R t,k is the mean traffic rate
  • ⁇ t is a factor for taking into account a fairness between the channel connections. As ⁇ t is close to zero, the fairness is not ensured but the integrated traffic throughput increases. By contrast, when ⁇ t becomes greater, the higher fairness is ensured but the integrated traffic throughput decreases.
  • the weighted traffic rate is calculated by changing R aux,t,k to the defined QoS traffic rates in Equation 1.
  • Equation 1 takes into account a multi-user diversity gain, it is expressed as Equation 2:
  • R aux , c , k F c , k ⁇ ⁇ i ⁇ R c , i ⁇ ( R aux , t , k ) ⁇ t ⁇ i ⁇ ( R t , i ) ⁇ t . [ Eqn . ⁇ 2 ]
  • R aux,c,k is the weighted traffic rate by multiplying R c,k by the weight f k
  • R c,k is the traffic rate based on the channel change
  • R aux,t,k is the weighted sustained traffic rate
  • R t,k is the mean traffic rate
  • F c,k is the multi-user diversity gain
  • ⁇ t is the factor for taking into account the fairness between the channel connections.
  • the base station calculates the priority using the weighted traffic rate.
  • the priority is calculated using Equation 3 or Equation 4. Equation 3 is used when the mean traffic rate R t,k is smaller than the minimum reserved traffic rate or greater than the maximum sustained traffic rate (when the sustained traffic rate does not meet the QoS traffic rates), and Equation 4 is used when the mean traffic rate R t,k is greater than the minimum reserved traffic rate or smaller than the maximum sustained traffic rate (when the sustained traffic rate meets the QoS traffic rates):
  • Equation 3 P k is the priority value, R aux,c,k is the weighted traffic rate by multiplying R c,k by the weight f k , R t,k is the mean traffic rate, and ⁇ t is the factor for taking into account the fairness between the channel connections.
  • Equation 4 P k is the priority value, R c,k is the traffic rate based on the channel change, R t,k is the mean traffic rate, and ⁇ t is the factor for taking into account the fairness between the channel connections.
  • the sustained traffic rate is greater than the maximum sustained traffic rate in the scheduling based on the real-time connection and the priority value is set to 0, it can be used not only in the non-real-connection but also in the real-time connection.
  • each terminal has the traffic rate of 1 Mbps. It is assumed that each terminal services at the traffic rate of 1 Mbps, the first terminal has the QoS traffic rate of 1.5 Mbps, and the other two terminals have the QoS traffic rate of 0 Kbps. In this case, with the maximum sector throughput of 3 Mbps traffic rate, each terminal transmit at 2R c,k , R c,k and R c,k respectively. In other words, the first terminal has the sustained traffic rate 2R c,k and the other two terminals have the sustained traffic rate R c,k . Accordingly, the final traffic rate of the terminals is
  • the minimum reserved traffic rate is required as in the nrtPS connection of the IEEE 802.16 standard
  • a weight greater than 1 is multiplied. Otherwise, a weight of 1 is multiplied.
  • the minimum reserved traffic rate is not necessary as in a Best Effort (BE) connection of the IEEE 802.16 standard
  • 1 is multiplied. However, this does not ensure the minimum reserved traffic rate. Since the traffic rate varies based on the channel condition, it is needed to fully consider the weight for the priority value of Equation 3 to accurately ensure the necessary minimum reserved traffic rate. Therefore, by applying the weight which meets the condition of Equation 1, the minimum reserved traffic rate (the QoS traffic rate) can be assured.
  • Equation 5 F c,k reflects the channel change and is calculated as
  • F c , k ( R c , k R c , k _ ) ⁇ c .
  • R c,k is the traffic rate based on the channel change and R c,k is the average rate according to the time of R c,k .
  • ⁇ c is a weighting factor to determine the range of the reflection of the channel status.
  • F t,k which ensures the minimum reserved traffic rate, has a great value when the recent sustained traffic rate is smaller than the minimum reserved traffic rate.
  • F l,k which ensures the maximum latency, has a great value when the latency of the recently transmitted packet is close to or greater than the maximum latency.
  • FIG. 2 is a flowchart of the base station to guarantee the QoS traffic rates using token allocation in the mobile communication system according to an embodiment of the present invention.
  • the base station determines whether it is a start point of a certain period. At the start point of the period, the base station compares a size of data transmitted in the previous period with a size of data transmitted in the period at the QoS traffic rate in step 202 . When the data size of the previous period is smaller than the data size of the period at the QoS traffic rate, the base station increases the number of allocated tokens by one in step 204 . When the data size of the previous period is greater than the data size of the period at the QoS traffic rate, the base station decreases the number of allocated tokens by one in step 206 . This is to allocate the tokens to guarantee the selection chance by periods and then to allow a higher priority as the number of the tokens increases.
  • step 208 the base station allocates the token acquired by comparing the data size transmitted the previous period with the data size transmitted in the period at the QoS traffic rate.
  • the number of the remaining tokens in every frame is T k
  • F t,k is acquired from the increased/decreased T k using Equation 4.
  • step 210 the base station decreases the tokens of every selected connection by one after the scheduling.
  • FIG. 3 is a block diagram of an apparatus for guaranteeing the QoS traffic rates in the mobile communication system according to an embodiment of the present invention.
  • the apparatus for guaranteeing the QoS traffic rates is referred to as a scheduler.
  • the scheduler 300 of FIG. 3 includes a sustained traffic calculator 304 , a traffic information calculator 302 , a weight calculator 306 , and a priority determiner 308 .
  • the traffic information calculator 302 calculates the traffic rate based on the channel change in every connection with the terminals using the CQI information for carrying the reception quality or the UL Tx power, and then outputs the traffic information to the sustained traffic calculator 304 and the weight calculator 306 .
  • the sustained traffic calculator 304 can acquire the sustained traffic rate using the traffic information provided from the traffic information calculator 302 .
  • the sustained traffic rate is calculated using the moving average or the exponential averaging (1-tap IIR filtering) and output to the weight calculator 306 .
  • the weight calculator 306 calculates the weight to acquire the QoS traffic rate using the total sum of the sustained traffic rates, the total sum of the traffic rates based on the channel change, and the information relating to the QoS traffic rates (the minimum reserved traffic rate and the maximum sustained traffic rate) provided from a QoS module 310 which is the upper layer of the scheduler 300 .
  • the weight to acquire the QoS traffic rates is calculated using Equation 1.
  • the priority determiner 308 calculates the priority using the weight traffic rate provided from the weight calculator 306 .
  • the priority is calculated using Equation 3 or Equation 4. Equation 3 is used when the sustained traffic rate is smaller than the QoS traffic rate, and Equation 4 is used when the sustained traffic rate is greater than the QoS traffic rate.
  • FIGS. 4 and 5 are graphs of the minimum reserved traffic rate according to an embodiment of the present invention.
  • eight terminals have the same channel in one sector and generate the channel independently.
  • Two terminals have the relatively high minimum reserved traffic rate of 1 Mbps.
  • the terminals have the sustained traffic rate of 500 kbps.
  • the remaining six terminals have the minimum reserved traffic rate of 50 kbps.
  • a preset number of tokens are allocated by periods and then the priority is increased in proportion to the number of the tokens.
  • the number of the tokens is the value calculated to meet the minimum reserved traffic rate.
  • every connection traffic rate exhibits the great change. As one can see, the minimum reserved traffic rate is not satisfied in most of the regions.
  • the connection traffic rate exhibits the little change while the minimum reserved traffic rate is well supported according to the present invention.
  • FIG. 6 shows the traffic rate change when the maximum sustained traffic rate is applied according to an embodiment of the present invention.
  • eight terminals have the same channel in one sector and generate the channel independently.
  • Four terminals have the relatively low maximum sustained traffic rate of 200 kbps. Without considering the maximum sustained traffic rate, the sustained traffic rate is 500 kbps. No maximum sustained traffic rate is applied to the remaining four terminals. As one can see, the terminals of the low maximum sustained traffic rate are stably limited to the traffic rate.
  • the method using the adequate weighting factor of FIG. 1 is suitable for the packet scheduler which schedules the non-real-time connections to acquire the traffic rate in proportion to the channel condition.
  • the method for periodically allocating the tokens of FIG. 2 is suitable for the packet scheduler which schedules the real-time connections in which the original source traffic has the bursty traffic feature.
  • the QoS can be satisfied.

Landscapes

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

Abstract

Apparatus and method for guaranteeing a Quality of Service (QoS) traffic rate in a mobile communication system are provided. The scheduling method for guaranteeing a QOS traffic rate in a mobile communication system includes calculating a total sum of traffic rates based on a channel change and a total sum of sustained traffic rates; calculating a weighted traffic rate using the traffic rate based on the channel change and the sustained traffic rate when the sustained traffic rate does not meet the QoS traffic rate; and determining a service priority using the weighted traffic rate. Therefore, the minimum reserved traffic rate and the maximum sustained traffic rate can be assured.

Description

CROSS-REFERENCE TO RELATED APPLICATION(S) AND CLAIM OF PRIORITY
This application claims priority under 35 U.S.C. §119(a) to an application filed in the Korean Intellectual Property Office on Feb. 1, 2007 and assigned Serial No. 2007-10365, the disclosure of which is herein incorporated by reference.
TECHNICAL FIELD OF THE INVENTION
The present invention relates generally to an apparatus and a method for Quality of Service (QoS) in a mobile communication system. More particularly, the present invention relates to an apparatus and a method for guaranteeing a minimum reserved traffic rate and a maximum sustained traffic rate in the mobile communication system.
BACKGROUND OF THE INVENTION
Recently, mobile communication standards are stressing Quality of Service (QoS) to assure traffic rate and latency required in an application, QoS differentiation on a user profile basis, and service parameters defined in connection admission. In a mobile communication system, the QoS is guaranteed in association with various schemes such as Connection Admission Control (CAC) for determining whether to admit the connection, flow control (e.g., leaky bucket) for controlling a source traffic rate in accordance with a network condition, and packet scheduling for controlling usage of radio channels between a base station and a terminal, by referring to QoS parameters from a user and the network condition.
Particularly, the Institute of Electrical and Electronics Engineers (IEEE) 802.16 standard provides quite detailed and sub-divided features in the QoS definition and differentiation. For example, the IEEE 802.16 standard defines QoS parameters of a minimum reserved traffic rate and a maximum sustained traffic rate. Also, the IEEE 802.16 standard supports Unsolicited Grant Service (UGS), real-time Polling Services (rtPS), and non-real-time Polling Services (nrtPS).
The minimum reserved traffic rate is used to meet a minimum traffic rate required in the application of real time service, or to keep a packet transmission interval of non-real-time service below a certain interval. The UGS connection of the IEEE 802.16 standard periodically allocates slots for the minimum reserved traffic rate in an unsolicited pattern. Accordingly, there are no more subjects to be considered to meet the minimum reserved traffic rate in the UGS connection. In the rtPS connection of the IEEE 802.16 standard, statistically, it is highly likely to satisfy the minimum traffic rate through the CAC. The application frequently using the rtPS connection is a video streaming service. The video streaming generates burst traffic at a video codec at intervals. Hence, the minimum traffic rate can be fully satisfied when the chance to select is guaranteed by acquiring several tokens at intervals. The nrtPS connection of the IEEE 802.16 standard, which has no required latency, exhibits the traffic rate in proportion to the channel condition. This is scheduled by a packet scheduler (e.g., a proportional fair scheduler). To raise the possibility of the traffic rate satisfaction, the packet scheduler multiplies by a weighting factor greater than 1 when calculating the priority. When the multiplied weighting factor is too great, the wireless bandwidth is monopolized. Thus, the traffic rate becomes too high and it may be problematic in view of the fairness. By contrast, when the multiplied weighting factor is too small, there would be not enough chances to select meet the minimum reserved traffic rate. Therefore, to effectively meet the minimum reserved traffic rate in the nrtPS connection, a method for determining an adequate weighting factor is required.
The maximum sustained traffic rate is used to provide the QoS based on a level of a subscriber. When the limited bandwidth is fairly allocated to the subscribers, the subscriber of the better channel condition acquires the higher traffic rate. When the traffic rate allocated to the subscriber is restricted, it is possible to allocate the small bandwidth to the subscriber who pays smaller fee in the good channel condition and then to allocate the remaining bandwidth to the subscriber who requires the high traffic rate and pays the considerable fee. That is, the subscriber requiring the high QoS acquires the high maximum sustained traffic rate while paying the considerable fee. Yet, the maximum sustained traffic rate is used to limit the traffic rate in accordance with the paid fee, rather than to guarantee the traffic rate.
Therefore, what are needed are an apparatus and a method for guaranteeing the minimum reserved traffic rate and the maximum sustained traffic rate in the non-real-time service of the mobile communication system.
SUMMARY OF THE INVENTION
To address the above-discussed deficiencies of the prior art, it is a primary aspect of the present invention to substantially solve at least the above problems and/or disadvantages and to provide at least the advantages below. Accordingly, an aspect of the present invention is to provide an apparatus and a method for QoS in a mobile communication system.
Another aspect of the present invention is to provide an apparatus and a method for calculating a weight which meets a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system.
Yet another aspect of the present invention is to provide an apparatus and a method for scheduling using a weight which meets a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system.
The above aspects are achieved by providing a scheduling method for guaranteeing a Quality of Service (QoS) traffic rate in a mobile communication system. The scheduling method includes calculating a total sum of traffic rates based on a channel change and a total sum of sustained traffic rates; calculating a weighted traffic rate using the traffic rate based on the channel change and the sustained traffic rate when the sustained traffic rate does not meet the QoS traffic rate; and determining a service priority using the weighted traffic rate.
According to one aspect of the present invention, a scheduling apparatus for guaranteeing a QoS traffic rate in a mobile communication system includes a traffic information calculator for calculating a total sum of traffic rates based on a channel change; a sustained traffic calculator for calculating a total sum of sustained traffic rates on a channel basis by accumulating the traffic rates; a weight calculator for calculating a weighted traffic rate using the traffic rate based on the channel change and the sustained traffic rate when the sustained traffic rate does not meet the QoS traffic rate; and a priority determiner for determining a service priority using the weighted traffic rate.
According to another aspect of the present invention, a method for guaranteeing a QoS traffic rate in a mobile communication system includes increasing a certain allocated token when a data size transmitted in a previous period is greater than a data size transmitted in a period at the QoS traffic rate; allocating the token to a corresponding to the channel connection; and scheduling using the allocated token and decreasing a token of a corresponding token.
Before undertaking the DETAILED DESCRIPTION OF THE INVENTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document: the terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation; the term “or,” is inclusive, meaning and/or; the phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like. Definitions for certain words and phrases are provided throughout this patent document, those of ordinary skill in the art should understand that in many, if not most instances, such definitions apply to prior, as well as future uses of such defined words and phrases.
BRIEF DESCRIPTION OF THE DRAWINGS
For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:
FIG. 1 is a flowchart of a base station to guarantee QoS traffic rates using a weight in a mobile communication system according to an embodiment of the present invention;
FIG. 2 is a flowchart of the base station to guarantee the QoS traffic rates using token allocation in the mobile communication system according to an embodiment of the present invention;
FIG. 3 a block diagram of an apparatus for guaranteeing the QoS traffic rates in the mobile communication system according to an embodiment of the present invention;
FIG. 4 is a graph of a minimum reserved traffic rate using the token allocation according to an embodiment of the present invention;
FIG. 5 is a graph of the minimum reserved traffic rate using the weight according to an embodiment of the present invention; and
FIG. 6 is a graph of a maximum sustained traffic rate using the weight according to an embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
FIGS. 1 through 6, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged wireless communication system.
The present invention provides an apparatus and a method for satisfying a minimum reserved traffic rate and a maximum sustained traffic rate in a mobile communication system. Herein, the minimum reserved traffic rate and the maximum sustained traffic rate are referred to as QoS traffic rates.
A method for satisfying the QoS traffic rate by multiplying by an adequate weight is explained in FIG. 1, a method for determining priority to meet the QoS traffic rates by periodically allocating tokens is explained in FIG. 2, and an apparatus for scheduling based on the priority which meets the QoS traffic rates is explained in FIG. 3.
FIG. 1 is a flowchart of a base station to guarantee QoS traffic rates using a weight in a mobile communication system according to an embodiment of the present invention.
In step 100, the base station calculates the total sum
i R c , k
of the traffic rates by measuring the traffic rates Rc,k based on the channel change for every connection with terminals. The traffic can be calculated using Channel Quality Indicator (CQI) information for carrying the reception quality or UpLink (UL) Tx power. Herein, the traffic rates Rc,k are determined based on the channel change, c is a channel status index, and k is a connection index.
In step 102, the base station calculates a total sum
i R t , k
of the mean traffic rates by calculating the sustained traffic rate Rt,k of every connection with the terminals. Herein, the sustained traffic rate Rt,k is on the time basis and can be acquired using the result of the scheduling. The calculation method of the sustained traffic rate varies depending on its definition. The IEEE 802.16 standard has a definition similar to a moving average. To guarantee the QoS, it is required that a packet scheduler perform a greater amount of calculation. For the accurate moving average calculation, a Digital Signal Processor (DSP), which requires a high processing load, is not suitable. Accordingly, the sustained traffic rate is calculated simply using an exponential average (1-tap IIR filtering).
In step 104, the base station determines whether the QoS traffic rates are 0 kbps. When the QoS traffic rates are 0 kbps, the base station determines priority using the acquired traffic rate based on the channel change and the mean traffic rate in step 110. Herein, the QoS traffic rates of 0 kbps signify no definition of the QoS traffic rates. Thus, in the scheduling, there is no need to meet the QoS traffic rates.
When the QoS traffic rates are not 0 kbps, that is, when the QoS traffic rates are defined, the base station determines whether the mean traffic rate meets the QoS traffic rates in step 106. When the mean traffic rate does not meet the QoS traffic rates, the base station calculates the traffic rate of a weight using the total sum
i R t , k
of the mean traffic rates and the total sum
i R c , k
of the traffic rates based on the channel change using Equation (1) in step 108.
As the priority based on the QoS traffic rates becomes similar with respect to the channel connection with the terminals, a higher mean traffic rate Rt,k can be acquired when Rc,k is greater than the other connections. In conclusion, when Raux,c,k is defined as the product of Rc,k and fk, a new sustained traffic rate Raux,t,k meets Equation 1:
R aux , c , k i R c , i = ( R aux , t , k ) α t i ( R t , i ) α t . [ Eqn . 1 ]
In Equation 1, Raux,c,k is a weighted traffic rate by multiplying Rc,k by the weight fk, Rc,k is the traffic rate based on the channel change, Raux,t,k is a weighted sustained traffic rate, Rt,k is the mean traffic rate, and αt is a factor for taking into account a fairness between the channel connections. As αt is close to zero, the fairness is not ensured but the integrated traffic throughput increases. By contrast, when αt becomes greater, the higher fairness is ensured but the integrated traffic throughput decreases.
When the sustained traffic rate does not meet the QoS traffic rates, the weighted traffic rate is calculated by changing Raux,t,k to the defined QoS traffic rates in Equation 1.
If Equation 1 takes into account a multi-user diversity gain, it is expressed as Equation 2:
R aux , c , k = F c , k × i R c , i × ( R aux , t , k ) α t i ( R t , i ) α t . [ Eqn . 2 ]
In Equation 2, Raux,c,k is the weighted traffic rate by multiplying Rc,k by the weight fk, Rc,k is the traffic rate based on the channel change, Raux,t,k is the weighted sustained traffic rate, Rt,k is the mean traffic rate, Fc,k is the multi-user diversity gain, and αt is the factor for taking into account the fairness between the channel connections.
In step 110, the base station calculates the priority using the weighted traffic rate. The priority is calculated using Equation 3 or Equation 4. Equation 3 is used when the mean traffic rate Rt,k is smaller than the minimum reserved traffic rate or greater than the maximum sustained traffic rate (when the sustained traffic rate does not meet the QoS traffic rates), and Equation 4 is used when the mean traffic rate Rt,k is greater than the minimum reserved traffic rate or smaller than the maximum sustained traffic rate (when the sustained traffic rate meets the QoS traffic rates):
P k = P aux , c , k ( R t , k ) α t . [ Eqn . 3 ]
In Equation 3, Pk is the priority value, Raux,c,k is the weighted traffic rate by multiplying Rc,k by the weight fk, Rt,k is the mean traffic rate, and αt is the factor for taking into account the fairness between the channel connections.
P k = R c , k ( R t , k ) α t [ Eqn . 4 ]
In Equation 4, Pk is the priority value, Rc,k is the traffic rate based on the channel change, Rt,k is the mean traffic rate, and αt is the factor for taking into account the fairness between the channel connections. For reference, when the sustained traffic rate is greater than the maximum sustained traffic rate in the scheduling based on the real-time connection and the priority value is set to 0, it can be used not only in the non-real-connection but also in the real-time connection.
For instance, when it is assumed that every terminal does not have the QoS traffic rates, three terminals have the same channel condition (that is, every terminal has the same Rc,k), and the maximum sector throughput is 3 Mbps, each terminal has the traffic rate of 1 Mbps. It is assumed that each terminal services at the traffic rate of 1 Mbps, the first terminal has the QoS traffic rate of 1.5 Mbps, and the other two terminals have the QoS traffic rate of 0 Kbps. In this case, with the maximum sector throughput of 3 Mbps traffic rate, each terminal transmit at 2Rc,k, Rc,k and Rc,k respectively. In other words, the first terminal has the sustained traffic rate 2Rc,k and the other two terminals have the sustained traffic rate Rc,k. Accordingly, the final traffic rate of the terminals is
1.5 Mbps ( 3 Mbps × 2 4 ) , 0.75 Mbps ( 3 Mbps × 1 4 ) , and 0.75 Mbps ( 3 Mbps × 1 4 )
based on Equation 1, and the final traffic rate of the first terminal guarantees the QoS traffic rate of 1.5 Mbps.
Next, the base station finishes this process.
In case where the minimum reserved traffic rate is required as in the nrtPS connection of the IEEE 802.16 standard, when the traffic rate based on the channel change is smaller than the minimum reserved traffic rate, a weight greater than 1 is multiplied. Otherwise, a weight of 1 is multiplied. When the minimum reserved traffic rate is not necessary as in a Best Effort (BE) connection of the IEEE 802.16 standard, 1 is multiplied. However, this does not ensure the minimum reserved traffic rate. Since the traffic rate varies based on the channel condition, it is needed to fully consider the weight for the priority value of Equation 3 to accurately ensure the necessary minimum reserved traffic rate. Therefore, by applying the weight which meets the condition of Equation 1, the minimum reserved traffic rate (the QoS traffic rate) can be assured.
In FIG. 1, high performance is exhibited in relation to the non-real-time connection traffic rate. Now, the method for guaranteeing the QoS traffic rates with respect to the real-time connection traffic rate is described by referring to FIG. 2. The priority in the real-time connection is calculated based on Equation 5:
P k,rt =F c,k ×F t,k ×F l,k.  [Eqn. 5]
In Equation 5, Fc,k reflects the channel change and is calculated as
F c , k = ( R c , k R c , k _ ) α c .
Rc,k is the traffic rate based on the channel change and Rc,k is the average rate according to the time of Rc,k. αc is a weighting factor to determine the range of the reflection of the channel status. Ft,k, which ensures the minimum reserved traffic rate, has a great value when the recent sustained traffic rate is smaller than the minimum reserved traffic rate. Fl,k, which ensures the maximum latency, has a great value when the latency of the recently transmitted packet is close to or greater than the maximum latency.
FIG. 2 is a flowchart of the base station to guarantee the QoS traffic rates using token allocation in the mobile communication system according to an embodiment of the present invention.
In step 200, the base station determines whether it is a start point of a certain period. At the start point of the period, the base station compares a size of data transmitted in the previous period with a size of data transmitted in the period at the QoS traffic rate in step 202. When the data size of the previous period is smaller than the data size of the period at the QoS traffic rate, the base station increases the number of allocated tokens by one in step 204. When the data size of the previous period is greater than the data size of the period at the QoS traffic rate, the base station decreases the number of allocated tokens by one in step 206. This is to allocate the tokens to guarantee the selection chance by periods and then to allow a higher priority as the number of the tokens increases.
In step 208, the base station allocates the token acquired by comparing the data size transmitted the previous period with the data size transmitted in the period at the QoS traffic rate. Herein, given that the number of the remaining tokens in every frame is Tk, Ft,k is acquired from the increased/decreased Tk using Equation 4.
In step 210, the base station decreases the tokens of every selected connection by one after the scheduling.
Next, the base station finishes this process.
FIG. 3 is a block diagram of an apparatus for guaranteeing the QoS traffic rates in the mobile communication system according to an embodiment of the present invention. Herein, the apparatus for guaranteeing the QoS traffic rates is referred to as a scheduler.
The scheduler 300 of FIG. 3 includes a sustained traffic calculator 304, a traffic information calculator 302, a weight calculator 306, and a priority determiner 308.
The traffic information calculator 302 calculates the traffic rate based on the channel change in every connection with the terminals using the CQI information for carrying the reception quality or the UL Tx power, and then outputs the traffic information to the sustained traffic calculator 304 and the weight calculator 306.
The sustained traffic calculator 304 can acquire the sustained traffic rate using the traffic information provided from the traffic information calculator 302. The sustained traffic rate is calculated using the moving average or the exponential averaging (1-tap IIR filtering) and output to the weight calculator 306.
When the QoS traffic rate is greater than the sustained traffic rate, the weight calculator 306 calculates the weight to acquire the QoS traffic rate using the total sum of the sustained traffic rates, the total sum of the traffic rates based on the channel change, and the information relating to the QoS traffic rates (the minimum reserved traffic rate and the maximum sustained traffic rate) provided from a QoS module 310 which is the upper layer of the scheduler 300. The weight to acquire the QoS traffic rates is calculated using Equation 1.
The priority determiner 308 calculates the priority using the weight traffic rate provided from the weight calculator 306. The priority is calculated using Equation 3 or Equation 4. Equation 3 is used when the sustained traffic rate is smaller than the QoS traffic rate, and Equation 4 is used when the sustained traffic rate is greater than the QoS traffic rate.
FIGS. 4 and 5 are graphs of the minimum reserved traffic rate according to an embodiment of the present invention. In the simulation environment, eight terminals have the same channel in one sector and generate the channel independently. Two terminals have the relatively high minimum reserved traffic rate of 1 Mbps. Without considering the minimum reserved traffic rate, the terminals have the sustained traffic rate of 500 kbps. The remaining six terminals have the minimum reserved traffic rate of 50 kbps. In FIG. 4, a preset number of tokens are allocated by periods and then the priority is increased in proportion to the number of the tokens. The number of the tokens is the value calculated to meet the minimum reserved traffic rate. Generally, every connection traffic rate exhibits the great change. As one can see, the minimum reserved traffic rate is not satisfied in most of the regions. In FIG. 5, the connection traffic rate exhibits the little change while the minimum reserved traffic rate is well supported according to the present invention.
FIG. 6 shows the traffic rate change when the maximum sustained traffic rate is applied according to an embodiment of the present invention. In the simulation environment, eight terminals have the same channel in one sector and generate the channel independently. Four terminals have the relatively low maximum sustained traffic rate of 200 kbps. Without considering the maximum sustained traffic rate, the sustained traffic rate is 500 kbps. No maximum sustained traffic rate is applied to the remaining four terminals. As one can see, the terminals of the low maximum sustained traffic rate are stably limited to the traffic rate.
The method using the adequate weighting factor of FIG. 1 is suitable for the packet scheduler which schedules the non-real-time connections to acquire the traffic rate in proportion to the channel condition. The method for periodically allocating the tokens of FIG. 2 is suitable for the packet scheduler which schedules the real-time connections in which the original source traffic has the bursty traffic feature.
As set forth above, since the weighted traffic rate is calculated to guarantee the minimum reserved traffic rate and the maximum sustained traffic rate in the mobile communication system, the QoS can be satisfied.
Although the present disclosure has been described with an exemplary embodiment, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompass such changes and modifications as fall within the scope of the appended claims.

Claims (14)

1. A scheduling method of a base station for guaranteeing a Quality of Service (QoS) traffic rate in a mobile communication system, the method comprising:
calculating, by a traffic information calculator, a total sum of traffic rates, each traffic rate being based on a channel change, and calculating, by a sustained traffic calculator, a total sum of mean traffic rates;
calculating, by a weight calculator, a weighted traffic rate for a mobile station using the total sum of traffic rates based on the channel changes and the total sum of mean traffic rates, when a mean traffic rate of the mobile station does not meet a QoS traffic rate of the mobile station; and
determining, by a priority determiner, a service priority using the weighted traffic rate.
2. The scheduling method of claim 1, wherein each traffic rate based on the channel change is calculated, by the traffic information calculator, based on Channel Quality Indicator (CQI) information or UpLink (UL) Tx power information.
3. The scheduling method of claim 1, further comprising:
acquiring, by the sustained traffic calculator, the mean traffic rate of the mobile station using an infinite impulse response (IIR) filter.
4. The scheduling method of claim 1, further comprising:
determining, by the priority determiner, the service priority using the total sum of traffic rates based on the channel changes and the total sum of mean traffic rates, when the mean traffic rate of the mobile station meets the QoS traffic rate.
5. The scheduling method of claim 1, wherein the weighted traffic rate is calculated by the weight calculator using the following equation:
R aux , c , k i R c , i = ( R aux , t , k ) α t t ( R t , i ) α t
where i is an index for a mobile station, Raux,c,k is a weighted traffic rate of a kth mobile station obtained by multiplying Rc,k by a weight fk, Rc,k is a traffic rate of the kth mobile station based on the channel change, Raux,t,k is a weighted mean traffic rate of the kth mobile station, Rt,k is a mean traffic rate of the kth mobile station, Rc,i is a traffic rate of an ith mobile station based on the channel change, Rt,i is a mean traffic rate of the ith mobile station, and αt is a factor for taking into account a fairness between channel connections.
6. The scheduling method of claim 5, wherein, when the mean traffic rate of the kth mobile station does not meet a QoS traffic rate of the kth mobile station, the weighted mean traffic rate Raux,t,k of the kth mobile station is set to the QoS traffic rate of the kth mobile station by the weight calculator.
7. The scheduling method of claim 1, wherein the service priority is determined, by the priority determiner, using the following equation:
P k = P aux , c , k ( R t , k ) α t
where Pk is a priority value of a kth mobile station, Raux,c,k is a weighted traffic rate of the kth mobile station after multiplying Rc,k by a weight fk, Rc,k is a traffic rate of the kth mobile station based on a channel change, Rt,k is a mean traffic rate of the kth mobile station, and αt is a factor for taking into account a fairness between channel connections.
8. A scheduling apparatus for guaranteeing a Quality of Service (QoS) traffic rate in a mobile communication system, the apparatus comprising:
a traffic information calculator circuit configured to calculate a total sum of traffic rates, each traffic rate being based on a channel change;
a sustained traffic calculator configured to calculate a total sum of mean traffic rates on a channel basis;
a weight calculator configured to calculate a weighted traffic rate for a mobile station using the total sum of traffic rates based on the channel changes and the total sum of mean traffic rates, when a mean traffic rate of the mobile station does not meet a QoS traffic rate of the mobile station; and
a priority determiner configured to determine a service priority using the weighted traffic rate.
9. The scheduling apparatus of claim 8, wherein each traffic rate based on the channel change is calculated based on Channel Quality Indicator (CQI) information or UpLink (UL) Tx power information.
10. The scheduling apparatus of claim 8, wherein the mean traffic rate of the mobile station is acquired through digital signal processing using an infinite impulse response (IIR) filter.
11. The scheduling apparatus of claim 8, further comprising:
the priority determiner configured to determine the service priority using the total sum of traffic rates based on the channel changes and the mean traffic rates, when the mean traffic rate of the mobile station meets the QoS traffic rate of the mobile station.
12. The scheduling apparatus of claim 8, wherein the weight traffic rate is calculated using the following equation:
R aux , c , k i R c , i = ( R aux , t , k ) α t t ( R t , i ) α t
where i is an index for a mobile station, Raux,c,k is a weighted traffic rate of a kth mobile station obtained by multiplying Rc,k by a weight fk, Rc,k is a traffic rate of the kth mobile station based on the channel change, Raux,t,k is a weighted mean traffic rate of the kth mobile station, Rt,k is a mean traffic rate of the kth mobile station, Rc,i is a traffic rate of an ith mobile station based on the channel change, Rt,i is a mean traffic rate of the ith mobile station, and αt is a factor for taking into account a fairness between channel connections.
13. The scheduling apparatus of claim 12, wherein, when the mean traffic rate of the kth mobile station does not meet a QoS traffic rate of the kth mobile station, the weighted mean traffic rate Raux,t,k of the kth mobile station is set to the QoS traffic rate of the kth mobile station.
14. The scheduling apparatus of claim 8, wherein the service priority is determined using the following equation:
P k = R aux , c , k ( R t , k ) α t
where Pk is a priority value of a kth mobile station, Raux,c,k is a weighted traffic rate of the kth mobile station after multiplying Rc,k by a weight fk, Rc,k is a traffic rate of the kth mobile station based on a channel change, Rt,k is a mean traffic rate of the kth mobile station, and αt is a factor for taking into account a fairness between channel connections.
US12/012,430 2007-02-01 2008-01-31 Apparatus and method for guaranteeing QoS traffic rate in mobile communication system Expired - Fee Related US7974198B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
KR10-2007-0010365 2007-02-01
KR2007-10365 2007-02-01
KR1020070010365A KR101007024B1 (en) 2007-02-01 2007-02-01 Apparatus and method for guaranteeing service quality traffic speed in mobile communication system

Publications (2)

Publication Number Publication Date
US20080186884A1 US20080186884A1 (en) 2008-08-07
US7974198B2 true US7974198B2 (en) 2011-07-05

Family

ID=39676070

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/012,430 Expired - Fee Related US7974198B2 (en) 2007-02-01 2008-01-31 Apparatus and method for guaranteeing QoS traffic rate in mobile communication system

Country Status (2)

Country Link
US (1) US7974198B2 (en)
KR (1) KR101007024B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140334394A1 (en) * 2011-04-13 2014-11-13 Telefonaktiebolaget L M Ericsson (Publ) Method and Base Station for Power Allocation in Wireless System

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9100880B2 (en) * 2009-02-13 2015-08-04 Qualcomm Incorporated Methods and systems for QoS translation during handover between wireless networks
US8510374B2 (en) * 2010-09-24 2013-08-13 Microsoft Corporation Polling protocol for automatic load limiting
US10243868B1 (en) * 2015-07-13 2019-03-26 Marvell Israel (M.I.S.L) Ltd Rate limiters and methods for rate limiting access to a resource
US9998381B2 (en) * 2016-05-05 2018-06-12 International Business Machines Corporation Quality of service for high network traffic events

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100246618B1 (en) 1997-12-19 2000-03-15 정선종 Traffic Scheduling Method in Asynchronous Transfer Mode Switch
US20040071081A1 (en) * 2002-10-10 2004-04-15 P-Cube Ltd. Method and software for calculating rate constraints
KR20040071709A (en) 2001-12-05 2004-08-12 리버스톤 네트웍스 인코포레이티드 Method and system for rate shaping in packet-based computer networks
KR20040097622A (en) 2003-05-12 2004-11-18 엘지전자 주식회사 Method of determining a reverse data rate in a mobile communication system
US6996061B2 (en) * 2000-08-11 2006-02-07 Industrial Technology Research Institute Dynamic scheduling for packet data network
KR20070005744A (en) 2005-07-06 2007-01-10 전자부품연구원 Traffic conditioning apparatus and method thereof for guaranteeing QoS
US20070099647A1 (en) * 2005-10-27 2007-05-03 Samsung Electronics Co., Ltd. Apparatus and method of determining uplink priority in wireless mobile communication system
US20070121498A1 (en) * 2005-11-30 2007-05-31 Samsung Electronics Co., Ltd. System and method for transmitting non-real-time data in a broadband communication system
US20070153801A1 (en) * 2005-12-12 2007-07-05 Samsung Electronics Co., Ltd. Method and apparatus for scheduling to guarantee QoS of VoIP service in portable Internet system
US20070183320A1 (en) * 2006-02-08 2007-08-09 Chen Jian F Deficit fair priority queuing
US20080175147A1 (en) * 2007-01-18 2008-07-24 Nokia Corporation Admission control for packet connections
US7460474B2 (en) * 2003-10-21 2008-12-02 Ntt Docomo, Inc. Packet transmission control apparatus and packet transmission control method
US7596090B2 (en) * 2001-10-04 2009-09-29 Qualcomm Incorporated Capacity-efficient flow control mechanism
US7633863B2 (en) * 2005-07-19 2009-12-15 Samsung Electronics Co., Ltd. Apparatus and method for scheduling data in a communication system
US7668110B2 (en) 2003-05-12 2010-02-23 Lg Electronics Inc. Method of determining reverse data rate in mobile communication system

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100246618B1 (en) 1997-12-19 2000-03-15 정선종 Traffic Scheduling Method in Asynchronous Transfer Mode Switch
US6996061B2 (en) * 2000-08-11 2006-02-07 Industrial Technology Research Institute Dynamic scheduling for packet data network
US7596090B2 (en) * 2001-10-04 2009-09-29 Qualcomm Incorporated Capacity-efficient flow control mechanism
KR20040071709A (en) 2001-12-05 2004-08-12 리버스톤 네트웍스 인코포레이티드 Method and system for rate shaping in packet-based computer networks
US20040071081A1 (en) * 2002-10-10 2004-04-15 P-Cube Ltd. Method and software for calculating rate constraints
KR20040097622A (en) 2003-05-12 2004-11-18 엘지전자 주식회사 Method of determining a reverse data rate in a mobile communication system
US7668110B2 (en) 2003-05-12 2010-02-23 Lg Electronics Inc. Method of determining reverse data rate in mobile communication system
US7460474B2 (en) * 2003-10-21 2008-12-02 Ntt Docomo, Inc. Packet transmission control apparatus and packet transmission control method
KR20070005744A (en) 2005-07-06 2007-01-10 전자부품연구원 Traffic conditioning apparatus and method thereof for guaranteeing QoS
US7633863B2 (en) * 2005-07-19 2009-12-15 Samsung Electronics Co., Ltd. Apparatus and method for scheduling data in a communication system
US20070099647A1 (en) * 2005-10-27 2007-05-03 Samsung Electronics Co., Ltd. Apparatus and method of determining uplink priority in wireless mobile communication system
US20070121498A1 (en) * 2005-11-30 2007-05-31 Samsung Electronics Co., Ltd. System and method for transmitting non-real-time data in a broadband communication system
US20070153801A1 (en) * 2005-12-12 2007-07-05 Samsung Electronics Co., Ltd. Method and apparatus for scheduling to guarantee QoS of VoIP service in portable Internet system
US20070183320A1 (en) * 2006-02-08 2007-08-09 Chen Jian F Deficit fair priority queuing
US20080175147A1 (en) * 2007-01-18 2008-07-24 Nokia Corporation Admission control for packet connections

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
Niyato, D.; Hossain, E.; , "Queue-aware uplink bandwidth allocation and rate control for polling service in IEEE 802.16 broadband wireless networks," Mobile Computing, IEEE Transactions on , vol. 5, No. 6, pp. 668-679, Jun. 2006. *
Niyato, D.; Hossain, E.; , "Service differentiation in broadband wireless access networks with scheduling and connection admission control: a unified analysis," Wireless Communications, IEEE Transactions on , vol. 6, No. 1, pp. 293-301, Jan. 2007. *
Office Action dated Jul. 30, 2010 in connection with Korean Patent Application No. 10-2007-0010365.
Settembre, M.; Puleri, M.; Garritano, S.; Testa, P.; Albanese, R.; Mancini, M.; Lo Curto, V.; , "Performance analysis of an efficient packet-based IEEE 802.16 MAC supporting adaptive modulation and coding," Computer Networks, 2006 International Symposium on pp. 11-16. *
Xiaofeng Bai; Shami, A.; Meerja, K.A.; Assi, C.; , "WLC22-3: New Distributed QoS Control Scheme for IEEE 802.16 Wireless Access Networks," Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE , vol., No., pp. 1-5, Nov. 27, 2006-Dec. 1, 2006. *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140334394A1 (en) * 2011-04-13 2014-11-13 Telefonaktiebolaget L M Ericsson (Publ) Method and Base Station for Power Allocation in Wireless System
US9271246B2 (en) * 2011-04-13 2016-02-23 Telefonaktiebolaget L M Ericsson Method and base station for power allocation in wireless system

Also Published As

Publication number Publication date
KR20080072110A (en) 2008-08-06
KR101007024B1 (en) 2011-01-12
US20080186884A1 (en) 2008-08-07

Similar Documents

Publication Publication Date Title
US7653025B1 (en) Scheduling shared channels and scheduler in wireless packet system
EP2296421B1 (en) Transmitter directed code division multiple access system using multi-users diversity to maximize throughput while equitably providing access to users
US7103350B2 (en) Scheduler with fairness control and quality of service support
JP4960365B2 (en) Method and apparatus for carrier allocation and management in a multi-carrier communication system
EP1370035B1 (en) Method and apparatus for scheduling users to allocate data transmissions in communications systems
US7769401B2 (en) Power management and distributed scheduling for uplink transmissions in wireless systems
US7430209B2 (en) Method and apparatus for providing communications bandwidth to users having a committed data rate based on priority assignment
US20110211478A1 (en) Cellular Communication System, Apparatus and Method for Management of Backhaul Resources
US20030135632A1 (en) Priority scheduler
US20100291959A1 (en) Radio scheduling apparatus, radio communication system, and radio scheduling method
US7289468B2 (en) System and method for scheduling protocol data units
US7974198B2 (en) Apparatus and method for guaranteeing QoS traffic rate in mobile communication system
US7298719B2 (en) Method for scheduling wireless downlink transmissions subject to rate constraints
KR100585713B1 (en) Forward Scheduling Method of High Speed Wireless Data Communication System
KR100660054B1 (en) Downlink Packet Scheduling Using Service Delay Time and Channel Status
US8542642B2 (en) Channel condition dependent scheduling
EP1832015B1 (en) A method for scheduling resources of packet level for integrated level for integrated traffic, and an apparatus therefor
KR100506018B1 (en) A method for determining a priority of packet transmission and a computer-readable medium having the program therof
KR20060073471A (en) Packet Level Resource Allocation Method and Apparatus for Aggregated Traffic
KR101084148B1 (en) Call Admission Control Method in Communication System
KR20060007622A (en) Apparatus and method for scheduling data transmission in communication system
KR20040006997A (en) System for packet scheduling of Mobile communication network and method thereof
KR20060111952A (en) Scheduling device and method in mobile communication system
HK1113049A (en) Transmitter directed code division multiple access system using multi-users diversity to maximize throughput while equitably providing access to users

Legal Events

Date Code Title Description
AS Assignment

Owner name: SAMSUNG ELECTRONICS CO., LTD., KOREA, REPUBLIC OF

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AHN, BYUNG-CHAN;PARK, JANG-WON;LEE, YOUNG-SOON;AND OTHERS;REEL/FRAME:020517/0905

Effective date: 20080129

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20230705