Deadline Based Resource Balancing Task Allocation for Clustered Heterogeneous LEO Small Satellite Network

Qin, Jing; Liu, Yonggang; Mao, Xiang; McNair, Janise

doi:10.1109/milcom.2013.308

Cited by 9 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Literature Reviewmentioning

confidence: 99%

“…The number of papers dealing with the multiple-EOSs observation problem has rapidly increased recently [25,[47][48][49][50][51][52]. Similar to the single-EOS case, several heuristic algorithms have been proposed: priority-based algorithms [25,51], rule-based algorithms [47], genetic algorithms [34], and tabu search algorithms [48]. Wu et al [50] designed an acyclic directed graph model for the multisatellite scheduling problem oriented to emergency jobs and common jobs and proposed a hybrid ant colony optimization algorithm mixed with an iteration local search.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Cho

Kim

Choi

et al. 2018

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

This Paper proposes a two-step binary linear programming formulation for task scheduling of a constellation of low-Earth-orbit satellites and demonstrates its applicability and scalability to obtain high-quality solutions using a standard mixed-integer linear programming solver. In this instance, the goal of satellite constellation task scheduling is to allocate each task for the satellites and to determine the task starting times in order to maximize the overall mission performance metric. The scheduling problem is formulated to find the solution by first finding a set of candidate communication time intervals for each satellite/ground-station pair as one of the key constraints and time tabling the observation task to acquire the user-requested data, with the incorporation of key constraints for satellite constellation operation. Numerical experiments are designed for investigating the trends, sensitivity, and characteristics of scheduling outputs based on multiple representative instances. The performance of the scheduling solutions by the proposed two-step binary linear programming method exhibits significant improvement of up to 35% in the number of assignments and the sum of profits over the general greedy algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Cho

Kim

Choi

et al. 2018

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

show abstract

“…In the algorithm, data location optimization was conducive to reducing the data transmission delay. Qing proposed a method to calculate the number of sub tasks and assignment priority index for allocating resources [11], which could balance resources and tasks. Grandl introduced the heuristic method and proposed the multi-type resources scheduling algorithm [12].…”

Section: Related Workmentioning

confidence: 99%

Improved YARN resource scheduling algorithm based on network load sensing

Ding¹,

Liu²,

Zhang³

et al. 2016

Proceedings of the 2016 International Conference on Advanced Electronic Science and Technology (AEST 2016)

View full text Add to dashboard Cite

Abstract.Confronted with multitask scheduling, YARN may conduct a precise calculation and allocation towards every single task's computing and memory resources,however it failed to consider the impact on task fulfillment and cluster resources utilization. In this paper, we propose a new algorithm to allocate the data interconnected tasks to the same node or to another closely-located low network load node. This new algorithm firstly builds a task flow graph for the task requests of an application, and then assigns tasks more properly using the greedy strategy, based on the state of network resource. In this way, it significantly improves the management performance of YARN in the case of network congestion or instability. Besides, it consumesless execution time, makes higher utilization of CPU and requires lower network load.

show abstract

Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model

Monmousseau

2021

J Optim Theory Appl

View full text Add to dashboard Cite

Deadline Based Resource Balancing Task Allocation for Clustered Heterogeneous LEO Small Satellite Network

Cited by 9 publications

References 10 publications

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation

Improved YARN resource scheduling algorithm based on network load sensing

Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model

Contact Info

Product

Resources

About