Minimization of Losses and Rate Matching in Satellite Networks With One to Many Pairings

This letter studies one-to-many capacity allocation pairings in multi-beam high throughput satellite networks employing smart gateway diversity. The minimization of total network's capacity losses and rate matching metrics are examined. To approach the aforementioned binary optimization problems, a two-step heuristic scheme is proposed. Firstly a continuous pairing solution is given based on difference of convex programming theory and then a continuous to binary feasible allocation solution is provided. Extended simulation results highlight the lower complexity of the proposed approach, compared with the exponential complexity of the optimal exhaustive mechanism and a small relative error in its performance.