Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jang, Insun | - |
dc.contributor.author | Suh, Dongeun | - |
dc.contributor.author | Pack, Sangheon | - |
dc.contributor.author | Dan, Gyorgy | - |
dc.date.accessioned | 2021-09-02T23:54:29Z | - |
dc.date.available | 2021-09-02T23:54:29Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2017-11 | - |
dc.identifier.issn | 0733-8716 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/81799 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | NETWORK | - |
dc.subject | ALGORITHM | - |
dc.title | Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Pack, Sangheon | - |
dc.identifier.doi | 10.1109/JSAC.2017.2760162 | - |
dc.identifier.scopusid | 2-s2.0-85032446560 | - |
dc.identifier.wosid | 000417338400011 | - |
dc.identifier.bibliographicCitation | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, v.35, no.11, pp.2532 - 2541 | - |
dc.relation.isPartOf | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | - |
dc.citation.title | IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | - |
dc.citation.volume | 35 | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 2532 | - |
dc.citation.endPage | 2541 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | NETWORK | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Service function chaining | - |
dc.subject.keywordAuthor | acceptable flow rate | - |
dc.subject.keywordAuthor | energy cost | - |
dc.subject.keywordAuthor | flow-compensatory rounding based placement | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.