On Dynamic Service Function Chain Deployment and Readjustment

Liu, Junjie; Lü, Wei; Zhou, Fen; Lu, Ping; Zhu, Zuqing

doi:10.1109/tnsm.2017.2711610

Cited by 262 publications

(138 citation statements)

References 37 publications

Supporting

Mentioning

138

Contrasting

Order By: Relevance

“…We mathematically formulate this problem as a multiobjective optimization model with two different goals of minimizing total resource consumption cost and operating cost, respectively. Similar to most existing works, [10][11][12][13][14]16,[19][20][21][22][23][24][25][26][31][32][33] we transform the multiobjective optimization problem into a single objective optimization problem and base on Dijkstra algorithm to design a heuristic service deployment approach to solve it.…”

Section: Related Workmentioning

confidence: 99%

“…Similar to most works, 23,24,[36][37][38][39][40][41][42][43] we conduct simulation experiments based on MATLAB R2015b and CPLEX toolbox, running on Windows 7 personal computer with Inter (R) Core(TM), 2.93GHz CPU, 4GRAM.…”

Section: Simulation Settingmentioning

confidence: 99%

“…The static proposals may lead to network performance degradation. 17,18 Although a large number of research works [19][20][21][22][23][24][25][26][27][28][29][30] have tried to tackle the problem of dynamic network SFCs deployment, they did not consider the dynamic network service chains deployment across multiple SDN domains. Thus, an efficient dynamic cross-domain SDN network service deployment scheme is urgently required to adapt to dynamic service demands from end users.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic network service deployment across multiple SDN domains

Zhang

Wang

Dong

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The integration of software defined networking (SDN) and network function virtualization (NFV) is a promising approach to support flexible service deployment and provisioning. In particular, NFV enables a network service to be represented as one network service function chain, which is composed of several virtual network functions in a specific order. However, with regard to service provisioning in multidomain SDN networks, virtual network functions are deployed in several different SDN domains due to limited resource capacity of each SDN domain. It results in the network service deployment complexity increase and causes additional operating cost. On the other hand, most current network service deployment proposals are limited to static user request scenarios. How to effectively deploy network service across multiple SDN domains to satisfy dynamic service demands of end users is a challenging problem. To address the aforementioned challenge, in this paper, we study the problem of dynamic network service deployment across multiple SDN domains. Specifically, we first design a novel service deployment framework to support dynamic deployment and optimization of virtual network function in multidomain SDN networks. Then, we formulate the problem as a multiobjective optimization problem with the target of jointly minimizing resource consumption cost and operating cost. Furthermore, we transform the multiobjective optimization problem into a single objective optimization model and present an efficient heuristic service deployment approach to solve it by leveraging Dijkstra algorithm. The simulation results demonstrate that the proposed service deployment method is efficient and outperforms comparison methods in terms of service rejection ratio, resource cost, and operating cost.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Simulation Settingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic network service deployment across multiple SDN domains

Zhang

Wang

Dong

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…[12][13][14][15][16][17][18][19][20][21][22][23][24][25] In Wang et al, 12 a model on dynamic function composition problem for NSC was proposed to adapt to the increasingly diverse service requirements. [12][13][14][15][16][17][18][19][20][21][22][23][24][25] In Wang et al, 12 a model on dynamic function composition problem for NSC was proposed to adapt to the increasingly diverse service requirements.…”

Section: Related Workmentioning

confidence: 99%

“…In the past few years, the network service function chain deployment has been a hot topic in industry and academia, and a large number of research works have been carried out. [12][13][14][15][16][17][18][19][20][21][22][23][24][25] In Wang et al, 12 a model on dynamic function composition problem for NSC was proposed to adapt to the increasingly diverse service requirements. The dynamic service function composition problem was defined as a multidimension multichoice problem and solved by using the Markov approximation algorithm.…”

Section: Related Workmentioning

confidence: 99%

Network service chains deployment across multiple SDN domains

Zhang

Wang

et al. 2018

Int J Communication

View full text Add to dashboard Cite

The integration of software-defined networking (SDN) and network function virtualization (NFV) enables the flexible deployment of network services and significant reduction in service provisioning cost. In particular, SDN, as a new networking paradigm, supports the flexible provisioning of new network services. Meanwhile, in NFV, the service request from end user can be represented as the service function chain (SFC). However, with the continuously increasing of network users and constant enlargement in network scale, the deployment of network services in the large-scale SDN network, which is composed of multiple SDN domains, becomes more challenging since these SDN domains are managed and maintained by different network operators and service providers. To address the above challenge, in this paper, we study the problem of how to deploy network services across multiple SDN domains optimally. Specifically, we first formulate this problem as an optimization problem by jointly minimizing the total number of SDN domains occupied by SFCs and the corresponding network resource consumption cost. We propose a novel heuristic deployment algorithm to solve this optimization problem. The simulation results demonstrate that the proposed heuristic deployment algorithm is effective and outperforms the comparison algorithms in terms of the total service cost. KEYWORDS multidomain network, network service deployment, SDN, SFC Int J Commun Syst. 2018;31:e3826.wileyonlinelibrary.com/journal/dac

show abstract

VNFPlacement and Sharing inNFV‐Based Cellular Networks

Malandrino¹,

Chiasserini²

2020

Wiley 5G Ref

View full text Add to dashboard Cite

Network function virtualization is one of the most relevant enabling technologies for 5G: conceiving a vertical service as a set of virtual network functions (VNFs) makes it possible to implement a service at the network edge in a fast and flexible manner, using computing, networking, and storage resources available therein. However, while deploying the VNFs composing a service, it is critical (i) to meet the key performance indices required by the vertical and (ii) to use the available resources in the most efficient manner so as to both cope with possible resource shortage and minimize the overall deployment cost. To successfully address the aforementioned issues, several works have tackled the problem of VNF placement at the network edge and, more recently, the problem of VNF sharing, i.e. of reusing the same VNF for multiple concurrent services. In this article, we first introduce VNF placement in 5G cellular networks and review existing solutions to this aspect. Then we focus on the problem of how to efficiently reuse VNFs and how to adapt the resources assigned to the virtual machines where such VNFs run, so that that the vertical key performance indicators (KPIs) are still satisfied. Importantly, it has been shown that carefully prioritizing the traffic of the services sharing a set of VNFs can lead to a significant cost reduction while still meeting the services KPIs. Such priorities can be set through an efficient algorithm, which provides a solution within a constant factor from the optimum, in polynomial time.

show abstract

On Dynamic Service Function Chain Deployment and Readjustment

Cited by 262 publications

References 37 publications

Dynamic network service deployment across multiple SDN domains

Dynamic network service deployment across multiple SDN domains

Network service chains deployment across multiple SDN domains

VNFPlacement and Sharing inNFV‐Based Cellular Networks

Contact Info

Product

Resources

About