scispace - formally typeset
Open AccessProceedings ArticleDOI

Towards "Full Containerization" in Containerized Network Function Virtualization

Yang Hu, +2 more
- Vol. 45, Iss: 1, pp 467-481
TLDR
NetContainer is proposed, a software framework that achieves fine-grained hardware resource management for containerized NFV platform and outperforms conventional page coloring-based memory allocator by 48% in terms of successful call rate.
Abstract
With exploding traffic stuffing existing network infra-structure, today's telecommunication and cloud service providers resort to Network Function Virtualization (NFV) for greater agility and economics. Pioneer service provider such as AT&T proposes to adopt container in NFV to achieve shorter Virtualized Network Function (VNF) provisioning time and better runtime performance. However, we characterize typical NFV work-loads on the containers and find that the performance is unsatisfactory. We observe that the shared host OS net-work stack is the main bottleneck, where the traffic flow processing involves a large amount of intermediate memory buffers and results in significant last level cache pollution. Existing OS memory allocation policies fail to exploit the locality and data sharing information among buffers. In this paper, we propose NetContainer, a software framework that achieves fine-grained hardware resource management for containerized NFV platform. NetContainer employs a cache access overheads guided page coloring scheme to coordinately address the inter-flow cache access overheads and intra-flow cache access overheads. It maps the memory buffer pages that manifest low cache access overheads (across a flow or among the flows) to the same last level cache partition. NetContainer exploits a footprint theory based method to estimate the cache access overheads and a Min-Cost Max-Flow model to guide the memory buffer mappings. We implement the NetContainer in Linux kernel and extensively evaluate it with real NFV workloads. Exper-imental results show that NetContainer outperforms conventional page coloring-based memory allocator by 48% in terms of successful call rate.

read more

Citations
More filters
Journal ArticleDOI

Reducing Latency in Virtual Machines: Enabling Tactile Internet for Human-Machine Co-Working

TL;DR: This paper develops, implements, and evaluates Chain-based Low latency VNF ImplemeNtation (CALVIN), a low-latency management framework for distributed Service Function Chains (SFCs), and investigates the practical feasibility of NFV with respect to the tactile Internet latency requirements.
Proceedings ArticleDOI

An Analysis and Empirical Study of Container Networks

TL;DR: It is found that virtualized network in containers incurs non-negligible overhead compared to physical networks, and users need to select an appropriate container network based on the requirements and characteristics of their workloads.
Proceedings ArticleDOI

FastBuild: Accelerating Docker Image Building for Efficient Development and Deployment of Container

TL;DR: A technique, named FastBuild, that maintains a local file cache to minimize the expensive file downloading and overlaps operations of instructions' execution and writing intermediate image layers to the disk is proposed.
Journal ArticleDOI

NFV Platforms: Taxonomy, Design Choices and Future Challenges

TL;DR: In this paper, the authors present a comprehensive survey on the NFV platform design and present a taxonomy of existing NFV platforms based on what features they provide in terms of a typical network function life cycle.
Journal ArticleDOI

NFV Platform Design: A Survey

TL;DR: This study presents a comprehensive survey on NFV platform design and gives a detailed guideline for network operators or service providers to choose the most appropriateNFV platform based on their respective requirements.
References
More filters
Journal Article

Docker: lightweight Linux containers for consistent development and deployment

Dirk Merkel
- 01 Mar 2014 - 
TL;DR: Docker promises the ability to package applications and their dependencies into lightweight containers that move easily between different distros, start up quickly and are isolated from each other.
Journal ArticleDOI

Evaluation techniques for storage hierarchies

TL;DR: A new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms.
Proceedings ArticleDOI

Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

TL;DR: In this article, the authors propose a low-overhead, runtime mechanism that partitions a shared cache between multiple applications depending on the reduction in cache misses that each application is likely to obtain for a given amount of cache resources.
Journal ArticleDOI

The working set model for program behavior

TL;DR: A new model, the “working set model,” is developed, defined to be the collection of its most recently used pages, which provides knowledge vital to the dynamic management of paged memories.
Proceedings ArticleDOI

Quincy: fair scheduling for distributed computing clusters

TL;DR: It is argued that data-intensive computation benefits from a fine-grain resource sharing model that differs from the coarser semi-static resource allocations implemented by most existing cluster computing architectures.
Related Papers (5)