...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >Network Function Virtualization Resource Allocation Based on Joint Benders Decomposition and ADMM
【24h】

Network Function Virtualization Resource Allocation Based on Joint Benders Decomposition and ADMM

机译:基于联合Benders分解和ADMM的网络功能虚拟化资源分配

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

摘要

Network function virtualization (NFV) has emerged as a new technology to reduce the cost of hardware deployment. It is an architecture that using virtualized functions run on the virtual machine to achieve services instead of using specific hardware. Although NFV brings more opportunities to enhance the flexibility and efficiency of the network, resource allocation problems should be well taken into consideration. In this paper, we investigate the virtual network function (VNF) resource allocation problem to minimize the network operation cost for different services. Both setting the VNF instances for each virtual machine and allocating the traffic volume in the network are considered. The problem is formulated as a mixed integer programming problem. Although it can be solved in a centralized fashion which requires a central controller to collect information from all virtual machines, it is not practical for large-scale networks. Thus, we propose a distributed iteration algorithm to achieve the optimal solution. The proposed algorithm framework is developed based on the joint Benders decomposition and alternating direction method of multipliers (ADMM), which allows us to deal with integer variables and decompose the original problem into multiple subproblems for each virtual machine. Furthermore, we describe the detail implementation of our algorithm to run on a computer cluster using the Hadoop MapReduce software framework. Finally, the simulation results indicate the effectiveness of the algorithm.
机译:网络功能虚拟化(NFV)已作为一种降低硬件部署成本的新技术出现。它是一种架构,它使用虚拟机上运行的虚拟化功能来实现服务,而不是使用特定的硬件。尽管NFV带来了更多的机会来增强网络的灵活性和效率,但是应该充分考虑资源分配问题。在本文中,我们研究了虚拟网络功能(VNF)资源分配问题,以最大程度地减少不同服务的网络运营成本。既要为每个虚拟机设置VNF实例,又要分配网络中的流量。该问题被表述为混合整数规划问题。尽管可以通过集中方式解决该问题,这需要中央控制器从所有虚拟机收集信息,但是对于大规模网络而言,这是不切实际的。因此,我们提出了一种分布式迭代算法来实现最优解。该算法框架是基于联合Benders分解和乘数交替方向联合方法(ADMM)开发的,该算法框架允许我们处理整数变量并将原始问题分解为每个虚拟机的多个子问题。此外,我们描述了使用Hadoop MapReduce软件框架在计算机集群上运行的算法的详细实现。最后,仿真结果表明了该算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号