Capacity Allocation Mechanisms in High-Throughput Satellite Systems: One-to-Many Pairings
In this article, one-to-many suboptimal assignments, for various capacity allocation metrics, in high-throughput multibeam satellite systems, under the smart gateway diversity concept, are studied. Furthermore, in the analysis both the offered and requested capacities in the satellite network and th...
Gespeichert in:
Veröffentlicht in: | IEEE systems journal 2022-09, Vol.16 (3), p.4005-4012 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this article, one-to-many suboptimal assignments, for various capacity allocation metrics, in high-throughput multibeam satellite systems, under the smart gateway diversity concept, are studied. Furthermore, in the analysis both the offered and requested capacities in the satellite network and the dynamic variations of the atmospheric satellite channels are considered. The objectives, from the literature, of maximization of both minimum and total system's satisfaction ratios are investigated. Moreover, the dissatisfaction ratio, defined as the multiplicative inverse of satisfaction ratio, is examined as a new proposed metric under the objectives of minimization of both maximum and total system's dissatisfaction ratios. In order to approach the optimal values of aforementioned binary optimization problems a two-step heuristic approach is described where first a continuous pairing solution is given based on fractional programming theory for the satisfaction problems and the difference of convex programming theory for the dissatisfaction problems. Then, a continuous to discrete feasible matching solution is provided for all cases. The proposed two-step schemes have very low complexity based on simulations and the latter show small relative error compared with the optimal performance of the exhaustive algorithms that have exponential time complexity. |
---|---|
ISSN: | 1932-8184 1937-9234 |
DOI: | 10.1109/JSYST.2021.3128211 |