Achieving Low Serving Latency in DPDK-Applied Systems at Multi-Tenant Edge Clouds

This paper explores a practical means to employ Data Plane Development Kit (DPDK), a kernel-bypassing framework for packet processing, in resource-limited multi-tenant edge data centers. Traditional virtual CPU (vCPU) schedulers are not compatible with the event detection model of DPDK, because each DPDK-applied VM (virtual machine) monopolizes one physical CPU (pCPU) for NIC register polling. Toward edge data center providers, this paper presents a new vCPU scheduling policy named Polling vCPU Consolidation (PvCC). PvCC enables DPDK-applied VMs to be consolidated on dedicated pCPUs by adopting microsecond-scale time slices. Along with this, PvCC provides vCPU scaling API that enables to scale up/down vCPUs of VMs at runtime. Our experiments show that PvCC allows consolidated DPDK-applied VMs to achieve low serving latencies, and our vCPU scaling API allows us to adjust CPU resource assignment according to the incoming request rate. It also enables to assign spare pCPUs to VMs executing non-latency-sensitive tasks.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Information and Systems
Published
2025-09-17
DOI
https://doi.org/10.1587/transinf.2025edp7023
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Achieving Low Serving Latency in DPDK-Applied Systems at Multi-Tenant Edge Clouds

Kenichi Yasukata, Kenta Ishiguro, Kenji Kono, Yuki Sato et al.
IEICE Transactions on Information and Systems
Cloud Computing and Resource Management
article

Achieving Low Serving Latency in DPDK-Applied Systems at Multi-Tenant Edge Clouds

Kenichi Yasukata, Kenta Ishiguro, Kenji Kono, Yuki Sato, Yuki Tsujimoto
article en

Abstract

This paper explores a practical means to employ Data Plane Development Kit (DPDK), a kernel-bypassing framework for packet processing, in resource-limited multi-tenant edge data centers. Traditional virtual CPU (vCPU) schedulers are not compatible with the event detection model of DPDK, because each DPDK-applied VM (virtual machine) monopolizes one physical CPU (pCPU) for NIC register polling. Toward edge data center providers, this paper presents a new vCPU scheduling policy named Polling vCPU Consolidation (PvCC). PvCC enables DPDK-applied VMs to be consolidated on dedicated pCPUs by adopting microsecond-scale time slices. Along with this, PvCC provides vCPU scaling API that enables to scale up/down vCPUs of VMs at runtime. Our experiments show that PvCC allows consolidated DPDK-applied VMs to achieve low serving latencies, and our vCPU scaling API allows us to adjust CPU resource assignment according to the incoming request rate. It also enables to assign spare pCPUs to VMs executing non-latency-sensitive tasks.

IEICE Transactions on Information and SystemsVol. E109.D(3)
Keio University (JP)
Openalex Percentile: Top 63%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.