EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm. (22nd November 2019)
- Record Type:
- Journal Article
- Title:
- EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm. (22nd November 2019)
- Main Title:
- EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm
- Authors:
- Li, Yuanzhen
Zhang, Yingyu - Other Names:
- Cheng Hui Academic Editor.
- Abstract:
- Abstract : 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 algorithmAbstract : 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. … (more)
- Is Part Of:
- Wireless communications and mobile computing. Volume 2019(2019)
- Journal:
- Wireless communications and mobile computing
- Issue:
- Volume 2019(2019)
- Issue Display:
- Volume 2019, Issue 2019 (2019)
- Year:
- 2019
- Volume:
- 2019
- Issue:
- 2019
- Issue Sort Value:
- 2019-2019-2019-0000
- Page Start:
- Page End:
- Publication Date:
- 2019-11-22
- Subjects:
- Wireless communication systems -- Periodicals
Mobile communication systems -- Periodicals
621.38205 - Journal URLs:
- https://onlinelibrary.wiley.com/journal/15308677 ↗
https://www.hindawi.com/journals/wcmc/ ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1155/2019/8416592 ↗
- Languages:
- English
- ISSNs:
- 1530-8669
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 9323.860000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 12510.xml