Cost-Aware Deterministic Latency-Bounded Network Slicing Deployment

With the rapid development of 5G and other next-generation networks, Network Slicing (NS) technology has become a critical means of meeting diverse business demands. Moreover, ensuring deterministic performance is crucial for providing high-quality services. A key issue in guaranteeing the deterministic performance of network slices is determining the required amount of resources. To address this, we first use Stochastic Network Calculus (SNC) theory to determine the minimum resources required for a network slice under deterministic bounded latency constraints. Based on this, we propose a heuristic algorithm based on Minimum Hop, aiming to maximize the service request acceptance rate while minimizing overall network costs. Simulation results demonstrate that the algorithm performs well in terms of acceptance rate and cost efficiency.