IEEE Transactions on Network and Service Management · 2021 · 16 citations · 34 references
ComputingComputer SystemsInformation TechnologyComputer NetworksEdge ComputingVirtualizationNetwork Function VirtualizationNetwork OptimizationNetwork VirtualizationResource ProvisioningSoftware-defined NetworkingVirtual Network FunctionsInteger Linear ProgrammingNetwork ProvisioningService ChainingService Function ChainingService ProvisioningSoftware-defined Networking MigrationVirtualized Network FunctionsVnf Placement
To minimize operating expenses (OPEX) and enhance flexibility for network service provisioning, network function virtualization (NFV) is used to chain an ordered sequence of virtualized network functions (VNFs), also known as service function chain (SFC), which can be placed on commodity servers. As a highly complementary to NFV, software-defined networking (SDN) can offer an agile way of VNF orchestration with the capability of fine-granularity network control over flows. However, one-step migration to SDN is impossible in ISP networks. Thus, in this paper we resort to hybrid SDN to implement SFC provisioning. By jointly optimizing SDN deployment that largely determines capital expenditures (CAPEX) and VNF placement that decides OPEX, we manage to make a tradeoff between CAPEX and OPEX, and to find out an appropriate SDN deployment rate for network operator. We first formulate the problem as an integer linear programming (ILP) model <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {P}$ </tex-math></inline-formula> , then, reformulate it with column generation technique and decomposition theory to develop a distributed approximation algorithm CGPD which obtains a tight upper bound of optimal solution to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {P}$ </tex-math></inline-formula> . In order to better decrease CAPEX, a dynamic programming-based heuristic EOES giving importance to effective resource sharing is further designed based on a hidden Markov model. The simulation results indicate that, the difference between <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {P}$ </tex-math></inline-formula> and CGPD is marginal. CGPD outperforms EOES in terms of total cost, average delay and bandwidth utilization, and EOES on the other hand demands 20% SDN deployment rate which is half of that of CGPD.
34
Selected Topics in Column Generation
Marco E. Lübbecke, Jacques Desrosiers · Operations Research · 2005 · 1.1K citations
A comprehensive survey of Network Function Virtualization
Bo Yi, Xingwei Wang, Keqin Li et al. · Computer Networks · 2018 · 528 citations
Near optimal placement of virtual network functions
Rami Cohen, Liane Lewin-Eytan, Joseph Naor et al. · 2015 · 522 citations