Method to determine a scheduling priority value for a user data connection based on a quality of service requirement

• US 20070070894A1
• Filed: 09/26/2005
• Published: 03/29/2007
• Est. Priority Date: 09/26/2005
• Status: Abandoned Application

• Current Assignee: Motorola Mobility, Inc. (Lenovo Group Ltd.)
• Original Assignee: Motorola Mobility, Inc. (Lenovo Group Ltd.)
• Inventors: Xiao, Weimin, Ghosh, Amitava, Ratasuk, Rapeepat, Wang, Fan, Whinnett, Nick
• Application Number:
  US11/235,625
• Publication Number:
  US 20070070894A1
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04W 72/1221 based on age of data to be sent
• CPC Class Codes: H04W 72/543 based on requested quality, e.g. QoS
• CPC Class Codes: H04W 72/569 of the traffic information

Abstract

A method to provide a nominal best effort data rate based on a Quality of Service (QoS) requirement of a user data connection, the method comprising assigning (105) a service priority based on the QoS requirement, and assigning (110) the nominal best effort data rate for the service priority using a predetermined function. Further, it comprises of a method to determine a scheduling priority value for a user data connection by providing a relative fairness. Furthermore, the method comprises a method to satisfy a delay requirement for a delay sensitive data connection through a scheduling.

Claims

1. A method to provide a nominal best effort data rate based on a Quality of Service (QoS) requirement of a user data connection, the method comprising:

assigning a service priority based on the QoS requirement; and

assigning the nominal best effort data rate for the service priority using a predetermined function.

2. The method of claim 1, wherein the predetermined function comprises a monotonically increasing function, where a higher service priority corresponds to a higher nominal best effort data rate.

3. The method of claim 2, wherein the nominal best effort data rate has a minimum value corresponding to a minimum service priority, the minimum value based on a plurality of criteria.

4. The method of claim 3, wherein the plurality of criteria comprises a type of service, the type of service further comprising one of an audio service, video service and data service.

5. A method to determine a scheduling priority value for a user data connection, the method comprising:

determining an instantaneous data rate achievable for the user data connection based on a channel quality;

determining a normalized average throughput for the user data connection, the normalized average throughput being a first ratio of an average throughput of the user data connection, with respect to a nominal best effort data rate assigned to the user data connection;

calculating the scheduling priority value being a second ratio of the instantaneous data rate controlled by a first mathematical index, with the normalized average throughput controlled by a second mathematical index, the first mathematical index and the second mathematical index being used to control a scheduling fairness.

6. The method of claim 5, wherein the calculating step further comprises:

determining a weight for nominal best effort data rate for the user data connection using a first mathematical function, the first mathematical function accepting a first pair of inputs comprising a best effort factor which controls the percentage of user data connections that fail to reach a nominal best effort data rate and the normalized average throughput; and

applying the weight for nominal best effort data rate to the relative fairness factor to the scheduling priority value.

7. The method of claim 6, wherein the first mathematical function comprises an exponentiation function.

8. The method of claim 5 further comprising:

computing a weight for a delay sensitive user data connection in accordance with a discard timer setting; and

applying the weight for the delay sensitive user data connection to the priority value.

9. The method of claim 8, wherein the computing step further comprises:

determining a normalized delay being a third ratio of a packet delay with the discard timer setting, the packet delay being an age in time units of a packet in a priority queue;

determining a delay factor using a second mathematical function based on a previous delay factor calculated for a previously transmitted packet of the delay sensitive user data connection; and

calculating the weight for the delay restriction for the user delay sensitive data connection using a third mathematical function, the third mathematical function accepting a second pair of inputs comprising the normalized delay and the delay factor;

10. The method of claim 9, wherein the second mathematical function comprises maximum and minimum functions.

11. The method of claim 9, wherein the third mathematical function comprises an exponentiation function.

12. The method of claim 5 further comprising allocating a plurality of resources based on the priority value.

13. A method to satisfy a delay requirement for a delay sensitive data connection through a scheduling, the method comprising:

setting a discard timer for the delay sensitive data connection;

determining an age of a packet corresponding to the delay sensitive service in a priority queue;

performing a comparison between the age of a most recently successfully transmitted or time expired data packet with the discard timer setting, to determine whether the age of the compared packet is less than the discard timer setting by a predetermined margin; and

calculating a new delay factor for the delay sensitive data connection based on the comparison and an old delay factor of the delay sensitive data connection.

14. The method of claim 13, wherein the calculating step further comprises:

setting the new delay factor to a value obtained by increasing the old delay factor by a first predetermined factor, if the age of the most recently successfully transmitted or time expired data packet is not less than the discard timer setting by the predetermined margin, the value being limited to a ceiling value.

15. The method of claim 13 further comprising dropping the oldest packet if the age of the oldest packet is not less than the discard timer by a predetermined margin.

16. The method of claim 13, wherein the calculating step further comprises:

setting the new delay factor to value obtained by reducing the old delay factor by a second predetermined factor, if the age of the most recently successfully transmitted data packet is less than the discard timer setting by the predetermined margin, the value being limited to a floor value.

17. The method of claim 13 further comprising assigning a predetermined initial value for a delay factor when a delay sensitive data connection is initialized.

18. The method of claim 13 further comprising computing a weight for a delay sensitive data connection based on the delay factor.

19. The method of claim 18 further comprising applying the weight for the delay sensitive data connection to a scheduling priority value calculated for the a packet in a priority queue during the scheduling, to obtain a resultant scheduling priority value.

20. The method of claim 19 further comprising allocating a plurality of resources to the delay sensitive data connections during the scheduling based on the resultant scheduling priority values.