论文标题
基于地面车站网络中卫星任务计划的服务链接位置
Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks
论文作者
论文摘要
随着卫星数量和多样性的增加，应需要卫星地面站以灵活有效的方式提供用户服务。网络功能虚拟化（NFV）可以提供一个新的范式，以通过基础网络为用户服务分配网络资源。但是，大多数现有工作都集中在企业数据中心网络的虚拟网络功能（VNF）放置和路由流量问题上，问题需要在卫星通信方案中进一步研究。在本文中，我们研究了卫星地面站网络中的VNF放置和路由交通问题。我们将资源分配的问题提出为整数非线性编程（INLP）模型，目的是最大程度地减少链接资源利用率和所使用的服务器数量。考虑有关卫星轨道固定和任务计划的信息，我们分别提出基于贪婪和IBM CPLEX 12.10的位置感知资源分配（LARA）算法。提出的LARA算法可以通过预测用户服务的运行条件来帮助部署VNF和路由流量流。我们评估了我们提出的LARA算法在三个Fat-Tree，Bcube和VL2网络中的性能。仿真结果表明，我们提出的LARA算法的性能要比没有预测的好，并且可以有效地降低卫星地面站网络的平均资源利用率。
As the increase in satellite number and variety, satellite ground stations 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. However, most of the existing work focuses on the virtual network function (VNF) placement and routing traffic problem for enterprise data center networks, the issue needs to further study in satellite communication scenarios. In this paper, we investigate the VNF placement and routing traffic problem in satellite ground station networks. We formulate the problem of resource allocation as an integer nonlinear programming (INLP) 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.
