Abstract

By softwarizing the legacy network functions, Network Function Virtualization (NFV) allows rapid development and deployment of network services as well as simplicity and flexibility in network operations and management. Monitoring the performance characteristics of Virtual Network Functions (VNFs), particularly packet processing time, is important to ensure that VNFs are operating correctly with desired performance. This is especially crucial for low-latency network services. In this paper, we present Packet Processing Time Monitoring (PPTMon), a real-time, fine-grained, and end-to-end solution for VNF packet processing time monitoring. PPTMon can provide per-hop monitoring for a single VNF as well as end-to-end monitoring for multiple VNFs in a service function chain. PPTMon allows monitoring in both sampling and continuous fashions. Continuously monitoring every packet may greatly degrade the performance of the VNFs and generate a huge amount of monitoring data. PPTMon’s event-filtering algorithm effectively filters out non-important data and reduces the performance overhead. PPTMon processes packets in-stack by embedding timestamp information directly into the packets, thus further reducing the effect on the VNF performance. PPTMon is implemented on top of extended Berkeley Packet Filter (eBPF) – a Linux framework that allows high-speed packet processing. Our experiment results shows that PPTMon can monitor VNF packet processing time with high accuracy and low impact on performance.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call