2017 3rd IEEE International Conference on Computer and Communications (ICCC) 2017
DOI: 10.1109/compcomm.2017.8322728
|View full text |Cite
|
Sign up to set email alerts
|

A effective two-step strategy of multi-domain virtual network embedding in 5G network slicing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…Numerous approaches (e.g., [18]- [23], among others) based on network embedding have also been published in recent years. In particular, the authors in [18] proposed a virtual network embedding problem based on 3-D resources that includes computing, network, and storage; [19] looked into a network slice embedding problem that considers the deployment costs due to the slice's minimum resource requirements (both at the nodes and links), as well as a cost related to the end-to-end delay (i.e., propagation and processing delays plus the virtualization overhead); [20] proposed an efficient heuristic for network slice embedding that allocates the network slice resources based on node rankings (four possible ranking algorithms are evaluated); and [21] proposed an algorithm for automatic virtual network embedding based on deep reinforcement learning with a novel multi-objective reward function.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Numerous approaches (e.g., [18]- [23], among others) based on network embedding have also been published in recent years. In particular, the authors in [18] proposed a virtual network embedding problem based on 3-D resources that includes computing, network, and storage; [19] looked into a network slice embedding problem that considers the deployment costs due to the slice's minimum resource requirements (both at the nodes and links), as well as a cost related to the end-to-end delay (i.e., propagation and processing delays plus the virtualization overhead); [20] proposed an efficient heuristic for network slice embedding that allocates the network slice resources based on node rankings (four possible ranking algorithms are evaluated); and [21] proposed an algorithm for automatic virtual network embedding based on deep reinforcement learning with a novel multi-objective reward function.…”
Section: Related Workmentioning
confidence: 99%
“…In particular, the authors in [18] proposed a virtual network embedding problem based on 3-D resources that includes computing, network, and storage; [19] looked into a network slice embedding problem that considers the deployment costs due to the slice's minimum resource requirements (both at the nodes and links), as well as a cost related to the end-to-end delay (i.e., propagation and processing delays plus the virtualization overhead); [20] proposed an efficient heuristic for network slice embedding that allocates the network slice resources based on node rankings (four possible ranking algorithms are evaluated); and [21] proposed an algorithm for automatic virtual network embedding based on deep reinforcement learning with a novel multi-objective reward function. Meanwhile, [22] and [23] investigated the partitioning of multi-domain virtual networks and proposed heuristics based on particle swarm optimization; the latter also proposed a two-step embedding strategy for the inter-and intradomain embedding sub-problems.…”
Section: Related Workmentioning
confidence: 99%
“…Due to the selfishness of different InPs, they are reluctant to disclose the specific topology information of networks. Therefore, the authors of literature [10] proposed a effective two-step strategy of multi-domain virtual network embedding in 5G network slicing, which can dynamically manage the resource information of different domains. In literature [11], the authors proposed a new information-centric heterogeneous network framework, which gives nodes the ability to store and compute, thus improving data throughput.…”
Section: The Distributed Vne Algorithmsmentioning
confidence: 99%
“…Meanwhile, two time‐efficient heuristic algorithms were designed to solve the model by leveraging the minimum k ‐cut problem. In their study, Wang et al 36 presented a two‐step cross‐domain SFC embedding strategy to dynamically manage network resources in each autonomous domain. The optimized discrete particle swarm algorithm‐based cross‐domain SFC embedding method was proposed to reduce resource consumption cost, and then, a fast algorithm based on Kruskal minimum spanning tree was proposed for intra‐domain mapping.…”
Section: The State Of the Art Of Multi‐domain Sfc Deploymentmentioning
confidence: 99%