Scheduling Data Transfer with Priorities and Interruptions for Space Missions
Résumé
In the context of space missions, an efficient data transfer strategy is crucial to avoid onboard buffer overflow. In many missions, such as the ESA's Rosetta mission, the data produced by each instrument is temporarily stored in a dedicated buffer and then dumped to Earth during downlink windows under a limited bandwidth. Previous work has considered the overlapping Memory Dumping Problem (oMDP), which consists in assigning transfer priorities to the memory buffers and minimize the peaks memory usage. The oMDP is NP-hard and has been tackled using heuristic methods that demonstrated their efficiency on real instances. In this paper, we consider additional decisions in the memory dumping plans that are implementable in practice: data transfer from each buffer can be interrupted after a given time, once per downlink window, preventing it from dumping data until the next window. The new problem is called oMDPi (oMDP with interruptions). We obtain several structural properties and complexity results, showing in particular that oMDPi is NP-hard for at least two windows. While the complexity status of the single window oMDPi remains open, we propose a polynomial-time heuristic to solve it. We propose a hybrid heuristic to solve the general oMDPi, embedding a flow relaxation and the single window heuristic. The results on both real and realistic generated instances show that our heuristic achieves a significant reduction of memory peaks in a reasonable time compared to previous works, making the new policy attractive for future space missions.
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |