System for allocating resources in a communication system
AssigneeQUALCOMM Incorporated
InventorsRajesh Pankaj, Nagabhushana T. Sindhushayana
Life of this patent
Estimating the term…
Abstract
A communication network having a plurality of subscriber units that receive a finite resource from a common node is disclosed. Individual subscriber units may seize the finite resource of the common node to the exclusion of all other subscriber units in the network. A scheduler allocates the finite resource to the individual subscriber units based upon a weight associated with the individual subscriber units. The scheduler determines the weight for each of the subscriber units based upon an instantaneous rate of consuming the finite resource.
Claims20
A resource scheduler in a communication system, the communication system including a common node and a plurality of customer nodes associated with the common node, the common node having at any particular service interval a finite resource seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes, each of the customer nodes having an instantaneous rate of consuming the finite resource, the resource scheduler comprising:
- logic for maintaining a weight associated with each of the customer nodes;
- logic for selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with the selected remaining customer nodes and the respective weights associated with the other remaining customer nodes, the subsequent service interval following a present service interval in which the finite resources are seized by one or more engaging customer nodes;
- and
- logic for changing the weight of the selected customer node based upon the instantaneous rate at which the selected customer node consumes the finite resource.
A method of allocating a finite resource in a communication system, the communication system including a common node and a plurality of customer nodes associated with the common node, the common node having at any particular service interval a finite resource seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes, each of the customer nodes having an instantaneous rate of consuming the finite resource, the method comprising:
- maintaining a weight associated with each of the customer nodes;
- selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with the selected remaining customer nodes and the respective weights associated with the other remaining customer nodes, the subsequent service interval following a present service interval in which the finite resources are seized by one or more engaging customer nodes;
- and
- changing the weight of the selected customer node based upon the instantaneous rate at which the selected customer node consumes the finite resource.
Dependencies are inferred from the claim text.