A Tabu Search Algorithm for Ground Station Scheduling Problem

Xhafa, Fatos; Herrero, Xavier; Barolli, Admir; Takizawa, Makoto

doi:10.1109/aina.2014.151

Cited by 13 publications

(16 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A shared satellite ground station is proposed by using user-oriented virtualization to address complex satellite telemetry, tracking and command (TT&C) in [42]. References [17] and [16] propose neighbor-area and tabu search algorithms to solve task scheduling of satellite ground stations, respectively.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks

Gao

Liu

Kaushik

2021

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

As per the increase in satellite number and variety, satellite ground station should be required to offer user services in a flexible and efficient manner. Network function virtualization (NFV) can provide a new paradigm to allocate network resources on demand for user services over the underlying network. In this paper, we investigate the virtualized network function (VNF) placement and routing traffic problem in satellite ground station networks. We formulate the problem of resource allocation as an integer linear programming (ILP) model and the objective is to minimize the link resource utilization and the number of servers used. Considering the information about satellite orbit fixation and mission planning, we propose location-aware resource allocation (LARA) algorithms based on Greedy and IBM CPLEX 12.10, respectively. The proposed LARA algorithm can assist in deploying VNFs and routing traffic flows by predicting the running conditions of user services. We evaluate the performance of our proposed LARA algorithm in three networks of Fat-Tree, BCube and VL2. Simulation results show that our proposed LARA algorithm performs better than that without prediction, and can effectively decrease the average resource utilization of satellite ground station networks.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…[7], [13], [14], [15]. There are a few related work about studying the problem of resource allocation in SGS networks [16], [17], [18], [19].…”

Section: Introductionmentioning

confidence: 99%

Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks

Gao

Liu

Kaushik

2021

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…The high complexity of the problem (such as the large number of both variables and requirements of the final solution) [3], and the high number and often variability of the constraints [4] [5] mean that most traditional mathematical approaches, such as those mentioned in [3], become intractable and require infeasible amounts of computational time.…”

Section: Problem Complexitymentioning

confidence: 99%

“…The ground station scheduling problem, more so than most other scheduling problems, is highly difficult computationally [3]. This is because the problem has many more constraints than is typical for a scheduling problem, and that the exact nature of these constraints varies strongly between problem instances [4] [5].…”

Section: Chapter 1 -Introduction 11 Introductionmentioning

confidence: 99%

Ground station scheduling optimization for a model of a real-world problem instance

Wildish¹

2021

Preprint

View full text Add to dashboard Cite

Effective scheduling of communication windows between orbiting spacecraft and ground stations is a crucial component of efficiently using spacecraft resources. In all but the most trivial cases, this forces the operator to choose a subset of the potentially available access windows such that they can achieve the best possible usage of their hardware and other resources. This is a complex problem not normally solvable analytically, and as a result the standard approach is to apply heuristic algorithms which take an initial guess at a solution and improve upon it in order to increase its quality. Various such algorithms exist, with some being in common practice for this particular problem. This thesis covers the application of several of the most commonly-used algorithms on a problem instance. Additionally, a real-world problem instance is used, and the resultant practical constraints are addressed when applying the heuristics and fine-tuning them for this application.

show abstract

“…But the ground station scheduling problem always don't have only one objective in practice, some researchers also carried out a lot of researches on the multi-objective ground station scheduling problem. In the references [5][6][7], xhafa defined four main objectives as follows that would compose the fitness function: access window fitness, communication clashes fitness, communication time requirement fitness and ground station usage fitness. Besides, the four fitness value calculating formulas are given.…”

Section: Introductionmentioning

confidence: 99%

Research on Task Planning Problem of Satellite-Ground Time Synchronization

Zhang¹,

Sun²,

Yan³

2016

Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016)

View full text Add to dashboard Cite

Abstract. The task planning of satellite-ground time synchronization (SGTSTP) is a complex multi-objective ground station scheduling problem. In this paper, we establish the problem formulation and analyze the optimization objectives. Based on the complexity analysis, we design a solving framework based on decomposition, which divides the plan horizon into many un-interactional plan periods and execute task planning in each period. In algorithm selection, the MOGA and NSGA2 are selected. At last, two different scale scenarios are designed and the computational result shows that more periods can get better result but spend more time, besides, the MOGA has better performance in efficiency and effect than NSGA2, however NSGA2 can get more solutions in solving SGTSTP.

show abstract

A Tabu Search Algorithm for Ground Station Scheduling Problem

Cited by 13 publications

References 12 publications

Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks

Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks

Ground station scheduling optimization for a model of a real-world problem instance

Research on Task Planning Problem of Satellite-Ground Time Synchronization

Contact Info

Product

Resources

About