首页> 外文期刊>Computer networks >Dynamic VNF placement, resource allocation and traffic routing in 5G
【24h】

Dynamic VNF placement, resource allocation and traffic routing in 5G

机译:动态VNF放置,资源分配和流量路由5G

获取原文
获取原文并翻译 | 示例

摘要

5G networks are going to support a variety of vertical services, with a diverse set of key performance indicators (KPIs), by using enabling technologies such as software-defined networking and network function virtualization. It is the responsibility of the network operator to efficiently allocate the available resources to the service requests in such a way to honor KPI requirements, while accounting for the limited quantity of available resources and their cost. A critical challenge is that requests may be highly varying over time, requiring a solution that accounts for their dynamic generation and termination. With this motivation, we seek to make joint decisions for request admission, resource activation, VNF placement, resource allocation, and traffic routing. We do so by considering real-world aspects such as the setup times of virtual machines, with the goal of maximizing the mobile network operator profit. To this end, first, we formulate a one-shot optimization problem which can attain the optimum solution for small size problems given the complete knowledge of arrival and departure times of requests over the entire system lifespan. We then propose an efficient and practical heuristic solution that only requires this knowledge for the next time period and works for realistically-sized scenarios. Finally, we evaluate the performance of these solutions using real-world services and large-scale network topologies. Results demonstrate that our heuristic solution performs better than a state-of-the-art online approach and close to the optimum.
机译:5G网络要支持各种各样的垂直服务,以多样化的关键绩效指标(KPI),通过使能技术,如软件定义网络和网络功能虚拟化。这是网络运营商有效地分配可用资源的服务请求以这样的方式来纪念KPI要求的责任,而占可利用资源有限数量及其成本。一个关键挑战是,请求可以是高度随时间变化的,需要一个解决方案,占其动态生成和终止。有了这个动机,我们力求做出请求核准,资源激活,VNF布局,资源分配和流量路由共同决定。我们考虑现实世界方面,例如虚拟机的设置时间这样做,与移动网络运营商利润最大化的目标。为此,首先,我们制定一个一次性的优化问题,可以达到给定的请求的到达和出发时间的完整的知识在整个系统生命周期体积小问题的最佳解决方案。然后,我们提出了一个高效实用的启发式,只需要这方面的知识为切实大小的情况下下一时间段和作品。最后,我们评估使用真实世界的服务和大型的网络拓扑结构,这些解决方案的性能。结果表明,比一个国家的最先进的在线方式与我们的启发式的解决方案更好地执行和接近最佳。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号