共 22 条
Resource consumption and security-aware multi-tenant service function chain deployment based on hypergraph matching
被引:2
|作者:
Gao, Jing
[1
]
Feng, Lei
[1
]
Yu, Peng
[1
]
Zhou, Fanqin
[1
]
Wu, Zihao
[2
]
Qiu, Xuesong
[1
]
Li, Jingchun
[1
]
Zhu, Yifei
[1
]
机构:
[1] BUPT, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Vanderbilt Univ, Coll Arts & Sci, Nashville, TN 37240 USA
基金:
国家重点研发计划;
关键词:
SFCs placement;
Resource optimization;
Safety and resource constraints;
Hypergraph match;
SFC;
PLACEMENT;
D O I:
10.1016/j.comnet.2022.109298
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
Network function virtualization (NFV) technology enables cloud service providers (CSPs) to deploy their service function chains (SFCs) into the common shared physical infrastructures to operate the network or cloud service. However, designing a suitable placement scheme for multi-tenant SFCs to balance resource consumption with performance and security is a tricky issue. In this paper, we first proposed security constraints based on physical isolation and formulated the problem of reasonably placing multi-tenant SFCs subject to multiple constraints to minimize resource consumption. The proposed problem is more intractable than previous works because of the extra introduced security constraints. To solve it, a new non-uniform weighted hypergraph construction approach is proposed by defining hyperedge weights to represent the resource consumption on one SFC. A hypergraph matching algorithm is proposed to find the maximum weight subset of hypergraphs whose vertices do not intersect to give a high degree of physical isolation by dealing with the conflict graphs. Simulation results show that the proposed hypergraph matching algorithm outperforms the comparison schemes in terms of the resource consumption while satisfying the security requirements.
引用
收藏
页数:12
相关论文