.png){kind=icon}
.png){kind=icon}
Return
Enabling Heterogeneous Network Function Chaining
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2018.2871845.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Today's data center operators deploy network policies in both physical (e.g., middleboxes, switches) and virtualized (e.g., virtual machines on general purpose servers) network function boxes (NFBs), which reside in different points of the network, to exploit their efficiency and agility respectively. Nevertheless, such heterogeneity has resulted in a great number of independent network nodes that can dynamically generate and implement inconsistent and conflicting network policies, making correct policy implementation a difficult problem to solve. Since these nodes have varying capabilities, services running atop are also faced with profound performance unpredictability. In this paper, we propose a Heterogeneous netwOrk Policy Enforcement (HOPE) scheme to overcome these challenges. HOPE guarantees that network functions (NFs) that implement a policy chain are optimally placed onto heterogeneousNFBs such that the network cost of the policy isminimized. We first experimentally demonstrate that the processing capacity ofNFBs is the dominant performance factor. This observation is then used to formulate the HeterogeneousNetwork Policy Placement problem, which is shown to beNP-Hard. To solve the problemefficiently, an online algorithmis proposed. Our experimental results demonstrate that HOPE achieves the same optimality as Branch-and-bound optimization but is 3 orders of magnitude more efficient.
Keywords:
Network policy
service chain
middleboxes
network functions
heterogeneous
datacenters
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
View more organizations