Low Latency Security Function Chain Embedding Across Multiple Domains

• Published in: IEEE access 2018-01, Vol.6, p.14474-14484
• Main Authors: Xu, Qi, Gao, Deyun, Li, Taixin, Zhang, Hongke
• Format: Article
• Language: English
• Subjects: 5G mobile communication; Algorithms; Business; Chains; Computational modeling; Computer architecture; Domains; Embedding; Heuristic methods; Hidden Markov models; Internet of Vehicles; Network latency; Security; Security services; service function chaining; Smart buildings; software defined network; Viterbi algorithm detectors; Wireless networks
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2018.2791963

5G network is envisioned to provide massive connectivity for a wide range of applications, such as ultra-clear media, internet of vehicles, and smart home. The traditional way of providing security services is difficult to support these new 5G applications flexibly and effectively. In our previous work, we proposed a SFC-based framework that chains security functions in different domains to provide security services on demand. However, creating cross-domain service function chains will inevitably result in the additional network latency. In this paper, we study this problem of minimizing the end-to-end latency when deploying cross-domain service function chains for 5G applications. First, an exact approach, consisting of service chain partition and service subchain embedding, is proposed to derive an optimal solution for cross-domain service function chain placement. Second, we improve the Viterbi algorithm and propose an efficient heuristic approach to derive near-optimal solutions for large networks. We also compare the performance of the proposed exact approach, the proposed heuristic approach, and the simple greedy approach in different scales of network infrastructures. Simulation results are presented to demonstrate the effectiveness of the proposed approaches.