High Reliability Scheduling for DAG Based Service Function Chains

Service Function Chains (SFCs) forward data traffic through a series of Virtual Network Functions (VNFs) to enhance the flexibility of network services. One of the key challenges in SFCs is the deployment of VNFs and scheduling incoming requests across computational nodes to ensure low latency and high reliability. However, existing studies primarily focus on static networks and assume that all SFC requests are predetermined, which is impractical. In this paper, we consider the high-reliability scheduling of SFCs in a dynamic network environment, specifically within Directed Acyclic Graphs (DAGs), to maximize the number of requests that can be successfully processed while satisfying latency and reliability constraints. To tackle this issue, we propose an efficient approach to determine the redundancy of VNFs under the constraint of latency while maximizing success. Experimental results demonstrate that our proposed solution significantly enhances the success rate and effectively conserves computational resources.