Research on Optimization of Service Function Chain Path Based on Graph Attention Network

HUANG Wanwei; LI Song; ZHANG Chaoqin; WANG Sunan; ZHANG Xiaohui

doi:10.11999/JEIT210458

Volume 44 Issue 8

Aug. 2022

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2022 > 44(8): 2833-2841

HUANG Wanwei, LI Song, ZHANG Chaoqin, WANG Sunan, ZHANG Xiaohui. Research on Optimization of Service Function Chain Path Based on Graph Attention Network[J]. Journal of Electronics & Information Technology, 2022, 44(8): 2833-2841. doi: 10.11999/JEIT210458

Citation:

HUANG Wanwei, LI Song, ZHANG Chaoqin, WANG Sunan, ZHANG Xiaohui. Research on Optimization of Service Function Chain Path Based on Graph Attention Network[J]. Journal of Electronics & Information Technology, 2022, 44(8): 2833-2841. doi: 10.11999/JEIT210458

Citation:

PDF( 3520 KB)

Research on Optimization of Service Function Chain Path Based on Graph Attention Network

doi: 10.11999/JEIT210458 cstr: 32379.14.JEIT210458

1.
College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China
2.
College of Computer and Commucation Engineering, Zhengzhou University of Light Industry, Zhengzhou 450001, China
3.
School of Electronic and Communication Engineering Shenzhen Polytechnic, Shenzhen 518005, China
4.
Henan Xin’an Communication Technology Co. Ltd, Zhengzhou 450000, China

Funds: The National Natural Science Foundation of China (62072416, 62072414)

Received Date: 2021-05-25
Rev Recd Date: 2021-10-26

Available Online: 2021-11-19

Publish Date: 2022-08-17

Abstract

Abstract

Service Function Chain (SFC) path generation aims to provide users with diversified network function customization services with high speed and low delay. Most of the existing SFC path selection algorithms aim at specific network topology or use a single evaluation index, which has the problems of weak generalization and single evaluation standard. In view of this, an SFC path selection optimization model (SFC-GAT) based on Graph ATtention network (GAT) is proposed. Its core is no longer to fix the network topology, but to model the SFC path selection problem as a path attention problem. The generalization of the model is enhanced by redesigning the path selection diagram and path update strategy; The effect of path optimization from the perspective of delay and load capacity is evaluated to solve the problem of single evaluation of path performance. The simulation results show that compared with the shortest path and minimum overload path selection strategy under constraints, SFC-GAT can improve the comprehensive performance of path selection by at least 12% and 7%.
- Service Function Chain(SFC),
- Graph ATtention network(GAT),
- Attention mechanism,
- Path selection

FullText(HTML)

References(15)

References

[1]	PANDEY S, HONG J W K, and YOO J H. Q-Learning based SFC deployment on edge computing environment[C]. The 21st Asia-Pacific Network Operations and Management Symposium, Daegu, Korea (South), 2020: 220–226.
[2]	HUFF A, VENÂNCIO G, GARCIA V F, et al. Building multi-domain service function chains based on multiple NFV orchestrators[C]. 2020 IEEE Conference on Network Function Virtualization and Software Defined Networks, Leganes, Spain, 2020: 19–24.
[3]	卢旭, 易波, 王兴伟, 等. SDN/NFV下的5G网络资源切片管理机制[J]. 小型微型计算机系统, 2021, 42(5): 1082–1087. doi: 10.3969/j.issn.1000-1220.2021.05.032 LU Xu, YI Bo, WANG Xingwei, et al. 5G network resource slice management mechanism in software-defined networking/net-work function virtualization[J]. Journal of Chinese Computer Systems, 2021, 42(5): 1082–1087. doi: 10.3969/j.issn.1000-1220.2021.05.032
[4]	Pham Chuan, Tran Nguyen H, Ren Shaolei, et al. Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach[J]. IEEE Transactions on Services Computing, 2020, 13(1): 172–185. doi: 10.1109/tsc.2017.2671867
[5]	WANG Xiaolei, XIE Lijun, QIN Zhiqiang, et al. Clustering of virtual network function instances oriented to compatibility in 5G network[J]. China Communications, 2017, 14(12): 111–119. doi: 10.1109/cc.2017.8246341
[6]	LIU Jiaqiang, LI Yong, ZHANG Ying, et al. Improve service chaining performance with optimized middlebox placement[J]. IEEE Transactions on Services Computing, 2017, 10(4): 560–573. doi: 10.1109/TSC.2015.2502252
[7]	BREMLER-BARR A, HARCHOL Y, and HAY D. OpenBox: A software-defined framework for developing, deploying, and managing network functions[C]. 2016 ACM SIGCOMM Conference, Florianópolis, Brazil, 2016: 511–524.
[8]	GU Lin, ZENG Deze, LI Wei, et al. Intelligent VNF orchestration and flow scheduling via model-assisted deep reinforcement learning[J]. IEEE Journal on Selected Areas in Communications, 2020, 38(2): 279–291. doi: 10.1109/JSAC.2019.2959182
[9]	SUBRAMANYA T, HARUTYUNYAN D, and RIGGIO R. Machine learning-driven service function chain placement and scaling in MEC-enabled 5G networks[J]. Computer Networks, 2020, 166: 106980. doi: 10.1016/j.comnet.2019.106980
[10]	CHOWDHURY P N, SHIVAKUMARA P, KANCHAN S, et al. Graph attention network for detecting license plates in crowded street scenes[J]. Pattern Recognition Letters, 2020, 140: 18–25. doi: 10.1016/j.patrec.2020.09.018
[11]	唐伦, 曹睿, 廖皓, 等. 基于深度强化学习的服务功能链可靠部署算法[J]. 电子与信息学报, 2020, 42(12): 2931–2938. doi: 10.11999/JEIT190969
[12]	GU Yunjie, DING Yuehang, HU Yuxiang. Joint optimization of delay guarantees and resource allocation for service function Chaining[J]. IEICE Transactions on Information and Systems, 2019, E102.D(12): 2611–2614.
[13]	CLAYMAN S, MAINI E, GALIS A, et al. The dynamic placement of virtual network functions[C]. 2014 IEEE Network Operations and Management Symposium, Krakow, Poland, 2014: 1–9.
[14]	VELIČKOVIĆ P, CUCURULL G, CASANOVA A, et al. Graph attention networks[C]. The 6th International Conference on Learning Representations, Vancouver, Canada. 2018.
[15]	XIE Lijun, JIANG Yiming, WANG Binqiang, et al. An approach for network Function combination based on least busy placement algorithm[J]. China Communications, 2016, 13(S1): 167–176.