Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining

IF 13.8 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications Pub Date : 2017-10-25 DOI:10.1109/JSAC.2017.2760162

Insun Jang, Dongeun Suh, Sangheon Pack, G. Dán

{"title":"Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining","authors":"Insun Jang, Dongeun Suh, Sangheon Pack, G. Dán","doi":"10.1109/JSAC.2017.2760162","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of optimal dynamic service function (SF) placement and flow routing in a SF chaining (SFC) enabled network. We formulate a multi-objective optimization problem to maximize the acceptable flow rate and to minimize the energy cost for multiple service chains. We transform the multi-objective optimization problem into a single-objective mixed integer linear programming (MILP) problem, and prove that the problem is NP-hard. We propose a polynomial time algorithm based on linear relaxation and rounding to approximate the optimal solution of the MILP. Extensive simulations are conducted to evaluate the effects of the energy budget, the network topology, and the amount of server resources on the acceptable flow rate. The results demonstrate that the proposed algorithm can achieve near-optimal performance and can significantly increase the acceptable flow rate and the service capacity compared to other algorithms under an energy cost budget.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2532-2541"},"PeriodicalIF":13.8000,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760162","citationCount":"57","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal on Selected Areas in Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/JSAC.2017.2760162","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}

引用次数: 57

Abstract

In this paper, we consider the problem of optimal dynamic service function (SF) placement and flow routing in a SF chaining (SFC) enabled network. We formulate a multi-objective optimization problem to maximize the acceptable flow rate and to minimize the energy cost for multiple service chains. We transform the multi-objective optimization problem into a single-objective mixed integer linear programming (MILP) problem, and prove that the problem is NP-hard. We propose a polynomial time algorithm based on linear relaxation and rounding to approximate the optimal solution of the MILP. Extensive simulations are conducted to evaluate the effects of the energy budget, the network topology, and the amount of server resources on the acceptable flow rate. The results demonstrate that the proposed algorithm can achieve near-optimal performance and can significantly increase the acceptable flow rate and the service capacity compared to other algorithms under an energy cost budget.

查看原文本刊更多论文

面向业务功能链的业务功能布局与流量分布联合优化

在本文中，我们考虑了启用SF链的网络中的最优动态服务函数（SF）布局和流路由问题。我们提出了一个多目标优化问题，以最大化可接受的流量，并最小化多个服务链的能源成本。将多目标优化问题转化为单目标混合整数线性规划（MILP）问题，证明了该问题是NP难问题。我们提出了一种基于线性松弛和舍入的多项式时间算法来近似MILP的最优解。进行了广泛的模拟，以评估能源预算、网络拓扑和服务器资源量对可接受流量的影响。结果表明，在能源成本预算下，与其他算法相比，该算法可以实现接近最优的性能，并显著提高可接受的流量和服务能力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Journal on Selected Areas in Communications 工程技术-电信学

CiteScore

30.00

自引率

4.30%

发文量

234

审稿时长

6 months

期刊介绍： The IEEE Journal on Selected Areas in Communications (JSAC) is a prestigious journal that covers various topics related to Computer Networks and Communications (Q1) as well as Electrical and Electronic Engineering (Q1). Each issue of JSAC is dedicated to a specific technical topic, providing readers with an up-to-date collection of papers in that area. The journal is highly regarded within the research community and serves as a valuable reference. The topics covered by JSAC issues span the entire field of communications and networking, with recent issue themes including Network Coding for Wireless Communication Networks, Wireless and Pervasive Communications for Healthcare, Network Infrastructure Configuration, Broadband Access Networks: Architectures and Protocols, Body Area Networking: Technology and Applications, Underwater Wireless Communication Networks, Game Theory in Communication Systems, and Exploiting Limited Feedback in Tomorrow’s Communication Networks.