...
首页> 外文期刊>International journal of communication systems >Cost minimization in placing service chains for virtualized network functions
【24h】

Cost minimization in placing service chains for virtualized network functions

机译:为虚拟化网络功能放置服务链时的成本最小化

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

摘要

Network function virtualization (NFV) places network functions onto the virtual machines (VMs) of physical machines (PMs) located in data centers. In practice, a data flow may pass through multiple network functions, which collectively form a service chain across multiple VMs residing on the same or different PMs. Given a set of service chains, network operators have two options for placing them: (a) minimizing the number of VMs and PMs so as to reduce the server rental cost or (b) placing VMs running network functions belonging to the same service chain on the same or nearby PMs so as to reduce the network delay. In determining the optimal service chain placement, operators face the problem of minimizing the server cost while still satisfying the end-to-end delay constraint. The present study proposes an optimization model to solve this problem using a nonlinear programming (NLP) approach. The proposed model is used to explore various operational problems in the service chain placement field. The results suggest that the optimal cost ratio for PMs with high, hybrid, and low capacity, respectively, is equal to 4:2:1. Meanwhile, the maximum operating utilization rate should be limited to 55% in order to minimize the rental cost. Regarding quality of service (QoS) relaxation, the server cost reduces by 20%, 30%, and 32% as the end-to-end delay constraint is relaxed from 40 to 60, 80, and 100 ms, respectively. For the server location, the cost decreases by 25% when the high-capacity PMs are decentralized rather than centralized. Finally, the cost reduces by 40% as the repetition rate in the service chain increases from 0 to 2. A heuristic algorithm, designated as common sub chain placement first (CPF), is proposed to solve the service chain placement problem for large-scale problems (eg, 256 PMs). It is shown that the proposed algorithm reduces the solution time by up to 86% compared with the NLP optimization model, with an accuracy reduction of just 8%.
机译:网络功能虚拟化(NFV)将网络功能放置在位于数据中心的物理机(PM)的虚拟机(VM)上。在实践中,数据流可能会通过多个网络功能,这些功能共同跨位于相同或不同PM上的多个VM形成服务链。给定一组服务链,网络运营商可以通过以下两种方式放置它们:(a)最小化VM和PM的数量以减少服务器租赁成本;或(b)将运行属于同一服务链的网络功能的VM放置在相同或附近的PM,以减少网络延迟。在确定最佳服务链位置时,运营商面临着使服务器成本最小化的问题,同时仍要满足端到端延迟约束。本研究提出了一种使用非线性规划(NLP)方法解决此问题的优化模型。提出的模型用于探索服务链放置领域中的各种运营问题。结果表明,具有高容量,混合容量和低容量的PM的最佳成本比分别等于4:2:1。同时,为了最大程度地降低租金成本,最高运营利用率应限制为55%。关于服务质量(QoS)放宽,随着端到端延迟约束分别从40 ms降低到60、80和100 ms,服务器成本降低了20%,30%和32%。对于服务器位置,将高容量PM分散而不是集中放置时,成本降低了25%。最后,随着服务链中的重复率从0增加到2,成本降低了40%。提出了一种启发式算法,称为“优先公共子链放置”(CPF),以解决大规模的服务链放置问题。问题(例如256 PM)。结果表明,与NLP优化模型相比,该算法最多可将求解时间减少86%,而准确率仅降低8%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号