SFC Constrained Privacy-Preserved Shortest Path Problem

被引：0

作者：

You C.-Q. ^{[1
]}

Li L.-M. ^{[1
]}

机构：

[1] School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu

来源：

Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China | 2020年 / 49卷 / 04期

关键词：

Multi-domain; Network function virtualization; Privacy-preserved; Service function chaining; Shortest path problem;

D O I：

10.12178/1001-0548.2019190

中图分类号：

学科分类号：

摘要：

With the development of network function virtualization (NFV), it is more flexible and important for service function chain (SFC) constrained traffic flows to find the shortest path to get through the network. Existing works only consider conditions within a single-domain network. However, when it comes to multiple domains or geo-distributed networks, due to the network's concern of revealing sensitive information, member networks conceal their own network details to each other. This paper proposed a new algorithm, privacy-preserved multi-domain shortest path problem under service function chaining constraints, to solve the multi-domain transfer problem of traffic flows, preserving the privacy information of each member network as well as choosing the shortest path for the flows. © 2020, Editorial Board of Journal of the University of Electronic Science and Technology of China. All right reserved.

引用

页码：537 / 541

页数：4

共 10 条

[1] LIU G, REN Y, YURCHENKO M, Et al., Microboxes: High performance NFV with customizable, asynchronous TCP stacks and dynamic subscriptions, The 2018 ACM SIGCOMM, 14, pp. 504-517, (2018)
[2] AYYUB Q, TU C C, CHIANG L, Et al., SIMPLE-fying middlebox policy enforcement using SDN, The 2013 ACM SIGCOMM, 43, 4, pp. 27-38, (2013)
[3] QUINN P, NADEAU T., Problem statement for service function chaining
[4] FABIOLA G., The large hadron collier (LHC) Experiment
[5] The square kilometer array (SKA)
[6] HAMILTON H., Central office
[7] MARIGOLD G., Central office lookup tool
[8] SALLAM G, GUPTA G R, LI B, Et al., Shortest path and maximum flow problems under service function chaining constraints, IEEE 2018 INFOCOM, 9, pp. 2132-2140, (2018)
[9] CAO Z, KODIALAM M, LAKSHMAN T., Traffic steering in software defined networks: Planning and online routing, The 2014 ACM SIGCOMM Workshop on Distributed Cloud Computing (DCC), 6, pp. 65-70, (2014)
[10] DWARAKI A, WOLF T., Adaptive service-chain routing for virtual network functions in software-defined networks, The 2016 ACM SIGCOMM Workshop on Hot Topics in Middleboxes and Network Function Virtualization, 6, pp. 32-37, (2016)

← 1 →