Method and system for multiple carrier resource allocation in LTE-advanced networks
AssigneeLeidos, Inc.
InventorRebecca K. Harrington
Life of this patent
Estimating the term…
Loading patent…
AssigneeLeidos, Inc.
InventorRebecca K. Harrington
Estimating the term…
A process for selecting an optimal individual user solution including an optimal rate allocation and associated price for a predetermined bandwidth of cellular network resources includes application of an iterative process and selection from multiple proposed user solutions. The inputs to the iterative process include at least an initial user bid, an initial network rate allocation, a generated user utility function and the cost data. The user utility function includes multiple application user functions. Optimal solution selection includes comparing each multiple proposed user rate allocation with the initial network rate allocation for the user and selecting the closest multiple proposed user rate allocation to the initial network rate allocation. The process may be applied to aggregated cellular carrier scenarios.
A method for scheduling user rate allocation of a network where a network bandwidth of at least two cellular carriers is available for scheduling the user rate allocation comprising:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]:…
Services specially adapted for wireless communication networks
Rating or billing plans; Tariff determination aspects: least cost routing
Least cost routing: bidding
About 7 years 6 months of term left · ends 18 Apr 2034 (estimated)
Field of the Embodiments
The embodiments are directed to cellular carrier resource scheduling and pricing and its relation to carrier aggregation. More particularly, a novel algorithm is applied to account for varying user utility functions and revised cellular standards reflecting carrier aggregation capabilities.
Description of Related Art
The preferred embodiments of the present invention are illustrated by way of example and not limited to the following figures:
FIG. 1 illustrates examplary utility functions applicable for categorizing smart phone functions and applications;
FIG. 2 illustrates the solution space including the Pareto inefficient solutions, Pareto optimal solutions, and infeasible solutions for determining optimal solution for rate allocation;
The Frank Kelly algorithm has been used to determine the optimal rate allocation as well as the network shadow price. As defined previously, the network shadow price is determined by the demand for network resources.
In the case of cellular networks, it may make sense in implementation to keep a reserve amount of resources to deal with network overhead associated with coordinating other users, handover, or other overhead costs. For the examples provided herein, it is assumed that the total number of resources used in the allocation are below the prescribed reserve required to complete handover, start new connections, and any additional network overhead.
The Frank Kelly algorithm is an iterative solution for achieving Pareto optimal resource allocation across the network keeping in mind proportional fairness. This means the Frank Kelly algorithm seeks to distribute all network resources keeping in mind not to disable any users.