返回
Virtual network function placement with bounded migrations
DOI:10.1007/s10586-021-03266-8.png)
摘要
En 中文
With the penetration of Network Function Virtualization (NFV), network functions, traditionally deployed as proprietary physical equipment like firewalls, Network Address Translations (NATs), are gradually being implemented as software and deployed on standardized hardware. One of the crucial challenges in this paradigm is how to place the software implemented network functions to minimize the number of used physical servers. In this paper, we study the problem of how to optimally place Virtual Network Functions (VNFs) in networks where it is allowed to migrate already placed VNFs to decrease used servers. We first formulate the offline problem as an Integer Linear Programming (ILP) problem, and then propose a semi-online algorithm to solve the online variant of the problem. We name the proposed algorithm Semi-online Vnf plAcement (SIVA). In particular, SIVA is based on a bin packing algorithm that solves online bin packing problem while taking care of migrations. According to our theoretical analysis, SIVA migrates at most lambda VNFs each step, and it has Asymptotic Competitive Ratio (ACR) of 3/2 if k -> infinity, where lambda = k center dot vertical bar n vertical bar, k is a tunable parameter, and vertical bar N vertical bar is the the number of supported VNF types. We conduct extensive numerical simulations to evaluate the performances of SIVA. The experiment results validate the theoretical analysis and show that SIVA outperforms the state-of-the-art algorithms by achieving near-optimal performance with minor VNF migrations.
Keyword:
Future networks
Network function virtualization
Resource allocation
Service function chaining
Semi-online algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.1
论文数:
5.0K
被引数:
7.5K
机构
暂无机构信息
引用论文
Effects of influenza vaccination in HIV-infected adults: a double-blind, placebo-controlled trial
Vaccine
IF0

