WO2005040959A2 - Packet scheduling system and method in mobile communication system - Google Patents

Packet scheduling system and method in mobile communication system Download PDF

Info

Publication number
WO2005040959A2
WO2005040959A2 PCT/KR2004/002417 KR2004002417W WO2005040959A2 WO 2005040959 A2 WO2005040959 A2 WO 2005040959A2 KR 2004002417 W KR2004002417 W KR 2004002417W WO 2005040959 A2 WO2005040959 A2 WO 2005040959A2
Authority
WO
WIPO (PCT)
Prior art keywords
packet
packet loss
probability
priority metric
user
Prior art date
Application number
PCT/KR2004/002417
Other languages
French (fr)
Other versions
WO2005040959A3 (en
Inventor
Dong-Hoi Kim
Byung-Han Ryu
Original Assignee
Electronics And Telecommunications Research Institute
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 Electronics And Telecommunications Research Institute filed Critical Electronics And Telecommunications Research Institute
Publication of WO2005040959A2 publication Critical patent/WO2005040959A2/en
Publication of WO2005040959A3 publication Critical patent/WO2005040959A3/en

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/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic 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/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • 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/54—Loss aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Definitions

  • the present invention relates to a packet scheduling system and method. More specifically, the present invention relates to a packet scheduling system and method for servicing real-time speech traffic data and real-time video traffic data in wireless multimedia environments.
  • Background Art
  • the next generation wireless communication systems are expected to provide broadband multimedia services including real-time speech and video data with QoS (quality of service)to mobile station users.
  • QoS quality of service
  • the M-LWDF (modified largest weighted delay first) method has been proposed as a scheduling method for guaranteeing delay of real-time traffic and processing performance in the wireless channel environment.
  • the algorithm initially allocates a sub channel to a user who has the top priority based on the priority metric of ⁇ (t).
  • the algorithm is designed for a delay-sensitive service, and considers the maximum delay condition of W required for each user i. max
  • Wis a packet delay for the user i (i.e., a time during which the user i stands by in the queue i, and in detail, a packet delay of the head of line of the queue i),
  • channel capacity (a channel rate) for the user i
  • i - log ⁇ ⁇ i I W 1 m ax
  • ⁇ ⁇ is the maximum probability value of W (t) which exceeds W 1 i max
  • a packet scheduling method in a mobile communication system comprises: (a) calculating a packet loss probability on an input real-time traffic packet; (b) differentiating a weight according to the state in which the calculated packet loss probability exceeds the maximum packet loss requirement probability, and determining a priority metric, the weight being established to be higher as the calculated packet loss probability approaches the maximum packet loss requirement probability; and (c) performing a packet scheduling process according to the priority metric determined in (b).
  • a packet scheduling system in a mobile communication system comprises: a QoS (quality of service) manager for storing realtime traffic data in an input buffer from among the data received from an upper layer, and managing QoS information corresponding to the stored traffic data; a per- subchannel packet loss calculator for calculating a per- subchannel packet loss probability of the stored real-time traffic data; and a packet scheduler for determining a priority metric based on the packet loss probability calculated by the per-subchannel packet loss calculator and the maximum packet loss requirement probability, and performing a packet scheduling process based on the priority metric
  • QoS quality of service
  • a recording medium for storing a program which has a real-time packet scheduling function of a mobile communication system, wherein the program comprises: calculating a packet loss probability on an input real-time traffic packet; allowing different weights according to the condition of whether the packet loss probability exceeds the maximum packet loss requirement probability, and determining the priority metric, the weights beingestablished to be higher as the calculated packet loss probability approaches the maximum packet loss; and performing a packet scheduling process according to the determined priority metric
  • FIG. 1 shows a packet scheduling system according to a preferred embodiment of the present invention
  • FIG. 2 shows a packet scheduling mechanism executed by a packet scheduler according to a preferred embodiment of the present invention.
  • FIG. 3 shows an operational flowchart of the packet scheduling algorithm according to a preferred embodiment of the present invention.
  • the PLR packet loss rate
  • the PLR on the real-time traffic service is caused by a delay which is greater than the maximum delay condition of W ' .
  • PER packet error rate
  • the packet loss rate is defined by the summation of the PER caused by channel impairment and the packet loss rate calculated from the packet which exceeds the required maximum delay condition. Therefore, the PLP (packet loss probability) for the user i is defined in Math Figure 4. [36] Math Figure 4
  • N 1 is a total number of the lost packets for the user i for each subchannel, lost and N is a total number of the packets serviced to the user i for each subchannel.
  • the algorithm according to the preferred embodiment of the present invention is determined by the relation between the PLP (t) and the maximum packet loss re- quirement probability of PLP max
  • the priority metric is decreased as the PLP (t) is increased in the case of PLP (t)>PLP 1
  • the priority metric is decreased as the PLP (t) is i max l decreased in the case of PLP (t) ⁇ PLP . Therefore, the opportunity for the user to be i max scheduled is increased since the priority metric is increased as the PLP (t) approaches the maximum packet loss requirement probability of PLP 1 max
  • FIG. 1 shows a detailed configuration of a packet scheduling system according to a preferred embodiment of the present invention.
  • the packet scheduling system 220 is provided in a base station 200 which provides information on the channel state (e.g., buffer states) to the packet scheduling system 220 through data communication with at least one user terminal 301 to 300n.
  • the packet scheduling system 220 determines the priority metric on the real-time traffic data to be transmitted to at least one user terminal 301 to 300n.
  • the preferred embodiment describes that the packet scheduling system 220 included in the base station 200 schedules the real-time traffic data from among the data received from an upper layer, but the present invention is not restricted to this, and the packet scheduling system 220 can be provided to various mobile communication systems to schedule the real-time traffic data.
  • the packet scheduling system 220 comprises a QoS manager 222, a per- subchannel packet loss calculator 224, and a packet scheduler 226.
  • the QoS manager 222 stores real-time traffic data from among IP (Internet packet) data received from the upper layer into an input buffer (not illustrated), and manages corresponding QoS information.
  • the per- subchannel packet loss calculator 224 calculates the per-subchannel packet loss probabilities of the packets stored in the QoS manager 222 for the respective users based on Math Figure 4.
  • the packet scheduler 226 determines the priority metrics defined by Math Figure 6 and performs packet scheduling by using the determined priority metrics, based on the packet loss probabilities calculated by the per-subchannel packet loss calculator 224 and the maximum packet loss requirement probability of PLP max
  • FIG. 2 shows a packet scheduling mechanism executed by the packet scheduler 226 according to a preferred embodiment of the present invention.
  • the packet scheduling algorithm initially provides a priority metric to the real-time speech service, and a subsequent priority metric to the real-time video service.
  • the priority metrics between the real-time speech services or between the realtime video services are based on the priority metrics defined by Math Figure 6.
  • FIG. 3 shows an operational flowchart when the packet scheduling algorithm according to the preferred embodiment of the present invention is applied to an OFDMA/FDD (orthogonal frequency division multiple access/frequency division duplex) system
  • OFDMA/FDD orthogonal frequency division multiple access/frequency division duplex
  • N is greater than the maximum value of the subchannels predefined N (given as 12 in FIG. 3) assuming that k real-time speech users and subchannels m real-time video users are provided and respective frequency axes are given as N which represent subcarrier axes
  • the scheduling task is terminated.
  • the value of subchannels N is established to be '0' in step S201, and it is determined whether the real-time subchannels speech buffers 110 and 120 are empty in step S202.
  • step S208 When the real-time speech buffers are found empty in the previous step S202, it is checked whether the real-time video buffers are empty in step S208. In this instance, the real-time speech buffers are checked in advance of the real-time video buffers since it is needed to transmit the real-time speech data with the priority compared to the realtime video data according to the characteristics of the data.
  • the scheduling process for the real-time video data repeats the process of from S208 to S213 in a like manner of the real-time speech data.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Disclosed is a scheduling system and method in a mobile communication system. In the algorithm applied to the scheduling system and method, a packet loss probability on an input real-time traffic packet is calculated, different weights are assigned depending on the condition whether the calculated packet loss probability exceeds the maximum packet loss requirement probability, and a priority metric is determined. In this instance, the weights are established to be higher as the calculated packet loss probability approaches the maximum packet loss. The packet scheduling process is performed according to the determined priority metric. The above-noted scheduling algorithm guarantees the maximum packet loss rate in the real-time traffic, and increases system capacity.

Description

Description PACKET SCHEDULING SYSTEM AND METHOD IN MOBILE COMMUNICATION SYSTEM Technical Field
[1] The present invention relates to a packet scheduling system and method. More specifically, the present invention relates to a packet scheduling system and method for servicing real-time speech traffic data and real-time video traffic data in wireless multimedia environments. Background Art
[2] The next generation wireless communication systems are expected to provide broadband multimedia services including real-time speech and video data with QoS (quality of service)to mobile station users.
[3] In order to efficiently utilize resources in the wireless communication environment, studies on packet scheduling algorithms for fairly distributing radio resources to a plurality of users have actively progressed. In particular, the next generation wireless communication system requires a packet scheduling algorithm for satisfying QoS for respective services and concurrently satisfying the system capacity.
[4] The M-LWDF (modified largest weighted delay first) method has been proposed as a scheduling method for guaranteeing delay of real-time traffic and processing performance in the wireless channel environment.
[5] The algorithm initially allocates a sub channel to a user who has the top priority based on the priority metric of μ (t).
[6] The algorithm is designed for a delay-sensitive service, and considers the maximum delay condition of W required for each user i. max
[7] The priority metrics of μ (t) corresponding to all the subchannels at the slot time t are given in Math Figure 1, and the service is initially performed for the user who has the top priority metric of μ (t).
[8] MathFigure 1
Figure imgf000002_0001
[9] where Wis a packet delay for the user i (i.e., a time during which the user i stands by in the queue i, and in detail, a packet delay of the head of line of the queue i),
is channel capacity (a channel rate) for the user i,
is a mean channel rate for the user i, it is defined that i =- log ^ δ i I W1 m ax , and δ Ϊ is the maximum probability value of W (t) which exceeds W1 i max
[10] The mean channel transmission rate of r,( ) is updated through Math Figure 2. [11] MathFigure 2 ;,(/+i)=(i -i/ re) ,( +(i/ re) r,(/)
[12] where T is a time constant of exponential filtering, such as T =1,000 slots (one second). [13] When W1 and max δ , are the same for all users who belong to the same service class, Math Figure 1 is redefined as Math Figure 3. [14] MathFigure 3
Figure imgf000003_0001
r. I
[15] Ebwever, the system capacity is restricted because of the mean outage probability of the packets which fail to satisfy the maximum packet loss rate in the case of the real-time traffic according to the conventional packet scheduling algorithm Therefore, algorithms for guaranteeing the maximum packet loss rate of the real-time traffic and increasing the number of users (the system capacity) are required.
[16] Disclosure of Invention Technical Problem
[17] It is an advantage of the present invention to provide a real-time packet scheduling method and device for satisfying QoS of respective services and system capacity.
[18] In one aspect of the present invention, a packet scheduling method in a mobile communication system comprises: (a) calculating a packet loss probability on an input real-time traffic packet; (b) differentiating a weight according to the state in which the calculated packet loss probability exceeds the maximum packet loss requirement probability, and determining a priority metric, the weight being established to be higher as the calculated packet loss probability approaches the maximum packet loss requirement probability; and (c) performing a packet scheduling process according to the priority metric determined in (b).
[19] In another aspect of the present invention, a packet scheduling system in a mobile communication system comprises: a QoS (quality of service) manager for storing realtime traffic data in an input buffer from among the data received from an upper layer, and managing QoS information corresponding to the stored traffic data; a per- subchannel packet loss calculator for calculating a per- subchannel packet loss probability of the stored real-time traffic data; and a packet scheduler for determining a priority metric based on the packet loss probability calculated by the per-subchannel packet loss calculator and the maximum packet loss requirement probability, and performing a packet scheduling process based on the priority metric
[20] In still another aspect of the present invention, provided is a recording medium for storing a program which has a real-time packet scheduling function of a mobile communication system, wherein the program comprises: calculating a packet loss probability on an input real-time traffic packet; allowing different weights according to the condition of whether the packet loss probability exceeds the maximum packet loss requirement probability, and determining the priority metric, the weights beingestablished to be higher as the calculated packet loss probability approaches the maximum packet loss; and performing a packet scheduling process according to the determined priority metric
[21] [22] [23] [24] Brief Description of the Drawings
[25] The accompanying drawings, which are incorporated in and constitute part of the specification, illustrate an embodiment of the invention, and together with the description, serve to explain the principles of the invention:
[26] FIG. 1 shows a packet scheduling system according to a preferred embodiment of the present invention;
[27] FIG. 2 shows a packet scheduling mechanism executed by a packet scheduler according to a preferred embodiment of the present invention; and
[28] FIG. 3 shows an operational flowchart of the packet scheduling algorithm according to a preferred embodiment of the present invention.
[29] Best Mode for Carrying Out the Invention
[30] In the following detailed description, only the preferred embodiment of the invention has been shown and described, simply by way of illustration of the best mode comtemplated by the inventor(s) of carrying out the invention. As will be realized, the invention is capable of modification in various obvious respects, all without departing from the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not restrictive. To clarify the present invention, parts which are not described in the specification are omitted, and parts for which similar descriptions are provided have the same reference numerals.
[31] A packet scheduling algorithm according to a preferred embodiment of the present invention will now be described.
[32] In the case of servicing real-time traffic data, loss occurs when faling to satisfying the maximum transmission delay, and hence, the QoS on the maximum packet loss rate required by the real-time service needs to be satisfied.
[33] (1) Per- subchannel packet loss probability
[34] The PLR (packet loss rate) is to be defined to satisfy the QoS condition on the realtime traffic The PLR on the real-time traffic service is caused by a delay which is greater than the maximum delay condition of W ' . When a transmission operation is max generated in a channel environment with a PER (packet error rate) of 1%, the packet error is increased by 1%, and when a retransmission operation is performed on the erroneous packet, the delay on the packet transmission is increased, and the packet loss is increased. Ebwever, since the retransmission operation can be omitted in the realtime traffic, performance is calculated without performing the retransmission operation in the preferred embodiment. [35] In this instance, the packet loss rate is defined by the summation of the PER caused by channel impairment and the packet loss rate calculated from the packet which exceeds the required maximum delay condition. Therefore, the PLP (packet loss probability) for the user i is defined in Math Figure 4. [36] MathFigure 4
N)Xt) PiPXi) N'hsl(f)+ N'servics(f)
[37] where N1 is a total number of the lost packets for the user i for each subchannel, lost and N is a total number of the packets serviced to the user i for each subchannel.
[38] The outage probability P for the i user is defined as Math Figure 5. out
[39] MathFigure 5 _
Figure imgf000006_0001
out -J. J- -*- max
[40] where Num (PLPi > PLPi ιax ) is the total number of users who have a packet loss rate which is greater than the maximum packet loss requirement probability of PLP , and N is the total number max max of the real-time traffic users. [41] (2) PLP-based packet scheduling algorithm
[42] The algorithm according to the preferred embodiment of the present invention is determined by the relation between the PLP (t) and the maximum packet loss re- quirement probability of PLP max
[43] The priority metric is defined in Math Figure 6.
[44] MathFigure 6 r ( =
Figure imgf000007_0001
[45] where is a positive number less than PLP1 . As known from Math Figure 6, the difference max of μ. C between the different users becomes greater according to the magnitude of PLP (t). Therefore, the opportunity for the user to be scheduled is increased as the PLP (t) approaches the maximum packet loss requirement probability of PLP max
[46] When the value of
'.(0 is defined to be constant, the priority metric is decreased as the PLP (t) is increased in the case of PLP (t)>PLP1 , and the priority metric is decreased as the PLP (t) is i max l decreased in the case of PLP (t)<PLP . Therefore, the opportunity for the user to be i max scheduled is increased since the priority metric is increased as the PLP (t) approaches the maximum packet loss requirement probability of PLP 1 max
[47] Also, when the delay value of W (t) is additionally reflected, the priority metric is provided to the user with a large delay time from an input buffer to reduce the delay time. Also, by reflecting the value of , the priority metric is provided to the good channel user to thus increase throughputs and improve the fairness between the users. [48] The packet scheduling algorithm guarantees the maximum packet loss rate of the real-time traffic and increases system capacity. [49] FIG. 1 shows a detailed configuration of a packet scheduling system according to a preferred embodiment of the present invention. [50] As shown, the packet scheduling system 220 is provided in a base station 200 which provides information on the channel state (e.g., buffer states) to the packet scheduling system 220 through data communication with at least one user terminal 301 to 300n. [51] The packet scheduling system 220 determines the priority metric on the real-time traffic data to be transmitted to at least one user terminal 301 to 300n. [52] The preferred embodiment describes that the packet scheduling system 220 included in the base station 200 schedules the real-time traffic data from among the data received from an upper layer, but the present invention is not restricted to this, and the packet scheduling system 220 can be provided to various mobile communication systems to schedule the real-time traffic data. [53] The packet scheduling system 220 comprises a QoS manager 222, a per- subchannel packet loss calculator 224, and a packet scheduler 226. [54] The QoS manager 222 stores real-time traffic data from among IP (Internet packet) data received from the upper layer into an input buffer (not illustrated), and manages corresponding QoS information. [55] The per- subchannel packet loss calculator 224 calculates the per-subchannel packet loss probabilities of the packets stored in the QoS manager 222 for the respective users based on Math Figure 4. [56] The packet scheduler 226 determines the priority metrics defined by Math Figure 6 and performs packet scheduling by using the determined priority metrics, based on the packet loss probabilities calculated by the per-subchannel packet loss calculator 224 and the maximum packet loss requirement probability of PLP max
[57] In detail, the packet scheduler assigns a priority metric to the user who has a good channel state the closer the packet loss probability of PLP (t)is to the maximum packet loss requirement probability of PLP1 , and the greater the delay time is at the input max buffer. [58] A scheduling mechanism according to the preferred embodiment of the present invention will now be described. [59] FIG. 2 shows a packet scheduling mechanism executed by the packet scheduler 226 according to a preferred embodiment of the present invention.
[60] In a transmission system including real-time speech buffers 110 and 120 and realtime video buffers 130 and 140, data of the k real-time speech users and data of m realtime video users are respectively stored in the real-time speech buffers 110 and 120 and the real-time video buffers 130 and 140.
[61] In this instance, the packet scheduling algorithm initially provides a priority metric to the real-time speech service, and a subsequent priority metric to the real-time video service. The priority metrics between the real-time speech services or between the realtime video services are based on the priority metrics defined by Math Figure 6.
[62] FIG. 3 shows an operational flowchart when the packet scheduling algorithm according to the preferred embodiment of the present invention is applied to an OFDMA/FDD (orthogonal frequency division multiple access/frequency division duplex) system
[63] Referring to FIG. 3, when N is greater than the maximum value of the subchannels predefined N (given as 12 in FIG. 3) assuming that k real-time speech users and subchannels m real-time video users are provided and respective frequency axes are given as N which represent subcarrier axes, the scheduling task is terminated. The value of subchannels N is established to be '0' in step S201, and it is determined whether the real-time subchannels speech buffers 110 and 120 are empty in step S202. [64] When the real-time speech buffers 110 and 120 are found empty, the scheduling process on the real-time speech data is terminated, and when they are not empty, the value of the priority metric of s for the corresponding user is calculated in step S203, and it is determined whether N is less than the initial value of 12 in step S204. subchannels
[65] When N is less than the value of 12, it is determined whether L (t) is greater subchannels than or equal to T (t) in step S205, where L (t) is the packets of the user "a" which are not processed but remain before the scheduling update time of "t", and T (t) is the size of transmission data caused by the transmission method determined according to the received SNR (signal to noise ratio) value which is channel information of the user "a". Therefore, the size of the data to be transmitted is variable for each slot and user where the user "a" is the user who has the top priority metric according to Math Figure 6. [66] When La(t) is greater than or equal to Ta(t) in the previous step S205, the scheduler performs a scheduling process to service the user "a" by the amount of T (t), increases the value of N by 1, defines the relation of L (t)=L (t)-T (t), and repeats the subchannels process until the value of N becomes greater than 12 in step S207. subchannels [67] When L (t) is less than T (t) in the previous step S205, the scheduler performs a scheduling process to service the user "a" by the amount of L (t), increases the value of N by 1 in step S206, and repeats the process of from the step of S204. subchannels
[68] While the data caused by the real-time user reside in the real-time speech buffers 110 and 120, the process of from S203 to S207 is repeated to perform the packet scheduling.
[69] When the real-time speech buffers are found empty in the previous step S202, it is checked whether the real-time video buffers are empty in step S208. In this instance, the real-time speech buffers are checked in advance of the real-time video buffers since it is needed to transmit the real-time speech data with the priority compared to the realtime video data according to the characteristics of the data.
[70] The scheduling process for the real-time video data repeats the process of from S208 to S213 in a like manner of the real-time speech data.
[71] As described, the system capacity is increased while guaranteeing the maximum packet loss rate of the real-time traffic
[72] While this invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover various modifications an equivalent arrangements included within the spirit and scope of the appended claims.
[73]
[74]

Claims

Claims
[1] A packet scheduling method in a mobile communication system, comprising: (a) calculating a packet loss probability on an input real-time traffic packet; (b) differentiating a weight according to the state in which the calculated packet loss probability exceeds the maximum packet loss requirement probability, and determining a priority metric, the weight being established to be higher as the calculated packet loss probability approaches the maximum packet loss requirement probability; and (c) performing a packet scheduling process according to the priority metric determined in (b).
[2] The packet scheduling method of claim 1, wherein the packet loss probability is calculated according to the subsequent equation:
Figure imgf000011_0001
where PLP (t)is the packet loss probability, N is a total number of the lost i lost packets for the user i for each subchannel, and N ' is a total number of the service packets serviced to the user i for each subchannel.
[3] The packet scheduling method of claim 1, wherein (b) comprises determining the priority metric by additionally using a packet delay of a user.
[4] The packet scheduling method of claim 1 or 3, wherein (b) comprises determining the priority metric by additionally using a channel transmission environment of a user.
[5] The packet scheduling method of claim 4, wherein the channel transmission environment is determined according to a ratio of the user's channel transmission rate to a mean channel transmission rate.
[6] The packet scheduling method of claim 4, wherein the priority metric is calculated by the subsequent equation:
Figure imgf000012_0001
where O is a positive number less than PLP , PLP (t) is a packet loss probability of the max l user "i", PLP1 is the maximum packet loss requirement probability of the user
is a mean packet transmission rate, r (t) is a packet transmission rate, and W (t) is a packet delay of the user "i".
[7] A packet scheduling system in a mobile communication system, comprising: a QoS (quality of service) manager for storing real-time traffic data in an input buffer from among data received from an upper layer, and managing QoS information corresponding to the stored traffic data; a per-subchannel packet loss calculator for calculating a per-subchannel packet loss probability of the stored real-time traffic data; and a packet scheduler for determining a priority metric based on the packet loss probability calculated by the per-subchannel packet loss calculator and a maximum packet loss requirement probability, and performing a packet scheduling process based on the priority metric
[8] The packet scheduling system of claim 7, wherein the packet scheduler allows different weights according to a condition of whether the packet loss probability exceeds the maximum packet loss requirement probability, and determines the priority metric, wherein the weights are established to be higher as the calculated packet loss probability approaches the maximum packet loss.
[9] The packet scheduling system of claim 7 or 8, wherein the packet scheduling system is applied to the OFDMA/FDD (orthogonal frequency division multiple access/frequency division duplex) system [10] A recording medium for storing a program which has a real-time packet scheduling function of a mobile communication system, wherein the program comprises: calculating a packet loss probability on an input real-time traffic packet; allowing different weights according to a condition of whether the packet loss probability exceeds a maximum packet loss requirement probability, and determining a priority metric, the weights beingestablished to be higher as the calculated packet loss probability approaches the maximum packet loss; and performing a packet scheduling process according to the determined priority metric
PCT/KR2004/002417 2003-10-24 2004-09-21 Packet scheduling system and method in mobile communication system WO2005040959A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2003-0074828 2003-10-24
KR10-2003-0074828A KR100505969B1 (en) 2003-10-24 2003-10-24 A packet scheduling system and a method of mobile telecommunication system

Publications (2)

Publication Number Publication Date
WO2005040959A2 true WO2005040959A2 (en) 2005-05-06
WO2005040959A3 WO2005040959A3 (en) 2005-07-21

Family

ID=34511086

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2004/002417 WO2005040959A2 (en) 2003-10-24 2004-09-21 Packet scheduling system and method in mobile communication system

Country Status (2)

Country Link
KR (1) KR100505969B1 (en)
WO (1) WO2005040959A2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008077282A1 (en) * 2006-12-27 2008-07-03 Intel Corporation Method and apparatus for determining a route metric
EP2943029A1 (en) * 2014-05-07 2015-11-11 Simmonds Precision Products, Inc. Deterministic scheduling algorithm for wireless communication
CN105828446A (en) * 2016-05-26 2016-08-03 武汉大学 DDL-EDF (Dynamic Dividing Loss-aware Earliest Deadline First) data packet scheduling method for wireless networks

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8811348B2 (en) 2003-02-24 2014-08-19 Qualcomm Incorporated Methods and apparatus for generating, communicating, and/or using information relating to self-noise
US7218948B2 (en) 2003-02-24 2007-05-15 Qualcomm Incorporated Method of transmitting pilot tones in a multi-sector cell, including null pilot tones, for generating channel quality indicators
US9544860B2 (en) 2003-02-24 2017-01-10 Qualcomm Incorporated Pilot signals for use in multi-sector cells
US9661519B2 (en) 2003-02-24 2017-05-23 Qualcomm Incorporated Efficient reporting of information in a wireless communication system
KR100523996B1 (en) * 2003-10-27 2005-10-26 한국전자통신연구원 Packet scheduling system and a packet scheduling method in a mobile communication system
RU2007117711A (en) 2004-10-14 2008-11-20 Квэлкомм Флэрион Текнолоджиз, Инк. (Us) METHODS AND DEVICE FOR DETERMINING, TRANSMITTING, AND USING INFORMATION THAT MAY BE USED FOR INTERFERENCE MANAGEMENT
US8503938B2 (en) 2004-10-14 2013-08-06 Qualcomm Incorporated Methods and apparatus for determining, communicating and using information including loading factors which can be used for interference control purposes
KR100739493B1 (en) * 2005-03-10 2007-07-13 주식회사 쿠오핀 Packet traffic management system and method for developing the quality of service for ip network
US9191840B2 (en) 2005-10-14 2015-11-17 Qualcomm Incorporated Methods and apparatus for determining, communicating and using information which can be used for interference control
US8989084B2 (en) 2005-10-14 2015-03-24 Qualcomm Incorporated Methods and apparatus for broadcasting loading information corresponding to neighboring base stations
US9148795B2 (en) 2005-12-22 2015-09-29 Qualcomm Incorporated Methods and apparatus for flexible reporting of control information
US9473265B2 (en) 2005-12-22 2016-10-18 Qualcomm Incorporated Methods and apparatus for communicating information utilizing a plurality of dictionaries
US9572179B2 (en) 2005-12-22 2017-02-14 Qualcomm Incorporated Methods and apparatus for communicating transmission backlog information
US9119220B2 (en) 2005-12-22 2015-08-25 Qualcomm Incorporated Methods and apparatus for communicating backlog related information
US9451491B2 (en) 2005-12-22 2016-09-20 Qualcomm Incorporated Methods and apparatus relating to generating and transmitting initial and additional control information report sets in a wireless system
US8514771B2 (en) 2005-12-22 2013-08-20 Qualcomm Incorporated Methods and apparatus for communicating and/or using transmission power information
US9125093B2 (en) 2005-12-22 2015-09-01 Qualcomm Incorporated Methods and apparatus related to custom control channel reporting formats
US9137072B2 (en) 2005-12-22 2015-09-15 Qualcomm Incorporated Methods and apparatus for communicating control information
US8437251B2 (en) 2005-12-22 2013-05-07 Qualcomm Incorporated Methods and apparatus for communicating transmission backlog information
US20070249360A1 (en) 2005-12-22 2007-10-25 Arnab Das Methods and aparatus related to determining, communicating, and/or using delay information in a wireless communications system
US9125092B2 (en) 2005-12-22 2015-09-01 Qualcomm Incorporated Methods and apparatus for reporting and/or using control information
US20070149132A1 (en) 2005-12-22 2007-06-28 Junyl Li Methods and apparatus related to selecting control channel reporting formats
US9338767B2 (en) 2005-12-22 2016-05-10 Qualcomm Incorporated Methods and apparatus of implementing and/or using a dedicated control channel
KR100728037B1 (en) * 2006-03-03 2007-06-14 삼성전자주식회사 Method and apparatus for controling parameter in wireless data streaming system
US20070243882A1 (en) 2006-04-12 2007-10-18 Qualcomm Incorporated Method and apparatus for locating a wireless local area network associated with a wireless wide area network
KR100935691B1 (en) * 2008-02-29 2010-01-08 울산대학교 산학협력단 Packet Scheduling method based On The Estimation Of Packet Loss Amount

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1083709A2 (en) * 1999-09-10 2001-03-14 Lucent Technologies Inc. Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network
US20020181436A1 (en) * 2001-04-02 2002-12-05 Jens Mueckenheim Method and system for UMTS packet transmission scheduling on uplink channels
EP1330080A2 (en) * 2002-01-17 2003-07-23 Nec Corporation Packet scheduling method and apparatus for downlink transmission to mobile terminals
US20030198207A1 (en) * 2001-12-11 2003-10-23 Samsung Electronics Co., Ltd. Method and apparatus for scheduling data packet transmission according to QoS in a mobile communication system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1083709A2 (en) * 1999-09-10 2001-03-14 Lucent Technologies Inc. Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network
US20020181436A1 (en) * 2001-04-02 2002-12-05 Jens Mueckenheim Method and system for UMTS packet transmission scheduling on uplink channels
US20030198207A1 (en) * 2001-12-11 2003-10-23 Samsung Electronics Co., Ltd. Method and apparatus for scheduling data packet transmission according to QoS in a mobile communication system
EP1330080A2 (en) * 2002-01-17 2003-07-23 Nec Corporation Packet scheduling method and apparatus for downlink transmission to mobile terminals

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008077282A1 (en) * 2006-12-27 2008-07-03 Intel Corporation Method and apparatus for determining a route metric
US8335166B2 (en) 2006-12-27 2012-12-18 Intel Corporation Method and apparatus for determining a route metric
EP2943029A1 (en) * 2014-05-07 2015-11-11 Simmonds Precision Products, Inc. Deterministic scheduling algorithm for wireless communication
US9621292B2 (en) 2014-05-07 2017-04-11 Simmonds Precision Products, Inc. Deterministic scheduling algorithm for wireless communication
CN105828446A (en) * 2016-05-26 2016-08-03 武汉大学 DDL-EDF (Dynamic Dividing Loss-aware Earliest Deadline First) data packet scheduling method for wireless networks

Also Published As

Publication number Publication date
WO2005040959A3 (en) 2005-07-21
KR20050039376A (en) 2005-04-29
KR100505969B1 (en) 2005-08-30

Similar Documents

Publication Publication Date Title
WO2005040959A2 (en) Packet scheduling system and method in mobile communication system
US6879561B1 (en) Method and system for wireless packet scheduling with per packet QoS support and link adaptation
US6542481B2 (en) Dynamic bandwidth allocation for multiple access communication using session queues
US7729308B2 (en) Optimal allocation of resources in a wireless communication system
KR100432976B1 (en) Communication system and communication channel allocation method
JP4624816B2 (en) Method and apparatus for dynamically allocating resources in a wireless network
CN111211830B (en) Satellite uplink bandwidth resource allocation method based on Markov prediction
KR100500878B1 (en) Method of packet scheduling with power
US20030123392A1 (en) Packet flow control method and device
EP1832015B1 (en) A method for scheduling resources of packet level for integrated level for integrated traffic, and an apparatus therefor
WO2006065021A1 (en) Packet scheduling method for real-time traffic transmission in mobile telecommunication system
KR20040003052A (en) Multiple threshold scheduler for scheduling transmission of data packets to mobile terminals based on a relative throughput spread
US8130713B2 (en) System and method for credit-based channel transmission scheduling (CBCTS)
Kwok et al. A quantitative comparison of multiple access control protocols for wireless ATM
US20110047271A1 (en) Method and system for allocating resources
JP2000069548A (en) Communication band assignment method
KR100523996B1 (en) Packet scheduling system and a packet scheduling method in a mobile communication system
KR100726332B1 (en) Apparatus and method of packet scheduling for providing wireless differentiated services in the wireless communication network
So Performance analysis of uplink scheduling algorithms for VoIP services in the IEEEE 802.16 e OFDMA system
JP4498941B2 (en) Radio scheduling apparatus, radio scheduling method, and radio apparatus
Chan et al. Two-tier scheduling algorithm for uplink transmissions in IEEE 802.16 broadband wireless access systems
Park et al. QoS guaranteed IPTV service over Wireless Broadband network
EP1885090A1 (en) Time horizon scheduling method for transmitting traffic data bursts with variable length in PMP telecommunications networks
KR20050063422A (en) A framing apparatus and a framing method in a mobile communication system
Chen et al. Wireless QoS architecture and resource management for CDMA packet access multimedia cellular radio

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase