Due to that Service Function Chain (SFC) permits the forwarding of flows along a predetermined sequence chain of Virtual Network Functions (VNFs), it has become a common service in Network Function Virtualization (NFV)-enabled Software Defined Networks (SDNs). Generally, since there are multiple same VNF-instances in NFV-Enabled SDNs, this brings a great challenge for selecting or placing the required VNF-instances to satisfy the routing of SFC Request flows (SRs). In this paper, we study the routing problem for SRs by jointly considering dynamical VNF placement and multiple Resources and Quality of Service (QoS) constraints in NFV-Enabled SDNs. Specifically, we first define two optimization problems: one is the Dynamical VNF Placement and Routing Problem for SRs (DVPRP) and the other is the Delay, packet Loss and Jitter Aware Dynamical VNF Placement and Routing Problem for SRs (DLJA-DVPRP). We then formulate the two problems as Integer Linear Programming (ILP) problems. Next, we creatively devise an auxiliary edge-weight graph and propose two efficient algorithms to solve the problems with the aim of minimizing the resource consumption costs as well as ensuring multiple QoS constraints. Especially, we utilize the shortest path algorithm based on Lagrange relaxation method to solve the DLJA-DVPRP with multiple QoS constraints. Compared with existing algorithms, simulation results demonstrate our proposed algorithms have better performance in terms of throughput, traffic acceptance rate and load balance.
In order to achieve reliability, security, and scalability, the request flow in the Internet of Things (IoT) needs to pass through the service function chain (SFC), which is composed of series-ordered virtual network functions (VNFs), then reach the destination application in multiaccess edge computing (MEC) for processing. Since there are usually multiple identical VNF instances in the network and the network environment of IoT changes dynamically, placing the SFC for the IoT request flow is a significant challenge. This paper decomposes the dynamic SFC placement problem of the IoT-MEC network into two subproblems: VNF placement and path determination of routing. We first formulate these two subproblems as Markov decision processes. We then propose a meta reinforcement learning and fuzzy logic-based dynamic SFC placement approach (MRLF-SFCP). The MRLF-SFCP contains an inner model that focuses on making SFC placement decisions and an outer model that focuses on learning the initial parameters considering the dynamic IoT-MEC environment. Specifically, the approach uses fuzzy logic to pre-evaluate the link status information of the network by jointly considering available bandwidth, delay, and packet loss rate, which is helpful for model training and convergence. In comparison to existing algorithms, simulation results demonstrate that the MRLF-SFCP algorithm exhibits superior performance in terms of traffic acceptance rate, throughput, and the average reward.
20 June 2025 in IEEE Transactions on Mobile Computing
For reliability, security and scalability, Multicast Request flows (MRs) need to traverse a Service Function Chain (SFC) that consists of series of Virtual Network Functions (VNFs) such as firewalls, encoder-decoder in Network Function Virtualization-enabled Software-Defined Networks (NFV-enabled SDNs). There are typically multiple identical VNF-instances in the network, it brings significant challenges when dynamically choosing or placing the requisite VNF-instances to construct a Service Function Tree (SFT) consisting of SFCs for fulfilling the MRs's routing. This paper investigates the Delay and Jitter Aware Dynamic SFT Embedding and Routing Problem (DJADSERP) considering VNF placement, network resources, delay and jitter constraints as well as network load balance in NFVEnabled SDNs. First, we formulate DJA-DSERP as an integer linear programming model and prove it to be NP-hard. Then, an auxiliary edge-weighted graph and an Optimal Link Selection Function (OLSF) are devised, and SFT Embedding Algorithm (SFT-EA) is proposed to address the problem aiming at minimizing the resource consumption costs while satisfying multiple QoS constraints and network load balance. Furthermore, we theoretically prove the effectiveness of the OLSF and the SFTEA. Simulation results demonstrate that the SFT-EA exhibits superior performance compared to existing algorithms in terms of throughput, traffic acceptance rate, and network load balance.