首页> 外文会议>2018 4th IEEE Conference on Network Softwarization and Workshops >SET: a Simple and Effective Technique to improve cost efficiency of VNF placement and chaining algorithms for network service provisioning
【24h】

SET: a Simple and Effective Technique to improve cost efficiency of VNF placement and chaining algorithms for network service provisioning

机译:SET:一种简单有效的技术,可提高网络服务供应的VNF放置和链接算法的成本效率

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

摘要

Network Functions Virtualization (NFV) is a promising solution to provide cost-efficient, scalable and rapid deployment of network services. It allows the implementation of fine-grained services as a chain of Virtual Network Functions (VNFs). In order to place the VNF chains in the network, several cost-efficient methods have been already proposed. However, a few works have considered order of VNFs to reduce the cost. In this paper, we propose a Simple and Effective Technique (SET), which can be easily combined with VNF placement methods to dramatically improve their cost efficiency by considering different possible orders for the VNFs in the chain. As a proof-of-concept, we combine the proposed technique with one of the recent cost-efficient VNF placement and chaining algorithms called CCVP. The results show that the combination can yield significantly better cost than CCVP operating solo.
机译:网络功能虚拟化(NFV)是一种有前途的解决方案,可提供经济高效,可扩展和快速的网络服务部署。它允许将细粒度的服务实现为虚拟网络功能(VNF)链。为了将VNF链放置在网络中,已经提出了几种具有成本效益的方法。但是,一些工作已经考虑了VNF的顺序以降低成本。在本文中,我们提出了一种简单有效的技术(SET),该技术可以轻松地与VNF放置方法结合使用,从而可以通过考虑链中VNF的不同可能顺序来显着提高其成本效率。作为概念验证,我们将提出的技术与最近的一种经济高效的VNF放置和链接算法CCVP相结合。结果表明,与CCVP单独运行相比,该组合可产生更好的成本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号