Method and apparatus for priority management of system algorithms in real time

• US 20040071114A1
• Filed: 04/21/2003
• Published: 04/15/2004
• Est. Priority Date: 10/10/2002
• Status: Active Grant

• Current Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Original Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Inventors: Lu, Guang
• Granted Patent: US 6,771,624 B2
• Time in Patent Office: Days
• US Class Current: 370/332
• CPC Class Codes: H04W 28/18 Negotiating wireless communication parameters

Abstract

A method for management of real-time system algorithms to achieve optimal efficiency which provides for dynamically managing priorities in a complex real-time system, considering the dynamic requirements of the system. A preferred embodiment describes the management of a plurality of RRM algorithms, including algorithms for SCC escape, LM escape, SCC rate control, and F-DCA background. More specifically, one exemplary embodiment assists in deciding: when to increase algorithm priorities, how to increase/decrease algorithm priorities, how to assign priority parameters, and how to dynamically manage priorities in the system, to result in optimal system efficiency.

Claims

1. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) accumulating a number of times an algorithm has been consecutively selected; and

e) retaining a priority level assigned to the selected algorithm when the number accumulated in step (d) is less than a given number.

2. The method of claim 1 wherein step (e) further comprises:

changing the priority level when the number accumulated in step (d) is at least equal to said given number.

3. The method of claim 1 wherein step (d) further comprises:

performing said selected algorithm.

4. The method of claim 1 further comprising:

f) lowering a priority level of the selected algorithm when it has been consecutively selected said given number of times and its priority level has not been lowered below a lowest allowed priority.

5. The method of claim 4 wherein step (f) includes:

lowering the priority level by two (2) levels.

6. The method of claim 4 wherein step (f) further comprises:

preventing said algorithm from being performed.

7. The method of claim 4 further comprising:

executing the selected algorithm when its priority level priority has been lowered to a lowest allowable priority; and

preventing the algorithm from having its present priority level lowered.

8. The method of claim 5 further comprising searching for an algorithm with a lower priority level to ease or cure the existing condition.

9. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n , to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) decreasing the priority level of a selected algorithm when conditions indicate it is not favorable to perform the algorithm.

10. The method of claim 9 wherein step (c) further includes:

d) decreasing the priority level of the selected algorithm when it is at a condition which is one of reaching its lowest permitted priority level and has its priority decreased a given number of times.

11. The method of claim 9 wherein step (b) includes:

(e) preventing selection of the algorithm.

12. The method of claim 10 wherein step (c) further includes:

waiting for selection of an algorithm with a new priority level.

13. The method of claim 9 wherein step (b) further includes:

(c) determining if there is another algorithm to choose when neither condition in step (b) is achieved.

14. The method of claim 13 wherein step (c) further includes:

(d) repeating step (b).

15. The method of claim 13 further comprising:

returning to step (a) when there are no other algorithms to choose.

16. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) accumulating a number of times an algorithm has been consecutively selected; and

e) increasing the priority level of the selected algorithm when its priority level has achieved one of two conditions including a lowest allowable level and a maximum number of reductions of the priority level.

17. The method of claim 16 wherein step (e) includes increasing the priority level by two (2) levels.

18. The method of claim 17 further including executing the selected algorithm.

19. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) accumulating a number of times an algorithm has been consecutively selected at a given priority level; and

e) increasing the priority level of the selected algorithm when the selected algorithm has been selected a given number of times at its present priority level.

20. The method of claim 19 wherein step (e) includes increasing the priority level by two (2) levels.

21. The method of claim 20 further including:

executing the selected algorithm.

22. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) decreasing the priority level of the selected algorithm when it has been consecutively selected a given number of times;

e) setting a timer when the priority level of the selected algorithm has been decreased; and

f) increasing the priority level of the selected algorithm when the timer times out before the algorithm is selected.

23. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) increasing the priority level of the selected algorithm when it has been consecutively selected a given number of times;

e) setting a timer when the priority level of the selected has been decreased; and

f) decreasing the priority level of the selected algorithm when the timer times out before the algorithm is selected.

24. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) accumulating a number of times an algorithm has been consecutively selected and has failed to cure or ease a condition; and

e) reducing the priority level assigned to the selected algorithm when the number accumulated in step (d) is at least equal to said given number.

25. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm for use;

d) accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected;

e) forming a product of the count accumulated at step (d) with the priority level assigned to the selected algorithm; and

f) reducing the priority level assigned to the selected algorithm when the product formed at step (e) is at least equal to a given number.

26. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm for use;

d) accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected; and

e) increasing the priority level of the selected algorithm when the number accumulated in step (d) is at least equal to said given number.

27. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm for use;

d) accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected;

e) dividing the number accumulated at step (d) by a present priority level of the selected algorithm; and

f) increasing the priority level assigned to the selected algorithm when the number obtained in step (e) is at least equal to a given number.

28. A method for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) accumulating a number of times an algorithm has been consecutively selected and has failed to cure or ease a condition;

e) forming a product of the number accumulated at step with the priority level of the selected algorithm; and

f) increasing the priority of the selected algorithm when the product obtained in step (e) is at least equal to a given number.

29. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

a) means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

b) means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

c) means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

d) means for accumulating a number of times an algorithm has been consecutively selected; and

e) means for retaining a priority level assigned to the selected algorithm when the number accumulated in said accumulating means is less than a given number.

30. The apparatus of claim 29 wherein said means for retaining further comprises:

means for changing the priority level when the number accumulated in the accumulating means is at least equal to said given number.

31. The apparatus of claim 29 further comprising:

means for lowering a priority level of the selected algorithm when it has been consecutively selected said given number of times and its priority level has not been lowered below a lowest allowed priority.

32. The apparatus of claim 31 wherein said means for lowering includes:

means for lowering the priority level by two (2) levels.

33. The apparatus of claim 31 wherein said means for retaining further comprises:

preventing said algorithm from being performed.

34. The apparatus of claim 31 further comprising:

means for executing the selected algorithm when its priority level priority has been lowered to a lowest allowable priority; and

preventing the algorithm from having its present priority level lowered.

35. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for decreasing the priority level of a selected algorithm when conditions indicate it is not favorable to perform the algorithm.

36. The apparatus of claim 35 wherein said means for decreasing further includes:

means for decreasing the priority level of the selected algorithm when it is at a condition which is one of reaching its lowest permitted priority level and has its priority decreased a given number of times.

37. The apparatus of claim 35 wherein said means for assigning includes:

means for preventing selection of the algorithm.

38. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for accumulating a number of times an algorithm has been consecutively selected; and

means for increasing the priority level of the selected algorithm when its priority level has achieved one of two conditions including a lowest allowable level and a maximum number of reductions of the priority level.

39. The apparatus of claim 38 wherein said means for increasing includes means for increasing the priority level by two (2) levels.

40. The apparatus of claim 39 further including means for executing the selected algorithm.

41. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for accumulating a number of times an algorithm has been consecutively selected at a given priority level; and

means for increasing the priority level of the selected algorithm when the selected algorithm has been selected a given number of times at its present priority level.

42. The apparatus of claim 41 wherein said means for increasing includes means for increasing the priority level by two (2) levels.

43. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for decreasing the priority level of the selected algorithm when it has been consecutively selected a given number of times;

means for setting a timer when the priority level of the selected algorithm has been decreased; and

means for increasing the priority level of the selected algorithm when the timer times out before the algorithm is selected.

44. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for increasing the priority level of the selected algorithm when it has been consecutively selected a given number of times;

means for setting a timer when the priority level of the selected algorithm has been increased; and

means for decreasing the priority level of the selected algorithm when the timer times out before the algorithm is selected.

45. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for accumulating a number of times an algorithm has been consecutively selected and has failed to cure or ease a condition; and

means for reducing the priority level assigned to the selected algorithm when the number accumulated by said accumulating means is at least equal to said given number.

46. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm for use;

means for accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected;

means for forming a product of the count accumulated by said accumulating means with the priority level assigned to the selected algorithm; and

means for reducing the priority level assigned to the selected algorithm when the product formed by said product forming means is at least equal to a given number.

47. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm for use;

means for accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected; and

means for increasing the priority level of the selected algorithm when the number accumulated by said accumulating means is at least equal to said given number.

48. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm for use;

means for accumulating a number of times an algorithm whose priority level has been reduced has been consecutively selected;

means for dividing the number accumulated by said accumulating means by a present priority level of the selected algorithm; and

means for increasing the priority level assigned to the selected algorithm when the number obtained in step (e) is at least equal to a given number.

49. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising:

means for assigning a priority level, taken from priority levels P₁, P₂, P₃ . . . P_n, to each algorithm wherein priority level P_n is a highest priority level;

means for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level;

means for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected;

means for accumulating a number of times an algorithm has been consecutively selected and has failed to cure or ease a condition;

means for forming a product of the number accumulated at step with the priority level of the selected algorithm; and

means for increasing the priority of the selected algorithm when the product obtained by said means for forming is at least equal to a given number.