Path mapping approach for network function virtualization resource allocation with network function decomposition support

Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That i...

Full description

Saved in:
Bibliographic Details
Main Authors: Raddwan, Basheer, Al-Wagih, Khalil, Al-Baltah, Ibrahim A., Alrshah, Mohamed A., Al-Maqri, Mohammed A.
Format: Article
Language:English
Published: MDPI 2019
Online Access:http://psasir.upm.edu.my/id/eprint/38257/1/38257.pdf
http://psasir.upm.edu.my/id/eprint/38257/
https://www.mdpi.com/2073-8994/11/9/1173
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.38257
record_format eprints
spelling my.upm.eprints.382572020-05-04T16:08:27Z http://psasir.upm.edu.my/id/eprint/38257/ Path mapping approach for network function virtualization resource allocation with network function decomposition support Raddwan, Basheer Al-Wagih, Khalil Al-Baltah, Ibrahim A. Alrshah, Mohamed A. Al-Maqri, Mohammed A. Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers. MDPI 2019 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/38257/1/38257.pdf Raddwan, Basheer and Al-Wagih, Khalil and Al-Baltah, Ibrahim A. and Alrshah, Mohamed A. and Al-Maqri, Mohammed A. (2019) Path mapping approach for network function virtualization resource allocation with network function decomposition support. Symmetry, 11 (9). art. no. 1173. pp. 1-25. ISSN 2073-8994 https://www.mdpi.com/2073-8994/11/9/1173 10.3390/sym11091173
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.
format Article
author Raddwan, Basheer
Al-Wagih, Khalil
Al-Baltah, Ibrahim A.
Alrshah, Mohamed A.
Al-Maqri, Mohammed A.
spellingShingle Raddwan, Basheer
Al-Wagih, Khalil
Al-Baltah, Ibrahim A.
Alrshah, Mohamed A.
Al-Maqri, Mohammed A.
Path mapping approach for network function virtualization resource allocation with network function decomposition support
author_facet Raddwan, Basheer
Al-Wagih, Khalil
Al-Baltah, Ibrahim A.
Alrshah, Mohamed A.
Al-Maqri, Mohammed A.
author_sort Raddwan, Basheer
title Path mapping approach for network function virtualization resource allocation with network function decomposition support
title_short Path mapping approach for network function virtualization resource allocation with network function decomposition support
title_full Path mapping approach for network function virtualization resource allocation with network function decomposition support
title_fullStr Path mapping approach for network function virtualization resource allocation with network function decomposition support
title_full_unstemmed Path mapping approach for network function virtualization resource allocation with network function decomposition support
title_sort path mapping approach for network function virtualization resource allocation with network function decomposition support
publisher MDPI
publishDate 2019
url http://psasir.upm.edu.my/id/eprint/38257/1/38257.pdf
http://psasir.upm.edu.my/id/eprint/38257/
https://www.mdpi.com/2073-8994/11/9/1173
_version_ 1665895968851099648
score 13.211869