Minimizing Delay in Network Function Virtualization with Shared Pipelines

doi:10.1109/TPDS.2016.2556670

Return

Minimizing Delay in Network Function Virtualization with Shared Pipelines

2017-01-01

PRE

Ori Rottenstreich *

Isaac Keslassy

Yoram Revah

DOI：10.1109/TPDS.2016.2556670

Original

Original request for help

Save

Abstract

En 中文

Pipelines are widely used to increase throughput in multi-core chips by parallelizing packet processing while relying on virtualization. Typically, each packet type is served by a dedicated pipeline with several cores, each implementing a network service. However, with the increase in the number of packet types and their number of required services, there are not enough cores for pipelines. In this paper, we study pipeline sharing, such that a single pipeline can be used to serve several packet types. Pipeline sharing decreases the needed total number of cores, but typically increases pipeline lengths and therefore packet delays. We consider two novel optimization problems of allocating cores between different packet types such that the average or the worst-case delay is minimized. We study the two problems and suggest optimal algorithms that apply under different assumptions on the input. We also present greedy algorithms for the general case. Last, we examine our solutions on synthetic examples as well as on real-life applications and demonstrate that they often achieve close-to-optimal delays.

Keywords:

Network function virtualization

multicore optimization

network processors

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.