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...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-09-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/11/9/1173 |
| _version_ | 1811298371143467008 |
|---|---|
| author | Basheer Raddwan Khalil AL-Wagih Ibrahim A. Al-Baltah Mohamed A. Alrshah Mohammed A. Al-Maqri |
| author_facet | Basheer Raddwan Khalil AL-Wagih Ibrahim A. Al-Baltah Mohamed A. Alrshah Mohammed A. Al-Maqri |
| author_sort | Basheer Raddwan |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-04-13T06:18:25Z |
| format | Article |
| id | doaj.art-c13f3307f3cd4fcdaffdec6dbc6cb42e |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-04-13T06:18:25Z |
| publishDate | 2019-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-c13f3307f3cd4fcdaffdec6dbc6cb42e2022-12-22T02:58:44ZengMDPI AGSymmetry2073-89942019-09-01119117310.3390/sym11091173sym11091173Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition SupportBasheer Raddwan0Khalil AL-Wagih1Ibrahim A. Al-Baltah2Mohamed A. Alrshah3Mohammed A. Al-Maqri4Faculty of Engineering & Information Technology, University of Modern Sciences, 85RC+6V Sana’a, YemenFaculty of Computer science & Information System, Thamar University, H9HG+H5 Thamar, YemenDepartment of Information Technology, Faculty of Computer Science & IT, Sana’a University, 85XR+C5 Sana’a, YemenDepartment Communication Technology & Network, Faculty of Computer Science & IT, Universiti Putra Malaysia, Serdang 43400, MalaysiaDepartment of Information Technology, Faculty of Engineering & Information Technology, Azal University for Human Development, 954F+PW Sana’a, YemenRecently, 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.https://www.mdpi.com/2073-8994/11/9/1173embeddingnetwork function decompositionnetwork function virtualization (NFV)network function virtualization resource allocation (NFV-RA)service function chaining (SFC) |
| spellingShingle | Basheer Raddwan Khalil AL-Wagih Ibrahim A. Al-Baltah Mohamed A. Alrshah Mohammed A. Al-Maqri Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support Symmetry embedding network function decomposition network function virtualization (NFV) network function virtualization resource allocation (NFV-RA) service function chaining (SFC) |
| title | 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_short | 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 |
| topic | embedding network function decomposition network function virtualization (NFV) network function virtualization resource allocation (NFV-RA) service function chaining (SFC) |
| url | https://www.mdpi.com/2073-8994/11/9/1173 |
| work_keys_str_mv | AT basheerraddwan pathmappingapproachfornetworkfunctionvirtualizationresourceallocationwithnetworkfunctiondecompositionsupport AT khalilalwagih pathmappingapproachfornetworkfunctionvirtualizationresourceallocationwithnetworkfunctiondecompositionsupport AT ibrahimaalbaltah pathmappingapproachfornetworkfunctionvirtualizationresourceallocationwithnetworkfunctiondecompositionsupport AT mohamedaalrshah pathmappingapproachfornetworkfunctionvirtualizationresourceallocationwithnetworkfunctiondecompositionsupport AT mohammedaalmaqri pathmappingapproachfornetworkfunctionvirtualizationresourceallocationwithnetworkfunctiondecompositionsupport |