Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA Satellite Networks

Abstract : This chapter presents an algorithm for resource allocation in satellite networks. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a different amount of bandwidth. The proposed algorithm relies on two main techniques. The first generates admissible configurations for the interference constraints, whereas the second uses linear and integer programming with column generation. The obtained solution estimates a possible allocation plan with optimality guarantees, and highlights the frequency interferences which degrade the construction of good solutions.
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000005
Contributor : Sara Alouf <>
Submitted on : Wednesday, July 10, 2019 - 7:13:27 PM
Last modification on : Thursday, July 11, 2019 - 8:59:39 AM

File

allocation-author-version.pdf
Files produced by the author(s)

Identifiers

Collections

Relations

Citation

Sara Alouf, Eitan Altman, Jérôme Galtier, Jean-François Lalande, Corinne Touati. Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA Satellite Networks. Maggie Xiaoyan Cheng and Yingshu Li and Ding-Zhu Du. Combinatorial Optimization in Communication Networks, 18 (18), Kluwer Academic Publishers, pp.325-365, 2006, Combinatorial Optimization, 0-387-29025-7. ⟨10.1007/0-387-29026-5_13⟩. ⟨inria-00000005⟩

Share

Metrics

Record views

326

Files downloads

183