Heuristic solutions of virtual network embedding: A survey

Cao, Haotong; Hu, Han; Qu, Zhicheng; Yang, Longxiang

doi:10.1109/cc.2018.8332001

Cited by 83 publications

(50 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, the applications considered in the aforementioned works are monolithic whereas, as already mentioned, the most promising paradigm for the design of fog applications is the microservice-oriented architecture. With this assumption, the application deployment becomes a virtual network embedding problem, an NP-hard problem for which many heuristic solutions have been proposed in literature [17], especially with respect to Virtual Network Function (VNF) placement [11]. Such problems are usually solved by greedily deploying one virtual network at the time.…”

Section: A Related Work and Main Contributionsmentioning

confidence: 99%

Deployment of Application Microservices in Multi-Domain Federated Fog Environments

Faticanti

Savi

Pellegrini

et al. 2020

2020 International Conference on Omni-Layer Intelligent Systems (COINS)

View full text Add to dashboard Cite

In this paper we consider the problem of initial resource selection for a single-domain fog provider lacking sufficient resources for the complete deployment of a batch of IoT applications. To overcome resources shortage, it is possible to lease assets from other domains across a federation of cloud-fog infrastructures to meet the requirements of those applications: the fog provider seeks to minimise the number of external resources to be rented in order to successfully deploy the applications' demands exceeding own infrastructure capacity. To this aim, we introduce a general framework for the deployment of applications across multiple domains of cloud-fog providers while guaranteeing resources locality constraints. The resource allocation problem is presented in the form of an integer linear program, and we provide a heuristic method that explores the resource assignment space in a breadth-first fashion. Extensive numerical results demonstrate the efficiency of the proposed approach in terms of deployment cost and feasibility with respect to standard approaches adopted in the literature.

show abstract

Section: A Related Work and Main Contributionsmentioning

confidence: 99%

Deployment of Application Microservices in Multi-Domain Federated Fog Environments

Faticanti

Savi

Pellegrini

et al. 2020

2020 International Conference on Omni-Layer Intelligent Systems (COINS)

View full text Add to dashboard Cite

show abstract

“…Researchers have conducted in-depth research on virtual network embedding algorithms from different perspectives, and a series of research results have emerged. Several papers [3][4][5] summarize the virtual network mapping algorithm. Fischer A [5] summarized the research content of VNE, provided the classi cation scheme of the VNE algorithm, and discussed further research works.…”

Section: Related Workmentioning

confidence: 99%

“…Since the VNE problem is NP-hard in terms of computational complexity, many VNE algorithms proposed in the literature are heuristic. Haotong Cao investigated, analyzed, and summarized some representative heuristic solutions in the paper [3]. In general, the virtual network mapping algorithm can be classi ed as follows.…”

Section: Related Workmentioning

confidence: 99%

“…Solutions. Recently, Cao et al divided the virtual network mapping algorithm into exact solution [4] and heuristic solution [3]. e exact solution solves the virtual network mapping problem based on the optimization theory [28].…”

Section: Heuristic Solutions Vs Exact Solutions Vs Metaheuristicmentioning

confidence: 99%

“…In recent years, network virtualization technology has been widespread concern in industry and academia [3][4][5].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm

Zhang

2019

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Virtual network embedding (VNE) problem is a key issue in network virtualization technology, and much attention has been paid to the virtual network embedding. However, very little research work focuses on parallelized virtual network embedding problems which assumes that the substrate infrastructure supports parallel computing and allows one virtual node to be mapped to multiple substrate nodes. Based on the work of Liang and Zhang, we extend the well-known VNE to parallelizable virtual network embedding (PVNE) in this paper. Furthermore, to the best of our knowledge, we give the first formulation of the PVNE problem. A new heuristic algorithm named efficient parallelizable virtual network embedding (EPVNE) is proposed to reduce the cost of embedding the VN request and increase the VN request acceptance ratio. EPVNE is a two-stage mapping algorithm, which first performs node mapping and then performs link mapping. In the node mapping phase, we present a simple and efficient virtual node and physical node sorting formula and perform the virtual node mapping in order. When mapping virtual nodes, we map virtual nodes to physical nodes that just meet the CPU requirements. Substrate nodes with more CPU resources will be retained for subsequent virtual network mapping requests. In the link mapping phase, Dijkstra’s algorithm is used to find a substrate path for each virtual link. Finally, simulations are carried out and simulation results show that our algorithm performs better than the existing heuristic algorithms.

show abstract