Flow-Aware Service Function Embedding Algorithm in Programmable Data Plane
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Jaewook | - |
dc.contributor.author | Ko, Haneul | - |
dc.contributor.author | Lee, Hochan | - |
dc.contributor.author | Pack, Sangheon | - |
dc.date.accessioned | 2021-08-30T05:12:42Z | - |
dc.date.available | 2021-08-30T05:12:42Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/50658 | - |
dc.description.abstract | Service function chaining (SFC) is an indispensable technique for Internet service providers to efficiently manage their networks. However, SFC poses requirements of additional processing time of service functions (SFs) and increased routing time owing to detoured paths. In this paper, we introduce the use of a programmable data plane (PDP) to reduce the additional processing and routing times in SFC. We first classify the existing PDP-empowered SFC schemes and analyze their pros and cons. An optimization problem, to find the optimal SF embedding strategy minimizing the SFC completion time while efficiently utilizing the PDP switch resources, is formulated and a flow-aware SF embedding (FASE) algorithm that complementarily combines the redundant SF and re-circulation approaches is devised. FASE is implemented over a commercial PDP switch and experimental results demonstrate that FASE can reduce the SFC completion time by up to 33% compared with conventional approaches while utilizing the switch resources efficiently. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Flow-Aware Service Function Embedding Algorithm in Programmable Data Plane | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Ko, Haneul | - |
dc.contributor.affiliatedAuthor | Pack, Sangheon | - |
dc.identifier.doi | 10.1109/ACCESS.2020.3048421 | - |
dc.identifier.scopusid | 2-s2.0-85099090323 | - |
dc.identifier.wosid | 000608209800001 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.9, pp.6113 - 6121 | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 9 | - |
dc.citation.startPage | 6113 | - |
dc.citation.endPage | 6121 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordAuthor | Service function chaining | - |
dc.subject.keywordAuthor | programmable data plane | - |
dc.subject.keywordAuthor | in-network computing | - |
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.