Service Chaining for Hybrid Network Function

In the Service-Function-Chaining (SFC) enabled networks, various sophisticated policy-aware network functions, such as intrusion detection, access control and unified threat management, can be realized in either physical middleboxes or virtualized network function (VNF) appliances. In this paper, we...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cloud computing 2019-10, Vol.7 (4), p.1082-1094
Main Authors: Huang, Huawei, Guo, Song, Wu, Jinsong, Li, Jie
Format: Article
Language:English
Subjects:
Access control
Algorithms
Approximation
Approximation algorithms
Chaining
Chains
Cloud computing
Hardware
Intrusion
Markov approximation
Markov processes
Mathematical analysis
middlebox
Middleboxes
network function
NFV
Routing
SDN
Security
Service function chaining
traffic steering
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the Service-Function-Chaining (SFC) enabled networks, various sophisticated policy-aware network functions, such as intrusion detection, access control and unified threat management, can be realized in either physical middleboxes or virtualized network function (VNF) appliances. In this paper, we study the service chaining towards the hybrid SFC clouds, where both physical appliances and VNF appliances provide services collaboratively. In such hybrid SFC networks, the challenge is how to efficiently steer the service chains for traffic demands while matching their individual policy chains concurrently such that a utility associated with the total admitted traffic rate and the induced overheads can be maximized. We find such problem has not been well solved so far. To this end, we devise a Markov Approximation (MA) based algorithm. The approximation property of the proposed algorithm is also proved. Extensive evaluation results show that the proposed MA algorithm can yield near-optimal solutions and outperform other benchmark algorithms significantly.
ISSN:2168-7161
2372-0018
DOI:10.1109/TCC.2017.2721401