NF-switch: VNFs-enabled SDN switches for high performance service function chaining

Hsieh, Cheng-Liang; Weng, Ning

doi:10.1109/icnp.2017.8117601

Cited by 7 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…OpenBox [10] and NF‐Switch [29] are based on the concept of sharing common operations between NFs for performance improvement. However, both of them have limitations.…”

Section: Related Workmentioning

confidence: 99%

Enabling low‐latency service function chains by merging duplicate match operations

et al. 2022

View full text Add to dashboard Cite

Service function chains (SFCs) built by network functions (NFs) are usually required to be low‐latency, especially in some tight latency scenarios such as Distributed Denial of Service (DDoS) defense. However, different NFs in SFCs are likely to perform identical operations of matching specific packet header fields (e.g., source IP address). Such a processing redundancy inevitably increases the overall end‐to‐end processing latency of SFCs, which in turn affects network management applications in their decision‐making process of handling short‐lived network events (e.g., microbursts). To address this problem, in this paper, we propose a novel NFV framework, DMO, that aims to eliminate those identical and redundant match operations among different NFs in input SFCs while maintaining the original SFC semantics of packet processing. To achieve this goal, our design proposes a semantic‐preserving mechanism that merges duplicate match operations between different NFs and also preserves original SFC semantics. Also, to avoid potential conflicts among NF rules at runtime, DMO further offers another mechanism that resolves unnecessary conflicts among different NF rules by assigning reasonable priorities to these rules. We have implemented a prototype of DMO. Our experiments indicate that DMO achieves 26.7%–67.3% latency reduction for real‐world SFCs.

show abstract

“…OpenBox [10] and NF‐Switch [29] are based on the concept of sharing common operations between NFs for performance improvement. However, both of them have limitations.…”

Section: Related Workmentioning

confidence: 99%

Enabling low‐latency service function chains by merging duplicate match operations

et al. 2022

View full text Add to dashboard Cite

show abstract

“…A recent trend advocates the use of data plane programmability and programmable devices, including multicore servers [42], FPGA [10], [12], [43], GPU [44], and programmable switches [45], [46], for improving the SFC performance. NetVM [42] eliminates redundant packet transmissions among NFs to accelerate SFCs on multi-core servers.…”

Section: B Sfc Accelerationmentioning

confidence: 99%

P4SC: A High Performance and Flexible Framework for Service Function Chain

et al. 2019

View full text Add to dashboard Cite

Network function virtualization allows network functions to be implemented and managed flexibly as a service function chain (SFC) in the data plane to process flows. However, software-based SFCs lead to poor performance compared to proprietary middleboxes. Moreover, existing solutions tackling performance issues suffer from the development complexity incurred by hardware details. To address these problems, we leverage both the high performance of P4-capable devices and the high flexibility of P4 language. In this paper, we present a P4 Service Chaining framework (P4SC), which tackles multiple challenges for P4 to support the SFC implementation. P4SC provides a suite of primitives allowing efficient SFC expression, and a converter and a generator converting input SFC requests to the corresponding P4 program. Here, an algorithm based on longest common subsequence (LCS) is used to allow simultaneously implementing multiple SFCs. Moreover, P4SC offers a runtime manager for flexible SFC management at runtime. It also provides an automatic integration mechanism to integrate P4-based NFs into P4SC. We implement a P4SC prototype, which supports three types of P4-capable devices. The experimental results show that P4SC outperforms state of the arts with orders-of-magnitude SFC performance improvement while maintains high flexibility.

show abstract

“…On the other hand, if VNF f (or its next VNF) has no instances on server s (or s ), then X (s,s ) f (t) = 0 in each time slot t. Note that dynamic request steering can be implemented by adopting VNFs-enabled SDN switches [20]. We denote all chaining decisions by X(t).…”

Section: E System Workflow and Scheduling Decisionsmentioning

confidence: 99%

Online VNF Chaining and Scheduling with Prediction: Optimality and Trade-Offs

Huang

Bian

Gao

et al. 2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

For NFV systems, the key design space includes the function chaining for network requests and the resource scheduling for servers. The problem is challenging since NFV systems usually require multiple (often conflicting) design objectives and the computational efficiency of real-time decision making with limited information. Furthermore, the benefits of predictive scheduling to NFV systems still remain unexplored. In this paper, we propose POSCARS, an efficient predictive and online service chaining and resource scheduling scheme that achieves tunable trade-offs among various system metrics with stability guarantee. Through a careful choice of granularity in system modeling, we acquire a better understanding of the tradeoffs in our design space. By a non-trivial transformation, we decouple the complex optimization problem into a series of online sub-problems to achieve the optimality with only limited information. By employing randomized load balancing techniques, we propose three variants of POSCARS to reduce the overheads of decision making. Theoretical analysis and simulations show that POSCARS and its variants require only mild-value of future information to achieve near-optimal system cost with ultra-low request response time.

show abstract

NF-switch: VNFs-enabled SDN switches for high performance service function chaining

Cited by 7 publications

References 13 publications

Enabling low‐latency service function chains by merging duplicate match operations

Enabling low‐latency service function chains by merging duplicate match operations

P4SC: A High Performance and Flexible Framework for Service Function Chain

Online VNF Chaining and Scheduling with Prediction: Optimality and Trade-Offs

Contact Info

Product

Resources

About