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

• US 6,771,624 B2
• Filed: 04/21/2003
• Issued: 08/03/2004
• Est. Priority Date: 10/10/2002
• Status: Expired due to Fees

• Current Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Original Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Inventors: Lu, Guang
• Primary Examiner(s): Vu, Huy D.
• Assistant Examiner(s): Ryman, Daniel J.
• Application Number:
  US10/419,471
• Publication Number:
  US 20040071114A1
• Time in Patent Office: 470 Days
• Field of Search: 370/328, 370/329, 370/332, 370/338, 370/464, 370/465, 370/466
• 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) increasing the priority level of the selected algorithm when its priority level has achieved one of a lowest allowable level and a maximum number of reductions of the priority level.

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

3. The method of claim 2 further including executing the selected algorithm.

4. 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 algorithm has been increased; and

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

5. 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.

6. 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.

7. 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 a lowest allowable level and a maximum number of reductions of the priority level.

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

9. The apparatus of claim 8 further including means for executing the selected algorithm.

10. 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.

11. 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 by said means for dividing is at least equal to a given number.

12. 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.