ONCache: A Cache-Based Low-Overhead Container Overlay Network

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lin, Shengkai, Zhao, Shizhen, Cao, Peirui, Han, Xinchi, Tian, Quan, Liu, Wenfeng, Wu, Qi, Han, Donghai, Wang, Xinbing
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911902571954176
author Lin, Shengkai
Zhao, Shizhen
Cao, Peirui
Han, Xinchi
Tian, Quan
Liu, Wenfeng
Wu, Qi
Han, Donghai
Wang, Xinbing
author_facet Lin, Shengkai
Zhao, Shizhen
Cao, Peirui
Han, Xinchi
Tian, Quan
Liu, Wenfeng
Wu, Qi
Han, Donghai
Wang, Xinbing
contents Recent years have witnessed a widespread adoption of containers. While containers simplify and accelerate application development, existing container network technologies either incur significant overhead, which hurts performance for distributed applications, or lose flexibility or compatibility, which hinders the widespread deployment in production. We carefully analyze the kernel data path of an overlay network, quantifying the time consumed by each segment of the data path and identifying the \emph{extra overhead} in an overlay network compared to bare metal. We observe that this extra overhead generates repetitive results among packets, which inspires us to introduce caches within an overlay network. We design and implement ONCache (\textbf{O}verlay \textbf{N}etwork \textbf{Cache}), a cache-based container overlay network, to eliminate the extra overhead while maintaining flexibility and compatibility. We implement ONCache using the extended Berkeley Packet Filter (eBPF) with only 524 lines of code, and integrate it as a plugin of Antrea. With ONCache, containers attain networking performance akin to that of bare metal. Compared to the standard overlay networks, ONCache improves throughput and request-response transaction rate by 12\% and 36\% for TCP (20\% and 34\% for UDP), respectively, while significantly reducing per-packet CPU overhead. Popular distributed applications also benefit from ONCache.
format Preprint
id arxiv_https___arxiv_org_abs_2305_05455
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle ONCache: A Cache-Based Low-Overhead Container Overlay Network
Lin, Shengkai
Zhao, Shizhen
Cao, Peirui
Han, Xinchi
Tian, Quan
Liu, Wenfeng
Wu, Qi
Han, Donghai
Wang, Xinbing
Networking and Internet Architecture
Distributed, Parallel, and Cluster Computing
Operating Systems
Recent years have witnessed a widespread adoption of containers. While containers simplify and accelerate application development, existing container network technologies either incur significant overhead, which hurts performance for distributed applications, or lose flexibility or compatibility, which hinders the widespread deployment in production. We carefully analyze the kernel data path of an overlay network, quantifying the time consumed by each segment of the data path and identifying the \emph{extra overhead} in an overlay network compared to bare metal. We observe that this extra overhead generates repetitive results among packets, which inspires us to introduce caches within an overlay network. We design and implement ONCache (\textbf{O}verlay \textbf{N}etwork \textbf{Cache}), a cache-based container overlay network, to eliminate the extra overhead while maintaining flexibility and compatibility. We implement ONCache using the extended Berkeley Packet Filter (eBPF) with only 524 lines of code, and integrate it as a plugin of Antrea. With ONCache, containers attain networking performance akin to that of bare metal. Compared to the standard overlay networks, ONCache improves throughput and request-response transaction rate by 12\% and 36\% for TCP (20\% and 34\% for UDP), respectively, while significantly reducing per-packet CPU overhead. Popular distributed applications also benefit from ONCache.
title ONCache: A Cache-Based Low-Overhead Container Overlay Network
topic Networking and Internet Architecture
Distributed, Parallel, and Cluster Computing
Operating Systems
url https://arxiv.org/abs/2305.05455