Service Function Chaining Resource Allocation: A Survey
Yanghao Xie, Zhixiang Liu, Sheng Wang, Yuxiu Wang
TL;DR
This survey reviews current research on algorithms for resource allocation in Service Function Chaining, focusing on optimization and VNF placement techniques for flexible network deployment.
Contribution
It provides a comprehensive overview of SFC-RA problem formulations, variants, and discusses future research directions in the field.
Findings
Summarizes different SFC-RA problem variants.
Highlights key algorithms and approaches for VNF placement.
Identifies open challenges and future research directions.
Abstract
Service Function Chaining (SFC) is a crucial technology for future Internet. It aims to overcome the limitation of current deployment models which is rigid and static. Application of this technology relies on algorithms that can optimally mapping SFC to substrate network. This category of algorithms is referred as "Service Function Chaining Resource Allocation (SFC-RA)" algorithms or "VNF placement (VNFP)" algorithms. This paper presents a survey of current researches in SFC-RA algorithms. After presenting the formulation and related problems, several variants of SFC-RA problem are summarized. At last, we discussed several future research directions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware-Defined Networks and 5G · Network Security and Intrusion Detection · Caching and Content Delivery