Year-end Sale % OFF 
Abstract
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.
Highlights
Network Function Virtualization (NFV) and Software Defined Networking (SDN) are two important key-enablers for future mobile core network infrastructure that is commercially known as the Fifth Generation (5G) [1,2]
Virtual Network Functions (VNFs)-P was formulated in Reference [32], where the Virtual Machines (VM) embedding requests were separated from the resource allocation of the service requests in order to share virtual networks between multiple tenants/users
The overall results show a significant enhancement in execution time for the optimal solution (ILP-P), as shown in Figure 5, compared to average execution time equals to 459.519 s for optimal solution of [12] at 110 nodes
Summary
Network Function Virtualization (NFV) and Software Defined Networking (SDN) are two important key-enablers for future mobile core network infrastructure that is commercially known as the Fifth Generation (5G) [1,2]. The work in Reference [10] introduced a future-proof 5G mobile network architecture, which uses the function decomposition to locate mobile NFs based on the end-user requirements and infrastructure capabilities. They suggested a geographical perspective to locate control plane in the central office while user plane can be located in the edge near to the user equipment. The contribution: The goal of this study is to develop a new placement algorithm that can meet a rapid response time to avoid high embedding cost, which might occur due to mapping multiple paths of service requests to long physical paths.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
