[1] ZHANG H, LIU N, CHU X, et al. Network slicing based 5G and future mobile networks:mobility, resource management, and challenges[J]. IEEE Communications Magazine, 2017, 55(8):138-145. [2] QUINN P, NADEAU T. Problem statement for service function chaining:IETF technique report:RFC 7498[R/OL].(2018-12-20)[2021-07-01]. https://data-tracker.ietf.org/doc/rfc7498/. [3] LAGHRISSI A, TALEB T. A survey on the placement of virtual resources and virtual network functions[J]. IEEE Communications Surveys and Tutorials, 2018, 21(2):1409-1434. [4] LI H, KONG Z, XIANG W, et al. Slice-based service function chain embedding with multiple factors[C]//2021 IEEE Globecom Workshops (GC Wkshps). Piscataway,NJ:IEEE Press, 2021:1-6. [5] SERIES M. Minimum requirements related to technical performance for IMT-2020 radio interface (s):ITU-R report:M.2410-0[R/OL].(2017-11-16)[2021-07-01]. https://www.itu.int/dms_pub/itu-r/opb/rep/R-REP-M.2410-2017-PDF-E.pdf. [6] PAPAGIANNI C, PAPADIMITRIOU P, BARAS J S. Rethinking service chain embedding for cellular network slicing[C]//2018 IFIP Networking Conference (IFIP Networking) and Workshops. Piscataway, NJ:IEEE Press, 2018:1-9. [7] TRUONG-HUU T, MOHAN P M, GURUSAMY M. Ser-vice chain embedding for diversified 5G slices with virtual network function sharing[J]. IEEE Communications Letters, 2019, 23(5):826-829. [8] NEJAD M A T, PARSAEEFARD S, MADDAH-ALI M A, et al. vSPACE:VNF simultaneous placement, admission control and embedding[J]. IEEE Journal on Selected Areas in Communications, 2018, 36(3):542-557. [9] ZHANG N, LIU Y F, FARMANBAR H, et al. Network slicing for service-oriented networks under resource constraints[J]. IEEE Journal on Selected Areas in Communications, 2017, 35(11):2512-2521. [10] CHEN W K, LIU Y F, DOMENICO A D, et al. Optimal network slicing for service-oriented networks with flexible routing and guaranteed E2E latency[J]. IEEE Transactions on Network and Service Management, 2021, 18(4):4337-4352. [11] XIE Y, WANG S, DAI Y. Revenue-maximizing virtualized network function chain placement in dynamic environment[J]. Future Generation Computer Systems, 2020, 108:650-661. [12] ROST M, SCHMID S. Charting the complexity landscape of virtual network embeddings[C]//2018 IFIP Networking Conference (IFIP Networking) and Workshops. Piscataway, NJ:IEEE Press, 2018:1-9. [13] DIJKSTRA E W. A note on two problems in connexion with graphs[J]. Numerische Mathematik, 1959, 1(1):269-271. [14] WAXMAN B M. Routing of multipoint connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 1(3):286-292. |