Flow-Aware Service Function Embedding Algorithm in Programmable Data Plane
Open Access
- 31 December 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 6113-6121
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.Keywords
Funding Information
- National Research Foundation (2020R1A2C3006786)
- Institute for Information and Communications Technology Promotion (IITP-2020-2017-0-01633)
This publication has 14 references indexed in Scilit:
- P4Guard: Designing P4 Based Firewall2018
- NetCache2017
- dRMT2017
- SilkRoad2017
- Service Function Chaining in Next Generation Networks: State of the Art and Research ChallengesIEEE Communications Magazine, 2016
- Packet Transactions2016
- MoonGen2015
- Service Function Chaining (SFC) Architecture2015
- Service Function Chaining: Creating a Service Plane via Network Service HeadersComputer, 2014
- Forwarding metamorphosis2013