A Network Calculus Model for SFC Realization and Traffic Bounds Estimation in Data Centers

• Published in: ACM transactions on Internet technology 2024-11, Vol.24 (4), p.1-32, Article 21
• Main Authors: Sharma, Sidharth, Jukan, Admela, Malik, Aashi, Gumaste, Ashwin
• Format: Article
• Language: English
• Subjects: Data center networks; Network performance analysis; Network reliability; Networks
• ISSN: 1533-5399; 1557-6051
• DOI: 10.1145/3700440

Network Function Virtualization (NFV) is a promising technology that can transform how internet service providers deliver their services. However, recent studies have identified several challenges in adopting NFV. Two key challenges are central to the operation and capacity planning of NFV Data Centers (DCs): (i) Service Function Chain (SFC) realization—determining if a new request with a known profile can be accommodated—and (ii) Network Function Virtualization (NFV) traffic bounds estimation—estimating the total traffic that a data center can handle considering all service requests and their performance constraints. To address these challenges, we propose a model that leverages stochastic network calculus to effectively dimension an NFV DC while ensuring delay and availability bounds for all service requests. Our theoretical model provides a mathematical framework to assess the realization of a single SFC request without delving into the specifics of the realization process. We utilize established availability-aware Virtual Network Function (VNF) placement patterns to obtain traffic bounds essential to planning data center capacity. We analyze NFV data center traffic under various scenarios over a Fat-tree DC topology. The results demonstrate that data center capacity is significantly influenced by the VNF placement strategy. Additionally, for data centers hosting latency-sensitive services, Service Level Objective (SLO) constraints on availability and delay are crucial in determining the number of such requests that can be accommodated.