Deploying chains of virtual network functions: On the relation between link and server usage

Kuo, Tung-Wei; Liou, Bang-Heng; Lin, Kate Ching-Ju; Tsai, Ming‐Jer

doi:10.1109/infocom.2016.7524565

Cited by 174 publications

(116 citation statements)

References 10 publications

Supporting

Mentioning

114

Contrasting

Unclassified

Order By: Relevance

“…Finally, though the tests were performed with WAN networks (for example, Internet networks), the ideas explored in this article can be easily adapted to other contexts. Examples include datacenter networks, and Software Defined Networks .…”

Section: Resultsmentioning

confidence: 99%

A branch‐and‐price algorithm for the single‐path virtual network embedding problem

2017

View full text Add to dashboard Cite

Network virtualization is a growing trend in the implementation of Internet infrastructures. The Virtual Network Embedding problem is one of the challenges in the virtualization of physical networks. This work shows that finding a feasible solution to this problem is NP‐Hard. However, in practice, it can be solved to optimality by exploiting the problem structure. We propose a new branch‐and‐price algorithm applied to a flow‐based formulation of the problem, and present an extensive computational study performed for instances of distinct topologies and sizes. The results presented attest the efficiency of the branch‐and‐price algorithm in solving the problem.

show abstract

Section: Resultsmentioning

confidence: 99%

A branch‐and‐price algorithm for the single‐path virtual network embedding problem

2017

View full text Add to dashboard Cite

show abstract

“…Bouet et al formulated the problem of minimizing the rental cost in terms of virtual deep packet inspection placement and then solved the problem using a greedy placement strategy. Finally, in Kuo et al obtained the minimal rental cost using a chain deployment algorithm based on the tradeoff between the path length and the VM reuse factor.…”

Section: Related Workmentioning

confidence: 99%

Cost minimization in placing service chains for virtualized network functions

Wang

Lin

Wang

et al. 2019

Int J Communication

View full text Add to dashboard Cite

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%. KEYWORDSnetwork function placement, network function virtualization, nonlinear programming, service chains Int J Commun Syst. 2020;33:e4222.wileyonlinelibrary.com/journal/dac

show abstract

“…Several papers propose a special-purpose algorithm for dealing with the SNE of specific problems [9]- [15], [18]- [21]. Our proposed LARAC-SN algorithm falls into this category for the constrained shortest path (CSP) problem.…”

Section: ) Special Purpose Algorithmsmentioning

confidence: 99%

“…As other works [9], [21], we do not define such a constraint and we consider that paths can contain loops.…”

Section: ) Solutions Based On Layeringmentioning

confidence: 99%

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

Bemten

Guck

Vizarreta

et al. 2018

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)

View full text Add to dashboard Cite

Abstract-With the emergence of Software-Defined Networking (SDN) and Network Function Virtualization (NFV), the problem of centralized routing through intermediate specified nodes (for which several candidates can be defined) has become an important issue. Indeed, an SDN controller routing flows through Service Function Chains (SFCs) has to efficiently solve this problem to achieve the online provisioning of routing requests and the online placement of Virtual Network Functions (VNFs). In this paper, we propose two algorithms for solving this problem. First, we propose LARAC for specified nodes (LARAC-SN), a fast and close to optimal algorithm for finding the constrained shortest path (CSP) visiting an ordered set of specified nodes. Second, we propose Mole in the Hole (MITH), a graph transformation algorithm which can force any state-of-the-art routing algorithm to visit an ordered set of specified nodes. While LARAC-SN is bounded to the specific CSP problem and can only handle one candidate per specified node, MITH can be used for any routing problem and can deal with several candidates per specified node. Through evaluations, we show that LARAC-SN is fast and close to optimal (its optimality gap stays lower than 1.62% in average) and that MITH has the potential of reaching optimality for any problem, but at the cost of a higher runtime.

show abstract

Deploying chains of virtual network functions: On the relation between link and server usage

Cited by 174 publications

References 10 publications

A branch‐and‐price algorithm for the single‐path virtual network embedding problem

A branch‐and‐price algorithm for the single‐path virtual network embedding problem

Cost minimization in placing service chains for virtualized network functions

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

Contact Info

Product

Resources

About