Resource deployment optimizer for non-geostationary and/or geostationary communications satellites

1. A communication system comprising:

a constellation of a plurality of non-geostationary and/or geostationary satellites, each of said satellites having assignable communication resources;

a ground system comprising one or more Earth stations for transmitting signals to, and receiving signals from, said constellation of satellites;

a plurality of satellite terminals for transmitting signals to, and receiving signals from, said constellation of satellites; and

a controller operable to dynamically assign satellite and ground system resources in response to demand for communications services required by the plurality of satellite terminals;

wherein the controller is further operable to:

pre-compile a link budget recipe and compute link budgets for all potential links; and

execute an optimization algorithm which uses said pre-compiled and computed link budgets to dynamically assign satellite and ground system resources in response to said demand for communications services required by the plurality of satellite terminals.

2. The system of claim 1 wherein said controller is selected from the group consisting of:

a centralized controller;

a distributed resource controller; and

a plurality of controllers.

3. The system of claim 1 wherein said controller is operable to pre-compile said link budget recipe and compute link budgets using vector-processing.

4. The system of claim 3 said vector-processing comprises a low-level parallelization scheme.

5. The system of claim 1 wherein the optimization algorithm assigns satellites by individual grid point or on a cell-by-cell basis, and assigns satellite communication beam resources by individual grid point or on a cell-by-cell basis.

6. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by performing a Venetian Blind algorithm wherein:

a demand grid comprising a continuous stream of time-steps is generated, the continuous stream of time-steps being divided into two streams of time-steps, the Venetian Blind algorithm alternatingly assigning blocks of said time steps into a first stream and a second stream;

each block of time-steps in said first stream of time-steps being optimized in isolation from other blocks of time-steps in said first stream; and

each block of time-steps in said second stream of time-steps being optimized in isolation from other blocks of time-steps in said second stream, using the optimized blocks of time-steps in said first stream of time-steps as boundary-condition constraints.

7. The system of claim 1 wherein said controller is operable to:

prior to optimization, characterize potential satellite to user uplinks and downlinks in terms of spectral efficiency and payload power utilization efficiency data, and

input said spectral efficiency and payload power utilization efficiency data to the optimization algorithm.

8. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by:

determining a relaxed solution on a point to point basis, using continuous variables; and

then solving an original mixed integer problem with a more narrowly defined objective and bounds.

9. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by:

balancing minimum satisfaction and average satisfaction as a weighted objective giving equal weights to maximize the minimum satisfaction and the average satisfaction across all grid points; and

performing an optimization calculation using a straight MIP (mixed integer programming) formulation.

10. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by:

balancing average satisfaction and aggregate capacity as a weighted objective giving equal weight to maximize the average satisfaction across all grid points and the aggregate delivered capacity; and

performing an optimization calculation using a straight MIP (mixed integer programming) formulation.

11. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by:

balancing average satisfaction and aggregate revenue as a weighted objective giving equal weight to maximize the average satisfaction across all grid points and the aggregate revenue; and

performing an optimization calculation using a straight MIP (mixed integer programming) formulation.

12. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources by:

characterizing the assignment of satellite resources as an optimization problem of integer variables;

determining a relaxed solution to the optimization problem by converting integer variables to continuous variables;

maximizing a minimum satisfaction, which is a ratio of given bandwidth to requested bandwidth; and

solving the optimization problem with a better-behaved objective, comprising a minimum bound and a reduced satisfaction solution space.

13. The system of claim 1 wherein said controller is operable to relax the demand to determine a feasible demand grid which can be met, prior to executing said optimization algorithm.

14. The system of claim 1 wherein said optimization algorithm includes the allocation of throughput on inter-satellite links (ISL).

15. The system of claim 1 wherein said controller is operable to dynamically allocate satellite resources including beam configurations, satellite beam pointing and beam hopping schedule, satellite transmit power, channel bandwidth, symbol rates, data rates, and data paths.

16. The system of claim 1 wherein said controller is operable to incorporate power flux density masks to protect other networks.

17. The system of claim 1 wherein said controller is operable to incorporate power flux density masks, performing power flux density mask calculations as independent tasks, allowing for parallel processing.

18. The system of claim 1 wherein said controller is operable to condition demand to a feasible state by responding to customers who demand satellite resources which go beyond the available capacity, by relaxing the demand to define a feasible demand grid that can be met, the feasible demand grid being used as an input to the optimization algorithm.

19. The system of claim 1 wherein said controller is operable to provide Full link routing and selection optimization, supporting both forward and return links to user terminals routed to a Point of Presence (PoP), by dynamically allocating satellite resources under the additional constraints of:

aggregate throughput supported by all active links from a given PoP to a given user satellite matching a total throughput delivered to all users assigned to that PoP from this satellite, in both forward downlink and return directions;

aggregate throughput of all active links over a given ISL being equal to or less than the ISL throughput capability; and

aggregate bandwidth required to support all active links through a landing station/satellite beam not exceeding the total bandwidth assigned through that beam, in both the forward and return direction.

20. The system of claim 1 wherein said controller is operable to provide Fading analysis and Mitigation as part of the optimization algorithm, by simulating constellation performance using a historical set of globally distributed rain rate data, and optimizing resource allocation using rain fade calculated on a basis of a global rain rate forecasts.

21. The system of claim 1 wherein said controller is operable to model beam bandwidth variables using integers to capture granularity of the allocatable resource.

22. The system of claim 1 wherein said controller is operable to manage beam squint by assigning frequencies to terminals based upon their actual location relative to a position of a beam center at a center frequency.

23. The system of claim 1 wherein said controller is operable to group terminals into fixed ground cells where cell members are jointly connected to a common satellite.

24. The system of claim 1 wherein said controller is operable to optimize resource allocations in a constellation whose satellites can support a constrained set of beam positions, by:

including an integer constraint of a number of beam positions or targets allowed at a given time; and

optionally setting branch priorities based on each beam target's capacity demand to speed up resolution of the mixed-integer problem, as higher-demand beam targets are more likely to have a high impact on node feasibility.

25. The system of claim 1 wherein said controller is operable to optimize for long-term link availability under fade by:

characterizing long-term availability of each instantaneous link; and

optimizing link allocations over a multi-time-step block to maximize time-averaged long-term availability of a chain of links to any given terminal, in tandem with clear-sky capacity optimization using weighted objectives and/or hierarchical objectives.

26. The system of claim 1 wherein said controller is operable to:

optimize resource allocations as a network flow problem where a flow value represents a number of links, approximating satellite constraints by flow-capacity constraints which have unitary coefficients and integer constants;

rather than performing a Mixed Integer Linear Programming optimization utilizing binary variables for the assignment of terminals to satellites.

27. The system of claim 26 wherein said satellite constraints comprise beam bandwidth, frequency reuse constraint, and available radiated RF power.

28. The system of claim 1 wherein said controller is operable to execute the optimization algorithm using a satellite-view beam layout whose pattern moves along deterministic curves following a same general direction as an apparent movement of a uniform distribution of fixed terminals as seen from a satellite.

29. The system of claim 1 wherein said controller is operable to define groups of beams to incorporate frequency re-use constraints, controlling frequency re-use by limiting aggregate effective bandwidth allocated in any cluster of beams, defined as a group of beams all fully coupled among each other based on a threshold spacing in a satellite field of view.

30. A method of operation for a satellite system comprising:

providing:

a constellation of a plurality of non-geostationary and/or geostationary satellites, each of said satellites having assignable communication resources;

a ground system comprising one or more Earth stations for transmitting signals to, and receiving signals from, said constellation of satellites; and

a plurality of satellite terminals for transmitting signals to, and receiving signals from, said constellation of satellites; and

dynamically assigning satellite and ground system resources in response to demand for communications services required by the plurality of satellite terminals by:

pre-compiling a link budget recipe and computing link budgets for all potential links; and

executing an optimization algorithm which uses said pre-compiled and computed link budgets to dynamically assign satellite and ground system resources in response to said demand for communications services required by the plurality of satellite terminals.

31. The method of claim 30 wherein said pre-compiling and executing an optimization algorithm are performed in a manner selected from the group consisting of:

in a centralized manner;

in a distributed manner; and

in a plurality of separate controllers.

32. The method of claim 30 wherein said pre-compiling said link budget recipe and computing link budgets comprises pre-compiling a link budget recipe and compute link budgets for all potential links using vector-processing.

33. The method of claim 32 wherein said vector-processing comprises executing a low-level parallelization scheme.