NFlow and MVT Abstractions for NFV Scaling

The ability to dynamically scale in/out network functions (NFs) on multiple cores/servers to meet traffic demands is a key benefit of network function virtualization (NFV). The stateful NF operations make NFV scaling a challenging task: if care is not taken, NFV scaling can lead to incorrect operati...

Full description

Saved in:
Bibliographic Details
Main Authors: Wu, Ziyan, Zhang, Yang, Feng, Wendi, Zhang, Zhi-Li
Format: Conference Proceeding
Language:English
Subjects:
Conferences
Multicore processing
Network function virtualization
Noise measurement
Pipelines
Scalability
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The ability to dynamically scale in/out network functions (NFs) on multiple cores/servers to meet traffic demands is a key benefit of network function virtualization (NFV). The stateful NF operations make NFV scaling a challenging task: if care is not taken, NFV scaling can lead to incorrect operations and poor performance. We advocate two general abstractions, NFlow and Match-Value Table (MVT), for NFV packet processing pipelines. We present formal definitions of the abstractions and discuss how they can facilitate NFV scaling by minimizing or eliminating shared states. Using NFs implemented with the proposed abstractions, we conduct extensive experiments and demonstrate their efficacy in terms of correctness and performance of NFV scaling.
ISSN:2641-9874
DOI:10.1109/INFOCOM48880.2022.9796764